Fullness conjecture for webs of type P in positive characteristic

Let $\mathbb{k}$ be a field, and let \text{\boldmatha} \in \mathbb{Z}^{r} and \text{\boldmathb} \in \mathbb{Z}^{s} be the parameters indexing the relevant objects, with sizes |\text{\boldmatha}|$and$|\text{\boldmath$b\}|$. Fullness conjecture. The fullness statement for the map in the web representation theory holds whenever

$$\operatorname{char}(\mathbb{k}) > |\text{\boldmath$a$}| + |\text{\boldmath$b$}|.$$

This conjecture gives a proposed characteristic bound under which the fullness result should remain valid; the supplied text does not state whether the conjecture has been resolved.