{"as_of":"2026-08-11T16:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5794b5596ed95f68c381a4fe1cdca30263f5a48859674903829a186d68367fd","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:35:26.448260Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T02:57:37.873567Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T02:57:38.116420Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2503.11657","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11657","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automating mathemati- cal proof generation using large language model agents and knowledge graphs","venue":null,"work_id":"53b3c8d7-a4f6-4534-b0bf-cc1b4321837b","year":2025},"citing_paper":{"arxiv_id":"2504.19678","last_updated":"2026-03-06T19:01:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-28T11:08:22Z","title":"From LLM Reasoning to Autonomous AI Agents: A Comprehensive Review","version":2},"reference_index":206,"source":"pdf_text","source_observed_at":"2026-05-15T02:57:37.873567Z"},"links":{"cited_paper":"/paper/2503.11657","citing_paper":"/paper/2504.19678"},"observation_digest":"sha256:b804b30a8946df79c3a1b7b61cecdade12e6a053c9946a043554d97ff000a206","observation_id":"7e3e72a7-9de0-4f88-bcdd-39b812b038b4","resolution":{"observed_at":"2026-05-26T02:02:59.460681Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.11657/citation-record","integrity":"/paper/2503.11657/integrity","json":"/paper/2503.11657/citation-record.json","paper":"/paper/2503.11657"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.660930Z","title":null,"venue":null,"work_id":"08fc3e37-8960-4e64-b43d-9a400e025604","year":2024},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.368519Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:ecb3d88fae8ca38c4eac1493557d68a953cb16befa5b19c763c54f6b2d76ecb3","observation_id":"0343f11a-0168-43dd-a9d8-944a06e66716","resolution":{"observed_at":"2026-08-09T13:35:26.663671Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.09469","last_updated":"2023-01-23T15:01:12Z","snapshot_observed_at":"2026-08-11T09:05:07.596470Z","submitted_at":"2023-01-23T15:01:12Z","title":"Nearest-neighbor approximation in one-excitation state evolution along spin-1/2 chain governed by XX-Hamiltonian","version":1},"cited_work":{"arxiv_id":"2301.09469","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.09469","snapshot_observed_at":"2026-08-09T13:35:26.566527Z","title":"Nearest-neighbor approximation in one-excitation state evolution along spin-1/2 chain governed by XX-Hamiltonian","venue":"quant-ph","work_id":"641299d2-1dda-4cc8-ab38-048e8f2cda91","year":2023},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.372310Z"},"links":{"cited_paper":"/paper/2301.09469","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:50cada8574611daf0bde025894731162acd58ad6e4a5d7f3485def7dca99899c","observation_id":"500a1046-585e-44d8-b6d5-34cab3c3a8f2","resolution":{"observed_at":"2026-08-09T13:35:26.570634Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.652782Z","title":"Bansal, S","venue":null,"work_id":"dd94b8be-0daa-4e58-af04-f9a7577df14c","year":2019},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.376002Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:b896da2988bfefe639148586ed471de03cb8a2b959d5b15c6636c1edf9c0d56d","observation_id":"fdaad23b-1585-4d9a-8168-0f2544ba78d5","resolution":{"observed_at":"2026-08-09T13:35:26.655705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-09T13:35:26.379620Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.379620Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:326670ebd0f8ee761d6e7418497a5aec4fbf3eb7e785730af4ad4fdd800d187c","observation_id":"3d707b3f-103e-42fc-8bbb-36b670cbcfdb","resolution":{"observed_at":"2026-08-09T13:35:26.379620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.644644Z","title":"de Moura, S","venue":null,"work_id":"d11b3f48-abcd-495b-a3b7-234f778aa4b4","year":2015},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.383220Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:0999fcfd6e88427b43276820a3f2568323fa373c4bcfbab1c7b6c470886761e8","observation_id":"0efa5cfb-76f9-4a62-9e0c-de1b4418f2ee","resolution":{"observed_at":"2026-08-09T13:35:26.647545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.636760Z","title":"de Moura and S","venue":null,"work_id":"716280c9-b464-4759-a9cc-41c141bdde17","year":2021},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.386513Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:87dca895413137cf9d8f9079d35329b618dae9e8e85e7cbb9049899f3f4f3163","observation_id":"a026a901-6a44-4d1c-b38f-e75835b8aba7","resolution":{"observed_at":"2026-08-09T13:35:26.639613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-09T13:35:26.390682Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.390682Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:098cc418125f48841b4db9f69fe4366556bf94c844164a63df57521659e8941b","observation_id":"fd347f8b-f6ab-4dfb-a074-1eb113673f65","resolution":{"observed_at":"2026-08-09T13:35:26.390682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-09T13:35:26.395120Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.395120Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:47b197e77353b3ac92a9e6278f7213ae4d97619c9e9459f4627a38ff9210f763","observation_id":"f8302450-72cd-4717-ab94-d77923181762","resolution":{"observed_at":"2026-08-09T13:35:26.395120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.628284Z","title":"Harrison","venue":null,"work_id":"0aedfc1a-ea6e-4472-8a40-aa57be075501","year":2009},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.398715Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:a59840955cb72fc0f546e232ea701d233099bba1a0d59d6188123fa98d457b7f","observation_id":"d9ed5cab-84f4-4b26-8a2d-578054917600","resolution":{"observed_at":"2026-08-09T13:35:26.631439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-09T13:35:26.401699Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.401699Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:3f108ea0f8001b63d16df7832cb1d231394022df43c6ccef707bbe347f54c9d3","observation_id":"e0ac399d-638c-4861-a697-f1df8a36bbfd","resolution":{"observed_at":"2026-08-09T13:35:26.401699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08957","last_updated":"2024-05-23T03:13:23Z","snapshot_observed_at":"2026-07-06T17:29:51.807428Z","submitted_at":"2024-02-14T05:57:58Z","title":"MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08957","snapshot_observed_at":"2026-08-09T13:35:26.405156Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.405156Z"},"links":{"cited_paper":"/paper/2402.08957","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:48e0bbf13f80d4c21df1002d7ab347382d35ad941a4b43526cdf0b6da2b4c9e8","observation_id":"4e458888-5836-4f8a-a958-d8d34fea093b","resolution":{"observed_at":"2026-08-09T13:35:26.405156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16443","last_updated":"2023-09-28T13:53:54Z","snapshot_observed_at":"2026-07-06T16:24:57.565403Z","submitted_at":"2023-09-28T13:53:54Z","title":"Novel Discrete Composite Distributions with Applications to Infectious Disease Data","version":1},"cited_work":{"arxiv_id":"2309.16443","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.16443","snapshot_observed_at":"2026-08-09T13:35:26.515710Z","title":"Novel Discrete Composite Distributions with Applications to Infectious Disease Data","venue":"stat.ME","work_id":"c3907e4a-1f4c-458b-9095-5a359e2ab190","year":2023},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.408661Z"},"links":{"cited_paper":"/paper/2309.16443","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:361edb6857c41e9ea390e849ec4405a0ceda427db70c0407218620b44b07a90d","observation_id":"0df83d60-1a10-42eb-b46b-a429f9f127f1","resolution":{"observed_at":"2026-08-09T13:35:26.520779Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.619384Z","title":"Johnson, D","venue":null,"work_id":"1c43cd0d-a4cc-49f1-8520-3e787de8fff8","year":2020},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.411858Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:b369e462d1f6506ad84c2641bbd8ad5f2e9ef864f944c5879c0e00bc46647e15","observation_id":"c38f8fc3-4297-4385-9ccc-f6669b405e2d","resolution":{"observed_at":"2026-08-09T13:35:26.622453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.611077Z","title":"Lample and F","venue":null,"work_id":"8308040c-9d14-4300-bfff-ddac8332e9d6","year":2022},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.414870Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:f913f107e73881aeab6e630019e63b44ea38f7f20eff8ada7f905d3a830e779a","observation_id":"1c091d57-7ac1-4416-b42f-c228ea5b4ac4","resolution":{"observed_at":"2026-08-09T13:35:26.613899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10005","last_updated":"2022-01-24T23:36:20Z","snapshot_observed_at":"2026-07-06T12:30:51.934079Z","submitted_at":"2022-01-24T23:36:20Z","title":"Text and Code Embeddings by Contrastive Pre-Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10005","snapshot_observed_at":"2026-08-09T13:35:26.417922Z","title":"Neelakantan, T","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.417922Z"},"links":{"cited_paper":"/paper/2201.10005","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:69cdb444e39989928e652aa6e735cc10e71018598b903b1e0e6bdc14a0913952","observation_id":"771ab388-79c6-42f3-be1a-e95e615f0df5","resolution":{"observed_at":"2026-08-09T13:35:26.417922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.602648Z","title":null,"venue":null,"work_id":"34e3caa9-9058-4c62-b092-e84cebf70f1e","year":2024},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.421718Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:e9195f1cc7edf9d4d41dbde7b3859ee5d63a4f42a1c610de75a244f1fd4fe8da","observation_id":"7b07b8f1-9581-48a2-9b2b-c07048aeee52","resolution":{"observed_at":"2026-08-09T13:35:26.605660Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.424480Z","title":"Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.424480Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:fe294764c09e55b790a99cd802642bbd535af1312b636556d0b7e32103b9d990","observation_id":"d8dac063-53f1-46ab-875e-e1739e04439c","resolution":{"observed_at":"2026-08-09T13:35:26.424480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03393","last_updated":"2020-09-07T19:50:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-09-07T19:50:10Z","title":"Generative Language Modeling for Automated Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03393","snapshot_observed_at":"2026-08-09T13:35:26.427396Z","title":"Polu and I","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.427396Z"},"links":{"cited_paper":"/paper/2009.03393","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:124b147548eb81955a96bc91eb8a5dbcaedd10f4cd01e2a424134e357cb6089c","observation_id":"8b1fe25c-1057-42e1-972d-146c0e23cf90","resolution":{"observed_at":"2026-08-09T13:35:26.427396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.594272Z","title":null,"venue":null,"work_id":"ec925547-704f-4cde-8cee-0e86f5c0fc60","year":2025},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.430257Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:b6a205bfb593ac36abc309e4b238110ccb5465d9715afe3d026da86830ef4859","observation_id":"dd237032-d7cf-417e-8f17-cb4b0494dec4","resolution":{"observed_at":"2026-08-09T13:35:26.597226Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04615","last_updated":"2023-06-12T17:51:15Z","snapshot_observed_at":"2026-07-06T13:19:12.109592Z","submitted_at":"2022-06-09T17:05:34Z","title":"Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04615","snapshot_observed_at":"2026-08-09T13:35:26.433145Z","title":"Brown, Adam Santoro, Aditya Gupta, Adrià Garriga-Alonso, Agnieszka Kluska, Aitor Lewkowycz, Akshat Agarwal, Alethea Power, Alex Ray, Alex Warstadt, Alexander W","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.433145Z"},"links":{"cited_paper":"/paper/2206.04615","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:052c20713c103eb6d76cd89279d7aa0e046bec7931029a3b14fe904617407db4","observation_id":"9b8bb7dc-91a1-4dc6-b81b-55ab45bf2cfe","resolution":{"observed_at":"2026-08-09T13:35:26.433145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.585685Z","title":null,"venue":null,"work_id":"328f04e1-a6b4-48f5-87dc-9351ad8becb4","year":2012},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.436372Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:d26ad9f5497125d2290f4614e1a2970c8ea7f56b51509eac60f19a4f5808968b","observation_id":"d9f9f820-1fd0-4726-b390-f38c8e15c4bc","resolution":{"observed_at":"2026-08-09T13:35:26.588810Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15626","last_updated":"2023-10-27T16:00:20Z","snapshot_observed_at":"2026-08-11T01:27:23.813824Z","submitted_at":"2023-06-27T17:05:32Z","title":"LeanDojo: Theorem Proving with Retrieval-Augmented Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15626","snapshot_observed_at":"2026-08-09T13:35:26.439109Z","title":"Swope, Alex Gu, Rahul Chalamala, Peiyang Song, Shixing Yu, Saad Godil, Ryan Prenger, and Anima Anandkumar","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.439109Z"},"links":{"cited_paper":"/paper/2306.15626","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:92c40cb952f030bcf16c78f30477c91a5d9f28e11a4b3670a76feba21c708196","observation_id":"738bd753-dc29-46bd-86fe-988f16da3b3a","resolution":{"observed_at":"2026-08-09T13:35:26.439109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00110","last_updated":"2022-02-28T06:03:23Z","snapshot_observed_at":"2026-08-11T08:16:22.316876Z","submitted_at":"2021-08-31T23:21:12Z","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00110","snapshot_observed_at":"2026-08-09T13:35:26.442038Z","title":"Zheng, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.442038Z"},"links":{"cited_paper":"/paper/2109.00110","citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:845168437dfcaf896b1be3c0fa43dd8162ebebe68818b4ce067f053a32fbb8bb","observation_id":"33b0693a-c229-4d82-b09e-85d69c2fa6f7","resolution":{"observed_at":"2026-08-09T13:35:26.442038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.445060Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.445060Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:9bbf775fe93715a679b676984c4370594b756c0b68003b7ddc32d7864bbbd8b9","observation_id":"853646f2-2002-4a14-9fbf-2bafeb22157b","resolution":{"observed_at":"2026-08-09T13:35:26.445060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:35:26.448260Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T13:35:26.448260Z"},"links":{"citing_paper":"/paper/2503.11657"},"observation_digest":"sha256:680a2c803ee1ed71425028a8d71d5d4fc405e7b59c7074b48c78916f6fefa19d","observation_id":"59cdf7fe-0686-4766-aa4e-e584f7eded36","resolution":{"observed_at":"2026-08-09T13:35:26.448260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2503.11657","last_updated":"2026-05-23T05:03:42Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T17:58:46.522840Z","submitted_at":"2025-02-04T07:17:34Z","title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":2,"verified_fuzzy":6},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2503.11657."}