3 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, 1 violated it and 0 have 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/2201.12680.json · badge: /api/ran/2201.12680.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 |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| compute_diag_off_diag_avg | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from facebookresearch/luckmatters pointer only; the stored copy get_code serves, from facebookresearch/luckmatters, is pointer only (licence: NOASSERTION) · get_code("d3baec476b355c8d") 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. |
| fit_diag_11 | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from facebookresearch/luckmatters pointer only; the stored copy get_code serves, from facebookresearch/luckmatters, is pointer only (licence: NOASSERTION) · get_code("397c623e247709b3") 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. |
| modular_addition | Ran ran, violated the contract we drafted |
this paper's copy was not recorded; identical code first harvested from facebookresearch/luckmatters pointer only; the stored copy get_code serves, from facebookresearch/luckmatters, is pointer only (licence: NOASSERTION) · get_code("71713a75d37f00c5") 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, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 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 |
|---|---|---|---|
| compute_diag_off_diag_avg | 1 other paper 1 later |
2410.01779 (2024-10) Composing Global Solutions to Reasoning Tasks via Algebraic Objects in Neural Nets |
|
| fit_diag_11 | 1 other paper 1 later |
2410.01779 (2024-10) Composing Global Solutions to Reasoning Tasks via Algebraic Objects in Neural Nets |
|
| modular_addition | 1 other paper 1 later |
2410.01779 (2024-10) Composing Global Solutions to Reasoning Tasks via Algebraic Objects in Neural Nets |
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.
We show that Contrastive Learning (CL) under a broad family of loss functions (including InfoNCE) has a unified formulation of coordinate-wise optimization on the network parameter $\boldsymbolθ$ and pairwise importance $α$, where the \emph{max player} $\boldsymbolθ$ learns representation for contrastiveness, and the \emph{min player} $α$ puts more weights on pairs of distinct samples that share similar representations. The resulting formulation, called $α$-CL, unifies not only various existing contrastive losses, which differ by how sample-pair importance $α$ is constructed, but also is able to extrapolate to give novel contrastive losses beyond popular ones, opening a new avenue of contrastive loss design. These novel losses yield comparable (or better) performance on CIFAR10, STL-10 and CIFAR-100 than classic InfoNCE. Furthermore, we also analyze the max player in detail: we prove that with fixed $α$, max player is equivalent to Principal Component Analysis (PCA) for deep linear network, and almost all local minima are global and rank-1, recovering optimal PCA solutions. Finally, we extend our analysis on max player to 2-layer ReLU networks, showing that its fixed points can have higher ranks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.12680")
get_code_for_paper("2201.12680")
have("2201.12680")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.12680.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.12680)
Connect an agent — have() is free.