- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
In this paper, the authors analyze the role and the benefits of adding curvature to Graph Neural Networks (GNNs). After reviewing the related work and previous results in the literature, the manuscript proceeds to illustrate the methodology. In particular, the authors present a two-sided method. After defining an edge curvature, made of the unweighted Forman curvature and the number of cycles of each length through the edge, they investigate whether adding this information to the edge features of edge-aware GNNs (like GINE or GPS) helps learning. Moreover, they use these features to implement a new MPNN layer, RICCIMP, whose edge weights are initialized with these values. The authors test both methods in several scenarios, and their experimental section is broad, covering ZINC, LRGB, TU, node classification, planted-community recovery, and a synthetic denoising task.
Critical strengths
- The research question is relevant and the analysis is interesting. I also think that this problem is relevant to the GNN literature.
- Propositions and theorems are, as far as I checked, well posed. The proofs also seem correct.
- The experimental setting is broad, and the experiments have been conducted rigorously.
Critical weaknesses
-
The contribution is only incremental, and the relevance of the evaluated architecture is insufficiently clear. Under the manuscript's framing, it appears that the introduced Forman curvature ultimately reduces to including node degrees in the edge features (Lemma 12 acknowledges that it adds no stable separation power). Moreover, Theorem 3, although correct and carefully derived, extends known results on the expressiveness of message-passing GNNs [3, Lemma 2, Theorem 3]. The authors should clearly distinguish the specific contributions of their method from existing expressiveness results for edge-labeled MPNNs. My main concern is the methodological novelty and the practical relevance of the expressiveness results.
-
Experimental weaknesses beyond the strengths mentioned above. I acknowledge that the experiments are thoughtful and well executed. However, the reported results do not make clear whether the RICCIMP layer provides an actual benefit over the tested baselines. For example, curvature-profile GINE outperforms RICCIMP on ZINC, while the long-range ablations show no clear additional benefit from adaptive conductances. These findings make me question the actual need for the whole RICCIMP layer (which has a notably higher computational cost) and for the conductance machinery the authors introduce. In addition to the weak experimental evidence, I think the authors should also compare their methodology with well-established and widely used positional encodings. In particular, they should show how their Forman curvature labeling and RICCIMP layer compare against adding LapPE or RWPE to the MPNN baselines (see [1,2,8]), which are used to inject global and topological information into the graph; in the manuscript's current state, RWPE is only adopted for the LRGB tasks.
-
Presentation. The manuscript is really hard to follow: sentences are dense and heavily hedged, notation is overloaded (, , ), and much of the evidence supporting the main claims is relegated to the appendix, whose writing suffers from the same issues. The writing would need substantial revision before the manuscript can be considered for publication.
- [1] Dwivedi et al., Benchmarking Graph Neural Networks, JMLR 2023
- [2] Kreuzer et al., Rethinking graph transformers with spectral attention. NeurIPS 2021
- [3] Xu et al. How Powerful are Graph Neural Networks? ICLR 2019
- [4] Tönshoff, J., et al. Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark. arXiv preprint arXiv:2309.00367, 2023.
- [5] Bamberger, J. et al. On Measuring Long-Range Interactions in Graph Neural Networks. ICML, 2025.
- [6] Mathys, J. et al. LRIM: a Physics-Based Benchmark for Provably Evaluating Long-Range Capabilities in Graph Learning. ICLR, 2026.
- [7] Miglior, L. et al. Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation, ICLR 2026
- [8] Dwivedi et al., Graph Neural Networks with Learnable Structural and Positional Representations, ICLR 2022
- [9] Yan et al. Cycle Invariant Positional Encoding for Graph Representation Learning. arXiv preprint arXiv:2311.14333, 2023.
Questions for authors
- Can the authors clarify which expressiveness results are specific to RICCIMP? Theorem 3 shows that its propagation components (conductances, gates, walk filter) add no separation power w.r.t. 1-WL, and Appendix C notes that Theorem 5 does not separate RICCIMP from GSN-e. Which results hold only for RICCIMP, and which hold for any edge-aware GNN (e.g., GINE or GSN-e)?
- Could the authors compare their methods (both RICCIMP and 1–2 baselines such as GINE) with Laplacian PE, RWSE, or other cycle-based PEs (e.g., [9]), including the profile combined with RWSE? This would show whether the profile adds information beyond degree and existing encodings, helping to better position the paper's empirical novelty. I think that an extensive ablation with controlled feature selection would improve the narrative of the results and help sharpen the empirical benefits of using RICCIMP.
- Could the authors provide results on additional state-of-the-art, controllable long-range benchmarks such as LRIM [6] or ECHO [7]? Recent work [4,5] questions whether performance on LRGB alone establishes long-range modeling capability. Such an experiment would clarify whether the observed gains arise from propagating distant information and whether adaptive conductances contribute to improved propagation.