{"as_of":"2026-08-06T10:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd67806a45683ce3bf6e435fe84bde09a7b3706d1fb8c614b87ec5fe83372ac4","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T21:40:03.235818Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.16372/citation-record","integrity":"/paper/2607.16372/integrity","json":"/paper/2607.16372/citation-record.json","paper":"/paper/2607.16372"},"outbound":[{"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-01T21:39:55.146544Z","title":"Generative language modeling for automated theorem proving,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:55.146544Z"},"links":{"cited_paper":"/paper/2009.03393","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:ef24bffd875b7311bab952f3532ab2affd5bdfd5faa70e47957c4c782b0229d5","observation_id":"5cfa695b-5cfb-4ca5-bacf-b7efdf821112","resolution":{"observed_at":"2026-08-01T21:39:55.146544Z","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-01T21:39:55.273521Z","title":"Leandojo: Theorem proving with retrieval-augmented language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:55.273521Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:8b74ba6a67ccb55935d2d45d08e778d7fcf13240eb1fa1cb36e36566fb546f9d","observation_id":"1f7b884c-4942-4408-9759-120da7108a03","resolution":{"observed_at":"2026-08-01T21:39:55.273521Z","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-01T21:39:55.441865Z","title":"Refinedc: automating the foundational verification of c code with refined ownership types,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:55.441865Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:8d4f086a8fcbfde36522de04b09787374386d9d8933a47f25b329aa07df4690d","observation_id":"be1c5bd5-2cbb-4ead-8472-8cf2687cdfd2","resolution":{"observed_at":"2026-08-01T21:39:55.441865Z","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-01T21:39:55.557455Z","title":"Foundational multi-modal program verifiers,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:55.557455Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:f2602375ca9b1cda30c6ddc83a970289436d4fadae9c4d4629cfef0f3c5470a5","observation_id":"b219b495-a7b8-46c7-bcb6-b0316abb8b5f","resolution":{"observed_at":"2026-08-01T21:39:55.557455Z","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-01T21:39:55.720025Z","title":"Seed-prover 1.5: Mastering undergraduate-level theorem proving via learning from experience,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:55.720025Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:400f0dd8ce3adbe93b5f8443a21043a839dc175c9c3af8f5df49826438805b17","observation_id":"4de7b25d-23f3-4be9-b72b-091480ebace3","resolution":{"observed_at":"2026-08-01T21:39:55.720025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21801","last_updated":"2025-07-18T08:20:23Z","snapshot_observed_at":"2026-08-02T11:46:58.603316Z","submitted_at":"2025-04-30T16:57:48Z","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21801","snapshot_observed_at":"2026-08-01T21:39:55.867810Z","title":"DeepSeek-Prover- V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:55.867810Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:fe85bf1addd749426619db0f836ae1799cfbe51d703b769118e7eae1cb33945a","observation_id":"9475b8af-b61e-4cee-98fa-8e65e946274d","resolution":{"observed_at":"2026-08-01T21:39:55.867810Z","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-01T21:39:56.032313Z","title":"A minimal agent for automated theorem proving,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.032313Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:52344bd10acd66047fde7e143e448284f4526d83a93e814c04904927598d4680","observation_id":"bf9885d5-3ab3-4dbc-a027-4823d01431c6","resolution":{"observed_at":"2026-08-01T21:39:56.032313Z","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-01T21:39:56.192356Z","title":"Numina- lean-agent: An open and general agentic reasoning system for formal mathematics,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.192356Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:0309f43e4910210850a90a96589107d452acd35a34e83df34f89e97d3a17e8d6","observation_id":"3865e349-503c-430e-b8ce-96d2f0ac4d0b","resolution":{"observed_at":"2026-08-01T21:39:56.192356Z","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-01T21:39:56.374238Z","title":"Merlean: An agentic framework for autoformalization in quantum computation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.374238Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:7500b08ecb7bd0b0e3f9540cb2e640ad7d407dbdd2fcf27ee25cece3a1ad3cb7","observation_id":"92928635-0ad5-4d15-96b1-c844d3d96bcf","resolution":{"observed_at":"2026-08-01T21:39:56.374238Z","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-01T21:39:56.444746Z","title":"Neural theorem proving: Generating and structuring proofs for formal verification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.444746Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:77151f83413364eac3cb17421c3b395ab3a4e6cd6b02aa4e2d0e821ae7b817b2","observation_id":"3d8e4f38-8ae2-4e4a-866a-a0fb312de8e2","resolution":{"observed_at":"2026-08-01T21:39:56.444746Z","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-01T21:39:56.536976Z","title":"Verisoftbench: Repository- scale formal verification benchmarks for lean,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.536976Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:674ccc57cf3f9313705dfdd3641d1912a5d87c20242d8785fc3531dd5fce5caf","observation_id":"03ce4464-98ff-4a55-8de9-88ed14da89b6","resolution":{"observed_at":"2026-08-01T21:39:56.536976Z","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-01T21:39:56.646106Z","title":"Aleph prover: State-of-the-art formal theorem prover,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.646106Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:83cf6ac4aacb19d9b0a94667b19eead4cf3aa8ced8ac2f6fee2331fc637e514e","observation_id":"8887b8a3-da33-4e05-bdcf-807c8e60b2e9","resolution":{"observed_at":"2026-08-01T21:39:56.646106Z","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-01T21:39:56.820146Z","title":"Putnambench: Evaluating neural theorem-provers on the putnam mathematical competition,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.820146Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:884d4dc99a05e7a29958e87b86f9786ee36aca5b2a9a484f17e6bbe0da4d6893","observation_id":"b2994e32-f775-4a91-a296-ebb16263ca6b","resolution":{"observed_at":"2026-08-01T21:39:56.820146Z","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-01T21:39:56.990913Z","title":"William Lowell Putnam Math- ematical Competition,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:56.990913Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:6f5f2e7813a96d26b03ab1e4b7964a9e9ed0ae32df09f5a8f86ca97b4d6c897c","observation_id":"78f4d2cb-12dc-4f2e-b299-b2e63a4c0ad7","resolution":{"observed_at":"2026-08-01T21:39:56.990913Z","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-01T21:39:57.195017Z","title":"Putnambench leaderboard,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:57.195017Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:6c65a7da97e5739cb38a09803567ee4382cd426b79707f505079ebcdba414647","observation_id":"f4b2b328-5ba1-4566-b49c-0833c7667d2f","resolution":{"observed_at":"2026-08-01T21:39:57.195017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.24273","last_updated":"2026-05-14T16:23:55Z","snapshot_observed_at":"2026-08-02T04:41:42.758635Z","submitted_at":"2026-02-27T18:43:47Z","title":"A Minimal Agent for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.24273","snapshot_observed_at":"2026-08-01T21:39:57.333823Z","title":"A minimal agent for automated theorem proving,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:57.333823Z"},"links":{"cited_paper":"/paper/2602.24273","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:b6cc80712f9e53b73eb5c435e48d955ab895ecbac3fcab2c775a4cab08e62508","observation_id":"ac00c2dd-0903-43b9-9987-5fa4243df9e5","resolution":{"observed_at":"2026-08-01T21:39:57.333823Z","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-01T21:39:57.456607Z","title":"Automated conjecture resolution with formal verification,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:57.456607Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:78c8f8dfbab78bd2bc67bf78e62a0666a88f604258b4db4109bf92ccf108806f","observation_id":"f3f0b6fb-e077-43ca-a3d6-3eb9acf389d4","resolution":{"observed_at":"2026-08-01T21:39:57.456607Z","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-01T21:39:57.740893Z","title":"A minimalist proof language for neural theorem proving over Isabelle/HOL,","venue":null,"work_id":null,"year":2073},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:57.740893Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:36ca97833ca18704b214f35ed24e4d9c504d9d4464385375fe6769aa72564845","observation_id":"9facd4af-421f-4715-8fb0-cfe49d2f9559","resolution":{"observed_at":"2026-08-01T21:39:57.740893Z","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-01T21:39:57.886776Z","title":"Coqpilot, a plugin for llm-based generation of proofs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:57.886776Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:58732d7262ff29b6e360c6d1d7759027b3be8b34a82075238041cddac6b01c16","observation_id":"8c1ffffe-b00a-4ae6-8f70-203e9eab8ecf","resolution":{"observed_at":"2026-08-01T21:39:57.886776Z","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-01T21:39:58.066916Z","title":"AutoCorrode software verification framework for Isabelle/HOL,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.066916Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:2f3f56374e96d91136de0b3bd9ddf7867d67ae4b995f6f71245adc8df8e80c93","observation_id":"591190b0-0653-4413-8da6-f865baa27fca","resolution":{"observed_at":"2026-08-01T21:39:58.066916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18626","last_updated":"2024-12-19T22:47:08Z","snapshot_observed_at":"2026-08-02T01:53:42.851993Z","submitted_at":"2024-12-19T22:47:08Z","title":"Why Do Large Language Models (LLMs) Struggle to Count Letters?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.18626","snapshot_observed_at":"2026-08-01T21:39:58.163407Z","title":"Why do large language models (LLMs) struggle to count letters?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.163407Z"},"links":{"cited_paper":"/paper/2412.18626","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:cd85f56f7b7dfd21e64d51171517da5097b6d12ae9fc0aba47fc5bfbfaadf8f2","observation_id":"4137c117-d0a9-4136-a1ef-1950f75099bf","resolution":{"observed_at":"2026-08-01T21:39:58.163407Z","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-01T21:39:58.274300Z","title":"CUTE: Measuring LLMs’ understanding of their tokens,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.274300Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:9e32f28b258f0c4544ad214108542ac855e06fccb15a1513dd1849fe6e80e358","observation_id":"7b6ef6b0-2561-47a1-aacb-2b769b207f00","resolution":{"observed_at":"2026-08-01T21:39:58.274300Z","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-01T21:39:58.334357Z","title":"A machine-oriented logic based on the resolution principle,","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.334357Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:768030ca657653c3462885819cb155ff2b0cf29d2dc78344272b9ddb3cd203d2","observation_id":"136f47f7-4e4e-4553-a9ef-7b592f2a1494","resolution":{"observed_at":"2026-08-01T21:39:58.334357Z","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-01T21:39:58.463734Z","title":"Rewrite-based equational theorem proving with selection and simplification,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.463734Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:dd2239e1e75307609a9efd252a00d7ef074433bf12dd74a332656c3ac095abfa","observation_id":"2b600f51-9728-4329-abe1-e26973bfa966","resolution":{"observed_at":"2026-08-01T21:39:58.463734Z","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-01T21:39:58.560045Z","title":"Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T),","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.560045Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:3c4872da86aec5635065f13407d50c5a535a7332ec73093d38d91917c57d660c","observation_id":"2b16698c-43ac-49ab-94bd-e861ec582371","resolution":{"observed_at":"2026-08-01T21:39:58.560045Z","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-01T21:39:58.654316Z","title":"Autoformalization with large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.654316Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:a9e9decd225f1401e07f64096a71161f05e21b36022bd291e4ca89f4a639988a","observation_id":"12c27ba0-4b2d-4da4-9e03-c45a4ab100f4","resolution":{"observed_at":"2026-08-01T21:39:58.654316Z","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-01T21:39:58.842549Z","title":"Draft, sketch, and prove: Guiding formal theorem provers with informal proofs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.842549Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:732d392b678280401632c91450f484888764d90250d12251a479f1d28c5e008c","observation_id":"89cf3669-5200-4b3c-8e8e-7e8e7909dc1e","resolution":{"observed_at":"2026-08-01T21:39:58.842549Z","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-01T21:39:58.980210Z","title":"Z3: An efficient SMT solver,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.980210Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:2570b993c5dbb1438418ad16a231dad65e230c8d699ce3025e3959074c5294b5","observation_id":"09521a70-3946-4214-8142-0ec5d23e1898","resolution":{"observed_at":"2026-08-01T21:39:58.980210Z","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-01T21:39:59.113242Z","title":"cvc5: A versatile and industrial-strength SMT solver,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.113242Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:c9baa9c517d12e7ab791838a343747a504e05b45d387666e005a5b8e2769581f","observation_id":"972bb5a3-2287-4f7e-bdcd-341c77dcdda1","resolution":{"observed_at":"2026-08-01T21:39:59.113242Z","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-01T21:39:59.232431Z","title":"Faster, higher, stronger: E 2.3,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.232431Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:eb4f36cdddf2b3b2e9146b82004ab470f6e2d997fc03ead20336440e5ef9789b","observation_id":"8cebfc94-c47a-42db-8c37-11a032ce093e","resolution":{"observed_at":"2026-08-01T21:39:59.232431Z","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-01T21:39:59.303172Z","title":"First-order proof tactics in higher-order logic theorem provers,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.303172Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:055ca179bdd2c19cffc1c5119349c05c925f9b69b59b830c1bec0f946e753256","observation_id":"5a86ec8f-c71e-40dc-b0bd-cf68f3791654","resolution":{"observed_at":"2026-08-01T21:39:59.303172Z","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-01T21:39:59.408326Z","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.408326Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:95277eab6141441d8bca8db9c95eea9d2f181a2ce9c78218bdde4e1a031dec1c","observation_id":"189d2191-7714-455c-941e-83d57fa84eda","resolution":{"observed_at":"2026-08-01T21:39:59.408326Z","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":"2601.18944","doi":"10.48550/arxiv.2601.18944","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Neural theorem proving for verification conditions: A real-world benchmark,","venue":"Open MIND","work_id":"1e0e354b-cd08-42d9-ac16-ade4e09db3b3","year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.619005Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:83c3b6a8db96824cea054c321e26cdba3d1adcc081f916bde2d8b4e3d6fd0ee1","observation_id":"ce6765e1-a797-46fc-9e1c-10df9412c12a","resolution":{"observed_at":"2026-08-01T21:43:30.278259Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-01T21:39:59.740462Z","title":"Prompt caching,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.740462Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:52355f6cf2f2d7d482891416f4fe5efa5ed3b00a25f50da3a016a001dfd3511a","observation_id":"7a068534-2bd6-4487-bc10-d359750f78ad","resolution":{"observed_at":"2026-08-01T21:39:59.740462Z","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-01T21:39:59.813549Z","title":"Minilang-afp-v1,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.813549Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:e06195016a0e212ab1006a23de033741bbb214a59b270026580e87db45be9800","observation_id":"12752841-dada-4d51-9ab9-9f317f3fb568","resolution":{"observed_at":"2026-08-01T21:39:59.813549Z","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-01T21:39:59.896160Z","title":"An in-context learning agent for formal theorem-proving,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:59.896160Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:4e0642ba4a3c2279b78451df4c5e06b15bc8cb49ff351e8192e093ef5c3486ed","observation_id":"098e298d-ddf7-492e-9e47-992f470fa516","resolution":{"observed_at":"2026-08-01T21:39:59.896160Z","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-01T21:40:00.034151Z","title":"Prover agent: An agent-based framework for formal mathematical proofs,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:00.034151Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:c944c14ecc69b220d2d2afb50ea905a1fcf61c40c0bde5f075d930492ac356aa","observation_id":"d6741f21-78d6-44b5-885c-1b46785632b4","resolution":{"observed_at":"2026-08-01T21:40:00.034151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15254","last_updated":"2025-06-10T21:52:15Z","snapshot_observed_at":"2026-07-06T19:20:37.430389Z","submitted_at":"2024-09-23T17:53:42Z","title":"Archon: An Architecture Search Framework for Inference-Time Techniques","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15254","snapshot_observed_at":"2026-08-01T21:40:00.428697Z","title":"Archon: An architecture search framework for inference-time techniques,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:00.428697Z"},"links":{"cited_paper":"/paper/2409.15254","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:852b2b7eaa2c564d12ae7309eaad52b3296aa4747ed663780cfd18f40238d7e7","observation_id":"0c371a2d-7b3e-4449-b052-3acac7ed6c05","resolution":{"observed_at":"2026-08-01T21:40:00.428697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.03303","last_updated":"2026-06-03T06:16:05Z","snapshot_observed_at":"2026-07-06T23:43:36.420646Z","submitted_at":"2026-06-02T08:16:42Z","title":"LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.03303","snapshot_observed_at":"2026-08-01T21:40:00.572352Z","title":"Leap: Supercharging llms for formal mathematics with agentic frameworks,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:00.572352Z"},"links":{"cited_paper":"/paper/2606.03303","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:8b1441d8c1736e607ab777819e3f2bcb279a13cd6dc1dbacf055d2b1e712e662","observation_id":"08c9e873-84ea-4d96-ba4b-1573dce7b8d4","resolution":{"observed_at":"2026-08-01T21:40:00.572352Z","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-01T21:40:00.738980Z","title":"Abstract syntax networks for code generation and semantic parsing,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:00.738980Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:225a6ce938c3b0c41954f01b3ed533c8d406518e9ca7c09f295cb717636772be","observation_id":"238e9340-e116-4fb1-a6d1-a4c3b0b374f0","resolution":{"observed_at":"2026-08-01T21:40:00.738980Z","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-01T21:40:00.956446Z","title":"Tree-to-tree neural networks for program translation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:00.956446Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:a7d2bac4ab6752816cf3ab7c65495957bcd9a884ac6bcb9cba76387ca11a00a9","observation_id":"626e845e-b252-4f28-bf07-e78dedeb972f","resolution":{"observed_at":"2026-08-01T21:40:00.956446Z","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":"10.18653/v1/d18-2002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TRANX: A transition-based neural abstract syntax parser for semantic parsing and code generation,","venue":null,"work_id":"e1bbe7bb-0cab-4566-ba6c-76fda8a30fee","year":2018},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:01.096710Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:f3a1ea54921a9bf63157251320d17ec9c418e500bbf6c9e550da472e95aa42da","observation_id":"15b8f2d3-ab8d-4c3d-b59e-357826c9c7e8","resolution":{"observed_at":"2026-08-01T21:43:30.188119Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-01T21:40:01.280179Z","title":"Treegen: A tree-based transformer architecture for code generation,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:01.280179Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:63920cf35b7ca0f7201c5add1cb06589365e361f3253d3edc3819f1303fd90de","observation_id":"354f9512-baea-43f5-90b9-504e6b1368de","resolution":{"observed_at":"2026-08-01T21:40:01.280179Z","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-01T21:40:01.428737Z","title":"Learning to fix build errors with graph2diff neural networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:01.428737Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:b384e9a05c05454e58f3649d4fb5e4436dbcdfdb1995d1ee02204c28b275ab9b","observation_id":"e58c175b-c241-4538-9e52-7a308c0adabb","resolution":{"observed_at":"2026-08-01T21:40:01.428737Z","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-01T21:40:01.564734Z","title":"Graph-based, self-supervised program repair from diagnostic feedback,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:01.564734Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:c2c06ed5e65c91b3dfecae2c75d4fc7e06c58fa27d97cf3f96af05bdb61d0ba8","observation_id":"5a0bbabe-468f-4eb9-bcff-ba43cefab759","resolution":{"observed_at":"2026-08-01T21:40:01.564734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20534","last_updated":"2026-02-03T04:57:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-28T05:35:43Z","title":"Kimi K2: Open Agentic Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.20534","snapshot_observed_at":"2026-08-01T21:40:01.752477Z","title":"Kimi k2: Open agentic intelligence,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:01.752477Z"},"links":{"cited_paper":"/paper/2507.20534","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:84e18ac13310eb60f5ab0a002a2675c0c98d85f2c31cfe63a0ef9ccafc60ddad","observation_id":"2c37d57f-765e-45b6-9f1e-3bad16b3539e","resolution":{"observed_at":"2026-08-01T21:40:01.752477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.15763","last_updated":"2026-02-24T10:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-17T17:50:56Z","title":"GLM-5: from Vibe Coding to Agentic Engineering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.15763","snapshot_observed_at":"2026-08-01T21:40:01.888205Z","title":"Glm-5: from vibe coding to agentic engineer- ing,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:01.888205Z"},"links":{"cited_paper":"/paper/2602.15763","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:8e7def59a480a1665c9e11b7452ccf57c86cc04d8c4eba8f07317fc32fcb768c","observation_id":"2651c683-6f17-4029-b722-728a5cfbb86e","resolution":{"observed_at":"2026-08-01T21:40:01.888205Z","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-01T21:40:02.002754Z","title":"Proof by pointing,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.002754Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:7a67ed3d0004001373c4ad93a9e55476c740175acba3a68799201462565a9853","observation_id":"7ebd7322-6b32-4077-8bf1-352337b03721","resolution":{"observed_at":"2026-08-01T21:40:02.002754Z","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-01T21:40:02.081633Z","title":"Proofviz: An interactive visual proof ex- plorer,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.081633Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:7ab160845bd73bc7b16ea3dacb9d52d5d272b91434546dbf90b5b151bfd32563","observation_id":"a38c60aa-f79d-4a95-8738-b88ee9e66dec","resolution":{"observed_at":"2026-08-01T21:40:02.081633Z","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-01T21:40:02.254362Z","title":"Henblocks: Structured editing for coq,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.254362Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:153764f592e0ea812d48d19e4c85d3e14907250a7f868769490f5933bb6e1f59","observation_id":"0c8abebe-ba51-4c19-9aa2-a0fef06a0141","resolution":{"observed_at":"2026-08-01T21:40:02.254362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.12594","last_updated":"2026-06-10T18:43:11Z","snapshot_observed_at":"2026-07-06T23:51:31.502574Z","submitted_at":"2026-06-10T18:43:11Z","title":"Pythagoras-Prover: Advancing Efficient Formal Proving via Augmented Lean Formalisation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.12594","snapshot_observed_at":"2026-08-01T21:40:02.390463Z","title":"Pythagoras-prover: Advancing efficient formal proving via augmented lean formalisation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.390463Z"},"links":{"cited_paper":"/paper/2606.12594","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:b5047a7bbc2b356ec18b1b44c3c37096f4be159fba8811cb9556cae86eadf3b1","observation_id":"d242234d-48c3-436c-b207-318b6fa88a8f","resolution":{"observed_at":"2026-08-01T21:40:02.390463Z","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-01T21:40:02.549940Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.549940Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:665997307e5599f4245f703a035ad0cce7cf931eadf364be56c315a816bbd731","observation_id":"fc7bbfe9-1133-4ba5-8b36-a008f1146021","resolution":{"observed_at":"2026-08-01T21:40:02.549940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11354","snapshot_observed_at":"2026-08-01T21:40:02.651495Z","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.651495Z"},"links":{"cited_paper":"/paper/2504.11354","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:55747e524250979fefa89f5098ea2a2b50532f9b58deece2f5a352e1d9df9016","observation_id":"018212f7-f213-49ca-abea-042fcf77dd7b","resolution":{"observed_at":"2026-08-01T21:40:02.651495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.17283","last_updated":"2026-05-17T06:39:05Z","snapshot_observed_at":"2026-08-02T16:55:37.869194Z","submitted_at":"2026-05-17T06:39:05Z","title":"OProver: A Unified Framework for Agentic Formal Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.17283","snapshot_observed_at":"2026-08-01T21:40:02.754266Z","title":"Oprover: A unified framework for agentic formal theorem proving,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.754266Z"},"links":{"cited_paper":"/paper/2605.17283","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:63dbe265201f963cb200139d10cf4b3b3ff193f62ff6fa0f4833d46182b1a066","observation_id":"df7b6aa1-4065-4dab-b253-f0fa1a359dfa","resolution":{"observed_at":"2026-08-01T21:40:02.754266Z","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-01T21:40:02.859128Z","title":"Longcat-flash- prover: Advancing native formal reasoning via agentic tool-integrated reinforcement learning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.859128Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:3a3d5f9907a3514ef72487af9ef44880872395717f67c2516ac31a37d7b8e80a","observation_id":"f4551c89-1abb-4027-8785-dfb45358be41","resolution":{"observed_at":"2026-08-01T21:40:02.859128Z","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-01T21:40:02.926195Z","title":"STP: self-play LLM theorem provers with iterative conjecturing and proving,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:02.926195Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:6b3380baa5a6ee9d1acfc53d526a7f0d04314e9b96cbae6be9991607320af678","observation_id":"f58b026f-2650-4bbb-869e-3186d320b658","resolution":{"observed_at":"2026-08-01T21:40:02.926195Z","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-01T21:40:03.016235Z","title":"Theorem prover as a judge for synthetic data generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:03.016235Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:54a191c0916119161b1bef4bde2c49b9b2b17003465c63d1e2649218139ef56c","observation_id":"b2616804-23b1-4f5e-a9b9-ddf9833e6f3c","resolution":{"observed_at":"2026-08-01T21:40:03.016235Z","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-01T21:40:03.138242Z","title":"FATE: A formal benchmark series for frontier algebra of multiple difficulty levels,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:03.138242Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:79588d8c6885f3c1300079e35bac6730dfd4e799526cb0c00c51bec86679235a","observation_id":"ac9ded12-89f3-4bcc-b569-05e98cbf118f","resolution":{"observed_at":"2026-08-01T21:40:03.138242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12433","last_updated":"2023-02-24T03:28:46Z","snapshot_observed_at":"2026-07-06T14:55:19.727805Z","submitted_at":"2023-02-24T03:28:46Z","title":"ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12433","snapshot_observed_at":"2026-08-01T21:40:03.235818Z","title":"Proofnet: Autoformalizing and formally proving undergraduate-level mathematics,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:03.235818Z"},"links":{"cited_paper":"/paper/2302.12433","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:3ade1a288b439bde26d7fc8ab213fdef9bdb074431c46b1995566790ed63d40f","observation_id":"ff0ce082-5bf7-45b2-b091-e2f4446860ed","resolution":{"observed_at":"2026-08-01T21:40:03.235818Z","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-01T21:39:58.726349Z","title":"Available: http://papers.nips.cc/paper files/paper/2022/ hash/d0c6bc641a56bebee9d985b937307367-Abstract-Conference.html","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:58.726349Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:1d180bc7ae370b712e010282d504c78596e438f05a6c165c6ccc531c6c564cdc","observation_id":"9a733f6c-4471-432a-bb81-23ec6bbd4bb5","resolution":{"observed_at":"2026-08-01T21:39:58.726349Z","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-01T21:40:00.223677Z","title":"Available: https://doi.org/10.48550/arXiv.2506.19923","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T21:40:00.223677Z"},"links":{"citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:503365f032a9240c3097ad8928b3e0afd8a9e7e0461c7cfea32add5463dbd8e7","observation_id":"6408db0c-3ddf-4606-9bea-c74f246dc710","resolution":{"observed_at":"2026-08-01T21:40:00.223677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03789","last_updated":"2026-05-30T05:07:37Z","snapshot_observed_at":"2026-07-13T12:18:08.261894Z","submitted_at":"2026-04-04T16:35:16Z","title":"Automated Conjecture Resolution with Formal Verification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.03789","snapshot_observed_at":"2026-08-01T21:39:57.604462Z","title":"Available: https://arxiv.org/abs/2604.03789","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:57.604462Z"},"links":{"cited_paper":"/paper/2604.03789","citing_paper":"/paper/2607.16372"},"observation_digest":"sha256:eea010c43c549bb74632a4a47b5c5c0600785fc69c84ce87d506ad107a0e6dc9","observation_id":"6d2f654a-3ff6-4d1f-8b46-b9bc7e6e6455","resolution":{"observed_at":"2026-08-01T21:39:57.604462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16372","last_updated":"2026-07-17T14:43:43Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-02T01:55:22.278621Z","submitted_at":"2026-07-17T14:43:43Z","title":"AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":60,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":62},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2607.16372."}