A repair price for contextuality, and its identity with Min-Rep
In plain wordsThe fewest merges of measurement outcomes that give a contextual scenario one consistent global assignment equals, when each context holds at most two measurements, a long-studied hard optimization problem shifted by a constant, so it is hard to approximate; with three per context the two can differ.
The result
As the paper states it, in briefThe least number of outcome merges that restores a global section; on binary scenarios it is an affine reparametrization of a standard quantity in hardness of approximation.
Questionson the index
How this was checked
- Blind audits
- Two blind refutation-first review rounds before release, with the review record in the repository.
- Independent computation
- Two engines
- Lean
- None.
- Peer review
- Not yet.
Every check here is internal. How we check results.
Novelty and credit
- Novelty
- The paper shows first that its central quantity is not new.
Versionsone, each with its own DOI
| Version | Date | DOI | Notes |
|---|---|---|---|
| 1.0.0 | 10.5281/zenodo.21876901 |
Paper, code and links
- Paper
This release has no PDF: the paper is the Markdown file
paper/PAPER-PI.mdat the archived commit.- DOI
10.5281/zenodo.21876901; all versions 10.5281/zenodo.21876900
Corrections
None so far.
All corrections, and what counts as one.
Cite
@misc{douglas2026contextuality,
author = {Douglas, Seth},
title = {A repair price for contextuality, and its identity with {Min}-Rep},
year = {2026},
version = {1.0.0},
doi = {10.5281/zenodo.21876901},
url = {https://doi.org/10.5281/zenodo.21876901}
}