Pith. sign in

The graph neural network model.IEEE Transactions on Neural Networks, 20(1):61–80

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

years

2026 4

roles

background 1

polarities

background 1

representative citing papers

Any-Dimensional Learning by Sampling

math.ST · 2026-07-08 · accept · novelty 7.0

Random sampling maps (with-replacement, binning, species) induce metrics that give uniform any-dimensional generalization and sketching rates for continuous functions on sequences, graphs and tensors.

Deep Arguing

cs.AI · 2026-05-11 · unverdicted · novelty 6.0

Neural networks learn to construct argumentation structures that explain classifications through support and attack relations, trained jointly with differentiable semantics and structure constraints.

Graph Hierarchical Recurrence for Long-Range Generalization

cs.LG · 2026-05-18 · unverdicted · novelty 5.0

GHR uses hierarchical recurrence on pooled graph abstractions to improve long-range dependency capture and out-of-range generalization while using far fewer parameters than existing models.

citing papers explorer

Showing 4 of 4 citing papers.

  • Any-Dimensional Learning by Sampling math.ST · 2026-07-08 · accept · none · ref 20

    Random sampling maps (with-replacement, binning, species) induce metrics that give uniform any-dimensional generalization and sketching rates for continuous functions on sequences, graphs and tensors.

  • OgBench: A Framework for Evaluating Graph Neural Networks on Omics Data cs.LG · 2026-05-15 · unverdicted · none · ref 50 · 2 links

    OgBench is the first benchmark platform for GNN graph-level prediction in the n << p omics regime and finds that common GNNs often underperform MLPs and classical baselines.

  • Deep Arguing cs.AI · 2026-05-11 · unverdicted · none · ref 45

    Neural networks learn to construct argumentation structures that explain classifications through support and attack relations, trained jointly with differentiable semantics and structure constraints.

  • Graph Hierarchical Recurrence for Long-Range Generalization cs.LG · 2026-05-18 · unverdicted · none · ref 29

    GHR uses hierarchical recurrence on pooled graph abstractions to improve long-range dependency capture and out-of-range generalization while using far fewer parameters than existing models.