{"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/gaussian-log-p","entry":"gaussian_log_p","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2306.10161","arxiv_id_is_arxiv":true,"paper":"/paper/building-the-bridge-of-schrodinger-a-1","title":"Building the Bridge of Schrödinger: A Continuous Entropic Optimal Transport Benchmark","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngushchin/entropicotbenchmark","path":"benchmark/glow_model.py","file_url":"https://github.com/ngushchin/entropicotbenchmark/blob/HEAD/benchmark/glow_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0466e4f918aa9da0","code_sha256_prefix":"0466e4f918aa9da0","mcp_get_code":{"code_sha256":"0466e4f918aa9da0"}},{"arxiv_id":"2206.05075","arxiv_id_is_arxiv":true,"paper":"/paper/diffeomorphic-counterfactuals-with-generative","title":"Diffeomorphic Counterfactuals with Generative Models","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"annahdo/counterfactuals","path":"counterfactuals/generative_models/flows/glow.py","file_url":"https://github.com/annahdo/counterfactuals/blob/HEAD/counterfactuals/generative_models/flows/glow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"054f22912d47c960","code_sha256_prefix":"054f22912d47c960","mcp_get_code":{"code_sha256":"054f22912d47c960"}},{"arxiv_id":"2105.07239","arxiv_id_is_arxiv":true,"paper":"/paper/ageflow-conditional-age-progression-and","title":"AgeFlow: Conditional Age Progression and Regression with Normalizing Flows","date":"2021-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hzzone/AgeFlow","path":"flow/models.py","file_url":"https://github.com/Hzzone/AgeFlow/blob/HEAD/flow/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hzzone/AgeFlow when it was checked","code_sha256":"d5a077f28a1ff247","code_sha256_prefix":"d5a077f28a1ff247","mcp_get_code":{"code_sha256":"d5a077f28a1ff247"}},{"arxiv_id":"1912.01219","arxiv_id_is_arxiv":true,"paper":"/paper/waveflow-a-compact-flow-based-model-for-raw-1","title":"WaveFlow: A Compact Flow-based Model for Raw Audio","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"L0SG/WaveFlow","path":"functions.py","file_url":"https://github.com/L0SG/WaveFlow/blob/HEAD/functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"054f22912d47c960","code_sha256_prefix":"054f22912d47c960","mcp_get_code":{"code_sha256":"054f22912d47c960"}},{"arxiv_id":"1807.03039","arxiv_id_is_arxiv":true,"paper":"/paper/glow-generative-flow-with-invertible-1x1","title":"Glow: Generative Flow with Invertible 1x1 Convolutions","date":"2018-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosinality/glow-pytorch","path":"model.py","file_url":"https://github.com/rosinality/glow-pytorch/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0466e4f918aa9da0","code_sha256_prefix":"0466e4f918aa9da0","mcp_get_code":{"code_sha256":"0466e4f918aa9da0"}},{"arxiv_id":"Wang_Distribution-Consistent_Modal_Recovering_for_Incomplete_Multimodal_Learning_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Distribution-Consistent_Modal_Recovering_for_Incomplete_Multimodal_Learning_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mdswyz/DiCMoR","path":"trains/singleTask/model/glow.py","file_url":"https://github.com/mdswyz/DiCMoR/blob/HEAD/trains/singleTask/model/glow.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0466e4f918aa9da0","code_sha256_prefix":"0466e4f918aa9da0","mcp_get_code":{"code_sha256":"0466e4f918aa9da0"}}],"record_sha256":"8bd9e5c138e1a140573bffdc55530276b2f0d771cbbb25fc0c4547e023bbdbf6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}