Generate a uniformly bounded catalog containing a cheap ball cover
OpenStableMSR.Recovery.BallCoverCatalog.uniform_ball_cover_catalogalgorithmsclustering
For each rational slack, build a finite command producing rows of center and boundary-point pairs. Every stable input must have one covering row with distinct centers and total nominal radius at most the optimum. Arbitrary other rows may overlap, repeat centers, or miss points. The uniform charged bounds apply on every metric input.
Preamble
import Definitions.Def_StableMSR_BallCoverCatalog open StableMSR.Recovery StableMSR.Recovery.Compiler StableMSR.Recovery.OracleQueries open Polynomial open StableMSR.Recovery.BallCoverCatalog
Formal statement
theorem StableMSR.Recovery.BallCoverCatalog.uniform_ball_cover_catalog : ∃a b : ℕ,0 < a ∧ 0 < b ∧
∀e : ℚ,0 < e → e < 1 → ∃cmd : Cmd,HasCatalog e a b cmd := by
sorry
Source
Shyam Ravichandran and Lev Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Algorithm 1 and Theorem 1.1. Finite deterministic RAM implementation and ball-cover certification.