--- title: "Mantas Baksys — author profile and papers · Reasoning" description: "Mantas Baksys, University of Cambridge: 2 papers on Elamur Research (2022–2025), h-index 2 — affiliations, topics, co-authors and who…" canonical: "https://research.elamur.ai/free/en/authors/mantas-baksys/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/mantas-baksys/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Mantas Baksys # Mantas Baksys Mantas Baksys has 2 papers in our library, in 2022–2025, most of them on [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Haiming Wang](https://md.research.elamur.ai/free/en/authors/haiming-wang/), [Igor Babuschkin](https://md.research.elamur.ai/free/en/authors/igor-babuschkin/), [Ilya Sutskever](https://md.research.elamur.ai/free/en/authors/ilya-sutskever/). 2 papers in our library · 2022–2025 [OpenAlex](https://openalex.org/A5027957031) · [**h-index 2**](https://openalex.org/authors/A5027957031) · [9 works](https://openalex.org/works?filter=author.id:A5027957031) · [30 citations](https://openalex.org/works?filter=author.id:A5027957031&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/mantas-baksys/#papers) · [🔗 Cited 213 times in our library](https://md.research.elamur.ai/free/en/authors/mantas-baksys/cited-by/) · [1 more in our library without a page yet](#also) · [⭐ Paper Stars ranking: #6196](https://md.research.elamur.ai/free/en/paper-stars/page/62/#star-6196) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Mantas+Baksys) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Mantas+Baksys) · [dblp](https://dblp.org/search?q=Mantas+Baksys) · [ACL Anthology](https://aclanthology.org/search/?q=Mantas+Baksys) ## Affiliations [🎓**University of Cambridge** Cambridge · United Kingdom 2021–2026 · 5 papers*current*](https://md.research.elamur.ai/free/en/universities/university-of-cambridge/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 6 The field of science this work belongs to (OpenAlex fields).[Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computational Theory and Mathematics · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/computational-theory-and-mathematics/) · [Arts and Humanities · 1 work](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Language and Linguistics · 1 work](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · [Mathematics · 1 work](https://md.research.elamur.ai/free/en/shelves/mathematics/) 🧭 Topics 1 Research subjects and languages the work is about.[Reasoning · 2 works](https://md.research.elamur.ai/free/en/topics/reasoning/) ## Works by year ### 2020s [**2025** 1 paper](https://md.research.elamur.ai/free/en/authors/mantas-baksys/year/2025/) · [**2022** 1 paper](https://md.research.elamur.ai/free/en/authors/mantas-baksys/year/2022/) ## Papers The most cited first (OpenAlex and our library). 1. **[Formal Mathematics Statement Curriculum Learning](https://md.research.elamur.ai/free/en/papers/polu-2022-formal-mathematics-statement-curriculum-learning/)** *(2022 · 133 citations)* Neural theorem provers for formal mathematics lack the self-play mechanism that drives progress in two-player games. 2. **[Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning](https://md.research.elamur.ai/free/en/papers/wang-2025-kimina-prover-preview-large-formal/)** *(2025 · 92 citations)* Earlier neural theorem provers for Lean 4 usually combined a language model with explicit search, such as best-first or Monte Carlo tree search. ## All works 3 works of theirs in our library, the most cited first; 2 with a page here, the others link their original until we summarise them. 1. [**Formal Mathematics Statement Curriculum Learning arXiv:2202.01344**Stanislas Polu, Jesse Michael Han, Kunhao Zheng, et al.*2022 · 133 citations*](https://md.research.elamur.ai/free/en/papers/polu-2022-formal-mathematics-statement-curriculum-learning/) 2. [**Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning arXiv:2504.11354**Haiming Wang, Mert Unsal, Xiaohan Lin, et al.*2025 · 92 citations*](https://md.research.elamur.ai/free/en/papers/wang-2025-kimina-prover-preview-large-formal/) 3. **[Kimina Lean Server: A High-Performance Lean Server for Large-Scale Verification ↗](https://arxiv.org/abs/2504.21230) arXiv:2504.21230 · no summary yet**Marco Dos Santos et al.*2025 · 14 citations* ## Co-authors here 8 co-authors with a page, the most papers together first. - [Haiming Wang](https://md.research.elamur.ai/free/en/authors/haiming-wang/) - [Igor Babuschkin](https://md.research.elamur.ai/free/en/authors/igor-babuschkin/) - [Ilya Sutskever](https://md.research.elamur.ai/free/en/authors/ilya-sutskever/) - [Jesse Michael Han](https://md.research.elamur.ai/free/en/authors/jesse-michael-han/) - [Jianqiao Lu](https://md.research.elamur.ai/free/en/authors/jianqiao-lu/) - [Kunhao Zheng](https://md.research.elamur.ai/free/en/authors/kunhao-zheng/) - [Marco Dos Santos](https://md.research.elamur.ai/free/en/authors/marco-dos-santos/) - [Stanislas Polu](https://md.research.elamur.ai/free/en/authors/stanislas-polu/) ## Cited by Papers of our library cite their works 213 times (of the 149,439 papers whose bibliographies we read); [38 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/mantas-baksys/cited-by/). Updated 2 November 2026