Computer Science > Computation and Language
arXiv:2509.07968 (cs)
[Submitted on 9 Sep 2025 (v1), last revised 10 Mar 2026 (this version, v2)]
Title:SimpleQA Verified: A Reliable Factuality Benchmark to Measure Parametric Knowledge
View a PDF of the paper titled SimpleQA Verified: A Reliable Factuality Benchmark to Measure Parametric Knowledge, by Lukas Haas and 4 other authors
View PDF
HTML (experimental)
Abstract:We introduce SimpleQA Verified, a 1,000-prompt benchmark for evaluating Large Language Model (LLM) short-form factuality based on OpenAI's SimpleQA. It addresses critical limitations in OpenAI's benchmark, including noisy and incorrect labels, topical biases, and question redundancy. SimpleQA Verified was created through a rigorous multi-stage filtering process involving de-duplication, topic balancing, and source reconciliation to produce a more reliable and challenging evaluation set, alongside improvements in the autorater prompt. On this new benchmark, Gemini 2.5 Pro achieves a state-of-the-art F1-score of 55.6, outperforming other frontier models, including GPT-5. This work provides the research community with a higher-fidelity tool to track genuine progress in parametric model factuality and to mitigate hallucinations. The benchmark dataset, evaluation code, and leaderboard are available at: this https URL.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2509.07968 [cs.CL] |
| (or arXiv:2509.07968v2 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2509.07968
Focus to learn more
arXiv-issued DOI via DataCite
|
Submission history
From: Lukas Haas [view email][v1] Tue, 9 Sep 2025 17:53:58 UTC (414 KB)
[v2] Tue, 10 Mar 2026 12:28:26 UTC (410 KB)
Full-text links:
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
View a PDF of the paper titled SimpleQA Verified: A Reliable Factuality Benchmark to Measure Parametric Knowledge, by Lukas Haas and 4 other authors
References & Citations
export BibTeX citation
Loading...
Bibliographic Tools
Code, Data, Media
Demos
Related Papers
About arXivLabs
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
Links to Code Toggle
Papers with Code (What is Papers with Code?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
