GravityGraphSAGE adapts GraphSAGE with a gravity-inspired decoder to outperform prior graph deep learning methods on directed link prediction across citation networks and 16 real-world graphs.
hub
International Conference on Learning Representations , year=
12 Pith papers cite this work. Polarity classification is still indexing.
12
Pith papers citing it
hub tools
citation-role summary
method 1
other 1
citation-polarity summary
years
2026 12verdicts
UNVERDICTED 12representative citing papers
GPR-GAE is a novel self-supervised graph auto-encoder using multiple Generalized PageRank filters that serves as a plug-and-play purifier achieving state-of-the-art robustness for GNNs against structural attacks.
Ex-GraphRAG replaces GNN encoders with M-GNAN for exact node-level decomposition in graph-augmented LLMs, matching black-box performance on STaRK-Prime while exposing semantic-structural mismatches that degrade multi-hop QA when low-attribution intermediaries are removed.
ST-TGExplainer disentangles stability and transition patterns in temporal graphs via a self-explainable TGNN guided by a disentangled information bottleneck objective to produce more faithful explanations.
Double metric learning learns two embeddings per node to build directed graphs with chain connections, yielding better performance than single metric learning for high-pT particles and accurate edge direction prediction in ATLAS ITk simulations.
GTLM injects graph-aware attention biases into LLMs using only 0.015% extra parameters, enabling native graph processing that matches 7B models with a 1B model on text-attributed graph benchmarks.
LUCID detects hallucinations in LLM-KG reasoning by extracting node/edge features from attention and semantics then integrating them with KG structure in a GNN, achieving SOTA on nine new benchmark datasets versus 15 baselines.
LoGraB creates fragmented graph benchmarks with controls for radius, spectral quality, noise, and coverage, while AFR reconstructs faithful graph islands from spectral patches using fidelity scoring, RANSAC-Procrustes alignment, and adaptive stitching, supported by recovery proofs and strong results
RADAR generates query-adaptive multi-agent communication structures via conditional discrete graph diffusion guided by effective graph size, outperforming baselines on accuracy and token consumption across six benchmarks.
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.
SCGNN uses granular-ball computing to partition nodes into groups, builds an anchor-based augmented graph, and fuses predictions with label-consistency supervision to improve semantic consistency in GNNs.
Linkify augments assembly graphs with corrected interface point clouds and trains GATv2 for masked part prediction, outperforming non-graph baselines on Fusion 360 data.
citing papers explorer
-
GravityGraphSAGE: Link Prediction in Directed Attributed Graphs
GravityGraphSAGE adapts GraphSAGE with a gravity-inspired decoder to outperform prior graph deep learning methods on directed link prediction across citation networks and 16 real-world graphs.
-
Self-supervised Adversarial Purification for Graph Neural Networks
GPR-GAE is a novel self-supervised graph auto-encoder using multiple Generalized PageRank filters that serves as a plug-and-play purifier achieving state-of-the-art robustness for GNNs against structural attacks.
-
Ex-GraphRAG: Interpretable Evidence Routing for Graph-Augmented LLMs
Ex-GraphRAG replaces GNN encoders with M-GNAN for exact node-level decomposition in graph-augmented LLMs, matching black-box performance on STaRK-Prime while exposing semantic-structural mismatches that degrade multi-hop QA when low-attribution intermediaries are removed.
-
ST-TGExplainer: Disentangling Stability and Transition Patterns for Temporal GNN Interpretability
ST-TGExplainer disentangles stability and transition patterns in temporal graphs via a self-explainable TGNN guided by a disentangled information bottleneck objective to produce more faithful explanations.
-
Double Metric Learning for Building Directed Graphs with Chain Connections for the ATLAS ITk Detector
Double metric learning learns two embeddings per node to build directed graphs with chain connections, yielding better performance than single metric learning for high-pT particles and accurate edge direction prediction in ATLAS ITk simulations.
-
Teaching LLMs to See Graphs: Unifying Text and Structural Reasoning
GTLM injects graph-aware attention biases into LLMs using only 0.015% extra parameters, enabling native graph processing that matches 7B models with a 1B model on text-attributed graph benchmarks.
-
Detecting Hallucinations for Large Language Model-based Knowledge Graph Reasoning
LUCID detects hallucinations in LLM-KG reasoning by extracting node/edge features from attention and semantics then integrating them with KG structure in a GNN, achieving SOTA on nine new benchmark datasets versus 15 baselines.
-
Spectral Embeddings Leak Graph Topology: Theory, Benchmark, and Adaptive Reconstruction
LoGraB creates fragmented graph benchmarks with controls for radius, spectral quality, noise, and coverage, while AFR reconstructs faithful graph islands from spectral patches using fidelity scoring, RANSAC-Procrustes alignment, and adaptive stitching, supported by recovery proofs and strong results
-
RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation
RADAR generates query-adaptive multi-agent communication structures via conditional discrete graph diffusion guided by effective graph size, outperforming baselines on accuracy and token consumption across six benchmarks.
-
Attention-based graph neural networks: a survey
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.
-
SCGNN: Semantic Consistency enhanced Graph Neural Network Guided by Granular-ball Computing
SCGNN uses granular-ball computing to partition nodes into groups, builds an anchor-based augmented graph, and fuses predictions with label-consistency supervision to improve semantic consistency in GNNs.
-
Linkify: Learning from Interface-Augmented Assembly Graphs
Linkify augments assembly graphs with corrected interface point clouds and trains GATv2 for masked part prediction, outperforming non-graph baselines on Fusion 360 data.