Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms
Abstract
=3em =10000 The Euler Characteristic Transform (ECT) is an efficiently-computable geometrical-topological invariant that characterizes the global shape of data. In this paper, we introduce the Local Euler Characteristic Transform ($ $), a novel extension of the ECT particularly designed to enhance expressivity and interpretability in graph representation learning. Unlike traditional graph neural networks (GNNs), which may lose critical local details through aggregation, the $ $ provides a lossless representation of local neighborhoods. This approach addresses key limitations in GNNs by preserving local structures while maintaining global interpretability. Moreover, we construct a rotation-invariant metric based on $ $s for spatial alignment of data spaces. Our method exhibits superior performance compared to standard GNNs on a variety of benchmark node-classification tasks, while also offering theoretical guarantees that demonstrate its effectiveness.
Benchmark Results
Tested on 8 datasets 32 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 best reported | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 best reported | |
| 34 | H2GCN | 0.9548
±0.0043 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) |
| 56 | GraphSAGE | 0.9508
±0.0026 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 64 | LECT_1+LECT_2 | 0.9490
±0.0060 | This paper |
| 328 | GIN | 0.9211
±0.0032 best reported | best at pub: Union Subgraph Neural Networks (AAAI 2023) |
| 390 | MLP | 0.9128
±0.0063 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | |
| 2 | GCN | 0.9160
±0.0160 | prev best: Clarify Confused Nodes via Separated Learning (2023) Improvement within reported uncertainty; not highlighted. |
| 3 | GAT | 0.9240
±0.0130 | prev best: SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning (2023) Improvement within reported uncertainty; not highlighted. |
| 8 | SAGE | 0.9351
±0.0006 | |
| 24 | LECT_1+LECT_2 | 0.9220
±0.0060 | This paper |
| 46 | GraphSAGE | 0.9120
±0.0029 best reported | best at pub: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) best today: Can TabPFN Compete with GNNs for Node Classification via Graph Tabularization? (LoG 2025) |
| 114 | H2GCN | 0.8986
±0.0022 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) |
| 282 | GIN | 0.8626
±0.0056 best reported | best at pub: Union Subgraph Neural Networks (AAAI 2023) |
| 320 | MLP | 0.8463 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GCN | 0.9302
±0.0011 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) |
| 2 | RSE + RGCN (70b) | 0.8852
±0.0019 | |
| 3 | LEMP+T | 0.8825 | |
| 9 | SAGE | 0.8771 | |
| 20 | H2GCN | 0.8660 best reported | |
| 31 | GAT | 0.8533 best reported | |
| 54 | GIN | 0.8303
±0.0021 best reported | |
| 69 | GraphSAGE | 0.8146
±0.0010 best reported | |
| 237 | MLP | 0.7469
±0.0085 | |
| 238 | Diss-l-ECT | 0.7460
±0.0050 | This paper |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 34 | MLP | 0.9230
±0.0070 | |
| 40 | H2GCN | 0.9189
±0.0393 best reported | best at pub: Global-Local Graph Neural Networks for Node-Classification (2024) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 53 | GraphSAGE | 0.9000
±0.0365 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) best today: Graph Neural Networks Need Cluster-Normalize-Activate Modules (NeurIPS 2024) |
| 189 | SAGE | 0.8269 | |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) |
| 257 | GCN | 0.7933
±0.0447 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Graph Wave Networks (WWW 2025) |
| 326 | GIN | 0.7460
±0.0080 best reported |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 | |
| 68 | H2GCN | 0.8623
±0.0471 best reported | best at pub: Design your own universe: a physics-informed agnostic method for enhancing graph neural networks (2024) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 138 | SAGE | 0.8269 | |
| 157 | GraphSAGE | 0.8196
±0.0739 best reported | best at pub: Heterophily-Aware Graph Attention Network (2023) Difference within reported uncertainty; not counted as underperformance. |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Differentiable Cluster Graph Neural Network (2024) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 201 | GIN | 0.7800
±0.0190 best reported | |
| 309 | Diss-l-ECT_1+Diss-l-ECT_2 | 0.6710
±0.0410 | This paper |
| 312 | Diss-l-ECT_2 | 0.6700
±0.0490 | This paper |
| 313 | Diss-l-ECT_1 | 0.6680
±0.0420 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 42 | MLP | 0.4026
±0.0108 | |
| 68 | GraphSAGE | 0.3899
±0.0085 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 71 | H2GCN | 0.3885
±0.0117 best reported | best at pub: ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splitting (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 135 | GCN | 0.3690 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 182 | GAT | 0.3605
±0.0035 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) |
| 266 | GIN | 0.3410
±0.0030 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) best today: What Can We Learn From MIMO Graph Convolutions? (IJCAI 2025) |
| 314 | ECT_1 | 0.3140
±0.0190 | This paper |
| 329 | ECT_1+ECT_2 | 0.3090
±0.0070 | This paper |
| 349 | ECT_2 | 0.3010
±0.0130 | This paper |
Heterophily Benchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Dir-Poly | 0.9451
±0.0022 | |
| 2 | D-CDE | 0.9387
±0.0041 | |
| 3 | LargeScaleNet | 0.9358
±0.0024 | |
| 26 | GraphSAGE | 0.9106
±0.0027 best reported | best at pub: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 64 | SAGE | 0.8574
±0.0067 | |
| 77 | GCN | 0.8272
±0.0082 best reported | best at pub: HyperAggregation: Aggregating over Graph Edges with Hypernetworks (2024) |
| 83 | GAT | 0.8145
±0.0009 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) best today: Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax (2025) |
| 84 | L-ECT_1+L-ECT_2 | 0.8110
±0.0040 | This paper |
| 129 | H2GCN | 0.6809
±0.0029 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) |
| 135 | MLP | 0.6665
±0.0047 | |
| 177 | GIN | 0.5680
±0.0100 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | UniGAP | 0.6375
±0.0110 | |
| 2 | H2GCN + HalfHop | 0.5961
±0.0100 | |
| 3 | GraphSAGE + HalfHop | 0.5897
±0.0150 | |
| 7 | H2GCN | 0.5681
±0.0090 best reported | |
| 12 | SAGE | 0.5569
±0.0023 | |
| 14 | GAT | 0.5559
±0.0027 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) |
| 15 | GraphSAGE | 0.5540
±0.0020 best reported | |
| 24 | GCN | 0.5411
±0.0034 best reported | |
| 84 | MLP | 0.5058 | |
| 88 | GIN | 0.5020
±0.0070 best reported | best today: Heterophily-informed Message Passing (TMLR 2025) |
| 97 | L-ECT_1+L-ECT_2 | 0.4980
±0.0030 | This paper |
| 99 | L-ECT_2 | 0.4960
±0.0030 | This paper |
| 116 | L-ECT_1 | 0.4840
±0.0030 | This paper |
