Hugging Face Trending Papers

Grounded verification of chemical and materials reasoning: detection is the bottleneck

Read the original on Hugging Face Trending Papers →

Large language models confabulate chemical objects (molecular formulas, space groups, formation energies) in fluent reasoning traces, concentrated on long-tail entities where confidence is least trustworthy. Deterministic, database-grounded verification can catch and repair such errors without the coverage cost of blanket retrieval; the binding constraint, we find, is detection, not repair.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Hugging Face Trending Papers.

arXiv Computation and Language
3d ago

CORE: Conflict-Oriented Reasoning Elimination for Verifiable Language-Model Search

CORE is a search controller that uses a verifier to obtain a certified conflict core, backjumps to the latest decision in that core, and caches the conflict to prevent repetition. In experiments on 2,000 graph‑coloring instances, CORE cuts median verifier calls by up to 39.8% compared to chronological repair, and improves success rates on five reasoning tasks, achieving 75.9% with Qwen2.5‑7B‑Instruct and 84.2% with Qwen3‑8B versus 72.5% and 81.8% for Tree of Thoughts. The approach also reduces verifier calls and generated tokens on both language‑model backbones.

By Siyu Song, Rui Xu, Jia Lin, Kai Liu, Weifang Wang