arXiv (All)
open access
Towards Robust Numerical Claim Verification
Large language models (LLMs) are widely used for claim verification, yet remain brittle for numerical reasoning: even small changes in value can sharply degrade accuracy. We show that this brittleness persists in frontier LLMs, but can be mitigated through adversarial fine-tuning on numerically pert
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- MuPlon: Multi-Path Causal Optimization for Claim Verification through Controlling Confounding#1082979
- Althea: The Fact-Checking--Metalearning Tradeoff in AI-Assisted Verification#1049753
- Calibrating Small Language Models for Claim Check-Worthiness Detection#820696
- Faithful Autoformalization of Natural Language Assertions#370396
- AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification#1141603
Record · ID 1155624
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive