8 of 10 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; 2 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 4 failures of our instrument; 2 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/2003.02541.json · badge: /api/ran/2003.02541.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 |
|---|---|---|
| tim-learn/BA3US | canonical (classifier label) classifier basis: census |
8 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| DANN | Ran ran on a synthesized input |
tim-learn/BA3US/my_loss.py code served (permissive licence) · get_code("b03644ad1b258f7e") 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 Tensor, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is not recorded. If your copy returns the same type, ndim and shape 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.
|
| Entropy | Ran ran on a synthesized input |
tim-learn/BA3US/my_loss.py code served (permissive licence) · get_code("792f32c0291a5af7") 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 Tensor, ndim 1, dtype family float, shape (2,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| grl_hook | Ran ran; our contract draft was wrong, not the code |
tim-learn/BA3US/my_loss.py pointer only (licence: MIT); the stored copy get_code serves, from Yiyang98/BFUDA, is pointer only (licence: NONE) · get_code("9768efb52f591b55") 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 Yiyang98/BFUDA, 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. |
| image_test | Ran ran; our contract draft was wrong, not the code |
tim-learn/BA3US/run_partial.py code served (permissive licence) · get_code("60166088c825b407") 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 Compose. 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.
|
| image_train | Ran ran; our contract draft was wrong, not the code |
tim-learn/BA3US/run_partial.py code served (permissive licence) · get_code("6d14e3fcb8d93fa1") 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 Compose. 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.
|
| inv_lr_scheduler | Ran ran; our contract draft was wrong, not the code |
tim-learn/BA3US/lr_schedule.py code served (permissive licence) · get_code("693fef7015113684") 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 SGD. 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.
|
| l_loader | Ran ran, honoured the contract we drafted |
tim-learn/BA3US/data_list.py pointer only (licence: MIT); the stored copy get_code serves, from Albert0147/AaD_SFDA, is pointer only (licence: NONE) · get_code("edd7184ac144c4fa") 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 Albert0147/AaD_SFDA, 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. |
| rgb_loader | Ran ran, honoured the contract we drafted |
tim-learn/BA3US/data_list.py code served (permissive licence) · get_code("2c5ce24ea2b5d2a4") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) 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.
|
| calc_coeff | Not yet run unverified (harvested, no recorded run) |
tim-learn/BA3US/network.py pointer only (licence: MIT); the stored copy get_code serves, from Yiyang98/BFUDA, is pointer only (licence: NONE) · get_code("e352afa5762c5a6b") 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 Yiyang98/BFUDA, 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. No invocation recorded. |
| make_dataset | Not yet run unverified (harvested, no recorded run) |
tim-learn/BA3US/data_list.py pointer only (licence: MIT); the stored copy get_code serves, from Albert0147/AaD_SFDA, is pointer only (licence: NONE) · get_code("2301055cb33836bc") 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 Albert0147/AaD_SFDA, 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. No invocation recorded. |
Of 10 samples lifted from this paper's linked repositories, 10 carry a function identity and 0 do not. Of the 10 distinct functions with an identity, 8 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 8 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 |
|---|---|---|---|
| rgb_loader | 19 other papers 19 later · 6 only as an assembly brick |
2104.01539 (2021-04) DINE: Domain Adaptation from Single and Multiple Black-box Predictors |
2104.01845 (2021-04) Unsupervised Multi-source Domain Adaptation Without Access to Source Data 2106.06916 (2021-06) Non-Transferable Learning: A New Approach for Model Ownership Verification and Applicability Authorization and 16 more not named here |
| l_loader | 17 other papers 17 later · 5 only as an assembly brick |
2104.01539 (2021-04) DINE: Domain Adaptation from Single and Multiple Black-box Predictors |
2104.01845 (2021-04) Unsupervised Multi-source Domain Adaptation Without Access to Source Data 2107.12585 (2021-07) Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation and 14 more not named here |
| make_dataset | 15 other papers 2 dated earlier, 13 later · 5 only as an assembly brick |
1702.00758 (2017-02) HashNet: Deep Learning to Hash by Continuation |
1908.00347 (2019-08) Central Similarity Quantization for Efficient Image and Video Retrieval 2104.01539 (2021-04) DINE: Domain Adaptation from Single and Multiple Black-box Predictors and 12 more not named here |
| calc_coeff | 14 other papers 2 dated earlier, 12 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 2007.14612 (2020-07) Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation and 11 more not named here |
| grl_hook | 12 other papers 1 dated earlier, 11 later · 3 only as an assembly brick |
1505.07818 (2015-05) Domain-Adversarial Training of Neural Networks |
2007.14612 (2020-07) Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation 2008.01454 (2020-08) Learning from a Complementary-label Source Domain: Theory and Algorithms and 9 more not named here |
| inv_lr_scheduler | 4 other papers 4 later · 1 only as an assembly brick |
2104.00808 (2021-04) Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation |
2108.09645 (2021-08) Improving Mini-batch Optimal Transport via Partial Transportation 2402.01887 (2024-02) On f -Divergence Principled Domain Adaptation: An Improved Framework and 1 more not named here |
| image_test | 1 other paper 1 later |
2108.09645 (2021-08) Improving Mini-batch Optimal Transport via Partial Transportation |
|
| image_train | 1 other paper 1 later |
2108.09645 (2021-08) Improving Mini-batch Optimal Transport via Partial Transportation |
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.
This work addresses the unsupervised domain adaptation problem, especially in the case of class labels in the target domain being only a subset of those in the source domain. Such a partial transfer setting is realistic but challenging and existing methods always suffer from two key problems, negative transfer and uncertainty propagation. In this paper, we build on domain adversarial learning and propose a novel domain adaptation method BA$^3$US with two new techniques termed Balanced Adversarial Alignment (BAA) and Adaptive Uncertainty Suppression (AUS), respectively. On one hand, negative transfer results in misclassification of target samples to the classes only present in the source domain. To address this issue, BAA pursues the balance between label distributions across domains in a fairly simple manner. Specifically, it randomly leverages a few source samples to augment the smaller target domain during domain alignment so that classes in different domains are symmetric. On the other hand, a source sample would be denoted as uncertain if there is an incorrect class that has a relatively high prediction score, and such uncertainty easily propagates to unlabeled target data around it during alignment, which severely deteriorates adaptation performance. Thus we present AUS that emphasizes uncertain samples and exploits an adaptive weighted complement entropy objective to encourage incorrect classes to have uniform and low prediction scores. Experimental results on multiple benchmarks demonstrate our BA$^3$US surpasses state-of-the-arts for partial domain adaptation tasks. Code is available at \url{https://github.com/tim-learn/BA3US}.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.02541")
get_code_for_paper("2003.02541")
have("2003.02541")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.02541.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.02541)
Connect an agent — have() is free.