Reproduce “Lean Graph Search for Formal Theorem Proving” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Yihan Xu, Jia-Chen Gu, Junyi Zhang, Di Wu, Haikang Deng, Po-Nien Kung, Kai-Wei Chang, Amit Sahai and 2 more
LeanGraphSearch retrieves relevant declarations for Lean theorem proving by combining semantic search with query-conditioned traversal of formal dependency links, then reranking candidates against the query. On a MathlibQR subset, standard-mode retrieval places the target within its first 100 results for 94.7% of queries, versus 82.7% for LeanSearch v2. These results concern retrieval in Lean 4 and Mathlib, not proof completion.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.