{"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-kl","entry":"gaussian_kl","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":10,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":6,"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":"2404.11599","arxiv_id_is_arxiv":true,"paper":"/paper/variational-bayesian-last-layers","title":"Variational Bayesian Last Layers","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vectorinstitute/vbll","path":"vbll/layers/classification.py","file_url":"https://github.com/vectorinstitute/vbll/blob/HEAD/vbll/layers/classification.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":"bc9b7937ef845522","code_sha256_prefix":"bc9b7937ef845522","mcp_get_code":{"code_sha256":"bc9b7937ef845522"}},{"arxiv_id":"2403.09605","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-contrastive-learning-robust","title":"Counterfactual contrastive learning: robust representations via causal image synthesis","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/counterfactual-contrastive","path":"causal_models/hvae.py","file_url":"https://github.com/biomedia-mira/counterfactual-contrastive/blob/HEAD/causal_models/hvae.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":"227af6c3aae15736","code_sha256_prefix":"227af6c3aae15736","mcp_get_code":{"code_sha256":"227af6c3aae15736"}},{"arxiv_id":"2402.07754","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-of-thoughts-chain-of-thought","title":"Diffusion of Thoughts: Chain-of-Thought Reasoning in Diffusion Language Models","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/diffusion-of-thoughts","path":"lib/ops.py","file_url":"https://github.com/hkunlp/diffusion-of-thoughts/blob/HEAD/lib/ops.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, hkunlp/diffusion-of-thoughts when it was checked","code_sha256":"33aa1ef9e2fea9b5","code_sha256_prefix":"33aa1ef9e2fea9b5","mcp_get_code":{"code_sha256":"33aa1ef9e2fea9b5"}},{"arxiv_id":"2402.01607","arxiv_id_is_arxiv":true,"paper":"/paper/natural-counterfactuals-with-necessary","title":"Natural Counterfactuals With Necessary Backtracking","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuangyuanHao/natural_counterfactuals","path":"src-2o/vae.py","file_url":"https://github.com/GuangyuanHao/natural_counterfactuals/blob/HEAD/src-2o/vae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, GuangyuanHao/natural_counterfactuals when it was checked","code_sha256":"b9020d1327a25f72","code_sha256_prefix":"b9020d1327a25f72","mcp_get_code":{"code_sha256":"b9020d1327a25f72"}},{"arxiv_id":"2402.01607","arxiv_id_is_arxiv":true,"paper":"/paper/natural-counterfactuals-with-necessary","title":"Natural Counterfactuals With Necessary Backtracking","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuangyuanHao/natural_counterfactuals","path":"src-2o/simple_vae.py","file_url":"https://github.com/GuangyuanHao/natural_counterfactuals/blob/HEAD/src-2o/simple_vae.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, GuangyuanHao/natural_counterfactuals when it was checked","code_sha256":"6d65b56cd5ec3730","code_sha256_prefix":"6d65b56cd5ec3730","mcp_get_code":{"code_sha256":"6d65b56cd5ec3730"}},{"arxiv_id":"2401.14758","arxiv_id_is_arxiv":true,"paper":"/paper/off-policy-primal-dual-safe-reinforcement","title":"Off-Policy Primal-Dual Safe Reinforcement Learning","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zmsn-2077/CUP-safe-rl","path":"algorithm/cup.py","file_url":"https://github.com/zmsn-2077/CUP-safe-rl/blob/HEAD/algorithm/cup.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, zmsn-2077/CUP-safe-rl when it was checked","code_sha256":"5b17e81927faf55e","code_sha256_prefix":"5b17e81927faf55e","mcp_get_code":{"code_sha256":"5b17e81927faf55e"}},{"arxiv_id":"2401.02683","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-facilitated-denoising-diffusion","title":"Geometric-Facilitated Denoising Diffusion Model for 3D Molecule Generation","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LEOXC1571/GFMDiff","path":"models/diff/loss.py","file_url":"https://github.com/LEOXC1571/GFMDiff/blob/HEAD/models/diff/loss.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":"5f1c82e11edc1360","code_sha256_prefix":"5f1c82e11edc1360","mcp_get_code":{"code_sha256":"5f1c82e11edc1360"}},{"arxiv_id":"2303.01274","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-axiomatic-soundness-of","title":"Measuring axiomatic soundness of counterfactual image models","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/causal-gen","path":"src/vae.py","file_url":"https://github.com/biomedia-mira/causal-gen/blob/HEAD/src/vae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b9020d1327a25f72","code_sha256_prefix":"b9020d1327a25f72","mcp_get_code":{"code_sha256":"b9020d1327a25f72"}},{"arxiv_id":"2212.00886","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-generative-models-in-infinite","title":"Diffusion Generative Models in Infinite Dimensions","date":"2022-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gavinkerrigan/functional_diffusion","path":"util/tools.py","file_url":"https://github.com/gavinkerrigan/functional_diffusion/blob/HEAD/util/tools.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":"b29d4310b4d6ee1f","code_sha256_prefix":"b29d4310b4d6ee1f","mcp_get_code":{"code_sha256":"b29d4310b4d6ee1f"}},{"arxiv_id":"2007.02622","arxiv_id_is_arxiv":true,"paper":"/paper/nappo-modular-and-scalable-reinforcement","title":"Integrating Distributed Architectures in Highly Modular RL Libraries","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PyTorchRL/pytorchrl","path":"pytorchrl/agent/algorithms/utils.py","file_url":"https://github.com/PyTorchRL/pytorchrl/blob/HEAD/pytorchrl/agent/algorithms/utils.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":"5ec30e1da221a76e","code_sha256_prefix":"5ec30e1da221a76e","mcp_get_code":{"code_sha256":"5ec30e1da221a76e"}}],"record_sha256":"7ef7fd95d22ec6b7179d8afdbe52f8fee8f4fdb77b5a83c24a6d610016124500","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}