Christopher Morris, Luis Müller
3 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2406.03148.json · badge: /api/ran/2406.03148.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| snap-stanford/ogb | canonical (classifier label) classifier basis: census |
2 ran · 1 no recorded run |
| luis-mueller/wl-transformers | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| evaluate | Ran ran, honoured the contract we drafted |
luis-mueller/wl-transformers/pre-training/pcqm4m.py code served (permissive licence) · get_code("da81c8bfa64e6020") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Sonnet 4.5, prompt python_fixture_v1) and returned float, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| read_binary_graph_raw | Ran ran; our contract draft was wrong, not the code |
snap-stanford/ogb/ogb/io/read_graph_raw.py code served (permissive licence) · get_code("e570d37c48e4306b") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| read_csv_graph_raw | Ran ran; our contract draft was wrong, not the code |
snap-stanford/ogb/ogb/io/read_graph_raw.py code served (permissive licence) · get_code("e8d6997fbc63d3e5") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| read_csv_heterograph_raw | Not yet run unverified (harvested, no recorded run) |
snap-stanford/ogb/ogb/io/read_graph_raw.py code served (permissive licence) · get_code("db875465b43ef0d5") How it ranno invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 0 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| read_binary_graph_raw | 1 other paper 1 dated earlier |
2403.01317 (2024-03) Less is More: Hop-Wise Graph Attention for Scalable and Generalizable Learning on Circuits |
|
| read_csv_graph_raw | 1 other paper 1 dated earlier |
2403.01317 (2024-03) Less is More: Hop-Wise Graph Attention for Scalable and Generalizable Learning on Circuits |
|
| read_csv_heterograph_raw | 1 other paper 1 dated earlier |
2403.01317 (2024-03) Less is More: Hop-Wise Graph Attention for Scalable and Generalizable Learning on Circuits |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph neural network architectures aligned with the k-dimensional Weisfeiler-Leman (k-WL) hierarchy offer theoretically well-understood expressive power. However, these architectures often fail to deliver state-of-the-art predictive performance on real-world graphs, limiting their practical utility. While recent works aligning graph transformer architectures with the k-WL hierarchy have shown promising empirical results, employing transformers for higher orders of k remains challenging due to a prohibitive runtime and memory complexity of self-attention as well as impractical architectural assumptions, such as an infeasible number of attention heads. Here, we advance the alignment of transformers with the k-WL hierarchy, showing stronger expressivity results for each k, making them more feasible in practice. In addition, we develop a theoretical framework that allows the study of established positional encodings such as Laplacian PEs and SPE. We evaluate our transformers on the large-scale PCQM4Mv2 dataset, showing competitive predictive performance with the stateof-the-art and demonstrating strong downstream performance when fine-tuning them on small-scale molecular datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.03148")
get_code_for_paper("2406.03148")
have("2406.03148")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.03148.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.03148)
Connect an agent — have() is free.