Pith. sign in

Title resolution pending

The negative loss for the verifier is given by: a log b + a log(2b) + a log b + (1 − 3a) log(1 − 2b) · 2019

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.AI 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

Neural Interactive Proofs

cs.AI · 2024-12-12 · conditional · novelty 6.0

The paper introduces a generalised prover-verifier game framework for 'neural interactive proofs', proves equilibria correspond to valid proof systems, and demonstrates modest gains in code validation with large language models.

citing papers explorer

Showing 1 of 1 citing paper.

  • Neural Interactive Proofs cs.AI · 2024-12-12 · conditional · none · ref 6

    The paper introduces a generalised prover-verifier game framework for 'neural interactive proofs', proves equilibria correspond to valid proof systems, and demonstrates modest gains in code validation with large language models.