Paper Citation Record · LEDGER

Proving Theorems Recursively

As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2405.14414.

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

pith.paper-citation-record.v1
2405.14414 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

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

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T00:06:30.367315Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T15:42:10.748568Z

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 1ddb718f-f2b4-4471-9536-63d4b9336b34 · inbound

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis cites this paper.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Proving Theorems Recursively

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-10T00:06:30.367315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5f7fc77-3ba5-4e58-baec-1c94e59c31db · inbound

Grammars of Formal Uncertainty: When to Trust LLMs in Automated Reasoning Tasks cites this paper.

Grammars of Formal Uncertainty: When to Trust LLMs in Automated Reasoning Tasks Proving Theorems Recursively

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T14:06:30.451938Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcd33a01-a62e-4fd9-9be8-14d4b9b53fac · inbound

MATP-BENCH: Can MLLM Be a Good Automated Theorem Prover for Multimodal Problems? cites this paper.

MATP-BENCH: Can MLLM Be a Good Automated Theorem Prover for Multimodal Problems? Proving Theorems Recursively

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-07T06:08:26.801891Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d60fc604-e1a3-4174-a478-793c63152586 · inbound

Reviving DSP for Advanced Theorem Proving in the Era of Reasoning Models cites this paper.

Reviving DSP for Advanced Theorem Proving in the Era of Reasoning Models Proving Theorems Recursively

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-07T04:09:12.311536Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7755d51-ab5b-4161-84da-96813b7f2d01 · inbound

Solving Formal Math Problems by Decomposition and Iterative Reflection cites this paper.

Solving Formal Math Problems by Decomposition and Iterative Reflection Proving Theorems Recursively

Reference 40

Resolution: verified exact; local_arxiv, observed 2026-08-06T15:42:10.830714Z

Source-reported events for the cited work

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