Calibrating Small Language Models for Claim Check-Worthiness Detection

Pratuat Amatya, V Venktesh, Vinay Setty
8/31/2026
cs.CLcs.AI

No confident code implementation found for this paper.

Abstract

Assessing claim check-worthiness is an essential first step in automated fact-checking pipelines. This work is motivated by a real deployment challenge at an early-stage startup: running large language models (LLMs) over every incoming claim is cost- and latency-prohibitive, yet smaller models sacrifice accuracy. We propose NN-PPI, a pointwise extension of Prediction-Powered Inference (PPI) that calibrates model predictions at inference time as a lightweight post-hoc layer, without re-training the underlying model. NN-PPI achieves weighted F1 gains ranging from 12% to 33.80% depending on the size and performance of the baseline model, bringing SLMs on par with larger LLMs. Beyond few-shot SLMs, NN-PPI further improves a production-deployed fine-tuned model, demonstrating that residual calibration is complementary to supervised fine-tuning. By recovering LLM-level accuracy from models that are an order of magnitude cheaper to serve, it makes accurate check-worthiness detection substantially cheaper to operate at scale. Our code and data can be found at https://anonymous.4open.science/r/arr-claim-worthiness-F237.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{amatya2026calibrating,
  title  = {Calibrating Small Language Models for Claim Check-Worthiness Detection},
  author = {Pratuat Amatya and V Venktesh and Vinay Setty},
  year   = {2026},
  eprint = {2608.30731},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2608.30731v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2608.30731.svg)](https://codeofpaper.com/paper/2608.30731)

Discussion