5 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 4 failures 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/2112.04575.json · badge: /api/ran/2112.04575.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 |
|---|---|---|
| jumxglhf/akgnn | canonical (classifier label) classifier basis: census |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| calculate_degree | Ran ran; our contract draft was wrong, not the code |
jumxglhf/akgnn/utils_pygcn.py code served (permissive licence) · get_code("94cc3fbc04dbff1a") 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 dia_matrix. 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 |
jumxglhf/akgnn/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.
|
| load_data | Ran ran; our contract draft was wrong, not the code |
jumxglhf/akgnn/utils.py code served (permissive licence) · get_code("43a8c0adebcb268c") 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.
|
| load_data | Ran ran; our contract draft was wrong, not the code |
jumxglhf/akgnn/utils_pygcn.py code served (permissive licence) · get_code("9a35209e7105505b") 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.
|
| parse_index_file | Ran ran, honoured the contract we drafted |
jumxglhf/akgnn/utils.py code served (permissive licence) · get_code("5c3fa9402a9405bc") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) 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.
|
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, 5 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 5 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 |
|---|---|---|---|
| parse_index_file | 53 other papers 30 dated earlier, 23 later · 1 only as an assembly brick |
1603.08861 (2016-03) Revisiting Semi-Supervised Learning with Graph Embeddings |
1611.07308 (2016-11) Variational Graph Auto-Encoders 1710.10568 (2017-10) Stochastic Training of Graph Convolutional Networks with Variance Reduction and 50 more not named here |
| encode_onehot | 12 other papers 7 dated earlier, 5 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 |
| calculate_degree | 1 other paper 1 later |
aaai_20664 (2022 (year only)) Adaptive Kernel Graph Neural Network |
|
| load_data | 1 other paper 1 later |
aaai_20664 (2022 (year only)) Adaptive Kernel Graph Neural Network |
|
| load_data | 1 other paper 1 later |
aaai_20664 (2022 (year only)) Adaptive Kernel Graph Neural Network |
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 demonstrated great success in representation learning for graph-structured data. The layer-wise graph convolution in GNNs is shown to be powerful at capturing graph topology. During this process, GNNs are usually guided by pre-defined kernels such as Laplacian matrix, adjacency matrix, or their variants. However, the adoptions of pre-defined kernels may restrain the generalities to different graphs: mismatch between graph and kernel would entail sub-optimal performance. For example, GNNs that focus on low-frequency information may not achieve satisfactory performance when high-frequency information is significant for the graphs, and vice versa. To solve this problem, in this paper, we propose a novel framework - i.e., namely Adaptive Kernel Graph Neural Network (AKGNN) - which learns to adapt to the optimal graph kernel in a unified manner at the first attempt. In the proposed AKGNN, we first design a data-driven graph kernel learning mechanism, which adaptively modulates the balance between all-pass and low-pass filters by modifying the maximal eigenvalue of the graph Laplacian. Through this process, AKGNN learns the optimal threshold between high and low frequency signals to relieve the generality problem. Later, we further reduce the number of parameters by a parameterization trick and enhance the expressive power by a global readout function. Extensive experiments are conducted on acknowledged benchmark datasets and promising results demonstrate the outstanding performance of our proposed AKGNN by comparison with state-of-the-art GNNs. The source code is publicly available at: https://github.com/jumxglhf/AKGNN.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2112.04575")
get_code_for_paper("2112.04575")
have("2112.04575")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2112.04575.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2112.04575)
Connect an agent — have() is free.