5 of 7 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 3 have no contract verdict; 1 failure of our instrument; 2 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/2211.00820.json · badge: /api/ran/2211.00820.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 |
|---|---|---|
| bilocq/wgan-gp-benchmark | canonical (classifier label) classifier basis not recorded on the link |
3 ran · 2 no recorded run |
| bilocq/trust-the-critics-2 | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| celebaHQ | Ran ran on a synthesized input |
bilocq/wgan-gp-benchmark/GAN_utils/dataloader.py code served (permissive licence) · get_code("7dac7abef4a1eb65") 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 DataLoader. 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.
|
| find_good_mu | Ran ran, honoured the contract we drafted |
bilocq/trust-the-critics-2/denoise_eval.py code served (permissive licence) · get_code("151d97bcd06cb159") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 0, dtype family float, shape () 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.
|
| psnr_calc | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
bilocq/trust-the-critics-2/denoise_eval.py code served (permissive licence) · get_code("2ed34c0e319f8945") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned tuple, ndim 2, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| truncated_gaussian | Ran ran on a synthesized input |
bilocq/wgan-gp-benchmark/GAN_utils/truncated_gaussian.py code served (permissive licence) · get_code("6ca373fe5f6587c6") 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 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.
|
| truncated_noise | Ran ran on a synthesized input |
bilocq/wgan-gp-benchmark/GAN_utils/truncated_gaussian.py code served (permissive licence) · get_code("b5f953d10d8a6ead") 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 TruncNoiseLoader. 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.
|
| cifar10 | Not yet run unverified (harvested, no recorded run) |
bilocq/wgan-gp-benchmark/GAN_utils/dataloader.py code served (permissive licence) · get_code("b9c65b7f758882f5") How it ranno invocation recorded. |
| mnist | Not yet run unverified (harvested, no recorded run) |
bilocq/wgan-gp-benchmark/GAN_utils/dataloader.py code served (permissive licence) · get_code("09f7d661e9b06f58") How it ranno invocation recorded. |
Of 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 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 7 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Wasserstein 1 optimal transport maps provide a natural correspondence between points from two probability distributions, $μ$ and $ν$, which is useful in many applications. Available algorithms for computing these maps do not appear to scale well to high dimensions. In deep learning applications, efficient algorithms have been developed for approximating solutions of the dual problem, known as Kantorovich potentials, using neural networks (e.g. [Gulrajani et al., 2017]). Importantly, such algorithms work well in high dimensions. In this paper we present an approach towards computing Wasserstein 1 optimal transport maps that relies only on Kantorovich potentials. In general, a Wasserstein 1 optimal transport map is not unique and is not computable from a potential alone. Our main result is to prove that if $μ$ has a density and $ν$ is supported on a submanifold of codimension at least 2, an optimal transport map is unique and can be written explicitly in terms of a potential. These assumptions are natural in many image processing contexts and other applications. When the Kantorovich potential is only known approximately, our result motivates an iterative procedure wherein data is moved in optimal directions and with the correct average displacement. Since this provides an approach for transforming one distribution to another, it can be used as a multipurpose algorithm for various transport problems; we demonstrate through several proof of concept experiments that this algorithm successfully performs various imaging tasks, such as denoising, generation, translation and deblurring, which normally require specialized techniques.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2211.00820")
get_code_for_paper("2211.00820")
have("2211.00820")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2211.00820.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2211.00820)
Connect an agent — have() is free.