Pith. sign in

Paper Citation Record · LEDGER

Proving Theorems Recursively

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 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 4 of 4 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 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:06:30.451938Z

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 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.

source=pdf_text observed=2026-08-07T14:06:30.451938Z digest=sha256:95e5c42344313eedaf866174cf24a10a4dce4b9b9b24c0092f10ee6fa57e6988

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.

source=pdf_text observed=2026-08-07T06:08:26.801891Z digest=sha256:b8c6dfe308c77134658a469106107fd52e8cdb1752b6cdf99b0c17d0fb3dc69f

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.

source=pdf_text observed=2026-08-07T04:09:12.311536Z digest=sha256:c5aa390475448b9e13d68edcc9a9cd42089072015ab6f79281beae574bdbe872

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-06T15:42:08.608512Z digest=sha256:28cf9768846fcdb5806ec849efc7a4d01770740ca7980e76974154193097050f