The binary owner list equals the interaction graph’s input-order greedy net
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.priority_net_matchesalgorithmsclusteringdynamic-programming
Reverse the binary scan list before applying the verified coarse-net routine. The resulting left-to-right greedy set equals the exact ordered greedy net used in the interaction graph, with coverage within 2R even for repetitions or unordered regional codes.
Preamble
import Definitions.Def_QuantumMaxCutFiniteNumericRuntime import Definitions.Def_StableMSR_Recovery_Supplement_PriorityRegions import Definitions.Def_StableMSR_Recovery_Supplement_RegionalModel open StableMSR.Recovery StableMSR.Recovery.Supplement StableMSR.Recovery.Supplement.BinaryRecovery open StableMSR.Recovery.Supplement.BinaryRecovery.Regional open OAI.MetricKMedian.Binary.Automatic
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.priority_net_matches : Poly netKeys ∧ ∀ (I : RationalInput) (_ : I.Valid) (R : ℚ) (w : Block), 0<R →
let z : RegionInput := (fieldsOf I,R,w)
let W := rawBlock I.n w
rawBlock I.n (netKeys z)=greedyNet I.dist (R:ℝ) W ∧ (∀i∈netKeys z,i<I.n) ∧
∀x∈W, ∃v : Point I.n, v.val∈netKeys z ∧ I.dist v x≤2*(R:ℝ) := by
sorry
Source
S. Ravichandran and L. Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Proposition 4.2 and Appendices A.4 and A.6, https://arxiv.org/abs/2611.03547. The priority-ball construction is an alternative implementation of the regional optimization.