LANTERN: Illuminating Hidden Mathematical Knowledge in Language Models
Abstract
Language models can now prove theorems, but people still decide which problems to pursue. We ask whether a model's internal representations can help identify promising mathematical connections. We develop LANTERN, a fast, cost-efficient pipeline that uses a classifier over pretrained-model activations to rank candidate relations, followed by staged filtering, hypothesis generation, executable verification, and analytical checking. Applied to the On-Line Encyclopedia of Integer Sequences (OEIS), LANTERN ranked 50 million pairs among 10,000 frequently referenced sequences and produced 62 verified relations between pairs without an existing OEIS cross-reference. A content screen retained 13 relations worth presenting; nine of these are informative or insightful, including four which are entirely novel to the best of our knowledge: none appears in the OEIS or in our targeted literature search. The entire end-to-end process including classifier training, candidate ranking, filtering and verification took under 8 hours.
Community
What if the next mathematical discovery is hiding between two objects nobody thought to connect? In under 8 hours, LANTERN scanned 50M OEIS pairs, verified 62 previously unlinked relations, and found four absent from both OEIS and the targeted literature.
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- When Does Structured Knowledge Help Neural Theorem Proving? (2026)
- J-Miner: Recovering the Decision Logic of Fine-Tuned LLM Classifiers as Compact Rules (2026)
- SlopShape: Identifying AI-Generated Commercial Web Content (2026)
- HSRM: Hidden-State Reward Models for Test-Time Verification (2026)
- Detectable Only Where It Is Confounded: What Verified Duplication Counts Say About Membership Evidence in Language Models (2026)
- Linger and Lose: Knowledge Collapse in Low-Bit Language Models (2026)
- Augustinian BabyLM: What Ostensive Definition Can and Cannot Teach a Small Language Model (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Get this paper in your agent:
hf papers read 2609.32264 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper