A repair price for contextuality, and its identity with Min-Rep
Seth Douglas
The repair price of a contextuality scenario is the minimum number of elementary outcome merges whose simultaneous application restores a global section. On binary scenarios it is an affine reparametrisation of the optimum of Min-Rep / LABEL-COVER_min: pi(e) = MinRep(e) - |Q| for Q the site set. The minimisation is therefore twenty-five years old and is not claimed as new; the contribution is the transfer and what it buys in both directions - an additive hardness of approximation for the repair price, and for the hardness-of-approximation quantity a reading as a physical repair cost that vanishes exactly on the non-contextual scenarios. The identity does not survive past binary arity: at arity three the two quantities can separate (pi = 3 against MinRep_gen - |Q| = 1 on an explicit witness), while equality persists on others including Mermin and GHZ, so strictness is exhibited and not generic. Also given: a monotone integer ledger along scenario growth, an incidence law at the price floor stated as a bounded exhaustion with its converse killed by a shipped witness, a measured separation from contextuality degree (flat where the repair price grades, and undefined on scenarios where the repair price is still defined), a complement to Arkhipov's arrangement theorem in the regime his theorem leaves open (stated as a conjecture), and an exact statement of the domain on which the repair price is identically zero. Two stdlib-only verification engines reproduce every recomputable number on three cross-asserted routes, and the complete pre-release review record - two blind refutation-first referee rounds, the repair log, and the residual confirmation - ships with the paper.
•Aug 10, 2026•0 citations