Weak saturation conjecture for balanced complete bipartite graphs

Let $K_{s,s}$ be the balanced complete bipartite graph, let $\mathrm{wsat}(n,K_{s,s})$ denote its weak saturation number, and let $G$ be an erasable graph in the corresponding erasing formulation. For $s>2$ and $2\leq j\leq s-3$, the balanced weak saturation conjecture.

$$\mathrm{wsat}(2s+j,K_{s,s})=\binom{2s+j}{2}-(j+1)(2s-2).$$

The conjecture concerns the previously unresolved range below $3s-3$ and proposes an exact value for the weak saturation number of balanced complete bipartite graphs.