Papers › Recipe for a General, Powerful, Scalable Graph Transformer
Recipe for a General, Powerful, Scalable Graph Transformer
Ladislav Rampášek, Mikhail Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu, Guy Wolf, Dominique Beaini
We propose a recipe on how to build a general, powerful, scalable (GPS) graph Transformer with linear complexity and state-of-the-art results on a diverse set of benchmarks. Graph Transformers (GTs) have gained popularity in the field of graph representation learning with a variety of recent publications but they lack a common foundation about what constitutes a good positional or structural encoding, and what differentiates them. In this paper, we summarize the different types of encodings with a clearer definition and categorize them as being local, global or relative. The prior GTs are constrained to small graphs with a few hundred nodes, here we propose the first architecture with a complexity linear in the number of nodes and edges O(N+E) by decoupling the local real-edge aggregation from the fully-connected Transformer. We argue that this decoupling does not negatively affect the expressivity, with our architecture being a universal function approximator on graphs. Our GPS recipe consists of choosing 3 main ingredients: (i) positional/structural encoding, (ii) local message-passing mechanism, and (iii) global attention mechanism. We provide a modular framework GraphGPS that supports multiple types of encodings and that provides efficiency and scalability both in small and large graphs. We test our architecture on 16 benchmarks and show highly competitive results in all of them, show-casing the empirical benefits gained by the modularity and the combination of different strategies.
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):
get_harvested_code_for_paper(arxiv_id="2205.12454")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2205.12454", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2205.12454")
Code
No sample from the archive's official repository (rampasek/GraphGPS) is linked to this paper; the 21 samples below come from 1 community repository. Syntology harvested code from rampasek/GraphGPS for another paper.
rampasek/GraphGPS: Syntology's graph links these samples to Graph Convolutions Enrich the Self-Attention in Transformers! (arXiv:2312.04234; that paper's own run record: 22 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 5 violated, 4 with no contract checked; 11 where Syntology's instrument failed) · 7 unverified); nothing checks that they implement this paper's method.
Syntology 21 code samples harvested from 1 repository linked to this paper: 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.
By repository: community (archive-listed): 21 samples from 1 repository, 3 ran (1 with no instrument failure; 2 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.
No sample is linked to this paper from 3 of its repositories that Syntology harvested for other papers:
- rampasek/GraphGPS, official repository: harvested for another paper, listed under the repository
- hamed1375/exphormer, community (archive-listed): harvested for another paper, listed under the repository
- linusbao/MoSE, community (archive-listed): harvested for 2 other papers, listed under the repository
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.
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.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
21 samples harvested: 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 0 of the 21 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 graphcore/ogb-lsc-pcqm4mv2. “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.
23d181463d883ce2 · report
fixture: signature data:EagerTensor/2/float, indices:EagerTensor/2/int, num_segments:int/0/int, gather_scatter_method:str/0/str, backwards_mode:str/0/str · returned EagerTensor · level recorded 2026-09-24 734d560a1dc6e70b · report
fixture: signature data:EagerTensor/3/float, indices:EagerTensor/2/int, num_segments:int/0/int, gather_scatter_method:str/0/str · returned EagerTensor · level recorded 2026-09-24 b9465ab1ad9e2278 · report
fixture: returned EagerTensor · level recorded 2026-09-22 e2ab63adef0914be · report
971b7db74f2673f3 · report
1dbf2926681fecd6 · report
8584b125423d1de0 · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.
1 assembly on this paper: 1 harvested, 0 generated.
harvested Assembly for GRAPHGPS (graph method: GRAPHGPS). 21 bricks; individually on a fixture: 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified. The assembly has not been run end-to-end.
- GPSLayer entry · level 0 · unverified ·
6d03ea56f29b99a2 - BiasedSelfAttentionLayer model · level 0 · unverified ·
e2ab63adef0914be - FFNLayer model · level 0 · unverified ·
c84df930a004726a - GraphDropout helper · level 0 · unverified ·
1fd88eabe2bf5a70 - InteractionNetworkLayer helper · level 0 · unverified ·
971b7db74f2673f3 - gather helper · level 0 · unverified ·
df3a80c6ac89079c - GenericAggregator helper · level 0 · unverified ·
154587abcabb598b - ResnetMultiplier helper · level 0 · unverified ·
52b6ed371f4e7c09 - generate_dropout_seed helper · level 1 · ran ·
b9465ab1ad9e2278 - _gather helper · level 0 · unverified ·
401bcf859fc41772 - call_outlined_function helper · level 0 · unverified ·
8584b125423d1de0 - _scatter_max helper · level 0 · unverified ·
14e69fb09fcdefa4 - _scatter_mean helper · level 0 · unverified ·
13e732c6b1e941a0 - _scatter_mean_and_var helper · level 0 · unverified ·
1dbf2926681fecd6 - _scatter_min helper · level 1 · ran · our draft was wrong ·
23d181463d883ce2 - _scatter_softmax helper · level 0 · unverified ·
8cdb18106afd6290 - _scatter_sqrtN helper · level 0 · unverified ·
7f92923b18f2f819 - _scatter_std helper · level 0 · unverified ·
1e17cdf620f5b2c6 - _scatter_sum helper · level 1 · ran; the contract check could not run (RAISES) ·
734d560a1dc6e70b - _scatter_var helper · level 0 · unverified ·
eba3c0cda10371e3 - _scatter_count helper · level 0 · unverified ·
5dda6b2e7b928bd7
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2205.12454") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
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
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