Abstract:

As a topological invariant for discrete structures, discrete curvature has been widely adopted in the study of complex networks and graph neural networks. A prevailing viewpoint posits that edges with highly negative curvature will induce graph bottlenecks and the over-squashing phenomenon. In this paper, we critically re-examine this view and put forward our central claim: high negative curvature is a sufficient but not a necessary condition for over-squashing. We first construct a family of counterexamples demonstrating the failure of discrete curvature, where some edges are severely squashed, but the curvature still appears positive. Furthermore, extensive experiments demonstrate that the most commonly used discrete curvature measure --- Ollivier–Ricci curvature --- fails to detect as many as 30%~40% of over-squashed edges. To alleviate this limitation, we propose Weighted Augmented Forman-3 Curvature (WAF3\mathsf{WAF3}), which significantly improves the detection of over-squashed edges. Additionally, we develop a highly efficient approximation algorithm for WAF3\mathsf{WAF3}, enabling curvature computation on graphs with five million edges in only 23.6 seconds, which is 133.7 times faster than the existing algorithm with the lowest complexity for curvatures.

Disclaimer
This report is AI-GENERATED using Large Language Models and WisPaper (A scholar search engine). It analyzes academic papers' tasks and contributions against retrieved prior work. While this system identifies POTENTIAL overlaps and novel directions, ITS COVERAGE IS NOT EXHAUSTIVE AND JUDGMENTS ARE APPROXIMATE. These results are intended to assist human reviewers and SHOULD NOT be relied upon as a definitive verdict on novelty.
NOTE that some papers exist in multiple, slightly different versions (e.g., with different titles or URLs). The system may retrieve several versions of the same underlying work. The current automated pipeline does not reliably align or distinguish these cases, so human reviewers will need to disambiguate them manually.
If you have any questions, please contact: mingzhang23@m.fudan.edu.cn

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

Core-task Taxonomy Papers
30
3
Claimed Contributions
12
Contribution Candidate Papers Compared
0
Refutable Paper

Research Landscape Overview

Core task: detecting over-squashing in graph neural networks using discrete curvature. The field has organized itself around several complementary directions. Theoretical Foundations and Analysis establishes the mathematical underpinnings, connecting discrete curvature measures to information bottlenecks and characterizing when message-passing architectures fail to propagate signals effectively. Rewiring and Structural Modification develops algorithms that adjust graph topology—adding edges or reweighting connections—to alleviate bottlenecks identified by curvature diagnostics. Curvature-Enhanced GNN Architectures and Curvature-Based Structural Encodings explore how to integrate curvature information directly into model design, either by modulating message-passing operations or by treating curvature as an auxiliary feature. Domain-Specific Applications demonstrate these ideas in contexts ranging from skeleton-based action recognition to brain network analysis, while Surveys and Comparative Studies synthesize the landscape and Related Methodologies connect curvature-based approaches to broader graph learning techniques. Within the theoretical branch, a handful of works have focused on formalizing the relationship between negative curvature and over-squashing. Curvature Bottlenecks[10] and Information Contraction Expansion[11] provide foundational analyses linking geometric properties to information flow, establishing that regions of low curvature can create severe bottlenecks. Rethinking Gold Standard[0] sits squarely in this cluster, revisiting earlier characterizations and proposing refined diagnostics for identifying problematic graph structures. Compared to Curvature Bottlenecks[10], which emphasizes worst-case bounds, Rethinking Gold Standard[0] appears to focus on practical detection criteria that balance sensitivity and computational cost. Meanwhile, works like Curvature Over-squashing[25] explore alternative curvature notions, highlighting ongoing debates about which geometric measures best predict message-passing failures. The interplay between rigorous theory and empirical validation remains a central open question across these studies.

Claimed Contributions

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.

2 retrieved papers
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.

10 retrieved papers
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.

0 retrieved papers

Core Task Comparisons

Comparisons with papers in the same taxonomy category

Contribution Analysis

Detailed comparisons for each claimed contribution

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.

Contribution

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.

Contribution

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.