Jung-Eun Kim, Varun Mulchandani
3 of 3 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; 2 failures of our instrument; 0 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/2503.18258.json · badge: /api/ran/2503.18258.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 |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
2 ran · 0 no recorded run |
| JEKimLab/ICLR2025_SpuriousDataPruning | marked official in Papers with Code Papers with Code archive |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| RobustLoss | Ran ran on a synthesized input · constructed an object; no result was computed |
JEKimLab/ICLR2025_SpuriousDataPruning/CelebA_experiments/joint_dro.py pointer only (licence: NONE) · get_code("56725d3f5a22cdcf") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, JEKimLab/ICLR2025_SpuriousDataPruning 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. |
| conv3x3 | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from lixiaotong97/DSU pointer only; the stored copy get_code serves, from lixiaotong97/DSU, is pointer only (licence: NONE) · get_code("fac5364e2f53c6db") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| cvar_value | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from daniellevy/fast-dro pointer only · get_code("2b8de0efd0313a25") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
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, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 1 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 |
|---|---|---|---|
| conv3x3 | 686 other papers 659 dated earlier, 1 the same month, 22 later, 4 same year, order not determinable · 31 only as an assembly brick |
1406.2661 (2014-06) Generative Adversarial Networks |
1409.0575 (2014-09) ImageNet Large Scale Visual Recognition Challenge 1412.6572 (2014-12) Explaining and Harnessing Adversarial Examples and 683 more not named here |
| cvar_value brick of this paper's assembly: helper |
5 other papers 5 dated earlier |
2010.05893 (2020-10) Large-Scale Methods for Distributionally Robust Optimization |
2302.02931 (2023-02) Bitrate-Constrained DRO: Beyond Worst Case Robustness To Unknown Group Shifts 2307.03306 (2023-07) When Fair Classification Meets Noisy Protected Attributes and 2 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.
Deep neural networks have been shown to learn and rely on spurious correlations present in the data that they are trained on. Reliance on such correlations can cause these networks to malfunction when deployed in the real world, where these correlations may no longer hold. To overcome the learning of and reliance on such correlations, recent studies propose approaches that yield promising results. These works, however, study settings where the strength of the spurious signal is significantly greater than that of the core, invariant signal, making it easier to detect the presence of spurious features in individual training samples and allow for further processing. In this paper, we identify new settings where the strength of the spurious signal is relatively weaker, making it difficult to detect any spurious information while continuing to have catastrophic consequences. We also discover that spurious correlations are learned primarily due to only a handful of all the samples containing the spurious feature and develop a novel data pruning technique that identifies and prunes small subsets of the training data that contain these samples. Our proposed technique does not require inferred domain knowledge, information regarding the sample-wise presence or nature of spurious information, or human intervention. Finally, we show that such data pruning attains state-ofthe-art performance on previously studied settings where spurious information is identifiable. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2503.18258")
get_code_for_paper("2503.18258")
have("2503.18258")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2503.18258.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2503.18258)
Connect an agent — have() is free.