Network Information Enhances Unreliable News Domain Detection
Raphaela Keßler, Roman David Ventzke, Viola Priesemann, Giordano De Marzo
Abstract
Content-based detection of unreliable news is increasingly difficult, as low-reliability sources mimic credible journalism and generative AI makes fabricated content harder to flag. We ask whether network structure can improve news reliability classification, taking a domain-level approach that shifts the focus from individual articles to source reliability. From URL-sharing patterns in Telegram chats, we build a statistically validated domain co-sharing network and find assortative mixing by reliability: low-reliability domains group together, as do reliable ones. Exploiting this structure, we compare Graph Neural Networks against network-unaware baselines using both content-aware features (multilingual text embeddings) and content-agnostic features (spreading dynamics). GNNs consistently outperform Multi-Layer Perceptrons on identical features, with GraphSAGE best in both settings (accuracy 0.63 with content, 0.53 without), a 13-14% relative gain over the network-unaware baseline. Network topology thus systematically improves domain reliability assessment, and remains effective even when content analysis is infeasible.
Create a lesson
Related papers
The Local-to-Global AD-k Conjecture is Resolved
Wei Chen
Improved Methods for k-core Community Search
Ian Chen, Haotian Yi, Arun Sharma et al.
Graphlets as structural fingerprints of complex networks
Anna Pidnebesna, David Hartman, Aneta Pokorna et al.
WCCS: Efficient Wedge Conductance Community Search over Large Temporal Bipartite Graphs (Full Paper)
Longlong Lin, Wei Chen, Pingpeng Yuan et al.
Inferring Temporal Dependencies from Social Time Series with the Cross-Correlogram
Bridget Smart, Renaud Lambiotte, Takaaki Aoki et al.
On the Expressive Power of Implicit Line-Graph Higher-Order Weisfeiler--Leman
Fan Yang