Rethinking the Gold Standard: Why Discrete Curvature Fails to Fully Capture Over-squashing in GNNs?
Overview
Overall Novelty Assessment
The paper challenges the prevailing assumption that negative discrete curvature is both necessary and sufficient for detecting over-squashing in graph neural networks. It sits within the Curvature-Based Over-Squashing Characterization leaf, which contains four papers providing formal analysis of how discrete curvature measures characterize bottlenecks. This is a moderately populated research direction within the broader Theoretical Foundations and Analysis branch, suggesting active but not overcrowded investigation into the fundamental relationship between geometric properties and information flow in GNNs.
The taxonomy reveals closely related work in sibling leaves: Over-Squashing and Over-Smoothing Trade-offs examines interactions between competing failure modes, while Geometric and Topological Perspectives explores alternative embedding spaces beyond standard graphs. Neighboring branches address practical interventions—Curvature-Guided Rewiring Methods develops topology modification algorithms, and Curvature-Constrained Message Passing integrates curvature into neural architectures. The paper's theoretical focus on characterization boundaries distinguishes it from these application-oriented directions, though its proposed WAF3 measure bridges toward the rewiring and architecture branches.
Among twelve candidates examined, none clearly refute the three main contributions. The theoretical claim that negative curvature is insufficient examined two candidates without finding overlapping prior work. The MOSR metric examined ten candidates, again with no refutations detected. The WAF3 curvature measure examined zero candidates, suggesting either limited semantic overlap in the search or a genuinely novel formulation. Given the small search scope—twelve papers from a field with thirty surveyed works—these statistics indicate potential novelty but cannot rule out relevant prior work outside the top-ranked semantic matches.
The analysis covers a focused slice of the literature: top-ranked semantic neighbors plus citation expansion within a thirty-paper taxonomy. The absence of refutations across contributions suggests the work introduces fresh perspectives on curvature-based diagnostics, particularly the counterexamples demonstrating insufficiency and the WAF3 approximation algorithm. However, the limited search scope means closely related theoretical results or alternative curvature formulations may exist in venues or subfields not captured by this retrieval strategy.
Taxonomy
Research Landscape Overview
Claimed Contributions
The authors construct counterexample graphs and prove that edges can exhibit severe over-squashing while maintaining highly positive discrete curvature values across eight popular curvature definitions, demonstrating that curvature cannot fully capture all over-squashing phenomena in GNNs.
A new metric that quantifies the proportion of over-squashed edges that are not identified by curvature-based methods. Extensive experiments show that Ollivier Ricci curvature can miss over 30% of over-squashed edges, revealing significant limitations in widely-used discrete curvature measures.
A new discrete curvature definition that weights node contributions by degree to better detect over-squashed edges, achieving significantly lower MOSR values. The authors also develop a MinHash-based approximation algorithm that reduces time complexity to linear level, enabling computation on graphs with five million edges in 23.6 seconds with 133.7× speedup.
Core Task Comparisons
Comparisons with papers in the same taxonomy category
[10] Understanding over-squashing and bottlenecks on graphs via curvature PDF
[11] Oversquashing in gnns through the lens of information contraction and graph expansion PDF
[25] Curvature and over-squashing in Graph Neural Networks PDF
Contribution Analysis
Detailed comparisons for each claimed contribution
Theoretical demonstration that discrete curvature is insufficient for detecting over-squashing
The authors construct counterexample graphs and prove that edges can exhibit severe over-squashing while maintaining highly positive discrete curvature values across eight popular curvature definitions, demonstrating that curvature cannot fully capture all over-squashing phenomena in GNNs.
Missed Over-Squashing Ratio (MOSR) metric
A new metric that quantifies the proportion of over-squashed edges that are not identified by curvature-based methods. Extensive experiments show that Ollivier Ricci curvature can miss over 30% of over-squashed edges, revealing significant limitations in widely-used discrete curvature measures.
[2] Curvdrop: A ricci curvature based approach to prevent graph neural networks from over-smoothing and over-squashing PDF
[8] Over-Squashing in Graph Neural Networks: A Comprehensive survey PDF
[9] Mitigating Over-Smoothing and Over-Squashing using Augmentations of Forman-Ricci Curvature PDF
[10] Understanding over-squashing and bottlenecks on graphs via curvature PDF
[12] A Remedy for Over-Squashing in Graph Learning via Forman-Ricci Curvature based Graph-to-Hypergraph Structural Lifting PDF
[16] Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvature PDF
[20] PIORF: Physics-Informed Ollivier-Ricci Flow for Long-Range Interactions in Mesh Graph Neural Networks PDF
[22] On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networks PDF
[31] FoSR: First-order spectral rewiring for addressing oversquashing in GNNs PDF
[32] DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing PDF
Weighted Augmented Forman-3 Curvature (WAF3) with efficient approximation algorithm
A new discrete curvature definition that weights node contributions by degree to better detect over-squashed edges, achieving significantly lower MOSR values. The authors also develop a MinHash-based approximation algorithm that reduces time complexity to linear level, enabling computation on graphs with five million edges in 23.6 seconds with 133.7× speedup.