Papers › Topology-Informed Graph Transformer
Topology-Informed Graph Transformer
Yun Young Choi, Sun Woo Park, Minho Lee, Youngho Woo
Transformers have revolutionized performance in Natural Language Processing and Vision, paving the way for their integration with Graph Neural Networks (GNNs). One key challenge in enhancing graph transformers is strengthening the discriminative power of distinguishing isomorphisms of graphs, which plays a crucial role in boosting their predictive performances. To address this challenge, we introduce 'Topology-Informed Graph Transformer (TIGT)', a novel transformer enhancing both discriminative power in detecting graph isomorphisms and the overall performance of Graph Transformers. TIGT consists of four components: A topological positional embedding layer using non-isomorphic universal covers based on cyclic subgraphs of graphs to ensure unique graph representation: A dual-path message-passing layer to explicitly encode topological characteristics throughout the encoder layers: A global attention mechanism: And a graph information layer to recalibrate channel-wise graph features for better feature representation. TIGT outperforms previous Graph Transformers in classifying synthetic dataset aimed at distinguishing isomorphism classes of graphs. Additionally, mathematical analysis and empirical evaluations highlight our model's competitive edge over state-of-the-art Graph Transformers across various benchmark datasets.
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="2402.02005")
Code
Syntology Ran 14 of 21 code samples harvested from 2 repositories linked to this paper; 7 have no recorded run. Of those that ran: 2 ran · violated contract; 12 ran with no contract checked.
By repository: official repository: 11 samples from 1 repository, 5 ran; community (archive-listed): 10 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
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
21 samples harvested; 14 ran; 0 honoured the contract we drafted; 7 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.
Licence: 21 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 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.
60fff7c3c400d7ff · report
19925529d217754e · report
aa5486a3650902d8 · report
1bb331bf70a78136 · report
a1c29ec4fe872b3b · report
ae56bcfaae96da3c · report
3db4474abe13fdee · report
c98a702be0660ac9 · report
438635c08adfe2aa · report
40e98e1ecbf39f34 · report
d796cdea5889c847 · report
561509b199175ea9 · report
0a7d2992d05685eb · report
602913d134538363 · report
28d0813e58ab4fd5 · report
cd17080a788963f3 · report
4a5dc6b540cf0d4f · report
3c39e4ce38e253db · report
e5d90ec7d5feae99 · report
e7de63c9d9975208 · report
0252438018c7afc0 · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Graph Classification | CIFAR10 100k | TIGT | Accuracy (%) | 73.955 | #8 of 20 | Archive leaderboard | report |
| Graph Classification | MNIST | TIGT | Accuracy | 98.230±0.133 | #9 of 13 | Archive leaderboard | report |
| Graph Classification | Peptides-func | TIGT | AP | 0.6679 | #25 of 44 | Archive leaderboard | report |
| Graph Regression | PCQM4Mv2-LSC | TIGT | Validation MAE | 0.0826 | #7 of 20 | Archive leaderboard | report |
| Graph Regression | Peptides-struct | TIGT | MAE | 0.2485 | #19 of 39 | Archive leaderboard | report |
| Graph Regression | ZINC | TIGT | MAE | 0.057 | #3 of 27 | Archive leaderboard | report |
| Graph Regression | ZINC-full | TIGT | Test MAE | 0.014 | #3 of 19 | Archive leaderboard | report |
| Node Classification | CLUSTER | TIGT | Accuracy | 78.033 | #8 of 12 | Archive leaderboard | report |
| Node Classification | PATTERN | TIGT | Accuracy | 86.680 | #10 of 11 | 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
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