{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/fig2img","entry":"fig2img","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d9a01fa212bd744","code_sha256_prefix":"5d9a01fa212bd744","mcp_get_code":{"code_sha256":"5d9a01fa212bd744"}},{"arxiv_id":"2405.19162","arxiv_id_is_arxiv":true,"paper":"/paper/does-learning-the-right-latent-variables","title":"Does learning the right latent variables necessarily improve in-context learning?","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericelmoznino/explicit_implicit_icl","path":"tasks/utils.py","file_url":"https://github.com/ericelmoznino/explicit_implicit_icl/blob/HEAD/tasks/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b13c1d83ae98c48","code_sha256_prefix":"2b13c1d83ae98c48","mcp_get_code":{"code_sha256":"2b13c1d83ae98c48"}},{"arxiv_id":"2405.14449","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, daniil-selikhanovych/asbm when it was checked","code_sha256":"5d9a01fa212bd744","code_sha256_prefix":"5d9a01fa212bd744","mcp_get_code":{"code_sha256":"5d9a01fa212bd744"}},{"arxiv_id":"2405.10093","arxiv_id_is_arxiv":true,"paper":"/paper/lat-pfn-a-joint-embedding-predictive","title":"LaT-PFN: A Joint Embedding Predictive Architecture for In-context Time-series Forecasting","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stijnverdenius/lat-pfn","path":"util/metrics.py","file_url":"https://github.com/stijnverdenius/lat-pfn/blob/HEAD/util/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, stijnverdenius/lat-pfn, is not in the permissive set Syntology serves inline","code_sha256":"0c10ac60c21bd3ce","code_sha256_prefix":"0c10ac60c21bd3ce","mcp_get_code":{"code_sha256":"0c10ac60c21bd3ce"}},{"arxiv_id":"2402.12095","arxiv_id_is_arxiv":true,"paper":"/paper/major-tom-expandable-datasets-for-earth","title":"Major TOM: Expandable Datasets for Earth Observation","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ESA-PhiLab/Major-TOM","path":"MajorTOM/extras/coverage_vis.py","file_url":"https://github.com/ESA-PhiLab/Major-TOM/blob/HEAD/MajorTOM/extras/coverage_vis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"759e1b4914b196e1","code_sha256_prefix":"759e1b4914b196e1","mcp_get_code":{"code_sha256":"759e1b4914b196e1"}},{"arxiv_id":"2311.08243","arxiv_id_is_arxiv":true,"paper":"/paper/mcmc-to-address-model-misspecification-in","title":"MCMC to address model misspecification in Deep Learning classification of Radio Galaxies","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"devinamhn/radiogalaxies-bnns","path":"radiogalaxies_bnns/eval/mightee/mightee_inference.py","file_url":"https://github.com/devinamhn/radiogalaxies-bnns/blob/HEAD/radiogalaxies_bnns/eval/mightee/mightee_inference.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"55c2041f06386cb1","code_sha256_prefix":"55c2041f06386cb1","mcp_get_code":{"code_sha256":"55c2041f06386cb1"}},{"arxiv_id":"2310.01174","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d9a01fa212bd744","code_sha256_prefix":"5d9a01fa212bd744","mcp_get_code":{"code_sha256":"5d9a01fa212bd744"}},{"arxiv_id":"2106.01954","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d9a01fa212bd744","code_sha256_prefix":"5d9a01fa212bd744","mcp_get_code":{"code_sha256":"5d9a01fa212bd744"}},{"arxiv_id":"1810.05934","arxiv_id_is_arxiv":true,"paper":"/paper/massively-parallel-hyperparameter-tuning","title":"A System for Massively Parallel Hyperparameter Tuning","date":"2018-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukashedegaard/ride","path":"ride/logging.py","file_url":"https://github.com/lukashedegaard/ride/blob/HEAD/ride/logging.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ac34a74721355dc","code_sha256_prefix":"1ac34a74721355dc","mcp_get_code":{"code_sha256":"1ac34a74721355dc"}},{"arxiv_id":"1806.09045","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33150c54d7f9eeb9","code_sha256_prefix":"33150c54d7f9eeb9","mcp_get_code":{"code_sha256":"33150c54d7f9eeb9"}},{"arxiv_id":"1805.09190","arxiv_id_is_arxiv":true,"paper":"/paper/towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bethgelab/AnalysisBySynthesis","path":"abs_models/visualization.py","file_url":"https://github.com/bethgelab/AnalysisBySynthesis/blob/HEAD/abs_models/visualization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da2ea3c124b9c9ab","code_sha256_prefix":"da2ea3c124b9c9ab","mcp_get_code":{"code_sha256":"da2ea3c124b9c9ab"}}],"record_sha256":"975b15d3655e97163d71eef5aa76e50255c1c84e311148774346c7a7cc5e3f91","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}