{"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/log-prior","entry":"log_prior","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"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":3,"ran":3,"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":"2305.14765","arxiv_id_is_arxiv":true,"paper":"/paper/masked-bayesian-neural-networks-theoretical","title":"Masked Bayesian Neural Networks : Theoretical Guarantee and its Posterior Inference","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggong369/mbnn","path":"MBNN/MCMC.py","file_url":"https://github.com/ggong369/mbnn/blob/HEAD/MBNN/MCMC.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, ggong369/mbnn when it was checked","code_sha256":"3152492a76f172d6","code_sha256_prefix":"3152492a76f172d6","mcp_get_code":{"code_sha256":"3152492a76f172d6"}},{"arxiv_id":"2007.09284","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-bayesian-estimation-of-gaussian","title":"Optimal Bayesian estimation of Gaussian mixtures with growing number of components","date":null,"month_inferred_from_arxiv_id":"2020-07","title_source":"archive","repo":"ilsangohn/bayes_mixture","path":"bayes.py","file_url":"https://github.com/ilsangohn/bayes_mixture/blob/HEAD/bayes.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, ilsangohn/bayes_mixture when it was checked","code_sha256":"3dc51c98ae346e22","code_sha256_prefix":"3dc51c98ae346e22","mcp_get_code":{"code_sha256":"3dc51c98ae346e22"}},{"arxiv_id":"2003.11036","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-multiple-dlas-per-spectrum-in-sdss","title":"Detecting Multiple DLAs per Spectrum in SDSS DR12 with Gaussian Processes","date":null,"month_inferred_from_arxiv_id":"2020-03","title_source":"archive","repo":"jibanCat/desi_gpy_dla_detection","path":"gpy_dla_detection/civ_log_posterior_mcmc.py","file_url":"https://github.com/jibanCat/desi_gpy_dla_detection/blob/HEAD/gpy_dla_detection/civ_log_posterior_mcmc.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":"8f0c7d82e160263d","code_sha256_prefix":"8f0c7d82e160263d","mcp_get_code":{"code_sha256":"8f0c7d82e160263d"}},{"arxiv_id":"2003.11036","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-multiple-dlas-per-spectrum-in-sdss","title":"Detecting Multiple DLAs per Spectrum in SDSS DR12 with Gaussian Processes","date":null,"month_inferred_from_arxiv_id":"2020-03","title_source":"archive","repo":"jibanCat/gpy_dla_detection","path":"gpy_dla_detection/log_posterior_mcmc.py","file_url":"https://github.com/jibanCat/gpy_dla_detection/blob/HEAD/gpy_dla_detection/log_posterior_mcmc.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":"ba1656569f75254c","code_sha256_prefix":"ba1656569f75254c","mcp_get_code":{"code_sha256":"ba1656569f75254c"}},{"arxiv_id":"1905.12052","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-distribution-on-the-simplex-with-auto","title":"A New Distribution on the Simplex with Auto-Encoding Applications","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astirn/MV-Kumaraswamy","path":"ars-reparameterization/dirichlet/dirichlet_score.py","file_url":"https://github.com/astirn/MV-Kumaraswamy/blob/HEAD/ars-reparameterization/dirichlet/dirichlet_score.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":"22b6c9f9d0ff1496","code_sha256_prefix":"22b6c9f9d0ff1496","mcp_get_code":{"code_sha256":"22b6c9f9d0ff1496"}},{"arxiv_id":"1810.05558","arxiv_id_is_arxiv":true,"paper":"/paper/variational-bayesian-monte-carlo","title":"Variational Bayesian Monte Carlo","date":"2018-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acerbilab/pyvbmc","path":"examples/scripts/pyvbmc_example_1_full_code.py","file_url":"https://github.com/acerbilab/pyvbmc/blob/HEAD/examples/scripts/pyvbmc_example_1_full_code.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e65f3328f82cace","code_sha256_prefix":"6e65f3328f82cace","mcp_get_code":{"code_sha256":"6e65f3328f82cace"}}],"record_sha256":"c6515f87dfecc27f171a492465a5c330acc91b1126d90000d801feff7512dbc7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}