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; 0 honoured the contract we drafted, 0 violated it and 1 has 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/2004.00900.json · badge: /api/ran/2004.00900.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 |
|---|---|---|
| JoyHuYY1412/LST_LVIS | canonical (classifier label) classifier basis: census |
4 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_group_gn | Ran ran on a synthesized input |
JoyHuYY1412/LST_LVIS/maskrcnn_benchmark/modeling/make_layers.py pointer only (licence: MIT) · get_code("83c64313d0501174") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, JoyHuYY1412/LST_LVIS, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. |
| interpolate | Ran ran; our contract draft was wrong, not the code |
JoyHuYY1412/LST_LVIS/maskrcnn_benchmark/layers/misc.py pointer only (licence: MIT); the stored copy get_code serves, from KanghoonYoon/torch-rasgg, is pointer only (licence: NONE) · get_code("2902bf4410253ff7") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, JoyHuYY1412/LST_LVIS, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. |
| sigmoid_focal_loss_cpu | Ran ran; our contract draft was wrong, not the code |
JoyHuYY1412/LST_LVIS/maskrcnn_benchmark/layers/sigmoid_focal_loss.py pointer only (licence: MIT); the stored copy get_code serves, from KanghoonYoon/torch-rasgg, is pointer only (licence: NONE) · get_code("426fd02a2beaf826") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, JoyHuYY1412/LST_LVIS, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. |
| smooth_l1_loss | Ran ran; our contract draft was wrong, not the code |
JoyHuYY1412/LST_LVIS/maskrcnn_benchmark/layers/smooth_l1_loss.py pointer only (licence: MIT) · get_code("e261fa29066b37e5") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, JoyHuYY1412/LST_LVIS, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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 (4 with at least one paper dated earlier, 2 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 |
|---|---|---|---|
| interpolate | 38 other papers 13 dated earlier, 25 later |
1703.06870 (2017-03) Mask R-CNN |
1803.03243 (2018-03) Domain Adaptive Faster R-CNN for Object Detection in the Wild 1807.08865 (2018-07) StereoNet: Guided Hierarchical Refinement for Real-Time Edge-Aware Depth Prediction and 35 more not named here |
| smooth_l1_loss | 16 other papers 6 dated earlier, 1 the same month, 9 later |
1703.06870 (2017-03) Mask R-CNN |
1903.00241 (2019-03) Mask Scoring R-CNN 1904.01169 (2019-04) Res2Net: A New Multi-scale Backbone Architecture and 13 more not named here |
| sigmoid_focal_loss_cpu | 10 other papers 4 dated earlier, 1 the same month, 5 later |
1803.03243 (2018-03) Domain Adaptive Faster R-CNN for Object Detection in the Wild |
1904.01169 (2019-04) Res2Net: A New Multi-scale Backbone Architecture 1904.01355 (2019-04) FCOS: Fully Convolutional One-Stage Object Detection and 7 more not named here |
| get_group_gn | 3 other papers 2 dated earlier, 1 later |
1703.06870 (2017-03) Mask R-CNN |
1904.01355 (2019-04) FCOS: Fully Convolutional One-Stage Object Detection 2111.12698 (2021-11) Open-Vocabulary Instance Segmentation via Robust Cross-Modal Pseudo-Labeling |
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.
Real-world visual recognition requires handling the extreme sample imbalance in large-scale long-tailed data. We propose a "divide&conquer" strategy for the challenging LVIS task: divide the whole data into balanced parts and then apply incremental learning to conquer each one. This derives a novel learning paradigm: class-incremental few-shot learning, which is especially effective for the challenge evolving over time: 1) the class imbalance among the old-class knowledge review and 2) the few-shot data in new-class learning. We call our approach Learning to Segment the Tail (LST). In particular, we design an instance-level balanced replay scheme, which is a memory-efficient approximation to balance the instance-level samples from the old-class images. We also propose to use a meta-module for new-class learning, where the module parameters are shared across incremental phases, gaining the learning-to-learn knowledge incrementally, from the data-rich head to the data-poor tail. We empirically show that: at the expense of a little sacrifice of head-class forgetting, we can gain a significant 8.3% AP improvement for the tail classes with less than 10 instances, achieving an overall 2.0% AP boost for the whole 1,230 classes.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2004.00900")
get_code_for_paper("2004.00900")
have("2004.00900")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2004.00900.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2004.00900)
Connect an agent — have() is free.