5 of 6 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; 4 failures of our instrument; 1 no recorded run), measured 2026-11-21; 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/2011.01623.json · badge: /api/ran/2011.01623.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 |
|---|---|---|
| xuChenSJTU/SAT-master-online | canonical (classifier label) classifier basis: classifier_2025 |
3 ran · 0 no recorded run |
| xuChenSJTU/SAT-master-link-prediction | reimplementation (classifier label) classifier basis: classifier_2025 |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| fts_loss_continuous | Ran ran, honoured the contract we drafted |
xuChenSJTU/SAT-master-online/NANG_main.py pointer only (licence: NONE) · get_code("22233629324ffe17") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xuChenSJTU/SAT-master-online when it was checked. 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. |
| fts_loss_discrete | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
xuChenSJTU/SAT-master-online/NANG_main.py pointer only (licence: NONE) · get_code("c736e22b6c81345d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xuChenSJTU/SAT-master-online when it was checked. 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. |
| graph_loss_func | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
xuChenSJTU/SAT-master-online/NANG_main.py pointer only (licence: NONE) · get_code("9b9a38db4701e356") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xuChenSJTU/SAT-master-online when it was checked. 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. |
| renormalize_adj | Ran ran; our contract draft was wrong, not the code |
xuChenSJTU/SAT-master-link-prediction/data/process.py pointer only (licence: NONE) · get_code("38d684548e6488e8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xuChenSJTU/SAT-master-link-prediction when it was checked. 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. |
| to_binary_bag_of_words | Ran ran; our contract draft was wrong, not the code |
xuChenSJTU/SAT-master-link-prediction/data/process.py pointer only (licence: NONE) · get_code("c1b14a7851940dca") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xuChenSJTU/SAT-master-link-prediction when it was checked. 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. |
| normalize_adj | Not yet run unverified (harvested, no recorded run) |
xuChenSJTU/SAT-master-link-prediction/data/process.py pointer only (licence: NONE) · get_code("a7bd63e06a7e21d1") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xuChenSJTU/SAT-master-link-prediction when it was checked. 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. No invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 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, 1 later) and 3 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 |
|---|---|---|---|
| to_binary_bag_of_words | 4 other papers 1 dated earlier, 3 later |
2006.16499 (2020-06) SCE: Scalable Network Embedding from Sparsest Cut |
2110.08727 (2021-10) Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation 2306.05628 (2023-06) Quantifying the Knowledge in GNNs for Reliable Distillation into MLPs and 1 more not named here |
| normalize_adj | 1 other paper 1 dated earlier |
2006.16499 (2020-06) SCE: Scalable Network Embedding from Sparsest Cut |
|
| renormalize_adj | 1 other paper 1 dated earlier |
2006.16499 (2020-06) SCE: Scalable Network Embedding from Sparsest Cut |
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graphs with complete node attributes have been widely explored recently. While in practice, there is a graph where attributes of only partial nodes could be available and those of the others might be entirely missing. This attribute-missing graph is related to numerous real-world applications and there are limited studies investigating the corresponding learning problems. Existing graph learning methods including the popular GNN cannot provide satisfied learning performance since they are not specified for attribute-missing graphs. Thereby, designing a new GNN for these graphs is a burning issue to the graph learning community. In this paper, we make a shared-latent space assumption on graphs and develop a novel distribution matching based GNN called structure-attribute transformer (SAT) for attribute-missing graphs. SAT leverages structures and attributes in a decoupled scheme and achieves the joint distribution modeling of structures and attributes by distribution matching techniques. It could not only perform the link prediction task but also the newly introduced node attribute completion task. Furthermore, practical measures are introduced to quantify the performance of node attribute completion. Extensive experiments on seven real-world datasets indicate SAT shows better performance than other methods on both link prediction and node attribute completion tasks. Codes and data are available online: https://github.com/xuChenSJTU/SAT-master-online
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.01623")
get_code_for_paper("2011.01623")
have("2011.01623")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.01623.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.01623)
Connect an agent — have() is free.