Pith. sign in

Paper Citation Record · LEDGER

Learning to Give Checkable Answers with Prover-Verifier Games

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2108.12099.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2108.12099 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T18:45:20.477727Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-03T03:57:38.322466Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 3ff1adac-872c-429b-b68a-dee5c970b479 · inbound

Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings cites this paper.

Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings Learning to Give Checkable Answers with Prover-Verifier Games

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-06T18:45:20.477727Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T18:45:20.477727Z digest=sha256:f7a8b5dbd8317d86629b69c48244b1fde43283dda9839be070aa8f1a91bb1c9c

Observation 38b00d6f-1aea-425d-bef9-f8a43c67da62 · inbound

Pseudo-Formalization for Automatic Proof Verification cites this paper.

Pseudo-Formalization for Automatic Proof Verification Learning to Give Checkable Answers with Prover-Verifier Games

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-05-21T06:29:42.219321Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-21T06:25:01.098420Z digest=sha256:b63e21bb7f0bc96ed75e9e446d274181b7cd88a85b30b72eb5a2108f34871cb0

Observation 79a42ac6-dfca-4f6f-b3d3-cccc261b3f67 · inbound

Pseudo-Formalization for Automatic Proof Verification cites this paper.

Pseudo-Formalization for Automatic Proof Verification Learning to Give Checkable Answers with Prover-Verifier Games

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-06-30T17:24:57.679420Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-06-30T17:17:48.969969Z digest=sha256:9048219f908716d053e3c0e3c4f61e59da7e4703809af7f26a91b299e217475e

Observation 80a5a73d-a987-4ed4-bb70-2dd4b6278230 · inbound

Divide and Cooperate: Role-Decomposed Multi-Agent LLM Training with Cross-Agent Learning Signals cites this paper.

Divide and Cooperate: Role-Decomposed Multi-Agent LLM Training with Cross-Agent Learning Signals Learning to Give Checkable Answers with Prover-Verifier Games

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-07-03T03:57:38.324359Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-06-27T14:23:06.932530Z digest=sha256:2776844a7e845d98d1061e5f073892eb94230d84932f68a7fd82a8b82bce5e6e

Observation b43be7ac-48ab-43b4-a3e5-faf5db62f32d · inbound

Addressing Over-Refusal in LLMs with Competing Rewards cites this paper.

Addressing Over-Refusal in LLMs with Competing Rewards Learning to Give Checkable Answers with Prover-Verifier Games

Reference 105

Resolution
metadata mismatch
arxiv_id, observed 2026-07-01T07:05:29.273288Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-07-01T06:59:12.695984Z digest=sha256:d4b18e4bb75ac3337af86211cd4167632201b2712dc400c170eec06beacf6fe5

Observation 9adf0a7d-5438-4598-9a42-50946701fb78 · inbound

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs cites this paper.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Learning to Give Checkable Answers with Prover-Verifier Games

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-12T01:34:45.323277Z digest=sha256:edeca6962593abbd82a85a9dc8952a6ed429e8b86df9555f6cfee5f931b28438