4 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; 1 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 2 failures of our instrument; 1 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/2002.04264.json · badge: /api/ran/2002.04264.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 |
|---|---|---|
| dongliangchang/Mutual-Channel-Loss | canonical (classifier label) classifier basis: census |
2 ran · 1 no recorded run |
| Kurumi233/Mutual-Channel-Loss | community (classifier label) classifier basis not recorded on the link |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| conv3x3 | Ran ran; our contract draft was wrong, not the code |
dongliangchang/Mutual-Channel-Loss/CUB-200-2011_ResNet18.py pointer only (licence: MIT); the stored copy get_code serves, from lixiaotong97/DSU, is pointer only (licence: NONE) · get_code("fac5364e2f53c6db") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from lixiaotong97/DSU, 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. |
| default_loader | Ran ran, honoured the contract we drafted |
Kurumi233/Mutual-Channel-Loss/dataload.py pointer only (licence: MIT); the stored copy get_code serves, from xlgsyzp/cvpt, is pointer only (licence: NONE) · get_code("ac269a0e4b8d946e") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xlgsyzp/cvpt, 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. |
| gray_loader | Ran ran on a synthesized input |
Kurumi233/Mutual-Channel-Loss/dataload.py code served (permissive licence) · get_code("90d61abe3df5849f") 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 Image. 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.
|
| resnet18 | Ran ran; our contract draft was wrong, not the code |
dongliangchang/Mutual-Channel-Loss/CUB-200-2011_ResNet18.py code served (permissive licence) · get_code("7375f22b6e02d48f") 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 ResNet. 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.
|
| Mask | Not yet run unverified (harvested, no recorded run) |
dongliangchang/Mutual-Channel-Loss/CUB-200-2011_ResNet18.py code served (permissive licence) · get_code("80779b7a31a59036") How it ranno invocation recorded. |
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, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 1 the same month, 3 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 |
|---|---|---|---|
| conv3x3 | 686 other papers 187 dated earlier, 9 the same month, 489 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 |
| resnet18 | 89 other papers 25 dated earlier, 63 later, 1 same year, order not determinable |
1705.09759 (2017-05) CASENet: Deep Category-Aware Semantic Edge Detection |
1801.07698 (2018-01) ArcFace: Additive Angular Margin Loss for Deep Face Recognition 1803.00839 (2018-03) Pose-Robust Face Recognition via Deep Residual Equivariant Mapping and 86 more not named here |
| default_loader | 27 other papers 8 dated earlier, 19 later |
1710.03463 (2017-10) Learning to Generalize: Meta-Learning for Domain Generalization |
1803.08669 (2018-03) Pyramid Stereo Matching Network 1810.11408 (2018-10) Anytime Stereo Image Depth Estimation on Mobile Devices and 24 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Key for solving fine-grained image categorization is finding discriminate and local regions that correspond to subtle visual traits. Great strides have been made, with complex networks designed specifically to learn part-level discriminate feature representations. In this paper, we show it is possible to cultivate subtle details without the need for overly complicated network designs or training mechanisms -- a single loss is all it takes. The main trick lies with how we delve into individual feature channels early on, as opposed to the convention of starting from a consolidated feature map. The proposed loss function, termed as mutual-channel loss (MC-Loss), consists of two channel-specific components: a discriminality component and a diversity component. The discriminality component forces all feature channels belonging to the same class to be discriminative, through a novel channel-wise attention mechanism. The diversity component additionally constraints channels so that they become mutually exclusive on spatial-wise. The end result is therefore a set of feature channels that each reflects different locally discriminative regions for a specific class. The MC-Loss can be trained end-to-end, without the need for any bounding-box/part annotations, and yields highly discriminative regions during inference. Experimental results show our MC-Loss when implemented on top of common base networks can achieve state-of-the-art performance on all four fine-grained categorization datasets (CUB-Birds, FGVC-Aircraft, Flowers-102, and Stanford-Cars). Ablative studies further demonstrate the superiority of MC-Loss when compared with other recently proposed general-purpose losses for visual classification, on two different base networks. Code available at https://github.com/dongliangchang/Mutual-Channel-Loss
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.04264")
get_code_for_paper("2002.04264")
have("2002.04264")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.04264.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.04264)
Connect an agent — have() is free.