Pith. sign in

Paper Citation Record · LEDGER

Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically

As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2411.01829.

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

pith.paper-citation-record.v1
2411.01829 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

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

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-10T18:17:33.729323Z

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 9040e1f3-0816-4f49-a9a4-61cddf875516 · 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 Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically

Reference 2024

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T00:06:30.301566Z digest=sha256:d2acafe81f15d77d96426cf52f934c7de255af7a56e1a9909446a10d62bd8c11

Observation 80d3c204-e517-4191-9338-e5e5db0b0bd7 · inbound

Learning to Reason with Insight for Informal Theorem Proving cites this paper.

Learning to Reason with Insight for Informal Theorem Proving Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-05-10T08:53:04.884987Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-10T08:35:11.082440Z digest=sha256:d6131044c3a03532ffcb8df55bc33bca2c43e87200f0f45c6d342004714e51f8

Observation 417dd885-39d8-46a4-9064-d569b606327a · inbound

From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier cites this paper.

From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically

Reference 62

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T18:17:33.730527Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-07-10T18:16:31.176239Z digest=sha256:04e315d8d57f9a2bb7f67784b606fa6720669cd284ae50ec147a64aa9d6be501