--- title: "Ran Xin — author profile and papers — Elamur Research" description: "Ran Xin: 2 papers on Elamur Research (2025), h-index 13 — affiliations, topics, co-authors and who cites them in our library." canonical: "https://research.elamur.ai/free/en/authors/ran-xin/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/ran-xin/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Ran Xin # Ran Xin Ran Xin has 2 papers in our library, in 2025, most of them on [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Xia Xiao](https://md.research.elamur.ai/free/en/authors/xia-xiao/), [Chenguang Xi](https://md.research.elamur.ai/free/en/authors/chenguang-xi/), [Feng Chen](https://md.research.elamur.ai/free/en/authors/feng-chen/). 2 papers in our library · 2025 [OpenAlex](https://openalex.org/A5033024261) · [ORCID](https://orcid.org/0000-0002-1697-9116) · [**h-index 13**](https://openalex.org/authors/A5033024261) · [52 works](https://openalex.org/works?filter=author.id:A5033024261) · [1,399 citations](https://openalex.org/works?filter=author.id:A5033024261&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/ran-xin/#papers) · [🔗 Cited 53 times in our library](https://md.research.elamur.ai/free/en/authors/ran-xin/cited-by/) · [⭐ Paper Stars ranking: #9540](https://md.research.elamur.ai/free/en/paper-stars/page/96/#star-9540) 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=Ran+Xin) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Ran+Xin) · [dblp](https://dblp.org/search?q=Ran+Xin) · [ACL Anthology](https://aclanthology.org/search/?q=Ran+Xin) ## Affiliations [🎓**Carnegie Mellon University** Pittsburgh · United States 2019–2023 · 16 papers](https://md.research.elamur.ai/free/en/universities/carnegie-mellon-university/) · [🎓**Shanghai Maritime University** Shanghai · China 2009–2016 · 14 papers](https://ror.org/04z7qrj66) · [🎓**Tufts University** Medford · United States 2018–2020 · 5 papers](https://md.research.elamur.ai/free/en/universities/tufts-university/) · [🎓**Shanghai Jiao Tong University** Shanghai · China 2004–2006 · 2 papers](https://md.research.elamur.ai/free/en/universities/shanghai-jiao-tong-university/) 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 3 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/) 🧭 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** 2 papers](https://md.research.elamur.ai/free/en/authors/ran-xin/year/2025/) ## Papers The most cited first (OpenAlex and our library). 1. **[BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Proving](https://md.research.elamur.ai/free/en/papers/xin-2025-bfs-prover-scalable-best-first/)** *(2025 · 49 citations)* Proof search in Lean4 involves a huge space of possible tactics, so automated provers have mostly relied on MCTS and learned value (critic) models. 2. **[Scaling up Multi-Turn Off-Policy RL and Multi-Agent Tree Search for LLM Step-Provers](https://md.research.elamur.ai/free/en/papers/xin-2025-scaling-up-multi-turn-off/)** *(2025 · 7 citations)* The paper tackles two linked bottlenecks in LLM-based theorem proving for Lean4. In training, reinforcement learning tends to stall after early gains. At inference, the space of possible tactics grows explosively. The authors present BFS-Prover-V2, an open-source step-level prover that treats proving as a Markov… ## Co-authors here 9 co-authors with a page, the most papers together first. - [Xia Xiao](https://md.research.elamur.ai/free/en/authors/xia-xiao/) ×2 - [Chenguang Xi](https://md.research.elamur.ai/free/en/authors/chenguang-xi/) - [Feng Chen](https://md.research.elamur.ai/free/en/authors/feng-chen/) - [Hang Wu](https://md.research.elamur.ai/free/en/authors/hang-wu/) - [Jie Yang](https://md.research.elamur.ai/free/en/authors/jie-yang/) - [Ming Ding](https://md.research.elamur.ai/free/en/authors/ming-ding/) - [Shen Zheng](https://md.research.elamur.ai/free/en/authors/shen-zheng/) - [Yifan Sun](https://md.research.elamur.ai/free/en/authors/yifan-sun/) - [Zeyu Zheng](https://md.research.elamur.ai/free/en/authors/zeyu-zheng/) ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [Annual Meeting of the Association for Computational Linguistics (ACL)](https://md.research.elamur.ai/free/en/venues/acl/): [ACL 2025](https://md.research.elamur.ai/free/en/venues/acl/2025/) ## Cited by Papers of our library cite their works 53 times (of the 149,439 papers whose bibliographies we read); [23 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/ran-xin/cited-by/). Updated 3 November 2026