Songcan Chen, Meng Cao, Jiexi Liu
2 of 6 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 1 failure of our instrument; 4 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/2601.21999.json · badge: /api/ran/2601.21999.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 |
|---|---|---|
| Alrash/NDCL | community Papers with Code archive |
2 ran · 4 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Classifier | Ran ran; our contract draft was wrong, not the code |
Alrash/NDCL/src/algorithms.py code served (permissive licence) · get_code("ce7990d7ad5821ff") 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 Linear. 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.
|
| MNIST_CNN | Ran ran on a synthesized input · constructed an object; no result was computed |
Alrash/NDCL/src/algorithms.py code served (permissive licence) · get_code("e1494c5ebd38c29b") 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 an instance of its own class, MNIST_CNN: the run constructed the object and did not call it, so no result was computed. 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.
|
| ERM | Not yet run unverified (harvested, no recorded run) |
Alrash/NDCL/src/algorithms.py code served (permissive licence) · get_code("8ce4296f1a8be155") How it ranno invocation recorded. |
| Featurizer | Not yet run unverified (harvested, no recorded run) |
Alrash/NDCL/src/algorithms.py code served (permissive licence) · get_code("5586e626465a1519") How it ranno invocation recorded. |
| NDCL | Not yet run unverified (harvested, no recorded run) |
Alrash/NDCL/src/algorithms.py code served (permissive licence) · get_code("7a80487812b24274") How it ranno invocation recorded. |
| ResNet | Not yet run unverified (harvested, no recorded run) |
Alrash/NDCL/src/algorithms.py code served (permissive licence) · get_code("087d5e3cc47ba644") How it ranno invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 4 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 0 the same month, 1 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 |
|---|---|---|---|
| Classifier brick of this paper's assembly: helper |
24 other papers 22 dated earlier, 2 later · 4 only as an assembly brick |
2106.02266 (2021-06) SAND-mask: An Enhanced Gradient Masking Strategy for the Discovery of Invariances in Domain Generalization |
2111.12853 (2021-11) Domain Prompt Learning for Efficiently Adapting CLIP to Unseen Domains 2205.09739 (2022-05) Diverse Weight Averaging for Out-of-Distribution Generalization and 21 more not named here |
| MNIST_CNN brick of this paper's assembly: helper |
3 other papers 3 dated earlier · 3 only as an assembly brick |
2205.14546 (2022-05) The Missing Invariance Principle Foundthe Reciprocal Twin of Invariant Risk Minimization |
2402.11682 (2024-02) Learning Conditional Invariances through Non-Commutativity 2502.04242 (2025-02) A High-Dimensional Statistical Method for Optimizing Transfer Quantities in Multi-Source Transfer Learning |
| Featurizer brick of this paper's assembly: helper |
1 other paper 1 dated earlier · 1 only as an assembly brick |
2402.11682 (2024-02) Learning Conditional Invariances through Non-Commutativity |
|
| ResNet brick of this paper's assembly: helper |
1 other paper 1 dated earlier · 1 only as an assembly brick |
2402.11682 (2024-02) Learning Conditional Invariances through Non-Commutativity |
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.
Imbalanced Domain Generalization (IDG) focuses on mitigating both domain and label shifts, both of which fundamentally shape the model's decision boundaries, particularly under heterogeneous long-tailed distributions across domains. Despite its practical significance, it remains underexplored, primarily due to the technical complexity of handling their entanglement and the paucity of theoretical foundations. In this paper, we begin by theoretically establishing the generalization bound for IDG, highlighting the role of posterior discrepancy and decision margin. This bound motivates us to focus on directly steering decision boundaries, marking a clear departure from existing methods. Subsequently, we technically propose a novel Negative-Dominant Contrastive Learning (NDCL) for IDG to enhance discriminability while enforce posterior consistency across domains. Specifically, inter-class decision-boundary separation is enhanced by placing greater emphasis on negatives as the primary signal in our contrastive learning, naturally amplifying gradient signals for minority classes to avoid the decision boundary being biased toward majority classes. Meanwhile, intra-class compactness is encouraged through a re-weighted cross-entropy strategy, and posterior consistency across domains is enforced through a prediction-central alignment strategy. Finally, rigorous yet challenging experiments on benchmarks validate the effectiveness of our NDCL. The code is available at https://github.com/Alrash/NDCL.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2601.21999")
get_code_for_paper("2601.21999")
have("2601.21999")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2601.21999.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2601.21999)
Connect an agent — have() is free.