We introduce Lean Finder V2, a semantic search framework for Mathlib that disambiguates user queries through complementary model-level adversarial training and input-level query rewriting. Human mathe...
arXiv:2604. 18584v2 Announce Type: replace-cross Abstract: Mathematical problem solving remains a challenging test of reasoning for large language and multimodal models, yet existing benchmarks are limited in size, language coverage, and task diversity.
LeanGraphSearch is a graph‑based retrieval method for the Lean 4 theorem prover that builds a dependency graph from Mathlib’s forward dependencies and traverses it to find supporting lemmas via multi‑hop chains. By linking each declaration to its premises, propagating relevance through a graph‑ranking algorithm, and re‑ranking candidates against the original query, it improves recall by up to 12% over LeanSearch v2 on MathlibQR and increases coverage of complete annotated proof routes on MathlibMPR by up to 3.7%. When integrated into an iterative proving loop, LeanGraphSearch raises pass rates at 8, 16, and 32 reflection turns by as much as 40% compared to a vanilla prover and up to 10% compared to LeanSearch v2, demonstrating higher accuracy‑cost efficiency.
arXiv:2606. 29894v1 Announce Type: cross Abstract: As agentic AI systems tackle more complex mathematical tasks, they increasingly rely on information retrieval (IR) to search problem databases, theorem libraries, and educational resources.
Clarify-Then-Search is a benchmark that tests whether large language models can ask clarification questions to improve the usefulness of deep search results. It uses 518 real-world query pairs from Baidu, where each intent query is paired with an underspecified version. The evaluation involves a clarifier asking up to three questions, a user answerer providing only explicit information, and a rewriter generating a new query that is then searched; performance is measured by a weighted nugget-recall score.
arXiv:2609.09410v1 Announce Type: new Abstract: While autonomous agents have made significant strides in "deep research" by iteratively navigating the open web to synthesize information, real-world p...
QREF is a plug‑and‑play system that improves DeepSearch agents by refining search queries to match the current reasoning intent and filtering evidence to keep only what is relevant. The Query Refiner rewrites queries for complementary coverage across each search batch, while the Evidence Filter removes distracting retrieval results. Experiments show that QREF boosts DeepSearch performance on four benchmarks, achieving significant Pass@1 gains and dramatically reducing ineffective query batches without changing the agents’ architectures or retraining their reasoning policies.
The paper introduces Librarian Agents, a framework that trains large language models to proactively curate long-context workspaces by reorganizing raw documents into a hierarchical filesystem of synthetic files and reference links. This builder agent, optimized via reinforcement learning, aims to maximize downstream answering accuracy by anticipating future queries rather than reacting to them. Experiments show that Librarian Agents outperform leading retrieval and precomputation methods, achieving a 33‑point accuracy gain on BrowseComp‑Plus and a 31‑point improvement on BRIGHT in zero‑shot settings.
LiveMathematicianBench is a dynamic multiple‑choice benchmark for research‑level mathematical reasoning, built from recent arXiv papers published after model training cutoffs. It introduces a thirteen‑category logical taxonomy of theorem types and uses a proof‑sketch‑guided distractor pipeline to create plausible but invalid answer choices, enhancing sensitivity to genuine reasoning. Evaluation shows current large language models perform poorly, with the best model scoring 43.5% overall and only 17.6% under substitution‑resistant conditions, indicating the benchmark’s difficulty and realism.
arXiv:2608. 14221v1 Announce Type: new Abstract: Autoformalization is commonly framed as translating natural-language mathematical statements into machine-verifiable formal languages such as Lean 4.
arXiv:2607. 24850v2 Announce Type: replace-cross Abstract: Recent advances in large language models (LLMs) have enabled search agents to autonomously tackle complex tasks across extended search and reasoning horizons.
arXiv:2610.06650v2 Announce Type: replace Abstract: Wikidata is one of the largest open knowledge bases, yet answering a complex question over it still requires a SPARQL query that names the right en...