Papers › CIN++: Enhancing Topological Message Passing

CIN++: Enhancing Topological Message Passing

6 Jun 2023arXiv:2306.03561archive 2025-07-28

Lorenzo Giusti, Teodora Reu, Francesco Ceccarelli, Cristian Bodnar, Pietro Liò

Graph Neural Networks (GNNs) have demonstrated remarkable success in learning from graph-structured data. However, they face significant limitations in expressive power, struggling with long-range interactions and lacking a principled approach to modeling higher-order structures and group interactions. Cellular Isomorphism Networks (CINs) recently addressed most of these challenges with a message passing scheme based on cell complexes. Despite their advantages, CINs make use only of boundary and upper messages which do not consider a direct interaction between the rings present in the underlying complex. Accounting for these interactions might be crucial for learning representations of many real-world complex phenomena such as the dynamics of supramolecular assemblies, neural activity within the brain, and gene regulation processes. In this work, we propose CIN++, an enhancement of the topological message passing scheme introduced in CINs. Our message passing scheme accounts for the aforementioned limitations by letting the cells to receive also lower messages within each layer. By providing a more comprehensive representation of higher-order and long-range interactions, our enhanced topological message passing scheme achieves state-of-the-art results on large-scale and long-range chemistry benchmarks.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

twitter-research/cwn mentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Graph ClassificationGraph Regression

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification HIV dataset CIN++ ROC-AUC 80.63 #1 of 5 Archive leaderboard report
Graph Classification HIV dataset CIN++-small ROC-AUC 80.26 #2 of 5 Archive leaderboard report
Graph Classification MUTAG CIN++ Accuracy 94.4% #7 of 74 Archive leaderboard report
Graph Classification NCI1 CIN++ Accuracy 85.3% #11 of 69 Archive leaderboard report
Graph Classification NCI109 CIN++ Accuracy 84.5 #5 of 38 Archive leaderboard report
Graph Classification PROTEINS CIN++ Accuracy 80.5 #8 of 103 Archive leaderboard report
Graph Classification PTC CIN++ Accuracy 73.2% #8 of 37 Archive leaderboard report
Graph Classification Peptides-func CIN++-500k AP 0.6569±0.0117 #29 of 44 Archive leaderboard report
Graph Regression Peptides-struct CIN++-500k MAE 0.2523 #25 of 39 Archive leaderboard report
Graph Regression ZINC CIN++ MAE 0.074 #12 of 27 Archive leaderboard report
Graph Regression ZINC CIN++-500k MAE 0.077 #14 of 27 Archive leaderboard report
Graph Regression ZINC CIN++-small MAE 0.091 #18 of 27 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections