The confusion-number upper-bound conjecture for signed graphs

Let $(G,\sigma)$ be a signed graph on $n$ vertices. The confusion-number upper-bound conjecture.

$$C(G,\sigma) \leq \left\lceil \frac{3n}{5}-4 \right\rceil.$$

This conjecture proposes a general upper bound for the confusion number of a signed graph. The paper presents it among problems and conjectures concerning confusion and relaxed confusion numbers; no resolution is given.