7 of 8 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 3 have no contract verdict; 3 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/2002.04784.json · badge: /api/ran/2002.04784.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 |
|---|---|---|
| chisam0217/Graph-Universal-Attack | canonical (classifier label) classifier basis: census |
7 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| add_perturb | Ran ran on a synthesized input |
chisam0217/Graph-Universal-Attack/GUA/eval_baseline.py code served (permissive licence) · get_code("dcd84f5838668f17") 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 ndarray, ndim 2, dtype family float, shape (4, 4) 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.
|
| alias_draw | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
chisam0217/Graph-Universal-Attack/node2vec/graph.py code served (permissive licence) · get_code("5d8936cd49426f76") 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 int64, ndim 0, dtype family int, 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.
|
| count_words | Ran ran on a synthesized input |
chisam0217/Graph-Universal-Attack/deepwalk/evaluate_deepwalk.py code served (permissive licence) · get_code("b30d29f66472e711") 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 Counter. The image it ran in was not recorded. If your copy returns the same type 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.
|
| encode_onehot | Ran ran; our contract draft was wrong, not the code |
chisam0217/Graph-Universal-Attack/GUA/utils.py code served (permissive licence) · get_code("3ab88254add4c192") 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 ndarray, ndim 2, dtype family int, shape (6, 3) 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.
|
| largest_connected_components | Ran ran, honoured the contract we drafted |
chisam0217/Graph-Universal-Attack/GUA/utils.py code served (permissive licence) · get_code("11c8a4ad13f75fe4") 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 int; 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.
|
| load_npz | Ran ran on a synthesized input |
chisam0217/Graph-Universal-Attack/GUA/utils.py code served (permissive licence) · get_code("4d18cf730d25baa5") 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 tuple. The image it ran in was not recorded. If your copy returns the same type 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.
|
| sparse2graph | Ran ran; our contract draft was wrong, not the code |
chisam0217/Graph-Universal-Attack/deepwalk/evaluate_deepwalk.py code served (permissive licence) · get_code("15e201038d5175ee") 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 dict. The image it ran in was not recorded. If your copy returns the same type 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.
|
| alias_setup | Not yet run unverified (harvested, no recorded run) |
chisam0217/Graph-Universal-Attack/node2vec/graph.py code served (permissive licence) · get_code("b097b719cf49daca") How it ranno invocation recorded. |
Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 8 distinct functions with an identity, 6 are also present in other papers whose code we hold (6 with at least one paper dated earlier, 2 the same month, 4 later) and 2 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 |
|---|---|---|---|
| encode_onehot | 12 other papers 3 dated earlier, 9 later |
1609.02907 (2016-09) Semi-Supervised Classification with Graph Convolutional Networks |
1710.10903 (2017-10) Graph Attention Networks 1803.03735 (2018-03) Attention-based Graph Neural Network for Semi-supervised Learning and 9 more not named here |
| largest_connected_components | 6 other papers 3 dated earlier, 3 later |
1803.00816 (2018-03) NetGAN: Generating Graphs via Random Walks |
1805.07984 (2018-05) Adversarial Attacks on Neural Networks for Graph Data 1902.08412 (2019-02) Adversarial Attacks on Graph Neural Networks via Meta Learning and 3 more not named here |
| alias_setup | 5 other papers 3 dated earlier, 1 the same month, 1 later |
1607.00653 (2016-07) node2vec: Scalable Feature Learning for Networks |
1911.02613 (2019-11) Hyper-SAGNN: a self-attention based graph neural network for hypergraphs 1911.08415 (2019-11) GMAN: A Graph Multi-Attention Network for Traffic Prediction and 2 more not named here |
| alias_draw | 4 other papers 2 dated earlier, 1 the same month, 1 later |
1607.00653 (2016-07) node2vec: Scalable Feature Learning for Networks |
1911.08415 (2019-11) GMAN: A Graph Multi-Attention Network for Traffic Prediction 2002.05257 (2020-02) Shortest path distance approximation using deep learning techniques and 1 more not named here |
| load_npz | 1 other paper 1 dated earlier |
1902.08412 (2019-02) Adversarial Attacks on Graph Neural Networks via Meta Learning |
|
| sparse2graph | 1 other paper 1 dated earlier |
1403.6652 (2014-03) DeepWalk: Online Learning of Social Representations |
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.
Deep neural networks, while generalize well, are known to be sensitive to small adversarial perturbations. This phenomenon poses severe security threat and calls for in-depth investigation of the robustness of deep learning models. With the emergence of neural networks for graph structured data, similar investigations are urged to understand their robustness. It has been found that adversarially perturbing the graph structure and/or node features may result in a significant degradation of the model performance. In this work, we show from a different angle that such fragility similarly occurs if the graph contains a few bad-actor nodes, which compromise a trained graph neural network through flipping the connections to any targeted victim. Worse, the bad actors found for one graph model severely compromise other models as well. We call the bad actors ``anchor nodes'' and propose an algorithm, named GUA, to identify them. Thorough empirical investigations suggest an interesting finding that the anchor nodes often belong to the same class; and they also corroborate the intuitive trade-off between the number of anchor nodes and the attack success rate. For the dataset Cora which contains 2708 nodes, as few as six anchor nodes will result in an attack success rate higher than 80\% for GCN and other three models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.04784")
get_code_for_paper("2002.04784")
have("2002.04784")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.04784.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.04784)
Connect an agent — have() is free.