3 of 11 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; 1 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 1 failure of our instrument; 8 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.12220.json · badge: /api/ran/2201.12220.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 |
|---|---|---|
| milenagazdieva/extremalneuraloptimaltransport | community (classifier label) classifier basis not recorded on the link |
2 ran · 7 no recorded run |
| iamalexkorotin/KernelNeuralOptimalTransport | extension (classifier label) classifier basis: classifier_2025 |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| downsample | Ran ran on a synthesized input |
milenagazdieva/extremalneuraloptimaltransport/src/tools.py code served (permissive licence) · get_code("11c9838304ae9c60") 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 Tensor, ndim 4, dtype family float, shape (2, 4, 2, 1) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| ewma | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
iamalexkorotin/KernelNeuralOptimalTransport/src/tools.py code served (permissive licence) · get_code("07c1c7fb63590df6") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Sonnet 4.5, prompt python_fixture_v1) and returned ndarray, ndim 1, dtype family float, shape (10,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| imread | Ran ran, honoured the contract we drafted |
milenagazdieva/extremalneuraloptimaltransport/src/fid_score.py pointer only (licence: MIT); the stored copy get_code serves, from zmtomorrow/mmdgs_neurips, is pointer only (licence: NONE) · get_code("aa4cae054b657ba2") 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 zmtomorrow/mmdgs_neurips, 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. |
| calculate_frechet_distance | Not yet run unverified (harvested, no recorded run) |
milenagazdieva/extremalneuraloptimaltransport/src/fid_score.py code served (permissive licence) · get_code("0def50a351111624") How it ranno invocation recorded. this sample carries JSON test cases instead of a setup block; get_reference_implementation serves them with the level they back. |
| fid_inception_v3 | Not yet run unverified (harvested, no recorded run) |
milenagazdieva/extremalneuraloptimaltransport/src/inception.py code served (permissive licence) · get_code("8ff6404a564b7968") How it ranno invocation recorded. |
| fig2data | Not yet run unverified (harvested, no recorded run) |
iamalexkorotin/KernelNeuralOptimalTransport/src/tools.py code served (permissive licence) · get_code("910de59edc0ed1b0") How it ranno invocation recorded. |
| get_activations | Not yet run unverified (harvested, no recorded run) |
milenagazdieva/extremalneuraloptimaltransport/src/fid_score.py pointer only (licence: MIT); the stored copy get_code serves, from zmtomorrow/mmdgs_neurips, is pointer only (licence: NONE) · get_code("56afde1af5757691") 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 zmtomorrow/mmdgs_neurips, 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. |
| load_dataset | Not yet run unverified (harvested, no recorded run) |
milenagazdieva/extremalneuraloptimaltransport/src/tools.py code served (permissive licence) · get_code("39610c5d46a53332") How it ranno invocation recorded. |
| plot_W_images | Not yet run unverified (harvested, no recorded run) |
milenagazdieva/extremalneuraloptimaltransport/src/plotters.py code served (permissive licence) · get_code("6eb9f1f3b93e1d07") How it ranno invocation recorded. |
| plot_images | Not yet run unverified (harvested, no recorded run) |
milenagazdieva/extremalneuraloptimaltransport/src/plotters.py code served (permissive licence) · get_code("9329f2ba14c5d5ba") How it ranno invocation recorded. |
| plot_random_images | Not yet run unverified (harvested, no recorded run) |
milenagazdieva/extremalneuraloptimaltransport/src/plotters.py code served (permissive licence) · get_code("92a9e27a14501d15") How it ranno invocation recorded. |
Of 11 samples lifted from this paper's linked repositories, 11 carry a function identity and 0 do not. Of the 11 distinct functions with an identity, 8 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 0 the same month, 8 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| calculate_frechet_distance | 74 other papers 24 dated earlier, 50 later |
1610.09585 (2016-10) Conditional Image Synthesis With Auxiliary Classifier GANs |
1706.08500 (2017-06) GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium 1807.11458 (2018-07) To learn image super-resolution, use a GAN to learn how to do image degradation first and 71 more not named here |
| imread | 12 other papers 3 dated earlier, 9 later |
2009.05475 (2020-09) Adversarial score matching and improved sampling for image generation |
2106.01954 (2021-06) Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark 2112.05134 (2021-12) A Shared Representation for Photorealistic Driving Simulators and 9 more not named here |
| get_activations | 10 other papers 2 dated earlier, 8 later |
2106.01954 (2021-06) Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark |
2112.05134 (2021-12) A Shared Representation for Photorealistic Driving Simulators 2205.15269 (2022-05) Kernel Neural Optimal Transport and 7 more not named here |
| fig2data | 8 other papers 3 dated earlier, 5 later |
1806.09045 (2018-06) Variational Wasserstein Clustering |
2007.05929 (2020-07) Data-Efficient Reinforcement Learning with Self-Predictive Representations 2106.01954 (2021-06) Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark and 5 more not named here |
| ewma | 2 other papers 1 dated earlier, 1 later |
2106.01954 (2021-06) Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark |
2205.15269 (2022-05) Kernel Neural Optimal Transport |
| fid_inception_v3 | 1 other paper 1 later |
2205.15269 (2022-05) Kernel Neural Optimal Transport |
|
| plot_images | 1 other paper 1 later |
2205.15269 (2022-05) Kernel Neural Optimal Transport |
|
| plot_random_images | 1 other paper 1 later |
2205.15269 (2022-05) Kernel Neural Optimal Transport |
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 present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. To justify the usage of neural networks, we prove that they are universal approximators of transport plans between probability distributions. We evaluate the performance of our optimal transport algorithm on toy examples and on the unpaired image-to-image translation.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.12220")
get_code_for_paper("2201.12220")
have("2201.12220")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.12220.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.12220)
Connect an agent — have() is free.