AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language | Paper Citation Record

Observation 5cfa695b-5cfb-4ca5-bacf-b7efdf821112 · outbound

This paper cites Generative Language Modeling for Automated Theorem Proving.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Generative Language Modeling for Automated Theorem Proving

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:55.146544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f7b884c-4942-4408-9759-120da7108a03 · outbound

This paper cites Leandojo: Theorem proving with retrieval-augmented language models,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Leandojo: Theorem proving with retrieval-augmented language models,

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:55.273521Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be1c5bd5-2cbb-4ead-8472-8cf2687cdfd2 · outbound

This paper cites Refinedc: automating the foundational verification of c code with refined ownership types,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Refinedc: automating the foundational verification of c code with refined ownership types,

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:55.441865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b219b495-a7b8-46c7-bcb6-b0316abb8b5f · outbound

This paper cites Foundational multi-modal program verifiers,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Foundational multi-modal program verifiers,

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:55.557455Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4de7b25d-23f3-4be9-b72b-091480ebace3 · outbound

This paper cites Seed-prover 1.5: Mastering undergraduate-level theorem proving via learning from experience,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Seed-prover 1.5: Mastering undergraduate-level theorem proving via learning from experience,

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:55.720025Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9475b8af-b61e-4cee-98fa-8e65e946274d · outbound

This paper cites DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:55.867810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf9885d5-3ab3-4dbc-a027-4823d01431c6 · outbound

This paper cites A minimal agent for automated theorem proving,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language A minimal agent for automated theorem proving,

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.032313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3865e349-503c-430e-b8ce-96d2f0ac4d0b · outbound

This paper cites Numina- lean-agent: An open and general agentic reasoning system for formal mathematics,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Numina- lean-agent: An open and general agentic reasoning system for formal mathematics,

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.192356Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92928635-0ad5-4d15-96b1-c844d3d96bcf · outbound

This paper cites Merlean: An agentic framework for autoformalization in quantum computation,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Merlean: An agentic framework for autoformalization in quantum computation,

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.374238Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d8e4f38-8ae2-4e4a-866a-a0fb312de8e2 · outbound

This paper cites Neural theorem proving: Generating and structuring proofs for formal verification,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Neural theorem proving: Generating and structuring proofs for formal verification,

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.444746Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 03ce4464-98ff-4a55-8de9-88ed14da89b6 · outbound

This paper cites Verisoftbench: Repository- scale formal verification benchmarks for lean,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Verisoftbench: Repository- scale formal verification benchmarks for lean,

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.536976Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8887b8a3-da33-4e05-bdcf-807c8e60b2e9 · outbound

This paper cites Aleph prover: State-of-the-art formal theorem prover,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Aleph prover: State-of-the-art formal theorem prover,

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.646106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2994e32-f775-4a91-a296-ebb16263ca6b · outbound

This paper cites Putnambench: Evaluating neural theorem-provers on the putnam mathematical competition,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Putnambench: Evaluating neural theorem-provers on the putnam mathematical competition,

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.820146Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78f4d2cb-12dc-4f2e-b299-b2e63a4c0ad7 · outbound

This paper cites William Lowell Putnam Math- ematical Competition,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language William Lowell Putnam Math- ematical Competition,

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:56.990913Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4b2b328-5ba1-4566-b49c-0833c7667d2f · outbound

This paper cites Putnambench leaderboard,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Putnambench leaderboard,

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:57.195017Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac00c2dd-0903-43b9-9987-5fa4243df9e5 · outbound

This paper cites A Minimal Agent for Automated Theorem Proving.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language A Minimal Agent for Automated Theorem Proving

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:57.333823Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3f0b6fb-e077-43ca-a3d6-3eb9acf389d4 · outbound

This paper cites Automated conjecture resolution with formal verification,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Automated conjecture resolution with formal verification,

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:57.456607Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9facd4af-421f-4715-8fb0-cfe49d2f9559 · outbound

This paper cites A minimalist proof language for neural theorem proving over Isabelle/HOL,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language A minimalist proof language for neural theorem proving over Isabelle/HOL,

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:57.740893Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c1ffffe-b00a-4ae6-8f70-203e9eab8ecf · outbound

This paper cites Coqpilot, a plugin for llm-based generation of proofs,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Coqpilot, a plugin for llm-based generation of proofs,

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:57.886776Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 591190b0-0653-4413-8da6-f865baa27fca · outbound

This paper cites AutoCorrode software verification framework for Isabelle/HOL,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language AutoCorrode software verification framework for Isabelle/HOL,

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.066916Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4137c117-d0a9-4136-a1ef-1950f75099bf · outbound

This paper cites Why Do Large Language Models (LLMs) Struggle to Count Letters?.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Why Do Large Language Models (LLMs) Struggle to Count Letters?

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.163407Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b6ef6b0-2561-47a1-aacb-2b769b207f00 · outbound

This paper cites CUTE: Measuring LLMs’ understanding of their tokens,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language CUTE: Measuring LLMs’ understanding of their tokens,

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.274300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 136f47f7-4e4e-4553-a9ef-7b592f2a1494 · outbound

This paper cites A machine-oriented logic based on the resolution principle,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language A machine-oriented logic based on the resolution principle,

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.334357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b600f51-9728-4329-abe1-e26973bfa966 · outbound

This paper cites Rewrite-based equational theorem proving with selection and simplification,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Rewrite-based equational theorem proving with selection and simplification,

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.463734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b16698c-43ac-49ab-94bd-e861ec582371 · outbound

This paper cites Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T),.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T),

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.560045Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12c27ba0-4b2d-4da4-9e03-c45a4ab100f4 · outbound

This paper cites Autoformalization with large language models,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Autoformalization with large language models,

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.654316Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89cf3669-5200-4b3c-8e8e-7e8e7909dc1e · outbound

This paper cites Draft, sketch, and prove: Guiding formal theorem provers with informal proofs,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Draft, sketch, and prove: Guiding formal theorem provers with informal proofs,

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.842549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 09521a70-3946-4214-8142-0ec5d23e1898 · outbound

This paper cites Z3: An efficient SMT solver,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Z3: An efficient SMT solver,

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.980210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 972bb5a3-2287-4f7e-bdcd-341c77dcdda1 · outbound

This paper cites cvc5: A versatile and industrial-strength SMT solver,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language cvc5: A versatile and industrial-strength SMT solver,

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:59.113242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8cebfc94-c47a-42db-8c37-11a032ce093e · outbound

This paper cites Faster, higher, stronger: E 2.3,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Faster, higher, stronger: E 2.3,

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:59.232431Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a86ec8f-c71e-40dc-b0bd-cf68f3791654 · outbound

This paper cites First-order proof tactics in higher-order logic theorem provers,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language First-order proof tactics in higher-order logic theorem provers,

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:59.303172Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 189d2191-7714-455c-941e-83d57fa84eda · outbound

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

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics,

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:59.408326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce6765e1-a797-46fc-9e1c-10df9412c12a · outbound

This paper cites Neural theorem proving for verification conditions: A real-world benchmark,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Neural theorem proving for verification conditions: A real-world benchmark,

Reference 33

Resolution: verified exact; arxiv_id, observed 2026-08-01T21:43:30.278259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 7a068534-2bd6-4487-bc10-d359750f78ad · outbound

This paper cites Prompt caching,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Prompt caching,

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:59.740462Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12752841-dada-4d51-9ab9-9f317f3fb568 · outbound

This paper cites Minilang-afp-v1,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Minilang-afp-v1,

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:59.813549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 098e298d-ddf7-492e-9e47-992f470fa516 · outbound

This paper cites An in-context learning agent for formal theorem-proving,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language An in-context learning agent for formal theorem-proving,

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:59.896160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6741f21-78d6-44b5-885c-1b46785632b4 · outbound

This paper cites Prover agent: An agent-based framework for formal mathematical proofs,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Prover agent: An agent-based framework for formal mathematical proofs,

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:00.034151Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c371a2d-7b3e-4449-b052-3acac7ed6c05 · outbound

This paper cites Archon: An Architecture Search Framework for Inference-Time Techniques.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Archon: An Architecture Search Framework for Inference-Time Techniques

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:00.428697Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08c9e873-84ea-4d96-ba4b-1573dce7b8d4 · outbound

This paper cites LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:00.572352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 238e9340-e116-4fb1-a6d1-a4c3b0b374f0 · outbound

This paper cites Abstract syntax networks for code generation and semantic parsing,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Abstract syntax networks for code generation and semantic parsing,

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:00.738980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 626e845e-b252-4f28-bf07-e78dedeb972f · outbound

This paper cites Tree-to-tree neural networks for program translation,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Tree-to-tree neural networks for program translation,

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:00.956446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15b8f2d3-ab8d-4c3d-b59e-357826c9c7e8 · outbound

This paper cites TRANX: A transition-based neural abstract syntax parser for semantic parsing and code generation,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language TRANX: A transition-based neural abstract syntax parser for semantic parsing and code generation,

Reference 42

Resolution: verified exact; doi, observed 2026-08-01T21:43:30.188119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 354f9512-baea-43f5-90b9-504e6b1368de · outbound

This paper cites Treegen: A tree-based transformer architecture for code generation,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Treegen: A tree-based transformer architecture for code generation,

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:01.280179Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e58c175b-c241-4538-9e52-7a308c0adabb · outbound

This paper cites Learning to fix build errors with graph2diff neural networks,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Learning to fix build errors with graph2diff neural networks,

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:01.428737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a0bbabe-468f-4eb9-bcff-ba43cefab759 · outbound

This paper cites Graph-based, self-supervised program repair from diagnostic feedback,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Graph-based, self-supervised program repair from diagnostic feedback,

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:01.564734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c37d57f-765e-45b6-9f1e-3bad16b3539e · outbound

This paper cites Kimi K2: Open Agentic Intelligence.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Kimi K2: Open Agentic Intelligence

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:01.752477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2651c683-6f17-4029-b722-728a5cfbb86e · outbound

This paper cites GLM-5: from Vibe Coding to Agentic Engineering.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language GLM-5: from Vibe Coding to Agentic Engineering

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:01.888205Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ebd7322-6b32-4077-8bf1-352337b03721 · outbound

This paper cites Proof by pointing,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Proof by pointing,

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.002754Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a38c60aa-f79d-4a95-8738-b88ee9e66dec · outbound

This paper cites Proofviz: An interactive visual proof ex- plorer,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Proofviz: An interactive visual proof ex- plorer,

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.081633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c8abebe-ba51-4c19-9aa2-a0fef06a0141 · outbound

This paper cites Henblocks: Structured editing for coq,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Henblocks: Structured editing for coq,

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.254362Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d242234d-48c3-436c-b207-318b6fa88a8f · outbound

This paper cites Pythagoras-Prover: Advancing Efficient Formal Proving via Augmented Lean Formalisation.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Pythagoras-Prover: Advancing Efficient Formal Proving via Augmented Lean Formalisation

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.390463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc7bbfe9-1133-4ba5-8b36-a008f1146021 · outbound

This paper cites Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction,

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.549940Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 018212f7-f213-49ca-abea-042fcf77dd7b · outbound

This paper cites Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.651495Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df7b6aa1-4065-4dab-b253-f0fa1a359dfa · outbound

This paper cites OProver: A Unified Framework for Agentic Formal Theorem Proving.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language OProver: A Unified Framework for Agentic Formal Theorem Proving

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.754266Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4551c89-1abb-4027-8785-dfb45358be41 · outbound

This paper cites Longcat-flash- prover: Advancing native formal reasoning via agentic tool-integrated reinforcement learning,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Longcat-flash- prover: Advancing native formal reasoning via agentic tool-integrated reinforcement learning,

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.859128Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f58b026f-2650-4bbb-869e-3186d320b658 · outbound

This paper cites STP: self-play LLM theorem provers with iterative conjecturing and proving,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language STP: self-play LLM theorem provers with iterative conjecturing and proving,

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:02.926195Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2616804-23b1-4f5e-a9b9-ddf9833e6f3c · outbound

This paper cites Theorem prover as a judge for synthetic data generation,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Theorem prover as a judge for synthetic data generation,

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:03.016235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac9ded12-89f3-4bcc-b569-05e98cbf118f · outbound

This paper cites FATE: A formal benchmark series for frontier algebra of multiple difficulty levels,.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language FATE: A formal benchmark series for frontier algebra of multiple difficulty levels,

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:03.138242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff0ce082-5bf7-45b2-b091-e2f4446860ed · outbound

This paper cites ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:03.235818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a733f6c-4471-432a-bb81-23ec6bbd4bb5 · outbound

This paper cites Available: http://papers.nips.cc/paper files/paper/2022/ hash/d0c6bc641a56bebee9d985b937307367-Abstract-Conference.html.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Available: http://papers.nips.cc/paper files/paper/2022/ hash/d0c6bc641a56bebee9d985b937307367-Abstract-Conference.html

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:58.726349Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6408db0c-3ddf-4606-9bea-c74f246dc710 · outbound

This paper cites Available: https://doi.org/10.48550/arXiv.2506.19923.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Available: https://doi.org/10.48550/arXiv.2506.19923

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-01T21:40:00.223677Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d2f654a-3ff6-4d1f-8b46-b9bc7e6e6455 · outbound

This paper cites Automated Conjecture Resolution with Formal Verification.

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language Automated Conjecture Resolution with Formal Verification

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-01T21:39:57.604462Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers