ClaimPKG: Enhancing Claim Verification via Pseudo-Subgraph Generation with Lightweight Specialized LLM
Hoang Pham, Thanh-Do Nguyen, Khac-Hoai Nam Bui

TL;DR
ClaimPKG is a novel framework that enhances claim verification by generating pseudo-subgraphs with a lightweight LLM to effectively leverage knowledge graphs, leading to improved accuracy and zero-shot generalization.
Contribution
It introduces a lightweight LLM for pseudo-subgraph generation and an end-to-end integration with KGs, advancing claim verification methods.
Findings
Achieves 9%-12% higher accuracy than baselines on FactKG.
Demonstrates effective zero-shot transfer to unstructured datasets.
Outperforms existing methods across multiple LLM backbones.
Abstract
Integrating knowledge graphs (KGs) to enhance the reasoning capabilities of large language models (LLMs) is an emerging research challenge in claim verification. While KGs provide structured, semantically rich representations well-suited for reasoning, most existing verification methods rely on unstructured text corpora, limiting their ability to effectively leverage KGs. Additionally, despite possessing strong reasoning abilities, modern LLMs struggle with multi-step modular pipelines and reasoning over KGs without adaptation. To address these challenges, we propose ClaimPKG, an end-to-end framework that seamlessly integrates LLM reasoning with structured knowledge from KGs. Specifically, the main idea of ClaimPKG is to employ a lightweight, specialized LLM to represent the input claim as pseudo-subgraphs, guiding a dedicated subgraph retrieval module to identify relevant KG subgraphs.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Web Data Mining and Analysis · Text and Document Classification Technologies
