Paper Citation Record · LEDGER

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

As of 10 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 3 inbound Pith citation observations for arXiv:2501.18310.

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

pith.paper-citation-record.v1
2501.18310 v2

Coverage vector

measured 32 of 32 reference resolution

Typed states for the displayed outbound observations.

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

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+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-07T13:48:56.774331Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-15T09:05:20.479946Z

Reference resolution

32 of 32 outbound references displayed

verified exact2
verified fuzzy9
unresolved21
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3335423d-35f1-44a4-9260-35501e22de06 · outbound

This paper cites an unresolved cited work.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-10T00:06:31.198876Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 0eaa972a-d2f5-4b12-906b-e9a97e3fbc24 · outbound

This paper cites user": "Please complete the following Isabelle proof.\n‘‘‘isabelle\n( * Informal statement:\n{xi}\n\nInformal proof:\n{yi} *)\n{xf}\n{yf_p} {ps}.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis user": "Please complete the following Isabelle proof.\n‘‘‘isabelle\n( * Informal statement:\n{xi}\n\nInformal proof:\n{yi} *)\n{xf}\n{yf_p} {ps}

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.069366Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f741b257-beb7-4c38-8664-d81d407feee3 · outbound

This paper cites Declarative versus Procedural.The discussion of proof styles dates back to Harrison (1996).

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Declarative versus Procedural.The discussion of proof styles dates back to Harrison (1996)

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.160877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation a64539fd-97d9-4995-96ad-34bc2df6f121 · outbound

This paper cites Proof Artifact Co-training for Theorem Proving with Language Models.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Proof Artifact Co-training for Theorem Proving with Language Models

Reference 4

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b26b5f7-f025-4b34-bc3e-f54465649776 · outbound

This paper cites Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs

Reference 5

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c272551-26c8-4cb3-9d3a-5ae11cf507a5 · outbound

This paper cites Lean-STaR: Learning to Interleave Thinking and Proving.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Lean-STaR: Learning to Interleave Thinking and Proving

Reference 6

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af19c98a-39d4-48b3-a18d-e7b3ced39f5e · outbound

This paper cites Magnushammer: A Transformer-Based Approach to Premise Selection.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Magnushammer: A Transformer-Based Approach to Premise Selection

Reference 7

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36efdbb1-0408-4f5a-9d19-3042f77a3add · outbound

This paper cites Formal Mathematics Statement Curriculum Learning.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Formal Mathematics Statement Curriculum Learning

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6016919c-2fe3-40fe-98cb-155e22042d28 · outbound

This paper cites DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models

Reference 10

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ba54822-1893-4da2-9bd6-def8b5fb2850 · outbound

This paper cites An In-Context Learning Agent for Formal Theorem-Proving.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis An In-Context Learning Agent for Formal Theorem-Proving

Reference 11

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ddb718f-f2b4-4471-9536-63d4b9336b34 · outbound

This paper cites Proving Theorems Recursively.

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 3514b49e-d508-47f6-a6e5-044d5b696601 · outbound

This paper cites an unresolved cited work.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-08-10T00:06:31.181969Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 6b72d8a4-7828-4537-a312-47469a05a392 · outbound

This paper cites Autoformalization with Large Language Models.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Autoformalization with Large Language Models

Reference 16

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec160884-fa5a-4c76-8f57-576194fc1497 · outbound

This paper cites Xin, H., Guo, D., Shao, Z., Ren, Z., Zhu, Q., Liu, B., Ruan, C., Li, W., and Liang, X.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Xin, H., Guo, D., Shao, Z., Ren, Z., Zhu, Q., Liu, B., Ruan, C., Li, W., and Liang, X

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 145a8d4c-afe0-4331-902f-46e900f3a8b6 · outbound

This paper cites LeanDojo: Theorem Proving with Retrieval-Augmented Language Models.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis LeanDojo: Theorem Proving with Retrieval-Augmented Language Models

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1895dc6a-a7b3-4b28-b864-e6ba6d1f5965 · outbound

This paper cites Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

Reference 19

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb2c7269-c872-4c88-8208-a495b7642bab · outbound

This paper cites SubgoalXL: Subgoal-based Expert Learning for Theorem Proving.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis SubgoalXL: Subgoal-based Expert Learning for Theorem Proving

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa263907-ba88-4ff1-8561-c8b80254b0f8 · outbound

This paper cites Lyra: Orchestrating Dual Correction in Automated Theorem Proving.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Lyra: Orchestrating Dual Correction in Automated Theorem Proving

Reference 21

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9c07695-0d0f-420b-9572-73214d61bc04 · outbound

This paper cites It is a hierarchical proving method in the sense that the lemmas used for proving the current theorem can be built on more low-level lemmas.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis It is a hierarchical proving method in the sense that the lemmas used for proving the current theorem can be built on more low-level lemmas

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.236796Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation a05cadc0-1fa0-41fb-b470-9c144510665a · outbound

This paper cites Whereas our ProofAug serves as a play-and-plug module and can fall back to naive single-pass generation, being superior in efficiency, robustness, and flexibility.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Whereas our ProofAug serves as a play-and-plug module and can fall back to naive single-pass generation, being superior in efficiency, robustness, and flexibility

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.216195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 6e7fb308-9919-4e8f-92fd-9aa4756b6cde · outbound

This paper cites a ˆ2 mod 3 = 0 \ < or > a ˆ2 mod 3 = 1.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis a ˆ2 mod 3 = 0 \ < or > a ˆ2 mod 3 = 1

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.139648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation c26431dd-e74b-4ac3-bd17-a386b6669606 · outbound

This paper cites As a result, we do not import the Symmetric Polynomials.Vieta theory as in Jiang et al.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis As a result, we do not import the Symmetric Polynomials.Vieta theory as in Jiang et al

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.123435Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 160caf1d-c3f1-4e63-9a57-7f19ecfd9ac5 · outbound

This paper cites user": "Please complete the following Isabelle proof.\n‘‘‘isabelle\n( * Informal statement:\n{xi}\n\nInformal proof:\n{yi} *)\n{xf}\n.

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.106545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 60eef13c-145a-40f5-b61e-ad71c13b8ab0 · outbound

This paper cites The three versions of few-shot prompting share the same prompt template shown in Figure 6, but differ in examples: ‘DSP’ refers to the examples in Jiang et al.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis The three versions of few-shot prompting share the same prompt template shown in Figure 6, but differ in examples: ‘DSP’ refers to the examples in Jiang et al

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.088199Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b1b086f5-002a-44f5-93b5-a39fd0dff94c · outbound

This paper cites Formal proof sketches.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Formal proof sketches

Reference 2004

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T00:06:31.281602Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation a4d63406-33f5-450a-8ca6-cdb52e6a64c3 · outbound

This paper cites doi: 10.2168/lmcs-8(1:30)2012.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis doi: 10.2168/lmcs-8(1:30)2012

Reference 2012

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54217f8f-d984-4abb-a31d-8b225470c82e · outbound

This paper cites Premise Selection for Theorem Proving by Deep Graph Embedding.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Premise Selection for Theorem Proving by Deep Graph Embedding

Reference 2017

Resolution: verified exact; local_arxiv, observed 2026-08-10T00:06:30.813513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 9d10f988-7b4b-4bc5-9630-c1083ad6c00c · outbound

This paper cites Generative Language Modeling for Automated Theorem Proving.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Generative Language Modeling for Automated Theorem Proving

Reference 2020

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53171b66-6731-4e0c-805d-186c4a755e9a · outbound

This paper cites an unresolved cited work.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Unresolved cited work

Reference 2021

Resolution: unresolved; raw_fallback, observed 2026-08-10T00:06:31.261877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 350e76c0-165b-481c-9348-37d9add2a3fd · outbound

This paper cites The Isabelle ENIGMA.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis The Isabelle ENIGMA

Reference 2022

Resolution: verified exact; local_arxiv, observed 2026-08-10T00:06:31.005853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation aa99cdaa-a394-4a66-bb34-8e58e4ec85b8 · outbound

This paper cites Baldur: Whole-Proof Generation and Repair with Large Language Models.

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis Baldur: Whole-Proof Generation and Repair with Large Language Models

Reference 2023

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9040e1f3-0816-4f49-a9a4-61cddf875516 · outbound

This paper cites Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically.

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.

Pith citing papers

Observation cae42ab4-bf9f-4c02-8636-b263b5b2603b · inbound

Step-Wise Formal Verification for LLM-Based Mathematical Problem Solving cites this paper.

Step-Wise Formal Verification for LLM-Based Mathematical Problem Solving ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T13:48:56.774331Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1a947d8-2868-4d9b-ab75-4f139789a856 · inbound

Mathesis: Towards Formal Theorem Proving from Natural Languages cites this paper.

Mathesis: Towards Formal Theorem Proving from Natural Languages ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T05:50:37.246144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbdda939-cb05-44e8-ae9a-546a73dc49a3 · inbound

Neuro-Symbolic Proof Generation for Scaling Systems Software Verification cites this paper.

Neuro-Symbolic Proof Generation for Scaling Systems Software Verification ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis

Reference 70

Resolution: verified exact; arxiv_id, observed 2026-05-15T09:05:20.481571Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.