Shengjie Luo, Bohang Zhang
2 of 2 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; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 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/2301.09505.json · badge: /api/ran/2301.09505.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 |
|---|---|---|
| lsj2408/Graphormer-GD | canonical (classifier label) classifier basis not recorded on the link |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| gaussian | Ran ran, violated the contract we drafted |
lsj2408/Graphormer-GD/graphormer/models/graphormer_3d.py pointer only (licence: MIT); the stored copy get_code serves, from bowenwang77/DR-Label, is pointer only (licence: NONE) · get_code("294ba20b052bfbc7") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, lsj2408/Graphormer-GD, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| softmax_dropout | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
lsj2408/Graphormer-GD/graphormer/models/graphormer_3d.py pointer only (licence: MIT); the stored copy get_code serves, from bowenwang77/DR-Label, is pointer only (licence: NONE) · get_code("74ba23674705912e") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, lsj2408/Graphormer-GD, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 2 later) and 0 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 |
|---|---|---|---|
| gaussian | 12 other papers 2 dated earlier, 10 later |
2203.04810 (2022-03) Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets |
2210.01765 (2022-10) One Transformer Can Understand Both 2D & 3D Molecular Data 2303.02875 (2023-03) DR-Label: Improving GNN Models for Catalysis Systems by Label Deconstruction and Reconstruction and 9 more not named here |
| softmax_dropout | 3 other papers 1 dated earlier, 2 later |
2203.04810 (2022-03) Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets |
2303.02875 (2023-03) DR-Label: Improving GNN Models for Catalysis Systems by Label Deconstruction and Reconstruction 2507.00846 (2025-07) BoltzNCE: Learning Likelihoods for Boltzmann Generation with Stochastic Interpolants and Noise Contrastive Estimation |
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.
Designing expressive Graph Neural Networks (GNNs) is a central topic in learning graph-structured data. While numerous approaches have been proposed to improve GNNs in terms of the Weisfeiler-Lehman (WL) test, generally there is still a lack of deep understanding of what additional power they can systematically and provably gain. In this paper, we take a fundamentally different perspective to study the expressive power of GNNs beyond the WL test. Specifically, we introduce a novel class of expressivity metrics via graph biconnectivity and highlight their importance in both theory and practice. As biconnectivity can be easily calculated using simple algorithms that have linear computational costs, it is natural to expect that popular GNNs can learn it easily as well. However, after a thorough review of prior GNN architectures, we surprisingly find that most of them are not expressive for any of these metrics. The only exception is the ESAN framework (Bevilacqua et al., 2022), for which we give a theoretical justification of its power. We proceed to introduce a principled and more efficient approach, called the Generalized Distance Weisfeiler-Lehman (GD-WL), which is provably expressive for all biconnectivity metrics. Practically, we show GD-WL can be implemented by a Transformer-like architecture that preserves expressiveness and enjoys full parallelizability. A set of experiments on both synthetic and real datasets demonstrates that our approach can consistently outperform prior GNN architectures.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2301.09505")
get_code_for_paper("2301.09505")
have("2301.09505")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2301.09505.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2301.09505)
Connect an agent — have() is free.