4 of 4 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; 2 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 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/1901.09181.json · badge: /api/ran/1901.09181.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 |
|---|---|---|
| dcmocanu/sparse-evolutionary-artificial-neural-networks | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| createSparseWeights | Ran ran; our contract draft was wrong, not the code |
dcmocanu/sparse-evolutionary-artificial-neural-networks/SET-MLP-Sparse-Python-Data-Structures/set_mlp_sparse_data_structures.py code served (permissive licence) · get_code("d1dd6b1240c82834") 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 csr_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.
|
| createWeightsMask | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from joostPieterse/CosineSET pointer only; the stored copy get_code serves, from joostPieterse/CosineSET, is pointer only (licence: NONE) · get_code("1cb2d51570c25ff3") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| find_first_pos | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from joostPieterse/CosineSET pointer only; the stored copy get_code serves, from joostPieterse/CosineSET, is pointer only (licence: NONE) · get_code("09540a28779b66ce") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| find_last_pos | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from joostPieterse/CosineSET pointer only; the stored copy get_code serves, from joostPieterse/CosineSET, is pointer only (licence: NONE) · get_code("6c42c3044030b535") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 4 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 4 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 |
|---|---|---|---|
| find_first_pos | 4 other papers 1 dated earlier, 3 later |
1707.04780 (2017-07) Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science |
1903.07138 (2019-03) A Brain-inspired Algorithm for Training Highly Sparse Neural Networks 2006.14085 (2020-06) Topological Insights into Sparse Neural Networks and 1 more not named here |
| find_last_pos | 3 other papers 1 dated earlier, 2 later |
1707.04780 (2017-07) Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science |
1903.07138 (2019-03) A Brain-inspired Algorithm for Training Highly Sparse Neural Networks 2006.14085 (2020-06) Topological Insights into Sparse Neural Networks |
| createSparseWeights | 2 other papers 1 dated earlier, 1 later |
1707.04780 (2017-07) Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science |
2006.14085 (2020-06) Topological Insights into Sparse Neural Networks |
| createWeightsMask | 2 other papers 2 later |
1903.07138 (2019-03) A Brain-inspired Algorithm for Training Highly Sparse Neural Networks |
2006.14085 (2020-06) Topological Insights into Sparse Neural Networks |
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.
Artificial Neural Networks (ANNs) have emerged as hot topics in the research community. Despite the success of ANNs, it is challenging to train and deploy modern ANNs on commodity hardware due to the ever-increasing model size and the unprecedented growth in the data volumes. Particularly for microarray data, the very-high dimensionality and the small number of samples make it difficult for machine learning techniques to handle. Furthermore, specialized hardware such as Graphics Processing Unit (GPU) is expensive. Sparse neural networks are the leading approaches to address these challenges. However, off-the-shelf sparsity inducing techniques either operate from a pre-trained model or enforce the sparse structure via binary masks. The training efficiency of sparse neural networks cannot be obtained practically. In this paper, we introduce a technique allowing us to train truly sparse neural networks with fixed parameter count throughout training. Our experimental results demonstrate that our method can be applied directly to handle high dimensional data, while achieving higher accuracy than the traditional two phases approaches. Moreover, we have been able to create truly sparse MultiLayer Perceptrons (MLPs) models with over one million neurons and to train them on a typical laptop without GPU, this being way beyond what is possible with any state-of-the-art techniques.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1901.09181")
get_code_for_paper("1901.09181")
have("1901.09181")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1901.09181.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1901.09181)
Connect an agent — have() is free.