---
title: "Who cites Solving Formal Math Problems by — 16 citing papers"
description: "16 papers of the Elamur Research library cite «Solving Formal Math Problems by Decomposition and Iterative Reflection», found in their…"
canonical: "https://research.elamur.ai/free/en/papers/zhou-2025-solving-formal-math-problems-decomposition/cited-by/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/zhou-2025-solving-formal-math-problems-decomposition/cited-by/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [Solving Formal Math Problems by Decomposition and…](https://md.research.elamur.ai/free/en/papers/zhou-2025-solving-formal-math-problems-decomposition/) / cited by

# Who cites «Solving Formal Math Problems by Decomposition and Iterative Reflection»

16 papers of our library cite it (of the 149,439 whose bibliographies we read) · 11 with a page here, the most cited first · [← back to «Solving Formal Math Problems by Decomposition and Iterative Reflection»](https://md.research.elamur.ai/free/en/papers/zhou-2025-solving-formal-math-problems-decomposition/)

1. [**Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction arXiv:2508.03613**Yong Lin, Shange Tang, Bohan Lyu, et al.*2025 · 67 citations*](https://md.research.elamur.ai/free/en/papers/lin-2025-goedel-prover-v2-scaling-formal/)
2. [**Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving arXiv:2507.23726**Luoxin Chen, Jinming Gu, Liankai Huang, et al.*2025 · 46 citations*](https://md.research.elamur.ai/free/en/papers/chen-2025-seed-prover-deep-broad-reasoning/)
3. **[Aristotle: IMO-level Automated Theorem Proving](https://md.research.elamur.ai/free/en/papers/achim-2025-aristotle-imo-level-automated-theorem/) [SuperIntelligence - Robotics - Safety & Alignment](https://md.research.elamur.ai/free/en/venues/superintelligence-robotics-safety-alignment/)**Tudor Achim, Alex Best, Alberto Bietti, et al.*2025 · 29 citations*
4. [**Hilbert: Recursively Building Formal Proofs with Informal Reasoning arXiv:2509.22819**Sumanth Varambally, Thomas Voice, Yanchao Sun, et al.*2025 · 26 citations*](https://md.research.elamur.ai/free/en/papers/varambally-2025-hilbert-recursively-building-formal-proofs/)
5. [**Seed-Prover 1.5: Mastering Undergraduate-Level Theorem Proving via Learning from Experience arXiv:2512.17260**Jiangjie Chen, Wenxiang Chen, Jiacheng Du, et al.*2025 · 19 citations*](https://md.research.elamur.ai/free/en/papers/chen-2025-seed-prover-1-5/)
6. [**Prover Agent: An Agent-Based Framework for Formal Mathematical Proofs arXiv:2506.19923**Kaito Baba, Chaoran Liu, Shuhei Kurita, et al.*2025 · 14 citations*](https://md.research.elamur.ai/free/en/papers/baba-2025-prover-agent-agent-based-framework/)
7. [**Scaling up Multi-Turn Off-Policy RL and Multi-Agent Tree Search for LLM Step-Provers arXiv:2509.06493**Ran Xin, Zeyu Zheng, Yanchen Nie, et al.*2025 · 7 citations*](https://md.research.elamur.ai/free/en/papers/xin-2025-scaling-up-multi-turn-off/)
8. [**ProofFlow: A Dependency Graph Approach to Faithful Proof Autoformalization arXiv:2510.15981**Rafael Cabral, Tuan Manh Do, Xuejun Yu, et al.*2025 · 5 citations*](https://md.research.elamur.ai/free/en/papers/cabral-2025-proofflow-dependency-graph-approach-faithful/)
9. [**StepFun-Prover Preview: Let's Think and Verify Step by Step arXiv:2507.20199**Shijie Shang, Ruosi Wan, Yue Peng, et al.*2025 · 5 citations*](https://md.research.elamur.ai/free/en/papers/shang-2025-stepfun-prover-preview-let-s/)
10. [**Intern-S1-MO: Long-horizon Reasoning Agent for Olympiad?Level Mathematical Problem Solving arXiv:2512.10739**Yuzhe Gu, Songyang Gao, Zijian Wu, et al.*2025 · 1 citation*](https://md.research.elamur.ai/free/en/papers/gu-2025-intern-s1-mo-long/)
11. **[Learning from Cognition: Enhancing RL Efficiency for LLM Reasoning via Hierarchical Metacognitive Decomposition and Refinement](https://md.research.elamur.ai/free/en/papers/sun-2026-learning-cognition-enhancing-rl-efficiency/) [Annual Meeting of the Association for Computational Linguistics (ACL)](https://md.research.elamur.ai/free/en/venues/acl/)**Zexu Sun, Yongcheng Zeng, Erxue Min, et al.*2026*

5 more papers of our library cite it; they have no page here yet.

- [← back to](https://md.research.elamur.ai/free/en/papers/zhou-2025-solving-formal-math-problems-decomposition/) — Solving Formal Math Problems by Decomposition and Iterative Reflection
