An explicit binary list containing all stable solutions above the common-radius threshold
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.two_step_candidate_listalgorithmsclusteringcomputational-complexity
For every input distance and point, compute the smallest index reachable in two threshold edges, and compact the resulting indices. One of these at most n² vectors encodes the stable optimum whenever (γ−1)² ≥ γ.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_CandidateSelection import Definitions.Def_QuantumMaxCutFiniteNumericRuntime open OAI.MetricKMedian.Binary.Automatic open StableMSR.Recovery StableMSR.Recovery.Supplement StableMSR.Recovery.Supplement.BinaryRecovery
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.two_step_candidate_list : Poly thresholdCandidates ∧ ∀ γ : ℚ, 1 < γ → γ ≤ (γ-1)^2 → ContainsStable thresholdCandidates γ := by sorry
Source
S. Ravichandran and L. Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Section 3 and Appendix C.4. https://arxiv.org/abs/2611.03547 . The common-radius two-edge criterion is deduced from the published center and intercluster separation statements.