6 of 12 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 5 have no contract verdict; 1 failure of our instrument; 6 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/2106.06586.json · badge: /api/ran/2106.06586.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 |
|---|---|---|
| susheels/gnns-and-local-assortativity | canonical (classifier label) classifier basis: census |
6 ran · 6 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| check_rm | Ran ran on a synthesized input |
susheels/gnns-and-local-assortativity/datasets/bgp.py code served (permissive licence) · get_code("f6a38e82cb7bacde") 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 bool, 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.
|
| chooseNeighbor | Ran ran on a synthesized input |
susheels/gnns-and-local-assortativity/struc_sim/algorithms.py code served (permissive licence) · get_code("a031777e4ebeff8a") 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 int, 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.
|
| convert_ndarray | Ran ran on a synthesized input |
susheels/gnns-and-local-assortativity/datasets/bgp.py code served (permissive licence) · get_code("7984390414b770ba") 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 1, dtype family int, shape (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.
|
| filter_rels | Ran ran; our contract draft was wrong, not the code |
susheels/gnns-and-local-assortativity/exp.py code served (permissive licence) · get_code("5e3663ee66aeb1d8") 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 MockData. 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.
|
| get_degrees | Ran ran on a synthesized input |
susheels/gnns-and-local-assortativity/datasets/airports.py code served (permissive licence) · get_code("a093c2a5cfaf259d") 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 1, dtype family int, shape (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.
|
| rm_useless | Ran ran on a synthesized input |
susheels/gnns-and-local-assortativity/datasets/bgp.py code served (permissive licence) · get_code("4102c2d70e0e526f") 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.
|
| build_multigraph_from_layers | Not yet run unverified (harvested, no recorded run) |
susheels/gnns-and-local-assortativity/build_multigraph.py code served (permissive licence) · get_code("5d28fa208f6b62a9") How it ranno invocation recorded. |
| exec_ramdom_walks_for_chunck | Not yet run unverified (harvested, no recorded run) |
susheels/gnns-and-local-assortativity/struc_sim/algorithms.py code served (permissive licence) · get_code("e2522114d54ff7a8") How it ranno invocation recorded. |
| exec_random_walk | Not yet run unverified (harvested, no recorded run) |
susheels/gnns-and-local-assortativity/struc_sim/algorithms.py code served (permissive licence) · get_code("686c85e304c59420") How it ranno invocation recorded. |
| getCompactDegreeLists | Not yet run unverified (harvested, no recorded run) |
susheels/gnns-and-local-assortativity/struc_sim/algorithms_distances.py code served (permissive licence) · get_code("be0549eb08da272a") How it ranno invocation recorded. |
| getCompactDegreeListsVertices | Not yet run unverified (harvested, no recorded run) |
susheels/gnns-and-local-assortativity/struc_sim/algorithms_distances.py code served (permissive licence) · get_code("0dfca563e6da5c5a") How it ranno invocation recorded. |
| getDegreeListsVertices | Not yet run unverified (harvested, no recorded run) |
susheels/gnns-and-local-assortativity/struc_sim/algorithms_distances.py code served (permissive licence) · get_code("4ae621b1fc59fd88") How it ranno invocation recorded. |
Of 12 samples lifted from this paper's linked repositories, 12 carry a function identity and 0 do not. Of the 12 distinct functions with an identity, 6 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 6 later) and 6 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 |
|---|---|---|---|
| filter_rels | 2 other papers 2 later |
2308.09517 (2023-08) Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity |
2412.15589 (2024-12) Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck |
| build_multigraph_from_layers | 1 other paper 1 later |
2601.11135 (2026-01) Context-aware Graph Causality Inference for Few-Shot Molecular Property Prediction |
|
| check_rm | 1 other paper 1 later |
2308.09517 (2023-08) Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity |
|
| convert_ndarray | 1 other paper 1 later |
2308.09517 (2023-08) Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity |
|
| get_degrees | 1 other paper 1 later |
2308.09517 (2023-08) Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity |
|
| rm_useless | 1 other paper 1 later |
2308.09517 (2023-08) Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity |
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) have achieved tremendous success on multiple graph-based learning tasks by fusing network structure and node features. Modern GNN models are built upon iterative aggregation of neighbor's/proximity features by message passing. Its prediction performance has been shown to be strongly bounded by assortative mixing in the graph, a key property wherein nodes with similar attributes mix/connect with each other. We observe that real world networks exhibit heterogeneous or diverse mixing patterns and the conventional global measurement of assortativity, such as global assortativity coefficient, may not be a representative statistic in quantifying this mixing. We adopt a generalized concept, node-level assortativity, one that is based at the node level to better represent the diverse patterns and accurately quantify the learnability of GNNs. We find that the prediction performance of a wide range of GNN models is highly correlated with the node level assortativity. To break this limit, in this work, we focus on transforming the input graph into a computation graph which contains both proximity and structural information as distinct type of edges. The resulted multi-relational graph has an enhanced level of assortativity and, more importantly, preserves rich information from the original graph. We then propose to run GNNs on this computation graph and show that adaptively choosing between structure and proximity leads to improved performance under diverse mixing. Empirically, we show the benefits of adopting our transformation framework for semi-supervised node classification task on a variety of real world graph learning benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.06586")
get_code_for_paper("2106.06586")
have("2106.06586")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.06586.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.06586)
Connect an agent — have() is free.