9 of 13 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 0 have no contract verdict; 8 failures of our instrument; 4 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/2310.01174.json · badge: /api/ran/2310.01174.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 |
|---|---|---|
| ngushchin/lightsb | canonical (classifier label) classifier basis not recorded on the link |
9 ran · 4 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| decode | Ran ran; our contract draft was wrong, not the code |
ngushchin/lightsb/ALAE/alae_ffhq_inference.py code served (permissive licence) · get_code("c20cc362e7fc6f55") 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 2, dtype family float, shape (10, 4) 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.
|
| encode | Ran ran; our contract draft was wrong, not the code |
ngushchin/lightsb/ALAE/alae_ffhq_inference.py code served (permissive licence) · get_code("343978ea7f961051") 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 3, dtype family float, shape (1, 6, 5) 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.
|
| kl | Ran ran; our contract draft was wrong, not the code |
ngushchin/lightsb/ALAE/losses.py code served (permissive licence) · get_code("96e5a2bdc93b101d") 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 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.
|
| parse_meta_mat | Ran ran; our contract draft was wrong, not the code |
ngushchin/lightsb/ALAE/dataset_preparation/prepare_imagenet.py code served (permissive licence) · get_code("fa9606a3ab19942d") 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 tuple, ndim 1, 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.
|
| parse_val_groundtruth_txt | Ran ran, honoured the contract we drafted |
ngushchin/lightsb/ALAE/dataset_preparation/prepare_imagenet.py code served (permissive licence) · get_code("a928de007e90f17d") 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 list, ndim 1, dtype family int; 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.
|
| pixel_norm | Ran ran; our contract draft was wrong, not the code |
ngushchin/lightsb/ALAE/net.py code served (permissive licence) · get_code("a320e6151da0b774") 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 2, dtype family float, shape (2, 4) 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.
|
| reconstruction | Ran ran; our contract draft was wrong, not the code |
ngushchin/lightsb/ALAE/losses.py code served (permissive licence) · get_code("d1629b5dc1a4aac0") 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 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.
|
| style_mod | Ran ran; our contract draft was wrong, not the code |
ngushchin/lightsb/ALAE/net.py pointer only (licence: MIT); the stored copy get_code serves, from podgorskiy/StyleGAN_Blobless, is pointer only (licence: NONE) · get_code("6df6223c6a733719") 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 podgorskiy/StyleGAN_Blobless, 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. |
| upscale2d | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
ngushchin/lightsb/ALAE/net.py pointer only (licence: MIT); the stored copy get_code serves, from podgorskiy/StyleGAN_Blobless, is pointer only (licence: NONE) · get_code("10f278fd8f76579c") 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 podgorskiy/StyleGAN_Blobless, 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. |
| discriminator_logistic_simple_gp | Not yet run unverified (harvested, no recorded run) |
ngushchin/lightsb/ALAE/losses.py code served (permissive licence) · get_code("f4fc729366d8c63c") How it ranno invocation recorded. |
| fig2data | Not yet run unverified (harvested, no recorded run) |
ngushchin/lightsb/src/plotters.py code served (permissive licence) · get_code("910de59edc0ed1b0") How it ranno invocation recorded. |
| fig2img | Not yet run unverified (harvested, no recorded run) |
ngushchin/lightsb/src/plotters.py code served (permissive licence) · get_code("5d9a01fa212bd744") How it ranno invocation recorded. |
| get_model_dict | Not yet run unverified (harvested, no recorded run) |
ngushchin/lightsb/ALAE/checkpointer.py code served (permissive licence) · get_code("424dcbf4c7ecc430") How it ranno invocation recorded. |
Of 13 samples lifted from this paper's linked repositories, 13 carry a function identity and 0 do not. Of the 13 distinct functions with an identity, 13 are also present in other papers whose code we hold (7 with at least one paper dated earlier, 0 the same month, 13 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 |
|---|---|---|---|
| fig2data | 8 other papers 6 dated earlier, 2 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 |
| upscale2d | 6 other papers 2 dated earlier, 4 later |
1807.07543 (2018-07) Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer |
1812.04948 (2018-12) A Style-Based Generator Architecture for Generative Adversarial Networks 2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching and 3 more not named here |
| kl | 5 other papers 1 dated earlier, 4 later |
1807.07543 (2018-07) Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching 2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges and 2 more not named here |
| pixel_norm | 5 other papers 1 dated earlier, 4 later |
1807.07543 (2018-07) Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching 2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges and 2 more not named here |
| reconstruction | 5 other papers 1 dated earlier, 4 later |
1807.07543 (2018-07) Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching 2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges and 2 more not named here |
| style_mod | 5 other papers 1 dated earlier, 4 later |
1812.04948 (2018-12) A Style-Based Generator Architecture for Generative Adversarial Networks |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching 2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges and 2 more not named here |
| discriminator_logistic_simple_gp | 4 other papers 4 later |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching |
2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges 2602.02241 (2026-02) Variational Entropic Optimal Transport and 1 more not named here |
| fig2img | 4 other papers 2 dated earlier, 2 later |
1805.09190 (2018-05) Towards the first adversarially robust neural network model on MNIST |
2106.01954 (2021-06) Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark 2405.14449 (2024-05) Adversarial Schrödinger Bridge Matching and 1 more not named here |
| decode | 3 other papers 3 later |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching |
2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges 2602.02241 (2026-02) Variational Entropic Optimal Transport |
| encode | 3 other papers 3 later |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching |
2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges 2602.02241 (2026-02) Variational Entropic Optimal Transport |
| get_model_dict | 3 other papers 3 later |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching |
2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges 2602.02241 (2026-02) Variational Entropic Optimal Transport |
| parse_meta_mat | 3 other papers 3 later |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching |
2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges 2602.02241 (2026-02) Variational Entropic Optimal Transport |
| parse_val_groundtruth_txt | 3 other papers 3 later |
2402.03207 (2024-02) Light and Optimal Schrödinger Bridge Matching |
2511.06856 (2025-11) Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges 2602.02241 (2026-02) Variational Entropic 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.
Despite the recent advances in the field of computational Schrödinger Bridges (SB), most existing SB solvers are still heavy-weighted and require complex optimization of several neural networks. It turns out that there is no principal solver which plays the role of simple-yet-effective baseline for SB just like, e.g., $k$-means method in clustering, logistic regression in classification or Sinkhorn algorithm in discrete optimal transport. We address this issue and propose a novel fast and simple SB solver. Our development is a smart combination of two ideas which recently appeared in the field: (a) parameterization of the Schrödinger potentials with sum-exp quadratic functions and (b) viewing the log-Schrödinger potentials as the energy functions. We show that combined together these ideas yield a lightweight, simulation-free and theoretically justified SB solver with a simple straightforward optimization objective. As a result, it allows solving SB in moderate dimensions in a matter of minutes on CPU without a painful hyperparameter selection. Our light solver resembles the Gaussian mixture model which is widely used for density estimation. Inspired by this similarity, we also prove an important theoretical result showing that our light solver is a universal approximator of SBs. Furthemore, we conduct the analysis of the generalization error of our light solver. The code for our solver can be found at https://github.com/ngushchin/LightSB
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.01174")
get_code_for_paper("2310.01174")
have("2310.01174")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2310.01174.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2310.01174)
Connect an agent — have() is free.