3 of 5 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, 0 violated it and 1 has no contract verdict; 2 failures of our instrument; 2 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/2010.13993.json · badge: /api/ran/2010.13993.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 |
|---|---|---|
| CUAI/CorrectAndSmooth | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| sangyx/gtrick | community (classifier label) classifier basis not recorded on the link |
1 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| random_feature | Ran ran on a synthesized input |
sangyx/gtrick/gtrick/random_feature.py code served (permissive licence) · get_code("95753adaeccb24eb") 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 Tensor, ndim 2, dtype family float, shape (2, 5) 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.
|
| test | Ran ran; our contract draft was wrong, not the code |
CUAI/CorrectAndSmooth/gen_models.py pointer only (licence: NONE) · get_code("5a209cddf7b3e52f") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CUAI/CorrectAndSmooth 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. |
| train | Ran ran; our contract draft was wrong, not the code |
CUAI/CorrectAndSmooth/gen_models.py pointer only (licence: NONE) · get_code("fac9425843013f50") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CUAI/CorrectAndSmooth 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. |
| eval | Not yet run unverified (harvested, no recorded run) |
sangyx/gtrick/benchmark/dgl/graph_pred.py code served (permissive licence) · get_code("3f05a96b5815dd82") How it ranno invocation recorded. |
| train | Not yet run unverified (harvested, no recorded run) |
sangyx/gtrick/benchmark/dgl/graph_pred.py code served (permissive licence) · get_code("4254dbfb6411b68f") How it ranno invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 4 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 |
|---|---|---|---|
| train | 1 other paper 1 later |
2208.04609 (2022-08) E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes |
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 Networks (GNNs) are the predominant technique for learning over graphs. However, there is relatively little understanding of why GNNs are successful in practice and whether they are necessary for good performance. Here, we show that for many standard transductive node classification benchmarks, we can exceed or match the performance of state-of-the-art GNNs by combining shallow models that ignore the graph structure with two simple post-processing steps that exploit correlation in the label structure: (i) an "error correlation" that spreads residual errors in training data to correct errors in test data and (ii) a "prediction correlation" that smooths the predictions on the test data. We call this overall procedure Correct and Smooth (C&S), and the post-processing steps are implemented via simple modifications to standard label propagation techniques from early graph-based semi-supervised learning methods. Our approach exceeds or nearly matches the performance of state-of-the-art GNNs on a wide variety of benchmarks, with just a small fraction of the parameters and orders of magnitude faster runtime. For instance, we exceed the best known GNN performance on the OGB-Products dataset with 137 times fewer parameters and greater than 100 times less training time. The performance of our methods highlights how directly incorporating label information into the learning algorithm (as was done in traditional techniques) yields easy and substantial performance gains. We can also incorporate our techniques into big GNN models, providing modest gains. Our code for the OGB results is at https://github.com/Chillee/CorrectAndSmooth.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2010.13993")
get_code_for_paper("2010.13993")
have("2010.13993")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2010.13993.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2010.13993)
Connect an agent — have() is free.