{"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/standard-normal-logprob","entry":"standard_normal_logprob","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":12,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":16,"n_places_pointer_only":10,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":0,"ran_draft_wrong":5,"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":"2609.13991","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-13991","title":"Mind2Cloud: EEG-to-Point Cloud Generation with Two-Granularity Diffusion Decoding","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"duasoi/Mind2Cloud","path":"PointCNN/model_PCNN/common.py","file_url":"https://github.com/duasoi/Mind2Cloud/blob/HEAD/PointCNN/model_PCNN/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, duasoi/Mind2Cloud when it was checked","code_sha256":"0b12695361f927fa","code_sha256_prefix":"0b12695361f927fa","mcp_get_code":{"code_sha256":"0b12695361f927fa"}},{"arxiv_id":"2605.16620","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16620","title":"SCOUT: Cyclic Causal Discovery Under Soft Interventions with Unknown Targets","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"alparturkoglu/scout-master","path":"models/scout_trainer.py","file_url":"https://github.com/alparturkoglu/scout-master/blob/HEAD/models/scout_trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alparturkoglu/scout-master when it was checked","code_sha256":"80f482ff6178b482","code_sha256_prefix":"80f482ff6178b482","mcp_get_code":{"code_sha256":"80f482ff6178b482"}},{"arxiv_id":"2605.16620","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16620","title":"SCOUT: Cyclic Causal Discovery Under Soft Interventions with Unknown Targets","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"alparturkoglu/scout-master","path":"datagen/structuralModels.py","file_url":"https://github.com/alparturkoglu/scout-master/blob/HEAD/datagen/structuralModels.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alparturkoglu/scout-master when it was checked","code_sha256":"fc7b06506cc03d26","code_sha256_prefix":"fc7b06506cc03d26","mcp_get_code":{"code_sha256":"fc7b06506cc03d26"}},{"arxiv_id":"2605.16620","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16620","title":"SCOUT: Cyclic Causal Discovery Under Soft Interventions with Unknown Targets","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"alparturkoglu/scout-master","path":"baselines/llc.py","file_url":"https://github.com/alparturkoglu/scout-master/blob/HEAD/baselines/llc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alparturkoglu/scout-master when it was checked","code_sha256":"d8e4ef0ca825d59e","code_sha256_prefix":"d8e4ef0ca825d59e","mcp_get_code":{"code_sha256":"d8e4ef0ca825d59e"}},{"arxiv_id":"2407.06250","arxiv_id_is_arxiv":true,"paper":"/paper/fairdiff-fair-segmentation-with-point-image","title":"FairDiff: Fair Segmentation with Point-Image Diffusion","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenyi-li/fairdiff","path":"PointMaskGen/models/common.py","file_url":"https://github.com/wenyi-li/fairdiff/blob/HEAD/PointMaskGen/models/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wenyi-li/fairdiff when it was checked","code_sha256":"1d6e462a448df843","code_sha256_prefix":"1d6e462a448df843","mcp_get_code":{"code_sha256":"1d6e462a448df843"}},{"arxiv_id":"2405.08322","arxiv_id_is_arxiv":true,"paper":"/paper/straightpcf-straight-point-cloud-filtering","title":"StraightPCF: Straight Point Cloud Filtering","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ddsediri/StraightPCF","path":"models/utils.py","file_url":"https://github.com/ddsediri/StraightPCF/blob/HEAD/models/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}},{"arxiv_id":"2402.06680","arxiv_id_is_arxiv":true,"paper":"/paper/social-physics-informed-diffusion-model-for","title":"Social Physics Informed Diffusion Model for Crowd Simulation","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/SPDiff","path":"models/common.py","file_url":"https://github.com/tsinghua-fib-lab/SPDiff/blob/HEAD/models/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tsinghua-fib-lab/SPDiff when it was checked","code_sha256":"1d6e462a448df843","code_sha256_prefix":"1d6e462a448df843","mcp_get_code":{"code_sha256":"1d6e462a448df843"}},{"arxiv_id":"2306.04675","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-flaws-of-generative-model-evaluation-1","title":"Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rtqichen/residual-flows","path":"qualitative_samples.py","file_url":"https://github.com/rtqichen/residual-flows/blob/HEAD/qualitative_samples.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}},{"arxiv_id":"2305.04847","arxiv_id_is_arxiv":true,"paper":"/paper/caloclouds-fast-geometry-independent-highly","title":"CaloClouds: Fast Geometry-Independent Highly-Granular Calorimeter Simulation","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flc-qu-hep/caloclouds-2","path":"models/common.py","file_url":"https://github.com/flc-qu-hep/caloclouds-2/blob/HEAD/models/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from wenyi-li/fairdiff, and GitHub detected no licence in that repository when it was checked","code_sha256":"1d6e462a448df843","code_sha256_prefix":"1d6e462a448df843","mcp_get_code":{"code_sha256":"1d6e462a448df843"}},{"arxiv_id":"2210.08176","arxiv_id_is_arxiv":true,"paper":"/paper/invertible-monotone-operators-for-normalizing","title":"Invertible Monotone Operators for Normalizing Flows","date":"2022-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/monotoneflows","path":"train_toy.py","file_url":"https://github.com/mlvlab/monotoneflows/blob/HEAD/train_toy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}},{"arxiv_id":"2103.09527","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-normalizing-flows-1","title":"Implicit Normalizing Flows","date":"2021-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}},{"arxiv_id":"2012.05942","arxiv_id_is_arxiv":true,"paper":"/paper/convex-potential-flows-universal-probability-1","title":"Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimization","date":"2020-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}},{"arxiv_id":"2008.02792","arxiv_id_is_arxiv":true,"paper":"/paper/caspr-learning-canonical-spatiotemporal-point","title":"CaSPR: Learning Canonical Spatiotemporal Point Cloud Representations","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davrempe/caspr","path":"caspr/models/utils.py","file_url":"https://github.com/davrempe/caspr/blob/HEAD/caspr/models/utils.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":"fa670bb69fb92a8f","code_sha256_prefix":"fa670bb69fb92a8f","mcp_get_code":{"code_sha256":"fa670bb69fb92a8f"}},{"arxiv_id":"2002.02798","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-train-your-neural-ode","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-hash-code/ffjord-rnode-finalweek-mnist","path":"train_misc.py","file_url":"https://github.com/D-hash-code/ffjord-rnode-finalweek-mnist/blob/HEAD/train_misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}},{"arxiv_id":"1906.02735","arxiv_id_is_arxiv":true,"paper":"/paper/residual-flows-for-invertible-generative","title":"Residual Flows for Invertible Generative Modeling","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eyalbetzalel/residual-flows","path":"qualitative_samples.py","file_url":"https://github.com/eyalbetzalel/residual-flows/blob/HEAD/qualitative_samples.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}},{"arxiv_id":"1811.00995","arxiv_id_is_arxiv":true,"paper":"/paper/invertible-residual-networks","title":"Invertible Residual Networks","date":"2018-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"2dc23e3f121c6a38","code_sha256_prefix":"2dc23e3f121c6a38","mcp_get_code":{"code_sha256":"2dc23e3f121c6a38"}}],"record_sha256":"90b18136b4c707ce0b3fb57f497ba53277c3261d3d5094d72fbe68b5402c3c5c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}