7 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 0 have no contract verdict; 5 failures of our instrument; 3 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/2107.12585.json · badge: /api/ran/2107.12585.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 |
|---|---|---|
| tntek/N2DCX | canonical (classifier label) classifier basis: census |
7 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Entropy | Ran ran; our contract draft was wrong, not the code |
tntek/N2DCX/object/loss.py pointer only (licence: MIT); the stored copy get_code serves, from albert0147/aad_sfda, is pointer only (licence: NONE) · get_code("94b5622f0aa7add1") 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. |
| grl_hook | Ran ran; our contract draft was wrong, not the code |
tntek/N2DCX/object/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_train | Ran ran; our contract draft was wrong, not the code |
tntek/N2DCX/object/N2DCEX_target.py pointer only (licence: MIT); the stored copy get_code serves, from Albert0147/AaD_SFDA, is pointer only (licence: NONE) · get_code("35c2d572ebd185f5") 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. |
| l_loader | Ran ran, honoured the contract we drafted |
tntek/N2DCX/object/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. |
| lr_scheduler | Ran ran; our contract draft was wrong, not the code |
tntek/N2DCX/object/N2DCEX_target.py pointer only (licence: MIT); the stored copy get_code serves, from albert0147/aad_sfda, is pointer only (licence: NONE) · get_code("0b7ffc9f8b77529c") 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. |
| op_copy | Ran ran; our contract draft was wrong, not the code |
tntek/N2DCX/object/N2DCEX_target.py pointer only (licence: MIT); the stored copy get_code serves, from albert0147/aad_sfda, is pointer only (licence: NONE) · get_code("93a11f62e4a129f0") 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 |
tntek/N2DCX/object/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.
|
| CDAN | Not yet run unverified (harvested, no recorded run) |
tntek/N2DCX/object/loss.py pointer only (licence: MIT); the stored copy get_code serves, from thuml/CDAN, is pointer only (licence: NONE) · get_code("385d1e010dfb76a9") 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 thuml/CDAN, 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. |
| calc_coeff | Not yet run unverified (harvested, no recorded run) |
tntek/N2DCX/object/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) |
tntek/N2DCX/object/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, 10 are also present in other papers whose code we hold (10 with at least one paper dated earlier, 2 the same month, 10 later) and 0 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 |
|---|---|---|---|
| op_copy | 21 other papers 4 dated earlier, 17 later · 5 only as an assembly brick |
2002.08546 (2020-02) Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation |
2012.07297 (2020-12) Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer 2104.01539 (2021-04) DINE: Domain Adaptation from Single and Multiple Black-box Predictors and 18 more not named here |
| rgb_loader | 19 other papers 4 dated earlier, 15 later · 6 only as an assembly brick |
2003.02541 (2020-03) A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation |
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 and 16 more not named here |
| lr_scheduler | 18 other papers 4 dated earlier, 14 later · 3 only as an assembly brick |
2002.08546 (2020-02) Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation |
2012.07297 (2020-12) Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer 2104.01539 (2021-04) DINE: Domain Adaptation from Single and Multiple Black-box Predictors and 15 more not named here |
| l_loader | 17 other papers 3 dated earlier, 14 later · 5 only as an assembly brick |
2003.02541 (2020-03) A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation |
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 and 14 more not named here |
| Entropy | 16 other papers 3 dated earlier, 13 later · 4 only as an assembly brick |
2007.14612 (2020-07) Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation |
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 and 13 more not named here |
| make_dataset | 15 other papers 5 dated earlier, 10 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 2003.02541 (2020-03) A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation and 12 more not named here |
| calc_coeff | 14 other papers 6 dated earlier, 1 the same month, 7 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 6 dated earlier, 1 the same month, 5 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 |
| image_train | 8 other papers 2 dated earlier, 6 later · 2 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 Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper (2022 (year only)) DINE: Domain Adaptation from Single and Multiple Black-box Predictors and 5 more not named here |
| CDAN | 4 other papers 2 dated earlier, 2 later |
2007.14612 (2020-07) Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation |
2104.01539 (2021-04) DINE: Domain Adaptation from Single and Multiple Black-box Predictors 2208.07591 (2022-08) Uncertainty-guided Source-free Domain Adaptation and 1 more not named here |
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 the classic setting of unsupervised domain adaptation (UDA), the labeled source data are available in the training phase. However, in many real-world scenarios, owing to some reasons such as privacy protection and information security, the source data is inaccessible, and only a model trained on the source domain is available. This paper proposes a novel deep clustering method for this challenging task. Aiming at the dynamical clustering at feature-level, we introduce extra constraints hidden in the geometric structure between data to assist the process. Concretely, we propose a geometry-based constraint, named semantic consistency on the nearest neighborhood (SCNNH), and use it to encourage robust clustering. To reach this goal, we construct the nearest neighborhood for every target data and take it as the fundamental clustering unit by building our objective on the geometry. Also, we develop a more SCNNH-compliant structure with an additional semantic credibility constraint, named semantic hyper-nearest neighborhood (SHNNH). After that, we extend our method to this new geometry. Extensive experiments on three challenging UDA datasets indicate that our method achieves state-of-the-art results. The proposed method has significant improvement on all datasets (as we adopt SHNNH, the average accuracy increases by over 3.0% on the large-scaled dataset). Code is available at https://github.com/tntek/N2DCX.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2107.12585")
get_code_for_paper("2107.12585")
have("2107.12585")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2107.12585.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2107.12585)
Connect an agent — have() is free.