Places approximate probabilistic consistency of explicit claims in NP with short certificates, and gives an interactive PCP for circuit-specified predictors, but the main protocol's soundness proof has an unproven step.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
How to Verify Consistency of Probabilistic Claims
Places approximate probabilistic consistency of explicit claims in NP with short certificates, and gives an interactive PCP for circuit-specified predictors, but the main protocol's soundness proof has an unproven step.