Trification: A Comprehensive Tree-based Strategy Planner and Structural Verification for Fact-Checking

Anab Maulana Barik, Shou Ziyi, Yang Kaiwen, Yang Qi, Shen Xin
11/29/2025
cs.AI

No confident code implementation found for this paper.

Abstract

Technological advancement allows information to be shared in just a single click, which has enabled the rapid spread of false information. This makes automated fact-checking system necessary to ensure the safety and integrity of our online media ecosystem. Previous methods have demonstrated the effectiveness of decomposing the claim into simpler sub-tasks and utilizing LLM-based multi agent system to execute them. However, those models faces two limitations: they often fail to verify every component in the claim and lack of structured framework to logically connect the results of sub-tasks for a final prediction. In this work, we propose a novel automated fact-checking framework called Trification. Our framework begins by generating a comprehensive set of verification actions to ensure complete coverage of the claim. It then structured these actions into a dependency graph to model the logical interaction between actions. Furthermore, the graph can be dynamically modified, allowing the system to adapt its verification strategy. Experimental results on two challenging benchmarks demonstrate that our framework significantly enhances fact-checking accuracy, thereby advancing current state-of-the-art in automated fact-checking system.

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{barik2025trification,
  title  = {Trification: A Comprehensive Tree-based Strategy Planner and Structural Verification for Fact-Checking},
  author = {Anab Maulana Barik and Shou Ziyi and Yang Kaiwen and Yang Qi and Shen Xin},
  year   = {2025},
  eprint = {2512.00267},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.00267v1}
}

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

Discussion