Tao Mei, Jiebo Luo, Zheng-Jun Zha, Wu Liu, Kecheng Zheng, Lingxiao He
2 of 3 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 2 have no contract verdict; 0 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/2103.12366.json · badge: /api/ran/2103.12366.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 |
|---|---|---|
| zkcys001/UDAStrongBaseline | marked official in Papers with Code Papers with Code archive |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| CrossEntropyLabelSmooth | Ran ran on a synthesized input |
zkcys001/UDAStrongBaseline/UDAsbs/trainers.py pointer only (licence: NONE) · get_code("67098de4b6d84be8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, zkcys001/UDAStrongBaseline 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. |
| SoftTripletLoss | Ran ran on a synthesized input |
zkcys001/UDAStrongBaseline/UDAsbs/trainers.py pointer only (licence: NONE) · get_code("c7014c033171910a") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, zkcys001/UDAStrongBaseline 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. |
| DbscanBaseTrainer_unc_ema | Not yet run unverified (harvested, no recorded run) |
zkcys001/UDAStrongBaseline/UDAsbs/trainers.py pointer only (licence: NONE) · get_code("2b788ef9e0f50921") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, zkcys001/UDAStrongBaseline 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. No invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 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.
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.
Unsupervised Domain Adaptive (UDA) person reidentification (ReID) aims at adapting the model trained on a labeled source-domain dataset to a target-domain dataset without any further annotations. Most successful UDA-ReID approaches combine clustering-based pseudo-label prediction with representation learning and perform the two steps in an alternating fashion. However, offline interaction between these two steps may allow noisy pseudo labels to substantially hinder the capability of the model. In this paper, we propose a Group-aware Label Transfer (GLT) algorithm, which enables the online interaction and mutual promotion of pseudo-label prediction and representation learning. Specifically, a label transfer algorithm simultaneously uses pseudo labels to train the data while refining the pseudo labels as an online clustering algorithm. It treats the online label refinery problem as an optimal transport problem, which explores the minimum cost for assigning M samples to N pseudo labels. More importantly, we introduce a group-aware strategy to assign implicit attribute group IDs to samples. The combination of the online label refining algorithm and the group-aware strategy can better correct the noisy pseudo label in an online fashion and narrow down the search space of the target identity. The effectiveness of the proposed GLT is demonstrated by the experimental results (Rank-1 accuracy) for Market1501→DukeMTMC (82.0%) and DukeMTMC→Market1501 (92.2%), remarkably closing the gap between unsupervised and supervised performance on person re-identification. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2103.12366")
get_code_for_paper("2103.12366")
have("2103.12366")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2103.12366.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2103.12366)
Connect an agent — have() is free.