Feng Liu, Bo Yuan, Jie Lu, Zhen Fang, Guangquan Zhang, Yiyang Zhang
3 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 1 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/2007.14612.json · badge: /api/ran/2007.14612.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 |
|---|---|---|
| Yiyang98/BFUDA | marked official in Papers with Code Papers with Code archive |
2 ran · 1 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| CDAN | Ran ran; our contract draft was wrong, not the code |
Yiyang98/BFUDA/ours/train_mu_et.py pointer only (licence: NONE) · get_code("266bec9da50e3ba1") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Yiyang98/BFUDA 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. |
| DANN | Ran ran; our contract draft was wrong, not the code |
Yiyang98/BFUDA/ours/train_mu_et.py pointer only (licence: NONE) · get_code("46904d327c3f9e52") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Yiyang98/BFUDA 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. |
| Tsharpen | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from Yiyang98/BFUDA pointer only; the stored copy get_code serves, from Yiyang98/BFUDA, is pointer only (licence: NONE) · get_code("fea9df9ce033e2d6") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for 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. |
| train | Not yet run unverified (harvested, no recorded run) |
Yiyang98/BFUDA/ours/train_mu_et.py pointer only (licence: NONE) · get_code("8e2bb8b7806a57d8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Yiyang98/BFUDA 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 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, 2 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 2 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 |
|---|---|---|---|
| CDAN brick of this paper's assembly: loss |
4 other papers 4 later |
2104.01539 (2021-04) DINE: Domain Adaptation from Single and Multiple Black-box Predictors |
2107.12585 (2021-07) Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation 2208.07591 (2022-08) Uncertainty-guided Source-free Domain Adaptation and 1 more not named here |
| Tsharpen brick of this paper's assembly: helper |
1 other paper 1 later |
2008.01454 (2020-08) Learning from a Complementary-label Source Domain: Theory and Algorithms |
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.
In unsupervised domain adaptation (UDA), classifiers for the target domain are trained with massive true-label data from the source domain and unlabeled data from the target domain. However, it may be difficult to collect fully-true-label data in a source domain given limited budget. To mitigate this problem, we consider a novel problem setting where the classifier for the target domain has to be trained with complementary-label data from the source domain and unlabeled data from the target domain named budget-friendly UDA (BFUDA). The key benefit is that it is much less costly to collect complementary-label source data (required by BFUDA) than collecting the truelabel source data (required by ordinary UDA). To this end, complementary label adversarial network (CLARINET) is proposed to solve the BFUDA problem. CLARINET maintains two deep networks simultaneously, where one focuses on classifying complementary-label source data and the other takes care of the source-to-target distributional adaptation. Experiments show that CLAR-INET significantly outperforms a series of competent baselines.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.14612")
get_code_for_paper("2007.14612")
have("2007.14612")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.14612.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.14612)
Connect an agent — have() is free.