Dependently rigid characterization of the maximum likelihood threshold

Let $G=(V,E)$) be a graph. A framework $(G,P)$ in $\mathbb{R}^n$ is $n$-dependently rigid if every edge-equivalent framework $(G,Q)$ in $\mathbb{R}^m$ has an affinely dependent set of points, and $G$ is generically $n$-dependently rigid if every generic framework $(G,P)$ in $\mathbb{R}^n$ is $n$-dependently rigid.

Dependently rigidity conjecture. The maximum likelihood threshold of $G$ is greater than $n$ if and only if $G$ is generically $n$-dependently rigid.

This conjecture is presented as a proposed connection between maximum likelihood thresholds and a stronger form of combinatorial rigidity. The supplied text does not state whether it has been resolved.