Pith. sign in

REVIEW 9 cited by

A Comprehensive Survey on Graph Neural Networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1901.00596 v4 pith:QORUPIWZ submitted 2019-01-03 cs.LG stat.ML

Zonghan Wu , Shirui Pan , Fengwen Chen , Guodong Long , Chengqi Zhang , Philip S. Yu This is my paper
classification cs.LGstat.ML
keywords graphnetworksneuraldatalearningmachineapplicationscomprehensive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art graph neural networks into four categories, namely recurrent graph neural networks, convolutional graph neural networks, graph autoencoders, and spatial-temporal graph neural networks. We further discuss the applications of graph neural networks across various domains and summarize the open source codes, benchmark data sets, and model evaluation of graph neural networks. Finally, we propose potential research directions in this rapidly growing field.

Discussion (0). Sign in to comment.

Forward citations

Cited by 9 Pith papers

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

  1. Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.

  2. Graph Property Inference in Small Language Models: Effects of Representation and Reasoning Strategy

    cs.LG 2026-02 conditional novelty 7.0 of 10

    Small instruction-tuned language models cannot reliably estimate graph-theoretic properties from textual encodings, though adjacency-list formats and multi-branch reasoning reduce errors relative to edge lists and sin...

  3. Designing Active Tether-Net Systems for Space Debris Capture with Graph-Learning-Aided Mixed-Combinatorial Optimization

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    A graph neural network recommends combinatorial choices for tether-net morphology, masses, thrusters, and aiming points, reducing the MCNLP to an NLP solved by PSO and yielding faster convergence than direct optimization.

  4. A Graph Neural Network Approach for Scalable Wireless Power Control

    cs.IT 2019-07 unverdicted novelty 6.0 of 10

    IGCNet learns power control policies for interference channels via graph convolutions, is proven to be a universal approximator for permutation-invariant continuous functions, and outperforms WMMSE in speed while rema...

  5. Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification

    cs.LG 2019-07 unverdicted novelty 6.0 of 10

    ML-GCN embeds nodes via GCN, generates a label matrix in the same space, and trains with relaxed skip-gram on node-label concatenations to model correlations, reporting outperformance on graph datasets.

  6. Tracking Temporal Evolution of Graphs using Non-Timestamped Data

    cs.SI 2019-07 unverdicted novelty 6.0 of 10

    Presents YoutubeGraph-Dyn, a multi-modal dynamic graph dataset from YouTube interactions with intra-day snapshots, and benchmarks clustering for community migration plus time series and RNN methods for forecasting non...

  7. Spectral-based Graph Convolutional Network for Directed Graphs

    cs.LG 2019-07 unverdicted novelty 5.0 of 10

    A spectral-based GCN for directed graphs uses redefined Laplacians to enable direct application to directed data and outperforms prior methods on semi-supervised node classification tasks.

  8. Fast Training of Sparse Graph Neural Networks on Dense Hardware

    stat.ML 2019-06 unverdicted novelty 5.0 of 10

    Techniques enable training the sparse GNN from Allamanis et al. [2018] on dense TPU hardware in 13 minutes versus a full day originally.

  9. Flow Matters: Directional and Expressive GNNs for Heterophilic Graphs

    cs.LG 2025-08 reject novelty 4.0 of 10

    A GAT model with polynomial gating (Poly) and a directed variant (Dir-Poly) report strong heterophilic node classification results, with Dir-Poly's largest gain on a single directed dataset.

Pith tools