Explicit coarse sweep signatures and distance-ball repairs for real metric scenarios
DefinitionStableMSR_ExplicitWindowScenesalgorithmsclusteringformal-verificationgraph-theory
A point is labeled by its R-component and the coarse net balls containing its shifted representative. A repair relabels a point by its first selected ball when one covers it. A uniform materializer must enumerate these explicitly specified labels for every radius pair, bounded integral multiplier, grid index and short tuple of distance balls. Its specification has no unknown clustering or stability premise.
Definition code
import Definitions.Def_StableMSR_WindowCSP
import Definitions.Def_StableMSR_Recovery_Supplement_CoarseSweep
open scoped Classical
set_option autoImplicit false
open StableMSR.Recovery StableMSR.Recovery.Supplement StableMSR.Recovery.WindowCSP
open StableMSR.Recovery.Compiler StableMSR.Recovery.OracleQueries StableMSR.Recovery.CartesianBallRows
open StableMSR.Recovery.BallCoverCatalog
open StableMSR.Recovery.Supplement.BinaryRecovery.Regional
namespace StableMSR.Recovery.WindowSweep
noncomputable def shiftPoint {n : ℕ} (d : Point n→Point n→ℝ) (b : ℝ) (p : Point n) : Point n :=
let K:=component d (2*b) Finset.univ p
if diameter d K≤2*b then Supplement.representative K p else p
noncomputable def coarseKey {n : ℕ} (d : Point n→Point n→ℝ) (R L b : ℝ) (i : ℕ) (p : Point n) :
Cluster n × Cluster n :=
let U:=component d R Finset.univ p
(U,if L< diameter d U then (greedyNet d (L/32) U).filter
(fun z=>d z (shiftPoint d b p)≤ sweepRadius L n i) else ∅)
noncomputable def splitBy {n : ℕ} {α : Type} (O : Partition n) (key : Point n→α) : Partition n :=
O.filter (fun C=>∃p∈C,∃q∈C,key p≠key q)
noncomputable def hits {n : ℕ} (d : Point n→Point n→ℝ) (g u : ℕ) (p : Point n) : Finset ℕ :=
(Finset.range g).filter (fun j=>MinSumFPT.oracleAnswer d (digit n u (2*j):ℤ) (p.val:ℤ) ≤
MinSumFPT.oracleAnswer d (digit n u (2*j):ℤ) (digit n u (2*j+1):ℤ))
noncomputable def repairKey {n : ℕ} {α : Type} (d : Point n→Point n→ℝ) (key : Point n→α)
(g u : ℕ) (p : Point n) : ℕ ⊕ α :=
let S:=hits d g u p
if h : S.Nonempty then .inl (S.min' h) else .inr (key p)
def explicitSpec (e : ℚ) (a b : ℕ) (cmd : Cmd) (n k : ℕ) (d : Point n→Point n→ℝ) : Prop :=
∃s z H,Executes d cmd (initialStore n k) s z ∧ z≤ a*n^(b*parameterEnvelope (e:ℝ)) ∧
H≤ a*n^(b*parameterEnvelope (e:ℝ)) ∧
let x:=worldOf k H d s
Ready x s ∧ ∀p q : Point n,0< d p q → ∀m≤ n,∀i< n,∀g≤ coarseBudget (e:ℝ),
∀u< rows n g,∃v< H,scale x v=d p q ∧ ∀j t : Point n,
let R:=d p q
let key:=coarseKey d R ((m:ℝ)*R) ((e:ℝ)*R/4) i
label x v j=label x v t ↔ repairKey d key g u j=repairKey d key g u t
end StableMSR.Recovery.WindowSweep
Source
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.