{"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/actnorm","entry":"ActNorm","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":10,"n_papers_ran_no_instrument_failure":10,"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":15,"n_samples_ran":15,"n_samples_constructed":12,"n_samples_ran_checked":15,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":9,"n_places":15,"n_places_pointer_only":4,"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":15,"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":"2403.07874","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-text-frozen-large-language-models-in","title":"Beyond Text: Frozen Large Language Models in Visual Signal Comprehension","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zh460045050/V2L-Tokenizer","path":"models/models_v2l.py","file_url":"https://github.com/zh460045050/V2L-Tokenizer/blob/HEAD/models/models_v2l.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zh460045050/V2L-Tokenizer when it was checked","code_sha256":"83318aade307ecf5","code_sha256_prefix":"83318aade307ecf5","mcp_get_code":{"code_sha256":"83318aade307ecf5"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"62239b0f787c9409","code_sha256_prefix":"62239b0f787c9409","mcp_get_code":{"code_sha256":"62239b0f787c9409"}},{"arxiv_id":"2106.05275","arxiv_id_is_arxiv":true,"paper":"/paper/tractable-density-estimation-on-learned","title":"Tractable Density Estimation on Learned Manifolds with Conformal Embedding Flows","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"layer6ai-labs/CEF","path":"nflows/transforms/conformal.py","file_url":"https://github.com/layer6ai-labs/CEF/blob/HEAD/nflows/transforms/conformal.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bd6bbeba4a14e67c","code_sha256_prefix":"bd6bbeba4a14e67c","mcp_get_code":{"code_sha256":"bd6bbeba4a14e67c"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","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":"67d781f4602f02f5","code_sha256_prefix":"67d781f4602f02f5","mcp_get_code":{"code_sha256":"67d781f4602f02f5"}},{"arxiv_id":"2105.04551","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-image-to-video-synthesis-using","title":"Stochastic Image-to-Video Synthesis using cINNs","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompVis/image2video-synthesis-using-cINNs","path":"stage2_cINN/modules/flow_blocks.py","file_url":"https://github.com/CompVis/image2video-synthesis-using-cINNs/blob/HEAD/stage2_cINN/modules/flow_blocks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2651b54a261ca07","code_sha256_prefix":"d2651b54a261ca07","mcp_get_code":{"code_sha256":"d2651b54a261ca07"}},{"arxiv_id":"2006.14154","arxiv_id_is_arxiv":true,"paper":"/paper/strictly-batch-imitation-learning-by-energy","title":"Strictly Batch Imitation Learning by Energy-based Distribution Matching","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wgrathwohl/JEM","path":"train_wrn_ebm.py","file_url":"https://github.com/wgrathwohl/JEM/blob/HEAD/train_wrn_ebm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c22f2d08409192a0","code_sha256_prefix":"c22f2d08409192a0","mcp_get_code":{"code_sha256":"c22f2d08409192a0"}},{"arxiv_id":"2006.06485","arxiv_id_is_arxiv":true,"paper":"/paper/deep-structural-causal-models-for-tractable","title":"Deep Structural Causal Models for Tractable Counterfactual Inference","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/deepscm","path":"deepscm/experiments/morphomnist/nf/conditional_flow_sem.py","file_url":"https://github.com/biomedia-mira/deepscm/blob/HEAD/deepscm/experiments/morphomnist/nf/conditional_flow_sem.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":"f68de70f80950eeb","code_sha256_prefix":"f68de70f80950eeb","mcp_get_code":{"code_sha256":"f68de70f80950eeb"}},{"arxiv_id":"2006.04598","arxiv_id_is_arxiv":true,"paper":"/paper/wavenode-a-continuous-normalizing-flow-for","title":"WaveNODE: A Continuous Normalizing Flow for Speech Synthesis","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ANLGBOY/WaveNODE","path":"model.py","file_url":"https://github.com/ANLGBOY/WaveNODE/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ANLGBOY/WaveNODE when it was checked","code_sha256":"4fa32e8020935bfa","code_sha256_prefix":"4fa32e8020935bfa","mcp_get_code":{"code_sha256":"4fa32e8020935bfa"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"595f289e212c9b26","code_sha256_prefix":"595f289e212c9b26","mcp_get_code":{"code_sha256":"595f289e212c9b26"}},{"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":"chrischute/glow","path":"models/glow/glow.py","file_url":"https://github.com/chrischute/glow/blob/HEAD/models/glow/glow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"65fc1df1616202de","code_sha256_prefix":"65fc1df1616202de","mcp_get_code":{"code_sha256":"65fc1df1616202de"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0312a33dd14621de","code_sha256_prefix":"0312a33dd14621de","mcp_get_code":{"code_sha256":"0312a33dd14621de"}},{"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":"rhychen/Glow","path":"models/glow.py","file_url":"https://github.com/rhychen/Glow/blob/HEAD/models/glow.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, rhychen/Glow when it was checked","code_sha256":"dfdfca3351e28290","code_sha256_prefix":"dfdfca3351e28290","mcp_get_code":{"code_sha256":"dfdfca3351e28290"}},{"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":"ClaraBing/flow","path":"models/glow/glow.py","file_url":"https://github.com/ClaraBing/flow/blob/HEAD/models/glow/glow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bff339fa799f507","code_sha256_prefix":"3bff339fa799f507","mcp_get_code":{"code_sha256":"3bff339fa799f507"}},{"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":"KiUngSong/Generative-Models","path":"Glow/Glow_pytorch.py","file_url":"https://github.com/KiUngSong/Generative-Models/blob/HEAD/Glow/Glow_pytorch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28fdcb25a21f1a5e","code_sha256_prefix":"28fdcb25a21f1a5e","mcp_get_code":{"code_sha256":"28fdcb25a21f1a5e"}},{"arxiv_id":"1705.07057","arxiv_id_is_arxiv":true,"paper":"/paper/masked-autoregressive-flow-for-density","title":"Masked Autoregressive Flow for Density Estimation","date":"2017-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahkons/flows","path":"MAF/MAF.py","file_url":"https://github.com/mahkons/flows/blob/HEAD/MAF/MAF.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1497a8b2b937dd04","code_sha256_prefix":"1497a8b2b937dd04","mcp_get_code":{"code_sha256":"1497a8b2b937dd04"}}],"record_sha256":"e0b518da159988c881ac36ade9aeb133a892b880b2bced1211b6c5422a66259e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}