{"as_of":"2026-08-09T15:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eeb9f8a35a8b845d1042de21fc0db1abdbc7617ed1789b8db0a171bdf76a7cf3","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":19,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T05:12:15.745314Z","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-07-04T19:10:04.276956Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-09T05:12:15.745314Z","title":"Eprint: arXiv:2310.00656","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03321","last_updated":"2025-02-19T06:52:46Z","snapshot_observed_at":"2026-08-09T05:05:34.842281Z","submitted_at":"2025-02-05T16:21:10Z","title":"Simplifying Formal Proof-Generating Models with ChatGPT and Basic Searching Techniques","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T05:12:15.745314Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2502.03321"},"observation_digest":"sha256:626f049f2a60dc23a3d35c9eee294531e8c8a6d73955a780e8d9a4072f69dba8","observation_id":"bb219c47-ced0-458e-b51f-9fb8fb5bbcd7","resolution":{"observed_at":"2026-08-09T05:12:15.745314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-08T18:20:22.519772Z","title":"LeanDojo: Theorem Proving with Retrieval-Augmented Language Models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05714","last_updated":"2025-02-08T22:54:58Z","snapshot_observed_at":"2026-08-09T14:26:22.603712Z","submitted_at":"2025-02-08T22:54:58Z","title":"Proving the Coding Interview: A Benchmark for Formally Verified Code Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T18:20:22.519772Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2502.05714"},"observation_digest":"sha256:08dc5c932d11d3ac136c9ecd785542b68f2b4b99fccc7b37102a18dcdb702f17","observation_id":"e2ed5352-a667-4e0d-bdb7-bada423db203","resolution":{"observed_at":"2026-08-08T18:20:22.519772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2504.11354","last_updated":"2025-04-15T16:23:44Z","snapshot_observed_at":"2026-08-03T03:38:06.953412Z","submitted_at":"2025-04-15T16:23:44Z","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T18:32:40.880435Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2504.11354"},"observation_digest":"sha256:05bc23fab468384827863b7961a574c39fb77c259a320aa69028290cb9bf8d63","observation_id":"c2fc0635-efa5-402a-9fa1-f88516b75ac9","resolution":{"observed_at":"2026-05-17T18:32:40.918717Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-07T11:26:31.151825Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02565","last_updated":"2025-06-03T07:49:38Z","snapshot_observed_at":"2026-08-07T23:33:14.577979Z","submitted_at":"2025-06-03T07:49:38Z","title":"Towards Generating Controllable and Solvable Geometry Problem by Leveraging Symbolic Deduction Engine","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T11:26:31.151825Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2506.02565"},"observation_digest":"sha256:5323b5becc805ed66cfbd1a4d39e98e9be84490ac43567258c6676127f65ef79","observation_id":"9f7fd8dc-95c5-4603-a7d4-e096737629b6","resolution":{"observed_at":"2026-08-07T11:26:31.151825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-07T05:50:37.582568Z","title":"Lego-prover: Neural theorem proving with growing libraries.arXiv preprint arXiv:2310.00656, 2023","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-08T15:57:39.040729Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.582568Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:e9b572b0acb02bc4575a29fbb964a2042108c0296f86270b26de7d303a620828","observation_id":"d2058df4-a660-4a3f-874a-272d5e29756d","resolution":{"observed_at":"2026-08-07T05:50:37.582568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-07T04:29:43.837522Z","title":"Lego-prover: Neural theorem proving with growing libraries","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-08T07:01:17.900094Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:43.837522Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:42059ee98063e0e89b444926c8251de131483f90f5803b7b5731ffe549786843","observation_id":"7d5b99e8-5c14-4a34-bdd8-4a0f4264ef87","resolution":{"observed_at":"2026-08-07T04:29:43.837522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-06T20:31:27.281171Z","title":"Lego-prover: Neural theorem proving with growing libraries","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.02541","last_updated":"2025-07-03T11:35:34Z","snapshot_observed_at":"2026-08-07T23:32:35.210784Z","submitted_at":"2025-07-03T11:35:34Z","title":"Clarifying Before Reasoning: A Coq Prover with Structural Context","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:31:27.281171Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2507.02541"},"observation_digest":"sha256:56ec04899056d6a3d4750985dc1f116e3bc55c83b024b827247d98b4bace8167","observation_id":"d408067e-135e-41c7-9d7c-b2fd1bf069a3","resolution":{"observed_at":"2026-08-06T20:31:27.281171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-06T15:42:08.504816Z","title":"Lego-prover: Neural theorem proving with growing libraries.arXiv preprint arXiv:2310.00656, 2023","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-08-06T17:33:28.833666Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T15:42:08.504816Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2507.15225"},"observation_digest":"sha256:cd2bf03e71e0ed634e820b91380ed734a0f366bc68128b7ec7aefce01814f55f","observation_id":"59aabeec-9984-4644-bd0c-aa2c767f5103","resolution":{"observed_at":"2026-08-06T15:42:08.504816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-06T13:47:37.576970Z","title":"LEGO-Prover: Neural theorem proving with growing libraries","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.20199","last_updated":"2025-08-13T10:58:50Z","snapshot_observed_at":"2026-08-07T10:10:33.604674Z","submitted_at":"2025-07-27T09:38:32Z","title":"StepFun-Prover Preview: Let's Think and Verify Step by Step","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T13:47:37.576970Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2507.20199"},"observation_digest":"sha256:45f4d176c6d460fb10f163514abbafecde1990d12e3ad82e9793d18df27e6beb","observation_id":"36feea82-9a2a-409e-ab89-5cc73df27e9c","resolution":{"observed_at":"2026-08-06T13:47:37.576970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2507.21046","last_updated":"2026-01-16T20:59:08Z","snapshot_observed_at":"2026-08-01T06:32:44.461162Z","submitted_at":"2025-07-28T17:59:05Z","title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","version":4},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-14T22:23:14.621091Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2507.21046"},"observation_digest":"sha256:c59e6885895c779b9b4f28bc504096fd9c6f1c3e16d348c8a55f59aa36f2f3d8","observation_id":"8400ccbe-1fcc-49be-b869-eb5c4140f682","resolution":{"observed_at":"2026-05-14T22:23:15.547500Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-06T17:05:19.239606Z","title":"Lego-prover: Neural theorem proving with growing libraries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22069","last_updated":"2025-07-31T07:33:11Z","snapshot_observed_at":"2026-08-08T02:08:22.389577Z","submitted_at":"2025-07-16T03:11:43Z","title":"A Compute-Matched Re-Evaluation of TroVE on MATH","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T17:05:19.239606Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2507.22069"},"observation_digest":"sha256:9b7dbdb857ada76241c9896bfb4fb99b9b516d88c35cc64037dbd29c53e49e3d","observation_id":"32f94fc4-ff56-47f3-a992-a178bf87fd54","resolution":{"observed_at":"2026-08-06T17:05:19.239606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2604.25155","last_updated":"2026-04-28T02:57:20Z","snapshot_observed_at":"2026-08-04T04:22:10.934988Z","submitted_at":"2026-04-28T02:57:20Z","title":"Rethinking Wireless Communications through Formal Mathematical AI Reasoning","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-07T15:42:24.167986Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2604.25155"},"observation_digest":"sha256:2ccf64e5ae4c897afa0504eae5d3d314958b20d148fb954bd95ae2342a1f8e98","observation_id":"0878dc47-7271-48d2-a42a-aed0f743485e","resolution":{"observed_at":"2026-05-12T00:11:16.348279Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2605.01394","last_updated":"2026-05-02T11:31:33Z","snapshot_observed_at":"2026-08-06T01:33:30.617883Z","submitted_at":"2026-05-02T11:31:33Z","title":"LiveFMBench: Unveiling the Power and Limits of Agentic Workflows in Specification Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-09T14:35:14.357256Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2605.01394"},"observation_digest":"sha256:8ba03d4569ebd02b4386bfc556024e5e4ffbe617ca12a39d5123e339b3b17e6f","observation_id":"76baa175-1c68-4611-aed5-2b056f264ed7","resolution":{"observed_at":"2026-05-11T16:51:09.534736Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2605.23643","last_updated":"2026-05-22T13:55:11Z","snapshot_observed_at":"2026-08-02T12:37:45.812132Z","submitted_at":"2026-05-22T13:55:11Z","title":"Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-25T04:09:10.588205Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2605.23643"},"observation_digest":"sha256:49f920fb4b559f4344b1cccfd4f26ff47d966ba93894548a9cd20cb2cb284dd0","observation_id":"244b7b1f-3aa0-42a3-b10c-6a6db7125321","resolution":{"observed_at":"2026-05-25T04:10:19.430662Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2605.25556","last_updated":"2026-05-27T19:06:07Z","snapshot_observed_at":"2026-08-03T11:59:32.421384Z","submitted_at":"2026-05-25T08:12:26Z","title":"Keep the Proof State Live: Snapshotting for Efficient Tactic Search in Lean 4","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T19:52:06.158735Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2605.25556"},"observation_digest":"sha256:3b6c9ef72f390bb21992df40ad4626d1debaddfb0bc2bea569c934dd34a47705","observation_id":"b68ba112-7551-4f56-974f-13ae1ba71011","resolution":{"observed_at":"2026-06-29T19:53:55.464207Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2605.29955","last_updated":"2026-05-28T14:00:22Z","snapshot_observed_at":"2026-08-09T13:58:49.202099Z","submitted_at":"2026-05-28T14:00:22Z","title":"Formalizing Mathematics at Scale","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-29T07:35:06.858835Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2605.29955"},"observation_digest":"sha256:78577340181527a9e967b68229f7d7d438612b63320233ac8f91ab9a70b7c89a","observation_id":"9d07a26d-1857-40ba-99ef-d39bec3ec1bb","resolution":{"observed_at":"2026-06-29T07:53:14.288299Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2606.18098","last_updated":"2026-06-16T16:00:14Z","snapshot_observed_at":"2026-07-06T23:53:36.096914Z","submitted_at":"2026-06-16T16:00:14Z","title":"IsabeLLM: Automated Theorem Proving Applied to Formally Verifying Consensus","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-27T01:14:04.350160Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2606.18098"},"observation_digest":"sha256:b32378794ee7f321ddd3e0c02dfc0710b1fbc0c16b68e76243edb814ebd2c638","observation_id":"37be89b3-700b-4ef8-95d9-16beca363e81","resolution":{"observed_at":"2026-07-03T20:38:55.790303Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":"2310.00656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-07-04T19:10:04.276956Z","title":"URL: https://arxiv.org/abs/2310.00656","venue":null,"work_id":"ba7b923c-31a8-402f-8437-764efbd6e2ba","year":2023},"citing_paper":{"arxiv_id":"2606.24443","last_updated":"2026-06-23T11:24:49Z","snapshot_observed_at":"2026-08-08T10:55:21.826984Z","submitted_at":"2026-06-23T11:24:49Z","title":"Verifiable Auto-Formalization of Mathematics Using a Relaxed Natural Formal Language","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-25T21:59:02.948726Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2606.24443"},"observation_digest":"sha256:9f72e58478b2bb2bd779a35d5d555b56cdcbec7b6803a7934bc5cd04084c61f2","observation_id":"5d7848b9-bb7e-4e9e-beb7-a9016c19b693","resolution":{"observed_at":"2026-07-04T19:10:04.279008Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-02T05:40:00.998283Z","title":"2310.00656 , archivePrefix=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13292","last_updated":"2026-08-05T04:34:27Z","snapshot_observed_at":"2026-08-08T23:10:28.074156Z","submitted_at":"2026-07-14T21:58:52Z","title":"Theory-Level Autoformalization: From Isolated Statements to Unified Formal Knowledge Bases","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T05:40:00.998283Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2607.13292"},"observation_digest":"sha256:72b7f75e4b6265481e5390b69d598ec8bba55c2a96744b982748e046edfefdad","observation_id":"9dc78a3f-9a8b-471d-adc8-3f6a8a5a3206","resolution":{"observed_at":"2026-08-02T05:40:00.998283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.00656/citation-record","integrity":"/paper/2310.00656/integrity","json":"/paper/2310.00656/citation-record.json","paper":"/paper/2310.00656"},"outbound":[],"paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T23:33:42.816316Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 19 inbound Pith citation observations for arXiv:2310.00656."}