Matlas introduces a semantic retrieval system over 8.07 million mathematical statements from papers and textbooks, using dependency graphs and topological unfolding for self-contained search via natural language queries.
Lower bounds for multivariate independence polynomials and their generalisa- tions
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
extension 1
citation-polarity summary
years
2026 5representative citing papers
Rethlas+Archon automatically construct and Lean-verify a counterexample showing weak quasi-completeness does not imply quasi-completeness for Noetherian local rings.
Danus uses a main planner, parallel workers, and a shared verified fact graph to construct long research-level mathematical proofs across six case studies.
LLM formal provers must shift from competition solvers to research agents that handle open-ended, under-specified frontier mathematics under machine-checked rigor.
New degree-sequence lower bounds on hard-core independent set sizes via multivariate local occupancy and spectral analysis.
citing papers explorer
-
Matlas: A Semantic Search Engine for Mathematics
Matlas introduces a semantic retrieval system over 8.07 million mathematical statements from papers and textbooks, using dependency graphs and topological unfolding for self-contained search via natural language queries.
-
Automated Conjecture Resolution with Formal Verification
Rethlas+Archon automatically construct and Lean-verify a counterexample showing weak quasi-completeness does not imply quasi-completeness for Noetherian local rings.
-
Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory
Danus uses a main planner, parallel workers, and a shared verified fact graph to construct long research-level mathematical proofs across six case studies.
-
From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier
LLM formal provers must shift from competition solvers to research agents that handle open-ended, under-specified frontier mathematics under machine-checked rigor.
-
Degree-sequence bounds for independent sets via multivariate local occupancy
New degree-sequence lower bounds on hard-core independent set sizes via multivariate local occupancy and spectral analysis.