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; 2 honoured the contract we drafted, 1 violated it and 1 has no contract verdict; 1 failure 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/2007.09271.json · badge: /api/ran/2007.09271.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 |
|---|---|---|
| zhiqiangdon/online-augment | canonical (classifier label) classifier basis: census |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| conv3x3 | Ran ran; our contract draft was wrong, not the code |
zhiqiangdon/online-augment/models/pyramidnet.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from lzj994/Binary-Quantization, is pointer only (licence: NONE) · get_code("03a0be4fb7381bd2") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from lzj994/Binary-Quantization, and GitHub detected no licence in that repository when it was checked. 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. |
| float_parameter | Ran ran, honoured the contract we drafted |
zhiqiangdon/online-augment/archive_policies.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from chenchenzong/dpc, is pointer only (licence: NONE) · get_code("40d3c39a403ae1f7") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked. 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. |
| get_mean_std | Ran ran on a synthesized input |
zhiqiangdon/online-augment/models/normalize_mean_std.py code served (permissive licence) · get_code("f963a0c21d33cafa") 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 2, 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.
|
| int_parameter | Ran ran, honoured the contract we drafted |
zhiqiangdon/online-augment/archive_policies.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from chenchenzong/dpc, is pointer only (licence: NONE) · get_code("7900a3a6deef908b") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from chenchenzong/dpc, and GitHub detected no licence in that repository when it was checked. 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. |
| normalize_fn | Ran ran, violated the contract we drafted |
zhiqiangdon/online-augment/models/normalize_mean_std.py code served (permissive licence) · get_code("8bc8b691d2e94f84") 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 Tensor, ndim 4, dtype family float, shape (2, 4, 3, 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.
|
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, 4 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 1 the same month, 4 later) and 1 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 |
|---|---|---|---|
| conv3x3 | 686 other papers 238 dated earlier, 16 the same month, 431 later, 1 same year, order not determinable · 31 only as an assembly brick |
1406.2661 (2014-06) Generative Adversarial Networks |
1409.0575 (2014-09) ImageNet Large Scale Visual Recognition Challenge 1412.6572 (2014-12) Explaining and Harnessing Adversarial Examples and 683 more not named here |
| float_parameter | 15 other papers 8 dated earlier, 7 later |
1409.4842 (2014-09) Going deeper with convolutions |
1512.00567 (2015-12) Rethinking the Inception Architecture for Computer Vision 1608.06993 (2016-08) Densely Connected Convolutional Networks and 12 more not named here |
| normalize_fn | 7 other papers 1 dated earlier, 6 later |
1910.00033 (2019-10) Hidden Trigger Backdoor Attacks |
2010.09080 (2020-10) Poisoned classifiers are not only backdoored, they are fundamentally broken 2012.05434 (2020-12) Composite Adversarial Attacks and 4 more not named here |
| int_parameter | 6 other papers 4 dated earlier, 2 later |
1904.12848 (2019-04) Unsupervised Data Augmentation for Consistency Training |
1905.00397 (2019-05) Fast AutoAugment 2001.06001 (2020-01) Curriculum Labeling: Revisiting Pseudo-Labeling for Semi-Supervised Learning and 3 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.
Data augmentation is one of the most important tools in training modern deep neural networks. Recently, great advances have been made in searching for optimal augmentation policies in the image classification domain. However, two key points related to data augmentation remain uncovered by the current methods. First is that most if not all modern augmentation search methods are offline and learning policies are isolated from their usage. The learned policies are mostly constant throughout the training process and are not adapted to the current training model state. Second, the policies rely on class-preserving image processing functions. Hence applying current offline methods to new tasks may require domain knowledge to specify such kind of operations. In this work, we offer an orthogonal online data augmentation scheme together with three new augmentation networks, co-trained with the target learning task. It is both more efficient, in the sense that it does not require expensive offline training when entering a new domain, and more adaptive as it adapts to the learner state. Our augmentation networks require less domain knowledge and are easily applicable to new tasks. Extensive experiments demonstrate that the proposed scheme alone performs on par with the state-of-the-art offline data augmentation methods, as well as improving upon the state-of-the-art in combination with those methods. Code is available at https://github.com/zhiqiangdon/online-augment .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.09271")
get_code_for_paper("2007.09271")
have("2007.09271")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.09271.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.09271)
Connect an agent — have() is free.