Bernhard–Jablan conjecture on the unlinking number

Let $L$ be a link. Its unlinking number $u(L)$ is the minimum number of crossing changes needed to transform $L$ into an unlink, and $u_{BJ}(L)$ denotes its Bernhard–Jablan unlinking number. Bernhard–Jablan conjecture. For every link $L$ we have

$$u(L)=u_{BJ}(L).$$

The conjecture asserts equality between the classical unlinking number and the Bernhard–Jablan unlinking number; the supplied source does not establish whether it has been resolved.