Papers › PANDA: Expanded Width-Aware Message Passing Beyond Rewiring

PANDA: Expanded Width-Aware Message Passing Beyond Rewiring

6 Jun 2024arXiv:2406.03671archive 2025-07-28

Jeongwhan Choi, Sumin Park, Hyowon Wi, Sung-Bae Cho, Noseong Park

Recent research in the field of graph neural network (GNN) has identified a critical issue known as "over-squashing," resulting from the bottleneck phenomenon in graph structures, which impedes the propagation of long-range information. Prior works have proposed a variety of graph rewiring concepts that aim at optimizing the spatial or spectral properties of graphs to promote the signal propagation. However, such approaches inevitably deteriorate the original graph topology, which may lead to a distortion of information flow. To address this, we introduce an expanded width-aware (PANDA) message passing, a new message passing paradigm where nodes with high centrality, a potential source of over-squashing, are selectively expanded in width to encapsulate the growing influx of signals from distant nodes. Experimental results show that our method outperforms existing rewiring methods, suggesting that selectively expanding the hidden state of nodes can be a compelling alternative to graph rewiring for addressing the over-squashing.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 9 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 3 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 9 samples from 1 repository, 7 ran (3 with no instrument failure; 4 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

jeongwhanchoi/panda officialmentioned in papermentioned on GitHubpytorchMITSyntology: 9 samples, 7 ran (4 instrument-failed) · 2 unverified 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

9 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · honoured contract
1ran · violated contract
1ran · our draft was wrong
3ran; the contract check could not run
2unverified

Licence: 3 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. For 3 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from jeongwhanchoi/panda. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

jeongwhanchoi/panda official repository 9 samples, 7 ran (4 instrument-failed) · 2 unverified
add_edge in 5 papers preprocessing/fosr.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant MIT (permissive) here; the stored copy is pointer only · 8253415b0d9f44f0 · report fixture: signature edge_index:ndarray/2/int, u:int/0/int, v:int/0/int · returned ndarray · level recorded 2026-09-22
choose_edge_to_add preprocessing/fosr.py ran · honoured contract MIT (permissive) here; the stored copy is pointer only · 063fa9897760a77f · report fixture: signature x:ndarray/1/float, edge_index:ndarray/2/int, degrees:ndarray/1/float · returned tuple · level recorded 2026-09-22
compute_degrees preprocessing/fosr.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant MIT (permissive) here; the stored copy is pointer only · 64f9409122eaca34 · report fixture: signature edge_index:ndarray/2/int, num_nodes:int/0/int · returned ndarray · level recorded 2026-09-22
dirichlet_energy in 6 papers measure_smoothing.py ran; the contract check could not run (RAISES) MIT (permissive) · 2aa246a3970f8113 · report fixture: signature X:ndarray/2/float, edge_index:tuple/1/ndarray · returned float · level recorded 2026-09-24
get_adj_matrix preprocessing/digl.py ran · honoured contract MIT (permissive) · 522df9dc671b43ec · report fixture: signature dataset:SimpleDataset/0/? · returned ndarray · level recorded 2026-09-24
get_ppr_matrix preprocessing/digl.py ran · violated contract fingerprinted MIT (permissive) · 60f2d5a22cd623c3 · report fixture: signature adj_matrix:ndarray/2/float, alpha:float/0/float · returned ndarray · level recorded 2026-09-24
load_centrality preprocessing/panda.py ran · our draft was wrong fingerprinted MIT (permissive) · 55fec0a00b6ca04c · report fixture: signature filename:str/0/str · returned dict · level recorded 2026-09-24
dirichlet_normalized measure_smoothing.py unverified MIT (permissive) · 57e036a3b1857000 · report
get_top_k_matrix preprocessing/digl.py unverified MIT (permissive) · 685534c936bc9f51 · report

Tasks

Graph ClassificationGraph Neural NetworkGraph RegressionNode Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification COLLAB R-GIN + PANDA Accuracy 77.8% #21 of 39 Archive leaderboard report
Graph Classification COLLAB GIN + PANDA Accuracy 75.11% #25 of 39 Archive leaderboard report
Graph Classification COLLAB R-GCN + PANDA Accuracy 71.4% #31 of 39 Archive leaderboard report
Graph Classification COLLAB GCN + PANDA Accuracy 68.4% #34 of 39 Archive leaderboard report
Graph Classification ENZYMES R-GIN + PANDA Accuracy 53.1 #39 of 54 Archive leaderboard report
Graph Classification ENZYMES GIN + PANDA Accuracy 46.2 #44 of 54 Archive leaderboard report
Graph Classification ENZYMES R-GCN + PANDA Accuracy 43.9 #46 of 54 Archive leaderboard report
Graph Classification ENZYMES GCN + PANDA Accuracy 31.55 #50 of 54 Archive leaderboard report
Graph Classification IMDB-BINARY GIN + PANDA Accuracy 72.56 #2 of 8 Archive leaderboard report
Graph Classification IMDB-BINARY R-GIN + PANDA Accuracy 72.09 #3 of 8 Archive leaderboard report
Graph Classification IMDB-BINARY R-GCN + PANDA Accuracy 66.79 #7 of 8 Archive leaderboard report
Graph Classification IMDB-BINARY GCN + PANDA Accuracy 63.76 #8 of 8 Archive leaderboard report
Graph Classification MUTAG R-GCN + PANDA Accuracy 90.05% #23 of 74 Archive leaderboard report
Graph Classification MUTAG GIN + PANDA Accuracy 88.75% #34 of 74 Archive leaderboard report
Graph Classification MUTAG R-GIN + PANDA Accuracy 88.2% #42 of 74 Archive leaderboard report
Graph Classification MUTAG GCN + PANDA Accuracy 85.75% #60 of 74 Archive leaderboard report
Graph Classification PROTEINS R-GIN + PANDA Accuracy 76.17 #56 of 103 Archive leaderboard report
Graph Classification PROTEINS GCN + PANDA Accuracy 76 #57 of 103 Archive leaderboard report
Graph Classification PROTEINS R-GCN + PANDA Accuracy 76 #58 of 103 Archive leaderboard report
Graph Classification PROTEINS GIN + PANDA Accuracy 75.759 #60 of 103 Archive leaderboard report
Graph Classification Peptides-func GCN + PANDA AP 0.6028±0.0031 #40 of 44 Archive leaderboard report
Graph Classification REDDIT-BINARY R-GIN + PANDA Accuracy 91.36 #1 of 9 Archive leaderboard report
Graph Classification REDDIT-BINARY GIN + PANDA Accuracy 91.055 #3 of 9 Archive leaderboard report
Graph Classification REDDIT-BINARY GCN + PANDA Accuracy 80.69 #4 of 9 Archive leaderboard report
Graph Classification REDDIT-BINARY R-GCN + PANDA Accuracy 80.2 #5 of 9 Archive leaderboard report
Graph Regression Peptides-struct GCN + PANDA MAE 0.3272±0.0001 #34 of 39 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.

Methods

Graph Neural Network

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