Bag-menu compilation and ordered readback take polynomial bit time
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.bag_menu_binary_programsalgorithmsclusteringdynamic-programming
For fixed width, words over the explicit variable/domain alphabet have fixed maximum length. Nested scans build the compatibility pairs and bag payloads. Readback recovers a global plan and emits the witness in the original factor order.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_BagMenuEncoding import Definitions.Def_QuantumMaxCutFiniteNumericRuntime open StableMSR.Recovery.Supplement.BinaryRecovery.Regional open StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree open OAI.MetricKMedian.Binary.Automatic
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.bag_menu_binary_programs {α : Type} [Coding α] [Inhabited α] (t : ℕ)
(vars terms : α→Block) (dom : α→List Value) (scope : α×ℕ→Block)
(emit : (α×ℕ)×Plan→Pack) (cost : α×Block→ℚ)
(layout : α→FactorLayout) (pl : Poly layout)
(p1 : Poly vars) (p2 : Poly terms) (p3 : Poly dom) (p4 : Poly scope)
(p5 : Poly emit) (p6 : Poly cost) :
Poly (fun a => encodeMenus t (vars a,dom a,layout a) (terms a)
(fun j => scope (a,j)) (fun j s => emit ((a,j),s)) (fun b => cost (a,b))) ∧
Poly (fun q : α×Block => renderFactors (terms q.1) (fun j s => emit ((q.1,j),s))
(unpack t (vars q.1,dom q.1,layout q.1) q.2)) := by
sorry
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Appendix A.6, tree-decomposition dynamic program. Explicit binary witness formulation.