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; 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/2008.01454.json · badge: /api/ran/2008.01454.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 | canonical (classifier label) classifier basis: classifier_2025 |
3 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Tsharpen | Ran ran, honoured the contract we drafted |
Yiyang98/BFUDA/ours/train_mu_et.py pointer only (licence: NONE) · get_code("fea9df9ce033e2d6") 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. |
| grl_hook | Ran ran; our contract draft was wrong, not the code |
Yiyang98/BFUDA/ours/network.py pointer only (licence: NONE) · get_code("9768efb52f591b55") 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. |
| test | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
Yiyang98/BFUDA/ours/train_mu_et.py pointer only (licence: NONE) · get_code("706d37e741433189") 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. |
| calc_coeff | Not yet run unverified (harvested, no recorded run) |
Yiyang98/BFUDA/ours/network.py pointer only (licence: NONE) · get_code("e352afa5762c5a6b") 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, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 2 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 |
|---|---|---|---|
| calc_coeff | 14 other papers 4 dated earlier, 10 later · 2 only as an assembly brick |
1505.07818 (2015-05) Domain-Adversarial Training of Neural Networks |
1904.06487 (2019-04) Semi-supervised Domain Adaptation via Minimax Entropy 2003.02541 (2020-03) A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation and 11 more not named here |
| grl_hook | 12 other papers 3 dated earlier, 9 later · 3 only as an assembly brick |
1505.07818 (2015-05) Domain-Adversarial Training of Neural Networks |
2003.02541 (2020-03) A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation 2007.14612 (2020-07) Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation and 9 more not named here |
| Tsharpen | 1 other paper 1 dated earlier |
2007.14612 (2020-07) Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation |
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), a classifier for the target domain is trained with massive true-label data from the source domain and unlabeled data from the target domain. However, collecting fully-true-label data in the source domain is high-cost and sometimes impossible. Compared to the true labels, a complementary label specifies a class that a pattern does not belong to, hence collecting complementary labels would be less laborious than collecting true labels. Thus, in this paper, we propose a novel setting that the source domain is composed of complementary-label data, and a theoretical bound for it is first proved. We consider two cases of this setting, one is that the source domain only contains complementary-label data (completely complementary unsupervised domain adaptation, CC-UDA), and the other is that the source domain has plenty of complementary-label data and a small amount of true-label data (partly complementary unsupervised domain adaptation, PC-UDA). To this end, a complementary label adversarial network} (CLARINET) is proposed to solve CC-UDA and PC-UDA problems. CLARINET maintains two deep networks simultaneously, where one focuses on classifying complementary-label source data and the other takes care of source-to-target distributional adaptation. Experiments show that CLARINET significantly outperforms a series of competent baselines on handwritten-digits-recognition and objects-recognition tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2008.01454")
get_code_for_paper("2008.01454")
have("2008.01454")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2008.01454.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2008.01454)
Connect an agent — have() is free.