Paper Citation Record · LEDGER

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving

As of 18 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2503.11657.

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

pith.paper-citation-record.v1
2503.11657 v3

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-09T13:35:26.448260Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-15T02:57:37.873567Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-15T02:57:38.116420Z

Reference resolution

25 of 25 outbound references displayed

verified exact2
verified fuzzy6
unresolved17
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0343f11a-0168-43dd-a9d8-944a06e66716 · outbound

This paper cites an unresolved cited work.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-09T13:35:26.663671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 500a1046-585e-44d8-b6d5-34cab3c3a8f2 · outbound

This paper cites Nearest-neighbor approximation in one-excitation state evolution along spin-1/2 chain governed by XX-Hamiltonian.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Nearest-neighbor approximation in one-excitation state evolution along spin-1/2 chain governed by XX-Hamiltonian

Reference 2

Resolution: verified exact; local_arxiv, observed 2026-08-09T13:35:26.570634Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fdaad23b-1585-4d9a-8168-0f2544ba78d5 · outbound

This paper cites Bansal, S.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Bansal, S

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T13:35:26.655705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 3d707b3f-103e-42fc-8bbb-36b670cbcfdb · outbound

This paper cites Language Models are Few-Shot Learners.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Language Models are Few-Shot Learners

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.379620Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0efa5cfb-76f9-4a62-9e0c-de1b4418f2ee · outbound

This paper cites de Moura, S.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving de Moura, S

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T13:35:26.647545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a026a901-6a44-4d1c-b38f-e75835b8aba7 · outbound

This paper cites de Moura and S.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving de Moura and S

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T13:35:26.639613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fd347f8b-f6ab-4dfb-a074-1eb113673f65 · outbound

This paper cites DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.390682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8302450-72cd-4717-ab94-d77923181762 · outbound

This paper cites The Llama 3 Herd of Models.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving The Llama 3 Herd of Models

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.395120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9ed5cab-84f4-4b26-8a2d-578054917600 · outbound

This paper cites Harrison.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Harrison

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T13:35:26.631439Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation e0ac399d-638c-4861-a697-f1df8a36bbfd · outbound

This paper cites Measuring Mathematical Problem Solving With the MATH Dataset.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Measuring Mathematical Problem Solving With the MATH Dataset

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.401699Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e458888-5836-4f8a-a958-d8d34fea093b · outbound

This paper cites MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.405156Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0df83d60-1a10-42eb-b46b-a429f9f127f1 · outbound

This paper cites Novel Discrete Composite Distributions with Applications to Infectious Disease Data.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Novel Discrete Composite Distributions with Applications to Infectious Disease Data

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-08-09T13:35:26.520779Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c38f8fc3-4297-4385-9ccc-f6669b405e2d · outbound

This paper cites Johnson, D.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Johnson, D

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T13:35:26.622453Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1c091d57-7ac1-4416-b42f-c228ea5b4ac4 · outbound

This paper cites Lample and F.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Lample and F

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T13:35:26.613899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 771ab388-79c6-42f3-be1a-e95e615f0df5 · outbound

This paper cites Text and Code Embeddings by Contrastive Pre-Training.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Text and Code Embeddings by Contrastive Pre-Training

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.417922Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b07b8f1-9581-48a2-9b2b-c07048aeee52 · outbound

This paper cites an unresolved cited work.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Unresolved cited work

Reference 16

Resolution: unresolved; raw_fallback, observed 2026-08-09T13:35:26.605660Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation d8dac063-53f1-46ab-875e-e1739e04439c · outbound

This paper cites Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.424480Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b1fe25c-1057-42e1-972d-146c0e23cf90 · outbound

This paper cites Generative Language Modeling for Automated Theorem Proving.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Generative Language Modeling for Automated Theorem Proving

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.427396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd237032-d7cf-417e-8f17-cb4b0494dec4 · outbound

This paper cites an unresolved cited work.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-08-09T13:35:26.597226Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9b8bb7dc-91a1-4dc6-b81b-55ab45bf2cfe · outbound

This paper cites Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.433145Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9f9f820-1fd0-4726-b390-f38c8e15c4bc · outbound

This paper cites an unresolved cited work.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving Unresolved cited work

Reference 21

Resolution: unresolved; raw_fallback, observed 2026-08-09T13:35:26.588810Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 738bd753-dc29-46bd-86fe-988f16da3b3a · outbound

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

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving LeanDojo: Theorem Proving with Retrieval-Augmented Language Models

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.439109Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33b0693a-c229-4d82-b09e-85d69c2fa6f7 · outbound

This paper cites MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.442038Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 853646f2-2002-4a14-9fbf-2bafeb22157b · outbound

This paper cites online" 'onlinestring :=.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving online" 'onlinestring :=

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.445060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59cdf7fe-0686-4766-aa4e-e584f7eded36 · outbound

This paper cites write newline.

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving write newline

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-09T13:35:26.448260Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 7e3e72a7-9de0-4f88-bcdd-39b812b038b4 · inbound

From LLM Reasoning to Autonomous AI Agents: A Comprehensive Review cites this paper.

From LLM Reasoning to Autonomous AI Agents: A Comprehensive Review Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving

Reference 206

Resolution: verified exact; arxiv_id, observed 2026-05-26T02:02:59.460681Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.