Pith. sign in

REVIEW 1 cited by

A Decision-Based Heterogenous Graph Attention Network for Multi-Class Fake News Detection

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 2501.03290 v1 pith:3VRKADHA submitted 2025-01-06 cs.LG cs.AIcs.SI

classification cs.LGcs.AIcs.SI
keywords newsfakedetectiondhgatgraphnetworknodeneighborhood
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A promising tool for addressing fake news detection is Graph Neural Networks (GNNs). However, most existing GNN-based methods rely on binary classification, categorizing news as either real or fake. Additionally, traditional GNN models use a static neighborhood for each node, making them susceptible to issues like over-squashing. In this paper, we introduce a novel model named Decision-based Heterogeneous Graph Attention Network (DHGAT) for fake news detection in a semi-supervised setting. DHGAT effectively addresses the limitations of traditional GNNs by dynamically optimizing and selecting the neighborhood type for each node in every layer. It represents news data as a heterogeneous graph where nodes (news items) are connected by various types of edges. The architecture of DHGAT consists of a decision network that determines the optimal neighborhood type and a representation network that updates node embeddings based on this selection. As a result, each node learns an optimal and task-specific computational graph, enhancing both the accuracy and efficiency of the fake news detection process. We evaluate DHGAT on the LIAR dataset, a large and challenging dataset for multi-class fake news detection, which includes news items categorized into six classes. Our results demonstrate that DHGAT outperforms existing methods, improving accuracy by approximately 4% and showing robustness with limited labeled data.

Discussion (0). Sign in 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. CrediBench: Building Web-Scale Network Datasets for Information Integrity

    cs.SI 2025-09 reject novelty 5.0 of 10

    CrediBench presents a one-month, 1-billion-edge Common Crawl web graph with text and 11.5K expert credibility labels, while the abstract's promised 8-month dataset and 85%-accuracy classifier are absent from the paper.

Pith tools