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=
11 Pith papers cite this work. Polarity classification is still indexing.
11
Pith papers citing it
hub tools
citation-role summary
background 1
citation-polarity summary
years
2026 11roles
background 1polarities
background 1representative citing papers
Cardiac Mesh Flow generates 3D+t four-chamber cardiac meshes with anatomical correspondence and volume conditioning via one-step flow matching on multi-scale deformation fields.
NodePFN pre-trains on synthetic graphs with controllable homophily and causal feature-label models to achieve 71.27 average accuracy on 23 node classification benchmarks without graph-specific training.
GPR-GAE is a novel self-supervised graph auto-encoder purifier using multiple GPR filters and multi-step recovery that delivers state-of-the-art robustness for GNNs against structural attacks as a plug-and-play module.
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.
Provides sufficient conditions for successful distillation of combinatorial optimization tasks into DP-aligned graph neural networks under the linear representation hypothesis for the source model.
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
EHRAG constructs structural hyperedges from sentence co-occurrence and semantic hyperedges from entity embedding clusters, then applies hybrid diffusion plus topic-aware PPR to retrieve top-k documents, outperforming baselines on four datasets with linear indexing cost and zero token overhead.
RADAR is a redundancy-aware, query-adaptive framework that uses conditional discrete graph diffusion to generate efficient communication topologies for multi-agent LLM systems, outperforming baselines on six benchmarks with higher accuracy and lower token use.
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.
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.
-
Cardiac Mesh Flow: One-Step Generation of 3D+t Cardiac Four-Chamber Meshes via Flow Matching
Cardiac Mesh Flow generates 3D+t four-chamber cardiac meshes with anatomical correspondence and volume conditioning via one-step flow matching on multi-scale deformation fields.
-
Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors
NodePFN pre-trains on synthetic graphs with controllable homophily and causal feature-label models to achieve 71.27 average accuracy on 23 node classification benchmarks without graph-specific training.
-
Self-supervised Adversarial Purification for Graph Neural Networks
GPR-GAE is a novel self-supervised graph auto-encoder purifier using multiple GPR filters and multi-step recovery that delivers state-of-the-art robustness for GNNs against structural attacks as a plug-and-play module.
-
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.
-
Towards Distillation Guarantees under Algorithmic Alignment for Combinatorial Optimization
Provides sufficient conditions for successful distillation of combinatorial optimization tasks into DP-aligned graph neural networks under the linear representation hypothesis for the source model.
-
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
-
EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval
EHRAG constructs structural hyperedges from sentence co-occurrence and semantic hyperedges from entity embedding clusters, then applies hybrid diffusion plus topic-aware PPR to retrieve top-k documents, outperforming baselines on four datasets with linear indexing cost and zero token overhead.
-
RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation
RADAR is a redundancy-aware, query-adaptive framework that uses conditional discrete graph diffusion to generate efficient communication topologies for multi-agent LLM systems, outperforming baselines on six benchmarks with higher accuracy and lower token use.
-
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.
- Full-Spectrum Graph Neural Networks: Expressive and Scalable