Pith. sign in

REVIEW 1 cited by

Reasoning Over Semantic-Level Graph for Fact Checking

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.03745 v3 pith:SVMFBCGM submitted 2019-09-09 cs.CL cs.AI

classification cs.CLcs.AI
keywords evidencegraphcheckingfactreasoningstructureaccuracyclaim
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Fact checking is a challenging task because verifying the truthfulness of a claim requires reasoning about multiple retrievable evidence. In this work, we present a method suitable for reasoning about the semantic-level structure of evidence. Unlike most previous works, which typically represent evidence sentences with either string concatenation or fusing the features of isolated evidence sentences, our approach operates on rich semantic structures of evidence obtained by semantic role labeling. We propose two mechanisms to exploit the structure of evidence while leveraging the advances of pre-trained models like BERT, GPT or XLNet. Specifically, using XLNet as the backbone, we first utilize the graph structure to re-define the relative distances of words, with the intuition that semantically related words should have short distances. Then, we adopt graph convolutional network and graph attention network to propagate and aggregate information from neighboring nodes on the graph. We evaluate our system on FEVER, a benchmark dataset for fact checking, and find that rich structural information is helpful and both our graph-based mechanisms improve the accuracy. Our model is the state-of-the-art system in terms of both official evaluation metrics, namely claim verification accuracy and FEVER score.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Top Ten Challenges Towards Agentic Neural Graph Databases

    cs.AI 2025-01 unverdicted novelty 3.0 of 10

    Agentic Neural Graph Databases are proposed as graph databases with autonomous query construction, neural query execution, and continuous learning, with ten open challenges listed.

Pith tools