The full real-distance sweep-and-repair family fits in the mission parameter exponent
ProvedStableMSR.Recovery.WindowCSP.explicit_scenario_countalgorithmsclusteringformal-verificationgraph-theory
Bound the coarse net cardinality cap by the mission treewidth bound and the grid crossing factor by 257 times the owner bound. Then count every ordered radius pair, multiplier, grid position and every length-g word of center-witness pairs. The resulting raw family has at most n to the 780 times the parameter-envelope rows.
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.explicit_scenario_count (n : ℕ) (hn : 2≤ n) (e : ℝ) (he : 0< e) (hl : e<1) :
let h:=coarseBudget e
h≤257*parameterEnvelope e ∧
n^2*(n+1)*n*(∑g∈Finset.range (h+1),CartesianBallRows.rows n g)≤ n^(780*parameterEnvelope e) := 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.