Euclidean distance degree conjecture for two-camera conic multiview varieties

Let $\textit{\textbf{C}}$ be an arrangement of two generic cameras, and let $\mathcal C_{\textit{\textbf{C}},2}$ denote the corresponding conic multiview variety. Euclidean distance degree conjecture. The Euclidean distance degree of $\mathcal C_{\textit{\textbf{C}},2}$ is $538$. This predicts a fixed algebraic complexity for Euclidean distance optimization on a generic two-camera conic multiview variety; the source gives no resolution of the conjecture.