{"total":11,"items":[{"citing_arxiv_id":"2605.23239","ref_index":8,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"Self-supervised Adversarial Purification for Graph Neural Networks","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:18:18+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21994","ref_index":14,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"Ex-GraphRAG: Interpretable Evidence Routing for Graph-Augmented LLMs","primary_cat":"cs.LG","submitted_at":"2026-05-21T04:43:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.20074","ref_index":23,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"Towards Distillation Guarantees under Algorithmic Alignment for Combinatorial Optimization","primary_cat":"cs.LG","submitted_at":"2026-05-19T16:28:18+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.09907","ref_index":23,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation","primary_cat":"cs.AI","submitted_at":"2026-05-11T02:50:40+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.09408","ref_index":9,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"GravityGraphSAGE: Link Prediction in Directed Attributed Graphs","primary_cat":"cs.LG","submitted_at":"2026-05-10T08:19:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"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.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"; Zheng, V . W.; and Chang, K. C.-C. 2018. A Compre- hensive Survey of Graph Embedding: Problems, Techniques, and Applications .IEEE Transactions on Knowledge & Data Engineering, 30(09): 1616-1637. Cai, L.; Li, J.; Wang, J.; and Ji, S. 2022. Line Graph Neural Networks for Link Prediction.IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(9): 5103-5113. Chen, D.; Lin, Y .; Li, W.; Li, P.; Zhou, J.; and Sun, X. 2020. Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological View.Pro- ceedings of the AAAI Conference on Artificial Intelligence, 34(04): 3438-3445. Clevert, D.-A. 2015. Fast and accurate deep network learning by exponential linear units (elus)."},{"citing_arxiv_id":"2605.05759","ref_index":20,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"Full-Spectrum Graph Neural Networks: Expressive and Scalable","primary_cat":"cs.LG","submitted_at":"2026-05-07T06:53:49+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.02617","ref_index":1,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"SCGNN: Semantic Consistency enhanced Graph Neural Network Guided by Granular-ball Computing","primary_cat":"cs.AI","submitted_at":"2026-05-04T14:09:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.01884","ref_index":49,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"Cardiac Mesh Flow: One-Step Generation of 3D+t Cardiac Four-Chamber Meshes via Flow Matching","primary_cat":"eess.IV","submitted_at":"2026-05-03T14:01:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.21094","ref_index":28,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"Spectral Embeddings Leak Graph Topology: Theory, Benchmark, and Adaptive Reconstruction","primary_cat":"cs.LG","submitted_at":"2026-04-22T21:31:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.19028","ref_index":83,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors","primary_cat":"cs.LG","submitted_at":"2026-04-21T03:23:34+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.17458","ref_index":221,"ref_count":1,"confidence":0.35,"is_internal_anchor":false,"paper_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","primary_cat":"cs.AI","submitted_at":"2026-04-19T14:18:49+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}