VeGraph decomposes complex claims into graph triplets, iteratively disambiguates ambiguous entities against a knowledge base, then verifies each triplet with an LLM and achieves competitive Macro-F1 on HoVer and FEVEROUS.
One of the hosts of the 2012 KBS Drama Awards
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Verify-in-the-Graph: Entity Disambiguation Enhancement for Complex Claim Verification with Interactive Graph Representation
VeGraph decomposes complex claims into graph triplets, iteratively disambiguates ambiguous entities against a knowledge base, then verifies each triplet with an LLM and achieves competitive Macro-F1 on HoVer and FEVEROUS.