Papers › FoSR: First-order spectral rewiring for addressing oversquashing in GNNs

FoSR: First-order spectral rewiring for addressing oversquashing in GNNs

21 Oct 2022arXiv:2210.11790archive 2025-07-28

Kedar Karhadkar, Pradeep Kr. Banerjee, Guido Montúfar

Graph neural networks (GNNs) are able to leverage the structure of graph data by passing messages along the edges of the graph. While this allows GNNs to learn features depending on the graph structure, for certain graph topologies it leads to inefficient information propagation and a problem known as oversquashing. This has recently been linked with the curvature and spectral gap of the graph. On the other hand, adding edges to the message-passing graph can lead to increasingly similar node representations and a problem known as oversmoothing. We propose a computationally efficient algorithm that prevents oversquashing by systematically adding edges to the graph based on spectral expansion. We combine this with a relational architecture, which lets the GNN preserve the original graph structure and provably prevents oversmoothing. We find experimentally that our algorithm outperforms existing graph rewiring methods in several graph classification tasks.

PaperPDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2210.11790")

Code

Syntology Ran 6 of 11 code samples harvested from 2 repositories linked to this paper; 5 have no recorded run. Of those that ran: 1 ran · honoured contract; 5 ran · fixture could not drive it.

By repository: official repository: 6 samples from 1 repository, 6 ran; community (archive-listed): 5 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kedar2/FoSR officialpytorch report
harel147/REFine mentioned on GitHubpytorchMIT 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

11 samples harvested; 6 ran; 1 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
5ran · fixture could not drive it
5unverified

Licence: 6 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

_edge_rewire kedar2/FoSR/preprocessing/fosr.py official repository ran · fixture could not drive it no licence file found · pointer only · 8da3844af3011078 · report
add_edge kedar2/FoSR/preprocessing/fosr.py official repository ran · fixture could not drive it fingerprinted no licence file found · pointer only · 8253415b0d9f44f0 · report
adj_matrix_multiply kedar2/FoSR/preprocessing/fosr.py official repository ran · fixture could not drive it no licence file found · pointer only · 4240dff02339db3f · report
choose_edge_to_add kedar2/FoSR/preprocessing/fosr.py official repository ran · honoured contract no licence file found · pointer only · 063fa9897760a77f · report
compute_degrees kedar2/FoSR/preprocessing/fosr.py official repository ran · fixture could not drive it no licence file found · pointer only · 64f9409122eaca34 · report
edge_rewire kedar2/FoSR/preprocessing/fosr.py official repository ran · fixture could not drive it no licence file found · pointer only · c73dc9f34fc49fed · report
compute_kernel_data harel147/REFine/algorithms/refine/REFine.py community (archive-listed) unverified MIT (permissive) · 511ae6a831d944f3 · report
cut_graph_by_cutoff harel147/REFine/algorithms/borf/util.py community (archive-listed) unverified MIT (permissive) · ea8c61a8a9111315 · report
kernel_to_edge_index_and_edge_weight harel147/REFine/algorithms/refine/REFine.py community (archive-listed) unverified MIT (permissive) · ee0c1b3c7efe196a · report
print_max_min_cluster_sizes harel147/REFine/algorithms/utils.py community (archive-listed) unverified MIT (permissive) · f882e1c03fbe1140 · report
symmetric_normalize_tensor harel147/REFine/algorithms/refine/REFine.py community (archive-listed) unverified MIT (permissive) · 94b99f56c5136410 · report

Tasks

Graph Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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