Kaushik Roy, Gobinda Saha, Isha Garg
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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 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/2103.09762.json · badge: /api/ran/2103.09762.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 |
|---|---|---|
| sahagobinda/GPM | canonical (classifier label) classifier basis: classifier_2025 |
4 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| compute_conv_output_size | Ran ran, honoured the contract we drafted |
sahagobinda/GPM/main_cifar100.py code served (permissive licence) · get_code("e71c2a2bc2fc8909") 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 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.
|
| get_model | Ran ran; our contract draft was wrong, not the code |
sahagobinda/GPM/main_cifar100.py code served (permissive licence) · get_code("ebd151f2b9fc07af") 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 OrderedDict. 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.
|
| test | Ran ran; our contract draft was wrong, not the code |
sahagobinda/GPM/main_cifar100.py code served (permissive licence) · get_code("52f190e75c2b2866") 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 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.
|
| update_GPM | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
sahagobinda/GPM/main_cifar100.py code served (permissive licence) · get_code("6e3c5f8afe521af7") 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. 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.
|
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, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 2 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 |
|---|---|---|---|
| compute_conv_output_size | 7 other papers 3 dated earlier, 4 later |
1905.11614 (2019-05) Uncertainty-based Continual Learning with Adaptive Regularization |
2003.09553 (2020-03) Adversarial Continual Learning 2008.11364 (2020-08) Improving Semi-supervised Federated Learning by Reducing the Gradient Diversity of Models and 4 more not named here |
| get_model | 7 other papers 3 dated earlier, 4 later · 2 only as an assembly brick |
2003.09553 (2020-03) Adversarial Continual Learning |
2006.07326 (2020-06) CPR: Classifier-Projection Regularization for Continual Learning 2010.01528 (2020-10) Remembering for the Right Reasons: Explanations Reduce Catastrophic Forgetting and 4 more not named here |
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.
The ability to learn continually without forgetting the past tasks is a desired attribute for artificial learning systems. Existing approaches to enable such learning in artificial neural networks usually rely on network growth, importance based weight update or replay of old data from the memory. In contrast, we propose a novel approach where a neural network learns new tasks by taking gradient steps in the orthogonal direction to the gradient subspaces deemed important for the past tasks. We find the bases of these subspaces by analyzing network representations (activations) after learning each task with Singular Value Decomposition (SVD) in a single shot manner and store them in the memory as Gradient Projection Memory (GPM). With qualitative and quantitative analyses, we show that such orthogonal gradient descent induces minimum to no interference with the past tasks, thereby mitigates forgetting. We evaluate our algorithm on diverse image classification datasets with short and long sequences of tasks and report better or on-par performance compared to the state-of-the-art approaches 1 .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2103.09762")
get_code_for_paper("2103.09762")
have("2103.09762")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2103.09762.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2103.09762)
Connect an agent — have() is free.