{"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/flow","entry":"Flow","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":10,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":13,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":5,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":9},"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":"2506.17197","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.17197","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"samuel-howard/Tree_SB_Matching_Barycentres","path":"run_BarycentreDSBM.py","file_url":"https://github.com/samuel-howard/Tree_SB_Matching_Barycentres/blob/HEAD/run_BarycentreDSBM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, samuel-howard/Tree_SB_Matching_Barycentres (NOASSERTION)","code_sha256":"44d4a2630940d979","code_sha256_prefix":"44d4a2630940d979","mcp_get_code":{"code_sha256":"44d4a2630940d979"}},{"arxiv_id":"2504.14889","arxiv_id_is_arxiv":true,"paper":"/paper/latent-bayesian-optimization-via","title":"Latent Bayesian Optimization via Autoregressive Normalizing Flows","date":"2025-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/NFBO","path":"generative_model/model/seqflow/flows.py","file_url":"https://github.com/mlvlab/NFBO/blob/HEAD/generative_model/model/seqflow/flows.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, mlvlab/NFBO when it was checked","code_sha256":"e1e4f90d57939772","code_sha256_prefix":"e1e4f90d57939772","mcp_get_code":{"code_sha256":"e1e4f90d57939772"}},{"arxiv_id":"2305.08457","arxiv_id_is_arxiv":true,"paper":"/paper/molhf-a-hierarchical-normalizing-flow-for","title":"MolHF: A Hierarchical Normalizing Flow for Molecular Graph Generation","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-sto/molhf","path":"models/MolHF.py","file_url":"https://github.com/violet-sto/molhf/blob/HEAD/models/MolHF.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":"9ac0aa08d59068b7","code_sha256_prefix":"9ac0aa08d59068b7","mcp_get_code":{"code_sha256":"9ac0aa08d59068b7"}},{"arxiv_id":"2304.04555","arxiv_id_is_arxiv":true,"paper":"/paper/neural-diffeomorphic-non-uniform-b-spline","title":"Neural Diffeomorphic Non-uniform B-spline Flows","date":"2023-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smhongok/Non-uniform-B-spline-Flow","path":"bgflow/bgflow/nn/flow/transformer/bspline.py","file_url":"https://github.com/smhongok/Non-uniform-B-spline-Flow/blob/HEAD/bgflow/bgflow/nn/flow/transformer/bspline.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, smhongok/Non-uniform-B-spline-Flow when it was checked","code_sha256":"a64d0dd1b2d81711","code_sha256_prefix":"a64d0dd1b2d81711","mcp_get_code":{"code_sha256":"a64d0dd1b2d81711"}},{"arxiv_id":"2206.08869","arxiv_id_is_arxiv":true,"paper":"/paper/fast-lossless-neural-compression-with-integer","title":"Fast Lossless Neural Compression with Integer-Only Discrete Flows","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/iodf","path":"core/models/flow.py","file_url":"https://github.com/thu-ml/iodf/blob/HEAD/core/models/flow.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":"e517bb3d3bd6c07d","code_sha256_prefix":"e517bb3d3bd6c07d","mcp_get_code":{"code_sha256":"e517bb3d3bd6c07d"}},{"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":"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, Hzzone/AgeFlow when it was checked","code_sha256":"afe7965aec801c93","code_sha256_prefix":"afe7965aec801c93","mcp_get_code":{"code_sha256":"afe7965aec801c93"}},{"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":"mahkons/flows","path":"models/CouplingLayer.py","file_url":"https://github.com/mahkons/flows/blob/HEAD/models/CouplingLayer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"21fa24b8b336cbae","code_sha256_prefix":"21fa24b8b336cbae","mcp_get_code":{"code_sha256":"21fa24b8b336cbae"}},{"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":"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":"30c625ed9a7499e6","code_sha256_prefix":"30c625ed9a7499e6","mcp_get_code":{"code_sha256":"30c625ed9a7499e6"}},{"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":"keonlee9420/VAENAR-TTS","path":"model/glow.py","file_url":"https://github.com/keonlee9420/VAENAR-TTS/blob/HEAD/model/glow.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":"a1fd2b4f40b70381","code_sha256_prefix":"a1fd2b4f40b70381","mcp_get_code":{"code_sha256":"a1fd2b4f40b70381"}},{"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":"vvvm23/glow","path":"glow/glow.py","file_url":"https://github.com/vvvm23/glow/blob/HEAD/glow/glow.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":"354000ff8c9ea2a9","code_sha256_prefix":"354000ff8c9ea2a9","mcp_get_code":{"code_sha256":"354000ff8c9ea2a9"}},{"arxiv_id":"1605.08803","arxiv_id_is_arxiv":true,"paper":"/paper/density-estimation-using-real-nvp","title":"Density estimation using Real NVP","date":"2016-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"li012589/NeuralRG","path":"flow/rnvp.py","file_url":"https://github.com/li012589/NeuralRG/blob/HEAD/flow/rnvp.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":"5f7fa08b89de722c","code_sha256_prefix":"5f7fa08b89de722c","mcp_get_code":{"code_sha256":"5f7fa08b89de722c"}},{"arxiv_id":"1505.05770","arxiv_id_is_arxiv":true,"paper":"/paper/variational-inference-with-normalizing-flows","title":"Variational Inference with Normalizing Flows","date":"2015-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhilippeNguyen/keras_normalizing_flows","path":"keras_normalizing_flows/layers/flows.py","file_url":"https://github.com/PhilippeNguyen/keras_normalizing_flows/blob/HEAD/keras_normalizing_flows/layers/flows.py","status":"ran","verification_level":1,"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, PhilippeNguyen/keras_normalizing_flows when it was checked","code_sha256":"c8c71c93d51e985b","code_sha256_prefix":"c8c71c93d51e985b","mcp_get_code":{"code_sha256":"c8c71c93d51e985b"}},{"arxiv_id":"1410.8516","arxiv_id_is_arxiv":true,"paper":"/paper/nice-non-linear-independent-components","title":"NICE: Non-linear Independent Components Estimation","date":"2014-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vincentstimper/normalizing-flows","path":"normflows/flows/affine/coupling.py","file_url":"https://github.com/vincentstimper/normalizing-flows/blob/HEAD/normflows/flows/affine/coupling.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":"5886cd39dfbd797e","code_sha256_prefix":"5886cd39dfbd797e","mcp_get_code":{"code_sha256":"5886cd39dfbd797e"}}],"record_sha256":"d92ad6a99433bd8a9c1aa532ff7ccbac2f25bf4eac4d7b5c5f3906b2fc32eb88","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}