Agent-based Automated Claim Matching with Instruction-following LLMs

Dina Pisarevskaya, Arkaitz Zubiaga
10/27/2025
cs.CLcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We present a novel agent-based approach for the automated claim matching task with instruction-following LLMs. We propose a two-step pipeline that first generates prompts with LLMs, to then perform claim matching as a binary classification task with LLMs. We demonstrate that LLM-generated prompts can outperform SOTA with human-generated prompts, and that smaller LLMs can do as well as larger ones in the generation process, allowing to save computational resources. We also demonstrate the effectiveness of using different LLMs for each step of the pipeline, i.e. using an LLM for prompt generation, and another for claim matching. Our investigation into the prompt generation process in turn reveals insights into the LLMs' understanding of claim matching.

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. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

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

Cite this paper

@article{pisarevskaya2025agentbased,
  title  = {Agent-based Automated Claim Matching with Instruction-following LLMs},
  author = {Dina Pisarevskaya and Arkaitz Zubiaga},
  year   = {2025},
  eprint = {2510.23924},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.23924v1}
}

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/2510.23924.svg)](https://codeofpaper.com/paper/2510.23924)

Discussion