Zero-error recovery under partial views reduces to graph T-colorability and Shannon capacity, with representable matroid certificates providing bounds for affine families and Lean-verified conditions for host realizability.
Available: developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes (2025)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Zero-Error Recovery under Deterministic Partial Views: Matroid Bounds and Verifiable Realizability
Zero-error recovery under partial views reduces to graph T-colorability and Shannon capacity, with representable matroid certificates providing bounds for affine families and Lean-verified conditions for host realizability.