Uniform distance-RAM materialization of all explicit sweep-and-repair label rows
OpenStableMSR.Recovery.WindowCSP.materialize_explicit_sweep_rowsalgorithmsclusteringformal-verificationgraph-theory
Materialize the specified finite family of coarse sweep and closed-ball repair equivalence relations on the real-distance oracle RAM in the parameter-envelope time bound. Every enumerated index uses only input distances and integers. Its specification is independent of stability, the optimum, and the number of split clusters in the unknown solution.
Preamble
import Definitions.Def_StableMSR_ExplicitWindowScenes import Definitions.Def_StableMSR_WindowCSP open StableMSR.Recovery.WindowSweep StableMSR.Recovery.Supplement.BinaryRecovery.Regional open StableMSR.Recovery StableMSR.Recovery.Compiler StableMSR.Recovery.OracleQueries open StableMSR.Recovery.Supplement StableMSR.Recovery.RegionalSeeds StableMSR.Recovery.WindowCSP open StableMSR.Recovery.BallCoverCatalog StableMSR.Recovery.FewBallRows open scoped Classical set_option autoImplicit false set_option maxHeartbeats 2400000 set_option maxRecDepth 12000
Formal statement
theorem StableMSR.Recovery.WindowCSP.materialize_explicit_sweep_rows : ∃a b : ℕ,0< a ∧ 0< b ∧ ∀e : ℚ,0< e → e<1 →
∃cmd : Cmd,∀(n k : ℕ) (d : Point n→Point n→ℝ),
1≤ k → k< n → fewBound (e:ℝ)< k → IsMetricArray d → explicitSpec e a b cmd n k d := by
sorrySource
Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Lemmas 3.3, 3.8, 3.9(iii), 4.4, Proposition 4.2, Algorithm 1, and Appendix A.4–A.6. Alternative pairwise formulation using bounded-overlap window traces in the mission’s real-distance model.