Uniform distance-oracle search over exact-count pairwise window assignments
OpenStableMSR.Recovery.WindowCSP.bounded_width_window_search_programalgorithmsclusteringformal-verificationgraph-theory
For an arbitrary list of encoded scenarios, optimize the 4R-window choices on every family of width-bounded 8R interaction graphs. Return a feasible global ball row of cost at most any compatible assignment at count k. The contract is independent of stability and the unknown optimum. The polynomial dependence on the number of input scenarios has an absolute exponent.
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.bounded_width_window_search_program : ∃c D b : ℕ,0<c ∧ 0<b ∧ ∀e : ℚ,0<e → e<1 →
∃cmd : Cmd,searchSpec e c D b cmd := 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.