The cardinality bound for minimal rank-determining sets of metric graphs

Let $\Gamma$ be a metric graph of genus $g$. A minimal rank-determining set is a rank-determining set of $\Gamma$ that has no proper subset that is rank-determining. Cardinality bound conjecture. Every minimal rank-determining set of $\Gamma$ has cardinality at most $g+1$. This conjecture proposes a universal upper bound on the size of minimal rank-determining sets, following the construction of minimal rank-determining sets with $g+1$ points; whether all metric graphs satisfy this bound is left open.