{"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/logmeanexp","entry":"logmeanexp","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":8,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":2},"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":"2409.09787","arxiv_id_is_arxiv":true,"paper":"/paper/bendem-a-boltzmann-sampler-based-on","title":"BNEM: A Boltzmann Sampler Based on Bootstrapped Noised Energy Matching","date":"2024-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tonyauyeung/BNEM","path":"dem/models/dds_module.py","file_url":"https://github.com/tonyauyeung/BNEM/blob/HEAD/dem/models/dds_module.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":"cded7f5b04d3ed38","code_sha256_prefix":"cded7f5b04d3ed38","mcp_get_code":{"code_sha256":"cded7f5b04d3ed38"}},{"arxiv_id":"2404.17249","arxiv_id_is_arxiv":true,"paper":"/paper/making-better-use-of-unlabelled-data-in","title":"Making Better Use of Unlabelled Data in Bayesian Active Learning","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fbickfordsmith/epig","path":"src/math.py","file_url":"https://github.com/fbickfordsmith/epig/blob/HEAD/src/math.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":"50077f14e5894773","code_sha256_prefix":"50077f14e5894773","mcp_get_code":{"code_sha256":"50077f14e5894773"}},{"arxiv_id":"2402.05098","arxiv_id_is_arxiv":true,"paper":"/paper/on-diffusion-models-for-amortized-inference","title":"Improved off-policy training of diffusion samplers","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GFNOrg/gfn-diffusion","path":"energy_sampling/utils.py","file_url":"https://github.com/GFNOrg/gfn-diffusion/blob/HEAD/energy_sampling/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, GFNOrg/gfn-diffusion when it was checked","code_sha256":"cded7f5b04d3ed38","code_sha256_prefix":"cded7f5b04d3ed38","mcp_get_code":{"code_sha256":"cded7f5b04d3ed38"}},{"arxiv_id":"2302.10607","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-multi-target-causal-bayesian","title":"Differentiable Multi-Target Causal Bayesian Experimental Design","date":"2023-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yannadani/DiffCBED","path":"models/dag_bootstrap.py","file_url":"https://github.com/yannadani/DiffCBED/blob/HEAD/models/dag_bootstrap.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":"0b9e95c45f6e0f42","code_sha256_prefix":"0b9e95c45f6e0f42","mcp_get_code":{"code_sha256":"0b9e95c45f6e0f42"}},{"arxiv_id":"2206.13687","arxiv_id_is_arxiv":true,"paper":"/paper/poem-out-of-distribution-detection-with","title":"POEM: Out-of-Distribution Detection with Posterior Sampling","date":"2022-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-jku/hopfield-boosting","path":"hopfield_boosting/trainer.py","file_url":"https://github.com/ml-jku/hopfield-boosting/blob/HEAD/hopfield_boosting/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad16a03dfc3e43e8","code_sha256_prefix":"ad16a03dfc3e43e8","mcp_get_code":{"code_sha256":"ad16a03dfc3e43e8"}},{"arxiv_id":"2203.02016","arxiv_id_is_arxiv":true,"paper":"/paper/interventions-where-and-how-experimental","title":"Interventions, Where and How? Experimental Design for Causal Models at Scale","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yannadani/cbed","path":"strategies/cbed.py","file_url":"https://github.com/yannadani/cbed/blob/HEAD/strategies/cbed.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":"0b9e95c45f6e0f42","code_sha256_prefix":"0b9e95c45f6e0f42","mcp_get_code":{"code_sha256":"0b9e95c45f6e0f42"}},{"arxiv_id":"1901.02731","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-guide-to-bayesian","title":"A Comprehensive guide to Bayesian Convolutional Neural Network with Variational Inference","date":"2019-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kumar-shridhar/PyTorch-BayesianCNN","path":"utils.py","file_url":"https://github.com/kumar-shridhar/PyTorch-BayesianCNN/blob/HEAD/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":"25d66479cebad409","code_sha256_prefix":"25d66479cebad409","mcp_get_code":{"code_sha256":"25d66479cebad409"}},{"arxiv_id":"1810.04152","arxiv_id_is_arxiv":true,"paper":"/paper/doubly-reparameterized-gradient-estimators","title":"Doubly Reparameterized Gradient Estimators for Monte Carlo Objectives","date":"2018-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nbip/IWAE","path":"src/utils.py","file_url":"https://github.com/nbip/IWAE/blob/HEAD/src/utils.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":"d372626c71f42bf0","code_sha256_prefix":"d372626c71f42bf0","mcp_get_code":{"code_sha256":"d372626c71f42bf0"}}],"record_sha256":"ab7829cc70b8a1936c5582c1a88e9b0cd5428213dc6a07bb43b621f5a879c838","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}