Zaslavsky's edge-disjoint negative-cycle conjecture

Let $\Sigma$ be a signed graph. Denote by $p^-(\Sigma)$ the maximum number of edge-disjoint negative cycles, by $l(\Sigma)$ its frustration index, and by $p(\Sigma)$ the maximum number of edge-disjoint cycles in its underlying graph. Zaslavsky's edge-disjoint negative-cycle conjecture. One always has

$$p^-(\Sigma)=\min\bigl(l(\Sigma),p(\Sigma)\bigr).$$

This asserts equality in both general bounds $p^-(\Sigma)\leq l(\Sigma)$ and $p^-(\Sigma)\leq p(\Sigma)$. The supplied text does not give evidence that the conjecture has been resolved, so its status is left open.