pith. sign in

AI Open , volume=

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

3 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 2 cs.SI 1

years

2026 3

verdicts

UNVERDICTED 3

roles

background 1

polarities

background 1

representative citing papers

Attention-based graph neural networks: a survey

cs.SI · 2026-05-09 · unverdicted · novelty 5.0

The survey groups attention-based GNNs into three stages—graph recurrent attention networks, graph attention networks, and graph transformers—while reviewing architectures and future directions.

Quantile-Free Uncertainty Quantification in Graph Neural Networks

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

QpiGNN provides a quantile-free dual-head architecture for GNN uncertainty quantification that directly optimizes coverage and interval width, yielding 22% higher coverage and 50% narrower intervals than baselines on 19 benchmarks with asymptotic coverage guarantees under mild assumptions.

citing papers explorer

Showing 3 of 3 citing papers.

  • ERPPO: Entropy Regularization-based Proximal Policy Optimization cs.LG · 2026-05-13 · unverdicted · none · ref 246

    ERPPO adds a DSA-based ambiguity estimator to MAPPO and switches between L1 and L2 entropy regularization to improve exploration and stability in non-stationary multi-dimensional observations.

  • Attention-based graph neural networks: a survey cs.SI · 2026-05-09 · unverdicted · none · ref 1

    The survey groups attention-based GNNs into three stages—graph recurrent attention networks, graph attention networks, and graph transformers—while reviewing architectures and future directions.

  • Quantile-Free Uncertainty Quantification in Graph Neural Networks cs.LG · 2026-05-06 · unverdicted · none · ref 35

    QpiGNN provides a quantile-free dual-head architecture for GNN uncertainty quantification that directly optimizes coverage and interval width, yielding 22% higher coverage and 50% narrower intervals than baselines on 19 benchmarks with asymptotic coverage guarantees under mild assumptions.