- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CTS-Net for learning on heterophilous graphs. The main idea is to address both geometric mismatch and the mixing of incompatible neighbor information during message passing. The model combines mixed-curvature representations, parallel transport for aligning messages across tangent spaces, and a two-track routing mechanism with separate spectral filters. The authors also provide theoretical analysis related to oversmoothing and oversquashing. Experiments on 14 node classification benchmarks show generally strong results, supported by ablation studies and scalability analysis.
Critical strengths
-
I find the connection between geometric alignment and heterophily particularly interesting. While existing geometric GNNs can represent nodes in curved spaces, they often still rely on smoothing-based aggregation. CTS-Net takes a different approach by explicitly transporting neighbor messages into the receiver's tangent space before aggregation. The use of a shared reference tangent space for subsequent spectral propagation is also a thoughtful design choice, as it keeps messages geometrically consistent across different nodes. I think this gives the paper a clear motivation beyond simply introducing non-Euclidean embeddings.
-
Another strength is how the different components work together. The routing mechanism uses local structural and geometric information to control how transported messages are distributed between smooth and contrastive tracks. Importantly, the orthogonal routing operator preserves message norms instead of simply suppressing potentially incompatible neighbors. Applying separate polynomial filters to the two tracks then allows the model to learn different spectral responses. I also appreciate that the authors provide theoretical analysis of the norm-preserving properties of transport and routing, as well as the expressive capacity of the independent filters. These details make the framework more convincing from a technical perspective.
-
Experimental results provide fairly strong support for the proposed design. CTS-Net achieves the best performance among the compared methods on 11 of the 14 benchmarks, with particularly noticeable improvements on datasets such as Texas and Squirrel. The ablation study is also informative. Removing routing leads to the largest average performance drop, while removing transport or replacing the two spectral filters with a single filter also causes clear degradation. These findings help explain why the different components matter. I also find the scalability results encouraging. On Penn94 and ogbn-arxiv, CTS-Net maintains memory usage and runtime comparable to Multi-Track despite the additional geometric operations. Together with the spectral response visualizations and oversmoothing analysis, these experiments provide useful evidence for the proposed framework.
Critical weaknesses
-
A clearer comparison with existing connection-based GNNs would help establish what is genuinely new in CTS-Net. While CUSP (Grover et al., 2025) and Multi-Track Message Passing (Pei et al., 2024) are discussed, several closely related geometric approaches receive little attention. Sheaf Neural Networks with Connection Laplacians (Barbero et al., 2022, https://proceedings.mlr.press/v196/barbero22a.html) already uses orthogonal maps to align information across neighboring nodes, which is particularly relevant to the proposed parallel transport mechanism. Neural Sheaf Diffusion (Bodnar et al., 2022, https://arxiv.org/abs/2202.04579) also studies geometry-aware propagation under heterophily, although it is only included as an experimental baseline here. More recently, Bundle Neural Network for Message Diffusion on Graphs (Bamberger et al., ICLR 2025, https://openreview.net/forum?id=scI9307PLG) and Gauge-Equivariant Graph Networks via Self-Interference Cancellation (Choi et al., ICML 2026, https://proceedings.mlr.press/v306/choi26d.html) explore related ideas involving geometric transport and graph propagation. I do not consider the combination of transport, routing, and spectral filtering a weakness by itself. However, I would like to see a more direct comparison of how CTS-Net differs from these methods, particularly in its use of mixed-curvature geometry, compatibility-aware routing, and independent spectral propagation.
-
I would like stronger evidence that geometric alignment itself is responsible for the reported improvements. The ablation results are encouraging, with average Macro-F1 dropping by around 3.2 points without transport and 2.4 points without curvature. However, removing these components also changes the model's representation space and potentially its expressive capacity, making it difficult to isolate the benefit of correcting geometric mismatch. A more direct analysis of how transport changes the compatibility of neighboring representations would help connect the experiments to the paper's central motivation. I also noticed an inconsistency worth clarifying in the curvature settings. Appendix C.3 describes the hyperbolic and spherical curvatures as learnable, yet Table 6 lists the same values of (-1, +1) for every dataset. Are these initialization values or the parameters obtained after training? Reporting the learned curvatures on a few representative datasets would provide more convincing evidence that the mixed-curvature geometry is actually adapting to different graph structures.
-
Some theoretical conclusions appear broader than what the propositions directly establish. For oversmoothing, the analysis shows that the smooth and contrastive tracks can maintain a certain degree of separation under specific assumptions. However, preserving differences between two tracks does not necessarily prevent node representations within either track from becoming indistinguishable as propagation becomes deeper. Similarly, the oversquashing analysis relies on the norm-preserving properties of parallel transport and orthogonal routing along individual propagation paths. This is useful, but it does not fully address information loss caused by aggregation, path interference, or structural bottlenecks in the graph. I think these results support particular properties of the proposed operators rather than a general guarantee against oversmoothing or oversquashing. A more careful distinction between these theoretical results and the broader empirical claims would make the analysis more convincing.
-
Figure 1 could do a better job of explaining the main idea of CTS-Net. At the moment, the architecture diagram contains many equations, symbols, and small labels, making it difficult to follow the message flow without repeatedly checking the method section. In particular, the transition from parallel transport to compatibility-aware routing, followed by the shared-reference representation and separate spectral filters, is not immediately clear. I would suggest organizing the figure around these main stages and showing more explicitly where the smooth and contrastive tracks are separated and processed. Moving some of the mathematical details into the main text would also help. Since the interaction between geometry, routing, and spectral propagation is central to the contribution, a clearer overview would make the proposed framework easier to understand.
Questions for authors
Please see Weaknesses 1–3 above. I would particularly appreciate clarification on the differences from related connection-based methods, the learned curvature values, and the scope of the theoretical results.