Leaf message passing and witness readback run in polynomial bit time
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.leaf_message_bit_programalgorithmsclusteringdynamic-programming
The state catalog and explicit resource bins give a polynomial cap on every message. Bounded intermediate encodings make the entire sequential binary list fold polynomial even on malformed inputs.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_TreeMenuMessages 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.leaf_message_bit_program : Poly (fun q : Instance×Block => optimize q.1 q.2) := by sorry
Source
Leaf elimination implementation for the bounded-treewidth dynamic program of Ravichandran and Reyzin, arXiv:2611.03547, Appendix A.6.