1 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 0 have no contract verdict; 1 failure of our instrument; 2 no recorded run), measured 2026-11-21; 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/2002.01690.json · badge: /api/ran/2002.01690.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 |
|---|---|---|
| AI-NERC-NUPT/MEDM | reimplementation (classifier label) classifier basis: classifier_2025 |
1 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| one_hot | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
AI-NERC-NUPT/MEDM/MEDM_VisDA_Res50.py pointer only (licence: NONE) · get_code("a50f333caba99b0a") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, AI-NERC-NUPT/MEDM 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. |
| load_pretrain | Not yet run unverified (harvested, no recorded run) |
AI-NERC-NUPT/MEDM/MEDM_VisDA_Res50.py pointer only (licence: NONE) · get_code("c4b6347d684b8725") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, AI-NERC-NUPT/MEDM 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. |
| load_pretrain | Not yet run unverified (harvested, no recorded run) |
AI-NERC-NUPT/MEDM/MEDM_VisDA_Res101.py pointer only (licence: NONE) · get_code("d799243b9af18d37") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, AI-NERC-NUPT/MEDM 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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Entropy minimization has been widely used in unsupervised domain adaptation (UDA). However, existing works reveal that entropy minimization only may result into collapsed trivial solutions. In this paper, we propose to avoid trivial solutions by further introducing diversity maximization. In order to achieve the possible minimum target risk for UDA, we show that diversity maximization should be elaborately balanced with entropy minimization, the degree of which can be finely controlled with the use of deep embedded validation in an unsupervised manner. The proposed minimal-entropy diversity maximization (MEDM) can be directly implemented by stochastic gradient descent without use of adversarial learning. Empirical evidence demonstrates that MEDM outperforms the state-of-the-art methods on four popular domain adaptation datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.01690")
get_code_for_paper("2002.01690")
have("2002.01690")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.01690.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.01690)
Connect an agent — have() is free.