Distance-oracle generation of aligned bounded-diameter scenarios in the dense regime
OpenStableMSR.Recovery.WindowCSP.dense_aligned_scenario_programalgorithmsclusteringformal-verificationgraph-theory
Generate a bounded list of radius pairs and regional labelings on the distance RAM. In the many-large-cluster regime one labeling at the correct maximum optimal radius must form aligned regions of diameter at most the density scale. This is the geometric partition-generation and split-cluster repair part of Algorithm 1.
Preamble
import Definitions.Def_StableMSR_WindowCSP 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.dense_aligned_scenario_program : ∃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 → sceneSpec 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.