None of the 4 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (4 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/1906.10337.json · badge: /api/ran/1906.10337.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 |
|---|---|---|
| ZJULearning/COP | canonical (classifier label) classifier basis: census |
0 ran · 4 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| convert_to_tf_records | Not yet run unverified (harvested, no recorded run) |
ZJULearning/COP/extra/imagenet_to_gcs.py code served (permissive licence) · get_code("3372fb75e325be6a") How it ranno invocation recorded. |
| download_dataset | Not yet run unverified (harvested, no recorded run) |
ZJULearning/COP/extra/imagenet_to_gcs.py code served (permissive licence) · get_code("56a5d49c4377cee5") How it ranno invocation recorded. |
| test_input_fn | Not yet run unverified (harvested, no recorded run) |
ZJULearning/COP/datasets/imagenet.py code served (permissive licence) · get_code("3b3dbab0c72edc28") How it ranno invocation recorded. |
| train_input_fn | Not yet run unverified (harvested, no recorded run) |
ZJULearning/COP/datasets/imagenet.py code served (permissive licence) · get_code("ebc6ad70fc7ee9b3") How it ranno invocation 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, 1 are also present in other papers whose code we hold (1 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 |
|---|---|---|---|
| convert_to_tf_records | 1 other paper 1 dated earlier |
1904.01569 (2019-04) Exploring Randomly Wired Neural Networks for Image Recognition |
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.
Neural network compression empowers the effective yet unwieldy deep convolutional neural networks (CNN) to be deployed in resource-constrained scenarios. Most state-of-the-art approaches prune the model in filter-level according to the "importance" of filters. Despite their success, we notice they suffer from at least two of the following problems: 1) The redundancy among filters is not considered because the importance is evaluated independently. 2) Cross-layer filter comparison is unachievable since the importance is defined locally within each layer. Consequently, we must manually specify layer-wise pruning ratios. 3) They are prone to generate sub-optimal solutions because they neglect the inequality between reducing parameters and reducing computational cost. Reducing the same number of parameters in different positions in the network may reduce different computational cost. To address the above problems, we develop a novel algorithm named as COP (correlation-based pruning), which can detect the redundant filters efficiently. We enable the cross-layer filter comparison through global normalization. We add parameter-quantity and computational-cost regularization terms to the importance, which enables the users to customize the compression according to their preference (smaller or faster). Extensive experiments have shown COP outperforms the others significantly. The code is released at https://github.com/ZJULearning/COP.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1906.10337")
get_code_for_paper("1906.10337")
have("1906.10337")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1906.10337.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1906.10337)
Connect an agent — have() is free.