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 0 have no contract verdict; 3 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/2105.04528.json · badge: /api/ran/2105.04528.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 |
|---|---|---|
| tedzhouhk/GCNP | canonical (classifier label) classifier basis: census |
3 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| calc_f1 | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
tedzhouhk/GCNP/GNN/metric.py code served (permissive licence) · get_code("abd93718f606fd86") 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, ndim 1, dtype family float; 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.
|
| parse_layer_yml | Ran ran; our contract draft was wrong, not the code |
tedzhouhk/GCNP/GNN/utils.py code served (permissive licence) · get_code("228a19cda5326b8c") 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.
|
| process_graph_data | Ran ran; our contract draft was wrong, not the code |
tedzhouhk/GCNP/GNN/utils.py code served (permissive licence) · get_code("1c9066cfcac05682") 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.
|
| evaluate_full_batch | Not yet run unverified (harvested, no recorded run) |
tedzhouhk/GCNP/GNN/pytorch_version/load_tensorflow_model.py code served (permissive licence) · get_code("4623accb00c7b6f7") How it ranno invocation recorded. |
| load_data | Not yet run unverified (harvested, no recorded run) |
tedzhouhk/GCNP/GNN/utils.py code served (permissive licence) · get_code("2a31ea18cd40e5ea") 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, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 0 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 |
|---|---|---|---|
| calc_f1 | 1 other paper 1 dated earlier |
1907.10903 (2019-07) DropEdge: Towards Deep Graph Convolutional Networks on Node Classification |
|
| parse_layer_yml | 1 other paper 1 dated earlier |
1907.10903 (2019-07) DropEdge: Towards Deep Graph Convolutional Networks on Node Classification |
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 proven to be powerful models to generate node embedding for downstream applications. However, due to the high computation complexity of GNN inference, it is hard to deploy GNNs for large-scale or real-time applications. In this paper, we propose to accelerate GNN inference by pruning the dimensions in each layer with negligible accuracy loss. Our pruning framework uses a novel LASSO regression formulation for GNNs to identify feature dimensions (channels) that have high influence on the output activation. We identify two inference scenarios and design pruning schemes based on their computation and memory usage for each. To further reduce the inference complexity, we effectively store and reuse hidden features of visited nodes, which significantly reduces the number of supporting nodes needed to compute the target embedding. We evaluate the proposed method with the node classification problem on five popular datasets and a real-time spam detection application. We demonstrate that the pruned GNN models greatly reduce computation and memory usage with little accuracy loss. For full inference, the proposed method achieves an average of 3.27x speedup with only 0.002 drop in F1-Micro on GPU. For batched inference, the proposed method achieves an average of 6.67x speedup with only 0.003 drop in F1-Micro on CPU. To the best of our knowledge, we are the first to accelerate large scale real-time GNN inference through channel pruning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2105.04528")
get_code_for_paper("2105.04528")
have("2105.04528")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2105.04528.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2105.04528)
Connect an agent — have() is free.