Sign inGet started
Paper · arXiv

OpenFC: Learning Verification Policies towards Open-Search Fact Checking

Open-search fact checking is not merely retrieval followed by classification, but a sequential decision problem in which every query, source visit, and stopping decision reshapes the evidence available for verification. Yet existing systems often distribute these decisions across predefined pipelines or separately prompted modules rather than learning them as a unified task-specific policy. We introduce \textbf{OpenFC}, a unified verification-policy training framework that post-trains Qwen3-8B as a compact next-action controller over reasoning, evidence acquisition, and stopping. OpenFC learns this policy in two stages. \textbf{Stepwise-Calibrated Cold Start (SCCS)} uses a strong training...

AuthorsXinming Wang, Kaixiang Qiu, Yansong Lin et al.
Primary categorycs.AI
Published27 September 2026
Last updated at source27 September 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/7d9039a8-214f-4efc-83d3-fe34f5c0ebdc" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.