{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/fig2data","entry":"fig2data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":4,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2511.06856","paper":"/paper/arxiv-2511-06856","title":"Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"ngushchin/LightSB","path":"src/plotters.py","file_url":"https://github.com/ngushchin/LightSB/blob/HEAD/src/plotters.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"910de59edc0ed1b0","mcp_get_code":{"code_sha256":"910de59edc0ed1b0"}},{"arxiv_id":"2405.14449","paper":"/paper/adversarial-schrodinger-bridge-matching","title":"Adversarial Schrödinger Bridge Matching","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daniil-selikhanovych/asbm","path":"bench_utils.py","file_url":"https://github.com/daniil-selikhanovych/asbm/blob/HEAD/bench_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"910de59edc0ed1b0","mcp_get_code":{"code_sha256":"910de59edc0ed1b0"}},{"arxiv_id":"2310.01174","paper":"/paper/light-schrodinger-bridge","title":"Light Schrödinger Bridge","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngushchin/lightsb","path":"src/plotters.py","file_url":"https://github.com/ngushchin/lightsb/blob/HEAD/src/plotters.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"910de59edc0ed1b0","mcp_get_code":{"code_sha256":"910de59edc0ed1b0"}},{"arxiv_id":"2303.13744","paper":"/paper/conditional-image-to-video-generation-with","title":"Conditional Image-to-Video Generation with Latent Flow Diffusion Models","date":"2023-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nihaomiao/CVPR23_LFDM","path":"misc.py","file_url":"https://github.com/nihaomiao/CVPR23_LFDM/blob/HEAD/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"910de59edc0ed1b0","mcp_get_code":{"code_sha256":"910de59edc0ed1b0"}},{"arxiv_id":"2205.15269","paper":"/paper/kernel-neural-optimal-transport","title":"Kernel Neural Optimal Transport","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamalexkorotin/neuraloptimaltransport","path":"src/tools.py","file_url":"https://github.com/iamalexkorotin/neuraloptimaltransport/blob/HEAD/src/tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"910de59edc0ed1b0","mcp_get_code":{"code_sha256":"910de59edc0ed1b0"}},{"arxiv_id":"2201.12220","paper":"/paper/neural-optimal-transport","title":"Neural Optimal Transport","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamalexkorotin/KernelNeuralOptimalTransport","path":"src/tools.py","file_url":"https://github.com/iamalexkorotin/KernelNeuralOptimalTransport/blob/HEAD/src/tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"910de59edc0ed1b0","mcp_get_code":{"code_sha256":"910de59edc0ed1b0"}},{"arxiv_id":"2106.01954","paper":"/paper/do-neural-optimal-transport-solvers-work-a","title":"Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamalexkorotin/Wasserstein2Barycenters","path":"src/tools.py","file_url":"https://github.com/iamalexkorotin/Wasserstein2Barycenters/blob/HEAD/src/tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"910de59edc0ed1b0","mcp_get_code":{"code_sha256":"910de59edc0ed1b0"}},{"arxiv_id":"2010.03409","paper":"/paper/learning-mesh-based-simulation-with-graph-1","title":"Learning Mesh-Based Simulation with Graph Networks","date":"2020-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"echowve/meshGraphNets_pytorch","path":"render_results.py","file_url":"https://github.com/echowve/meshGraphNets_pytorch/blob/HEAD/render_results.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e7e2742326c28429","mcp_get_code":{"code_sha256":"e7e2742326c28429"}},{"arxiv_id":"2007.05929","paper":"/paper/data-efficient-reinforcement-learning-with-1","title":"Data-Efficient Reinforcement Learning with Self-Predictive Representations","date":"2020-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mila-iqia/spr","path":"src/utils.py","file_url":"https://github.com/mila-iqia/spr/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01ea1c18cea4f892","mcp_get_code":{"code_sha256":"01ea1c18cea4f892"}},{"arxiv_id":"1806.09045","paper":"/paper/variational-wasserstein-clustering","title":"Variational Wasserstein Clustering","date":"2018-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icemiliang/pyvot","path":"utils_numpy.py","file_url":"https://github.com/icemiliang/pyvot/blob/HEAD/utils_numpy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e5583a6771abb4c3","mcp_get_code":{"code_sha256":"e5583a6771abb4c3"}}]}