Dubickas–Sha squarefree distance-two conjecture for integer polynomials

Let $f(x)\in\mathbb{Z}[x]$ have degree $n\geq 0$. A polynomial is squarefree if it is not divisible by the square of an irreducible polynomial over $\mathbb{Q}$. Define $L(f-g)=\sum_{j=0}^{n}|b_j-a_j|$ when $f(x)=\sum_{j=0}^{n}a_jx^j$ and $g(x)=\sum_{j=0}^{n}b_jx^j$. Dubickas–Sha squarefree distance-two conjecture. There is a squarefree polynomial $g(x)\in\mathbb{Z}[x]$ of degree at most $n$ satisfying

$$L(f-g)\leq 2.$$

This conjecture is the squarefree-polynomial variant investigated by Dubickas and Sha. The supplied text does not state whether it has been resolved.