Shiliang Zhang, Xiaobin Liu
5 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (2 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 3 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-22; 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/2105.04776.json · badge: /api/ran/2105.04776.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 |
|---|---|---|
| liu-xb/GCMT | community Papers with Code archive |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| AverageMeter | Ran ran on a synthesized input |
liu-xb/GCMT/gcc/trainer_v2.py pointer only (licence: NONE) · get_code("ac660c609ee238a7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, liu-xb/GCMT 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. |
| CrossEntropyLabelSmooth | Ran ran on a synthesized input · constructed an object; no result was computed |
liu-xb/GCMT/gcc/trainer_v2.py pointer only (licence: NONE) · get_code("96664332f74c696f") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, liu-xb/GCMT 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. |
| GCCTrainer | Ran ran on a synthesized input · constructed an object; no result was computed |
liu-xb/GCMT/gcc/trainer_v2.py pointer only (licence: NONE) · get_code("2cf1abd4d6f5d9f9") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, liu-xb/GCMT 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. |
| accuracy | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
liu-xb/GCMT/gcc/trainer_v2.py pointer only (licence: NONE) · get_code("f5a5c92c5a887ce9") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, liu-xb/GCMT 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. |
| to_torch | Ran ran, honoured the contract we drafted |
liu-xb/GCMT/gcc/trainer_v2.py pointer only (licence: NONE) · get_code("7aac4c51e0ceee97") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, liu-xb/GCMT 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. |
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 (3 with at least one paper dated earlier, 0 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 |
|---|---|---|---|
| to_torch brick of this paper's assembly: helper |
9 other papers 5 dated earlier, 4 later · 3 only as an assembly brick |
1912.08265 (2019-12) Learning from Synthetic Animals |
2003.02501 (2020-03) Detecting Attended Visual Targets in Video 2007.09919 (2020-07) Robust Tracking against Adversarial Attacks and 6 more not named here |
| AverageMeter brick of this paper's assembly: helper |
2 other papers 1 dated earlier, 1 later · 2 only as an assembly brick |
2103.12366 (2021-03) Group-aware Label Transfer for Domain Adaptive Person Re-identification |
2203.14675 (2022-03) Part-based Pseudo Label Refinement for Unsupervised Person Re-identification |
| accuracy brick of this paper's assembly: helper |
2 other papers 1 dated earlier, 1 later · 2 only as an assembly brick |
2103.12366 (2021-03) Group-aware Label Transfer for Domain Adaptive Person Re-identification |
2203.14675 (2022-03) Part-based Pseudo Label Refinement for Unsupervised Person Re-identification |
| CrossEntropyLabelSmooth brick of this paper's assembly: helper |
1 other paper 1 later |
2203.14675 (2022-03) Part-based Pseudo Label Refinement for Unsupervised Person Re-identification |
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.
Recent works show that mean-teaching is an effective framework for unsupervised domain adaptive person re-identification. However, existing methods perform contrastive learning on selected samples between teacher and student networks, which is sensitive to noises in pseudo labels and neglects the relationship among most samples. Moreover, these methods are not effective in cooperation of different teacher networks. To handle these issues, this paper proposes a Graph Consistency based Mean-Teaching (GCMT) method with constructing the Graph Consistency Constraint (GCC) between teacher and student networks. Specifically, given unlabeled training images, we apply teacher networks to extract corresponding features and further construct a teacher graph for each teacher network to describe the similarity relationships among training images. To boost the representation learning, different teacher graphs are fused to provide the supervise signal for optimizing student networks. GCMT fuses similarity relationships predicted by different teacher networks as supervision and effectively optimizes student networks with more sample relationships involved. Experiments on three datasets, i.e., Market-1501, DukeMTMC-reID, and MSMT17, show that proposed GCMT outperforms state-of-the-art methods by clear margin. Specially, GCMT even outperforms the previous method that uses a deeper backbone. Experimental results also show that GCMT can effectively boost the performance with multiple teacher and student networks. Our code is available at https://github.com/liu-xb/GCMT .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2105.04776")
get_code_for_paper("2105.04776")
have("2105.04776")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2105.04776.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2105.04776)
Connect an agent — have() is free.