{"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":"/task/probabilistic-programming","name":"Probabilistic Programming","slug":"probabilistic-programming","description_markdown":"Probabilistic programming languages are designed to describe probabilistic models and then perform inference in those models. PPLs are closely related to graphical models and Bayesian networks, but are more expressive and flexible.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Michael Betancourt](https://betanalpha.github.io/writing/) )</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":273,"papers_with_code":92,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/bayesian-inference","name":"Bayesian Inference"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":3,"rows_per_page":100,"shown":100,"of":273,"of_with_code":92,"tagged_in_all":273,"counts":{"archive_papers_tagged":273,"with_a_code_link":92,"where_syntology_ran_a_sample":19,"not_listed_spam_title":0,"listed":273,"listed_where_code_ran":19,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/tensorflow-distributions","slug":"tensorflow-distributions","title":"TensorFlow Distributions","date":"2017-11-28","arxiv_id":"1711.10604","repositories_listed":8,"syntology":null},{"url":"/paper/delayed-sampling-and-automatic-rao","slug":"delayed-sampling-and-automatic-rao","title":"Delayed Sampling and Automatic Rao-Blackwellization of Probabilistic Programs","date":"2017-08-25","arxiv_id":"1708.07787","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/delayed-sampling-and-automatic-rao#ran","syntology_url":"https://syntology.ai/paper/1708.07787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.07787"}},"official":null}},{"url":"/paper/inference-compilation-and-universal","slug":"inference-compilation-and-universal","title":"Inference Compilation and Universal Probabilistic Programming","date":"2016-10-31","arxiv_id":"1610.09900","repositories_listed":4,"syntology":null},{"url":"/paper/automatic-differentiation-variational","slug":"automatic-differentiation-variational","title":"Automatic Differentiation Variational Inference","date":"2016-03-02","arxiv_id":"1603.00788","repositories_listed":4,"syntology":null},{"url":"/paper/the-future-of-cosmological-likelihood-based","slug":"the-future-of-cosmological-likelihood-based","title":"The future of cosmological likelihood-based inference: accelerated high-dimensional parameter estimation and model comparison","date":"2024-05-21","arxiv_id":"2405.12965","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-future-of-cosmological-likelihood-based#ran","syntology_url":"https://syntology.ai/paper/2405.12965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12965"}},"official":{"repos":["alessiospuriomancini/cosmopower","astro-informatics/harmonic","dpiras/cosmopower-jax"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/symbolicai-a-framework-for-logic-based","slug":"symbolicai-a-framework-for-logic-based","title":"SymbolicAI: A framework for logic-based approaches combining generative models and solvers","date":"2024-02-01","arxiv_id":"2402.00854","repositories_listed":3,"syntology":null},{"url":"/paper/composable-effects-for-flexible-and","slug":"composable-effects-for-flexible-and","title":"Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro","date":"2019-12-24","arxiv_id":"1912.11554","repositories_listed":3,"syntology":{"n":26,"n_ran":23,"n_constructed":0,"n_ran_checked":23,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":22,"n_pointer_only":0,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 23 with no instrument failure: 1 honoured, 0 violated, 22 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/composable-effects-for-flexible-and#ran","syntology_url":"https://syntology.ai/paper/1912.11554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11554"}},"official":{"repos":["pyro-ppl/numpyro"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/etalumis-bringing-probabilistic-programming","slug":"etalumis-bringing-probabilistic-programming","title":"Etalumis: Bringing Probabilistic Programming to Scientific Simulators at Scale","date":"2019-07-08","arxiv_id":"1907.03382","repositories_listed":3,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/etalumis-bringing-probabilistic-programming#ran","syntology_url":"https://syntology.ai/paper/1907.03382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.03382"}},"official":null}},{"url":"/paper/an-introduction-to-probabilistic-programming","slug":"an-introduction-to-probabilistic-programming","title":"An Introduction to Probabilistic Programming","date":"2018-09-27","arxiv_id":"1809.10756","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-probabilistic-inference-in-the","slug":"efficient-probabilistic-inference-in-the","title":"Efficient Probabilistic Inference in the Quest for Physics Beyond the Standard Model","date":"2018-07-20","arxiv_id":"1807.07706","repositories_listed":3,"syntology":null},{"url":"/paper/simplifying-debiased-inference-via-automatic","slug":"simplifying-debiased-inference-via-automatic","title":"Simplifying debiased inference via automatic differentiation and probabilistic programming","date":"2024-05-14","arxiv_id":"2405.08675","repositories_listed":2,"syntology":null},{"url":"/paper/sequential-monte-carlo-steering-of-large","slug":"sequential-monte-carlo-steering-of-large","title":"Sequential Monte Carlo Steering of Large Language Models using Probabilistic Programs","date":"2023-06-05","arxiv_id":"2306.03081","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sequential-monte-carlo-steering-of-large#ran","syntology_url":"https://syntology.ai/paper/2306.03081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03081"}},"official":{"repos":["probcomp/hfppl","probcomp/llamppl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scenic-a-language-for-scenario-specification","slug":"scenic-a-language-for-scenario-specification","title":"Scenic: A Language for Scenario Specification and Data Generation","date":"2020-10-13","arxiv_id":"2010.06580","repositories_listed":2,"syntology":null},{"url":"/paper/vae-encoding-stochastic-process-priors-with","slug":"vae-encoding-stochastic-process-priors-with","title":"$π$VAE: a stochastic process prior for Bayesian deep learning with MCMC","date":"2020-02-17","arxiv_id":"2002.06873","repositories_listed":2,"syntology":null},{"url":"/paper/dynamicppl-stan-like-speed-for-dynamic","slug":"dynamicppl-stan-like-speed-for-dynamic","title":"DynamicPPL: Stan-like Speed for Dynamic Probabilistic Models","date":"2020-02-07","arxiv_id":"2002.02702","repositories_listed":2,"syntology":null},{"url":"/paper/automatic-structured-variational-inference","slug":"automatic-structured-variational-inference","title":"Automatic structured variational inference","date":"2020-02-03","arxiv_id":"2002.00643","repositories_listed":2,"syntology":null},{"url":"/paper/sinkhorn-autoencoders","slug":"sinkhorn-autoencoders","title":"Sinkhorn AutoEncoders","date":"2018-10-02","arxiv_id":"1810.01118","repositories_listed":2,"syntology":null},{"url":"/paper/scenic-language-based-scene-generation","slug":"scenic-language-based-scene-generation","title":"Scenic: A Language for Scenario Specification and Scene Generation","date":"2018-09-25","arxiv_id":"1809.09310","repositories_listed":2,"syntology":null},{"url":"/paper/hamiltonian-monte-carlo-inference-of","slug":"hamiltonian-monte-carlo-inference-of","title":"Hamiltonian Monte Carlo Inference of Marginalized Linear Mixed-Effects Models","date":"2024-10-31","arxiv_id":"2410.24079","repositories_listed":1,"syntology":null},{"url":"/paper/markov-senior-learning-markov-junior-grammars","slug":"markov-senior-learning-markov-junior-grammars","title":"Markov Senior -- Learning Markov Junior Grammars to Generate User-specified Content","date":"2024-08-12","arxiv_id":"2408.05959","repositories_listed":1,"syntology":null},{"url":"/paper/blackjax-composable-bayesian-inference-in-jax","slug":"blackjax-composable-bayesian-inference-in-jax","title":"BlackJAX: Composable Bayesian inference in JAX","date":"2024-02-16","arxiv_id":"2402.10797","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/blackjax-composable-bayesian-inference-in-jax#ran","syntology_url":"https://syntology.ai/paper/2402.10797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10797"}},"official":{"repos":["blackjax-devs/blackjax"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-models-for-probabilistic-1","slug":"diffusion-models-for-probabilistic-1","title":"Diffusion models for probabilistic programming","date":"2023-11-01","arxiv_id":"2311.00474","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-integer-arithmetic-in-probabilistic","slug":"scaling-integer-arithmetic-in-probabilistic","title":"Scaling Integer Arithmetic in Probabilistic Programs","date":"2023-07-25","arxiv_id":"2307.13837","repositories_listed":1,"syntology":null},{"url":"/paper/from-word-models-to-world-models-translating","slug":"from-word-models-to-world-models-translating","title":"From Word Models to World Models: Translating from Natural Language to the Probabilistic Language of Thought","date":"2023-06-22","arxiv_id":"2306.12672","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-neural-probabilistic-answer-set","slug":"scalable-neural-probabilistic-answer-set","title":"Scalable Neural-Probabilistic Answer Set Programming","date":"2023-06-14","arxiv_id":"2306.08397","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-neural-probabilistic-answer-set#ran","syntology_url":"https://syntology.ai/paper/2306.08397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08397"}},"official":{"repos":["ml-research/slash"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pus-mathbb-h-concurrent-probabilistic","slug":"pus-mathbb-h-concurrent-probabilistic","title":"Push: Concurrent Probabilistic Programming for Bayesian Deep Learning","date":"2023-06-10","arxiv_id":"2306.06528","repositories_listed":1,"syntology":null},{"url":"/paper/automating-model-comparison-in-factor-graphs","slug":"automating-model-comparison-in-factor-graphs","title":"Automating Model Comparison in Factor Graphs","date":"2023-06-09","arxiv_id":"2306.05965","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-calibration-of-mems-accelerometers","slug":"bayesian-calibration-of-mems-accelerometers","title":"Bayesian Calibration of MEMS Accelerometers","date":"2023-06-09","arxiv_id":"2306.06144","repositories_listed":1,"syntology":null},{"url":"/paper/exact-bayesian-inference-on-discrete-models","slug":"exact-bayesian-inference-on-discrete-models","title":"Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach","date":"2023-05-26","arxiv_id":"2305.17058","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/exact-bayesian-inference-on-discrete-models#ran","syntology_url":"https://syntology.ai/paper/2305.17058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17058"}},"official":{"repos":["fzaiser/genfer"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/black-box-variational-inference-with-a","slug":"black-box-variational-inference-with-a","title":"Black Box Variational Inference with a Deterministic Objective: Faster, More Accurate, and Even More Black Box","date":"2023-04-11","arxiv_id":"2304.05527","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/black-box-variational-inference-with-a#ran","syntology_url":"https://syntology.ai/paper/2304.05527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05527"}},"official":{"repos":["rgiordan/dadvipaper"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automatically-marginalized-mcmc-in","slug":"automatically-marginalized-mcmc-in","title":"Automatically Marginalized MCMC in Probabilistic Programming","date":"2023-02-01","arxiv_id":"2302.00564","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/automatically-marginalized-mcmc-in#ran","syntology_url":"https://syntology.ai/paper/2302.00564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00564"}},"official":{"repos":["lll6924/automatically-marginalized-mcmc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/treeflow-probabilistic-programming-and","slug":"treeflow-probabilistic-programming-and","title":"TreeFlow: probabilistic programming and automatic differentiation for phylogenetics","date":"2022-11-09","arxiv_id":"2211.05220","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-quantum-programming-with","slug":"differentiable-quantum-programming-with","title":"Differentiable Quantum Programming with Unbounded Loops","date":"2022-11-08","arxiv_id":"2211.04507","repositories_listed":1,"syntology":null},{"url":"/paper/nonparametric-involutive-markov-chain-monte","slug":"nonparametric-involutive-markov-chain-monte","title":"Nonparametric Involutive Markov Chain Monte Carlo","date":"2022-11-02","arxiv_id":"2211.01100","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/nonparametric-involutive-markov-chain-monte#ran","syntology_url":"https://syntology.ai/paper/2211.01100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01100"}},"official":{"repos":["fzaiser/nonparametric-hmc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ice-core-dating-using-probabilistic","slug":"ice-core-dating-using-probabilistic","title":"Ice Core Dating using Probabilistic Programming","date":"2022-10-29","arxiv_id":"2210.16568","repositories_listed":1,"syntology":null},{"url":"/paper/improved-marginal-unbiased-score-expansion","slug":"improved-marginal-unbiased-score-expansion","title":"Improved Marginal Unbiased Score Expansion (MUSE) via Implicit Differentiation","date":"2022-09-21","arxiv_id":"2209.10512","repositories_listed":1,"syntology":null},{"url":"/paper/robust-leave-one-out-cross-validation-for","slug":"robust-leave-one-out-cross-validation-for","title":"Robust leave-one-out cross-validation for high-dimensional Bayesian models","date":"2022-09-19","arxiv_id":"2209.09190","repositories_listed":1,"syntology":null},{"url":"/paper/borch-a-deep-universal-probabilistic","slug":"borch-a-deep-universal-probabilistic","title":"Borch: A Deep Universal Probabilistic Programming Language","date":"2022-09-13","arxiv_id":"2209.06168","repositories_listed":1,"syntology":null},{"url":"/paper/language-model-cascades","slug":"language-model-cascades","title":"Language Model Cascades","date":"2022-07-21","arxiv_id":"2207.10342","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-model-cascades#ran","syntology_url":"https://syntology.ai/paper/2207.10342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10342"}},"official":{"repos":["google-research/cascades"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/3dp3-3d-scene-perception-via-probabilistic","slug":"3dp3-3d-scene-perception-via-probabilistic","title":"3DP3: 3D Scene Perception via Probabilistic Programming","date":"2021-10-30","arxiv_id":"2111.00312","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-the-effective-reproduction-number","slug":"unifying-the-effective-reproduction-number","title":"Unifying incidence and prevalence under a time-varying general branching process","date":"2021-07-12","arxiv_id":"2107.05579","repositories_listed":1,"syntology":null},{"url":"/paper/nonparametric-hamiltonian-monte-carlo","slug":"nonparametric-hamiltonian-monte-carlo","title":"Nonparametric Hamiltonian Monte Carlo","date":"2021-06-18","arxiv_id":"2106.10238","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/nonparametric-hamiltonian-monte-carlo#ran","syntology_url":"https://syntology.ai/paper/2106.10238","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10238"}},"official":{"repos":["fzaiser/nonparametric-hmc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/d3p-a-python-package-for-differentially","slug":"d3p-a-python-package-for-differentially","title":"D3p -- A Python Package for Differentially-Private Probabilistic Programming","date":"2021-03-22","arxiv_id":"2103.11648","repositories_listed":1,"syntology":null},{"url":"/paper/recsim-ng-toward-principled-uncertainty","slug":"recsim-ng-toward-principled-uncertainty","title":"RecSim NG: Toward Principled Uncertainty Modeling for Recommender Ecosystems","date":"2021-03-14","arxiv_id":"2103.08057","repositories_listed":1,"syntology":null},{"url":"/paper/compositional-semantics-for-probabilistic","slug":"compositional-semantics-for-probabilistic","title":"Compositional Semantics for Probabilistic Programs with Exact Conditioning","date":"2021-01-27","arxiv_id":"2101.11351","repositories_listed":1,"syntology":null},{"url":"/paper/bayescard-a-unified-bayesian-framework-for","slug":"bayescard-a-unified-bayesian-framework-for","title":"BayesCard: Revitilizing Bayesian Frameworks for Cardinality Estimation","date":"2020-12-29","arxiv_id":"2012.14743","repositories_listed":1,"syntology":null},{"url":"/paper/spacecraft-collision-risk-assessment-with","slug":"spacecraft-collision-risk-assessment-with","title":"Spacecraft Collision Risk Assessment with Probabilistic Programming","date":"2020-12-18","arxiv_id":"2012.10260","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-metropolis-hastings-with","slug":"accelerating-metropolis-hastings-with","title":"Accelerating Metropolis-Hastings with Lightweight Inference Compilation","date":"2020-10-23","arxiv_id":"2010.12128","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-independence-by-typing","slug":"conditional-independence-by-typing","title":"Conditional independence by typing","date":"2020-10-22","arxiv_id":"2010.11887","repositories_listed":1,"syntology":null},{"url":"/paper/financial-data-analysis-using-expert-bayesian","slug":"financial-data-analysis-using-expert-bayesian","title":"Financial Data Analysis Using Expert Bayesian Framework For Bankruptcy Prediction","date":"2020-10-19","arxiv_id":"2010.13892","repositories_listed":1,"syntology":null},{"url":"/paper/ppl-bench-evaluation-framework-for","slug":"ppl-bench-evaluation-framework-for","title":"PPL Bench: Evaluation Framework For Probabilistic Programming Languages","date":"2020-10-17","arxiv_id":"2010.08886","repositories_listed":1,"syntology":null},{"url":"/paper/sympais-symbolic-parallel-adaptive-importance","slug":"sympais-symbolic-parallel-adaptive-importance","title":"Symbolic Parallel Adaptive Importance Sampling for Probabilistic Program Analysis","date":"2020-10-10","arxiv_id":"2010.05050","repositories_listed":1,"syntology":null},{"url":"/paper/exact-symbolic-inference-in-probabilistic","slug":"exact-symbolic-inference-in-probabilistic","title":"SPPL: Probabilistic Programming with Fast Exact Symbolic Inference","date":"2020-10-07","arxiv_id":"2010.03485","repositories_listed":1,"syntology":{"n":30,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":20,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/exact-symbolic-inference-in-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2010.03485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03485"}},"official":{"repos":["probcomp/sppl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":20,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-programs-with-stochastic","slug":"probabilistic-programs-with-stochastic","title":"Probabilistic Programs with Stochastic Conditioning","date":"2020-10-01","arxiv_id":"2010.00282","repositories_listed":1,"syntology":null},{"url":"/paper/pclean-bayesian-data-cleaning-at-scale-with","slug":"pclean-bayesian-data-cleaning-at-scale-with","title":"PClean: Bayesian Data Cleaning at Scale with Domain-Specific Probabilistic Programming","date":"2020-07-23","arxiv_id":"2007.11838","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-signaling-pathways-with","slug":"inferring-signaling-pathways-with","title":"Inferring Signaling Pathways with Probabilistic Programming","date":"2020-05-28","arxiv_id":"2005.14062","repositories_listed":1,"syntology":null},{"url":"/paper/planning-as-inference-in-epidemiological","slug":"planning-as-inference-in-epidemiological","title":"Planning as Inference in Epidemiological Models","date":"2020-03-30","arxiv_id":"2003.13221","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/planning-as-inference-in-epidemiological#ran","syntology_url":"https://syntology.ai/paper/2003.13221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13221"}},"official":{"repos":["plai-group/covid"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-distributions-for-tensorflow","slug":"joint-distributions-for-tensorflow","title":"Joint Distributions for TensorFlow Probability","date":"2020-01-22","arxiv_id":"2001.11819","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-probabilistic-programs","slug":"stochastic-probabilistic-programs","title":"Stochastic Probabilistic Programs","date":"2020-01-08","arxiv_id":"2001.02656","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-distribution-free-concept-for","slug":"a-new-distribution-free-concept-for","title":"A New Distribution-Free Concept for Representing, Comparing, and Propagating Uncertainty in Dynamical Systems with Kernel Probabilistic Programming","date":"2019-11-25","arxiv_id":"1911.11082","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-elimination-in-particle-gibbs","slug":"parameter-elimination-in-particle-gibbs","title":"Parameter elimination in particle Gibbs sampling","date":"2019-10-30","arxiv_id":"1910.14145","repositories_listed":1,"syntology":null},{"url":"/paper/functional-tensors-for-probabilistic","slug":"functional-tensors-for-probabilistic","title":"Functional Tensors for Probabilistic Programming","date":"2019-10-23","arxiv_id":"1910.10775","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/functional-tensors-for-probabilistic#ran","syntology_url":"https://syntology.ai/paper/1910.10775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10775"}},"official":{"repos":["pyro-ppl/funsor"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/amortized-rejection-sampling-in-universal","slug":"amortized-rejection-sampling-in-universal","title":"Amortized Rejection Sampling in Universal Probabilistic Programming","date":"2019-10-20","arxiv_id":"1910.09056","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/amortized-rejection-sampling-in-universal#ran","syntology_url":"https://syntology.ai/paper/1910.09056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09056"}},"official":{"repos":["plai-group/amortized-rejection-sampling"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multiverse-causal-reasoning-using-importance","slug":"multiverse-causal-reasoning-using-importance","title":"MultiVerse: Causal Reasoning using Importance Sampling in Probabilistic Programming","date":"2019-10-17","arxiv_id":"1910.08091","repositories_listed":1,"syntology":null},{"url":"/paper/towards-verified-stochastic-variational","slug":"towards-verified-stochastic-variational","title":"Towards Verified Stochastic Variational Inference for Probabilistic Programs","date":"2019-07-20","arxiv_id":"1907.08827","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-programming-for-birth-death","slug":"probabilistic-programming-for-birth-death","title":"Probabilistic programming for birth-death models of evolution using an alive particle filter with delayed sampling","date":"2019-07-10","arxiv_id":"1907.04615","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-bayesian-approaches-to-eqtl-mapping","slug":"exploring-bayesian-approaches-to-eqtl-mapping","title":"Exploring Bayesian approaches to eQTL mapping through probabilistic programming","date":"2019-06-12","arxiv_id":"1906.05150","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-reparameterisation-of-probabilistic","slug":"automatic-reparameterisation-of-probabilistic","title":"Automatic Reparameterisation of Probabilistic Programs","date":"2019-06-07","arxiv_id":"1906.03028","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/automatic-reparameterisation-of-probabilistic#ran","syntology_url":"https://syntology.ai/paper/1906.03028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03028"}},"official":{"repos":["mgorinova/autoreparam"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/rotation-invariant-householder","slug":"rotation-invariant-householder","title":"Rotation Invariant Householder Parameterization for Bayesian PCA","date":"2019-05-12","arxiv_id":"1905.04720","repositories_listed":1,"syntology":null},{"url":"/paper/modular-deep-probabilistic-programming","slug":"modular-deep-probabilistic-programming","title":"Modular Deep Probabilistic Programming","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-monte-carlo-approach-for","slug":"a-bayesian-monte-carlo-approach-for","title":"A Bayesian Monte Carlo approach for predicting the spread of infectious diseases","date":"2019-04-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/reversible-jump-probabilistic-programming","slug":"reversible-jump-probabilistic-programming","title":"Reversible Jump Probabilistic Programming","date":"2019-04-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/applying-probabilistic-programming-to","slug":"applying-probabilistic-programming-to","title":"Applying Probabilistic Programming to Affective Computing","date":"2019-03-15","arxiv_id":"1903.06445","repositories_listed":1,"syntology":null},{"url":"/paper/lf-ppl-a-low-level-first-order-probabilistic","slug":"lf-ppl-a-low-level-first-order-probabilistic","title":"LF-PPL: A Low-Level First Order Probabilistic Programming Language for Non-Differentiable Models","date":"2019-03-06","arxiv_id":"1903.02482","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/lf-ppl-a-low-level-first-order-probabilistic#ran","syntology_url":"https://syntology.ai/paper/1903.02482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02482"}},"official":{"repos":["bradleygramhansen/PyLFPPL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/probo-a-framework-for-using-probabilistic","slug":"probo-a-framework-for-using-probabilistic","title":"ProBO: Versatile Bayesian Optimization Using Any Probabilistic Programming Language","date":"2019-01-31","arxiv_id":"1901.11515","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-layers-a-module-for-neural-network","slug":"bayesian-layers-a-module-for-neural-network","title":"Bayesian Layers: A Module for Neural Network Uncertainty","date":"2018-12-10","arxiv_id":"1812.03973","repositories_listed":1,"syntology":null},{"url":"/paper/a-factor-graph-approach-to-automated-design","slug":"a-factor-graph-approach-to-automated-design","title":"A Factor Graph Approach to Automated Design of Bayesian Signal Processing Algorithms","date":"2018-11-08","arxiv_id":"1811.03407","repositories_listed":1,"syntology":null},{"url":"/paper/simple-distributed-and-accelerated","slug":"simple-distributed-and-accelerated","title":"Simple, Distributed, and Accelerated Probabilistic Programming","date":"2018-11-05","arxiv_id":"1811.02091","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-programming-with-densities-in","slug":"probabilistic-programming-with-densities-in","title":"Probabilistic Programming with Densities in SlicStan: Efficient, Flexible and Deterministic","date":"2018-11-02","arxiv_id":"1811.00890","repositories_listed":1,"syntology":null},{"url":"/paper/pyro-deep-universal-probabilistic-programming","slug":"pyro-deep-universal-probabilistic-programming","title":"Pyro: Deep Universal Probabilistic Programming","date":"2018-10-18","arxiv_id":"1810.09538","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pyro-deep-universal-probabilistic-programming#ran","syntology_url":"https://syntology.ai/paper/1810.09538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.09538"}},"official":{"repos":["uber/pyro"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/extending-stan-for-deep-probabilistic","slug":"extending-stan-for-deep-probabilistic","title":"Compiling Stan to Generative Probabilistic Languages and Extension to Deep Probabilistic Programming","date":"2018-09-30","arxiv_id":"1810.00873","repositories_listed":1,"syntology":null},{"url":"/paper/modelling-users-theory-of-ais-mind-in","slug":"modelling-users-theory-of-ais-mind-in","title":"Machine Teaching of Active Sequential Learners","date":"2018-09-08","arxiv_id":"1809.02869","repositories_listed":1,"syntology":null},{"url":"/paper/myopic-bayesian-design-of-experiments-via","slug":"myopic-bayesian-design-of-experiments-via","title":"Myopic Bayesian Design of Experiments via Posterior Sampling and Probabilistic Programming","date":"2018-05-25","arxiv_id":"1805.09964","repositories_listed":1,"syntology":null},{"url":"/paper/hamiltonian-monte-carlo-for-probabilistic","slug":"hamiltonian-monte-carlo-for-probabilistic","title":"Hamiltonian Monte Carlo for Probabilistic Programs with Discontinuities","date":"2018-04-07","arxiv_id":"1804.03523","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-neural-networks","slug":"bayesian-neural-networks","title":"Bayesian Neural Networks","date":"2018-01-23","arxiv_id":"1801.07710","repositories_listed":1,"syntology":null},{"url":"/paper/zhusuan-a-library-for-bayesian-deep-learning","slug":"zhusuan-a-library-for-bayesian-deep-learning","title":"ZhuSuan: A Library for Bayesian Deep Learning","date":"2017-09-18","arxiv_id":"1709.05870","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-search-for-structured-data-via","slug":"probabilistic-search-for-structured-data-via","title":"Probabilistic Search for Structured Data via Probabilistic Programming and Nonparametric Bayes","date":"2017-04-04","arxiv_id":"1704.01087","repositories_listed":1,"syntology":null},{"url":"/paper/better-call-saul-flexible-programming-for","slug":"better-call-saul-flexible-programming-for","title":"Better call Saul: Flexible Programming for Learning and Inference in NLP","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/detecting-dependencies-in-sparse-multivariate","slug":"detecting-dependencies-in-sparse-multivariate","title":"Detecting Dependencies in Sparse, Multivariate Databases Using Probabilistic Programming and Non-parametric Bayes","date":"2016-11-05","arxiv_id":"1611.01708","repositories_listed":1,"syntology":null},{"url":"/paper/deep-amortized-inference-for-probabilistic","slug":"deep-amortized-inference-for-probabilistic","title":"Deep Amortized Inference for Probabilistic Programs","date":"2016-10-18","arxiv_id":"1610.05735","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-data-analysis-with","slug":"probabilistic-data-analysis-with","title":"Probabilistic Data Analysis with Probabilistic Programming","date":"2016-08-18","arxiv_id":"1608.05347","repositories_listed":1,"syntology":null},{"url":"/paper/dataflow-matrix-machines-as-a-generalization","slug":"dataflow-matrix-machines-as-a-generalization","title":"Dataflow Matrix Machines as a Generalization of Recurrent Neural Networks","date":"2016-03-29","arxiv_id":"1603.09002","repositories_listed":1,"syntology":null},{"url":null,"slug":"large-language-bayes","title":"Large Language Bayes","date":"2025-04-18","arxiv_id":"2504.14025","repositories_listed":0,"syntology":null},{"url":null,"slug":"syntactic-and-semantic-control-of-large","title":"Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo","date":"2025-04-17","arxiv_id":"2504.13139","repositories_listed":0,"syntology":null},{"url":null,"slug":"deeprv-pre-trained-spatial-priors-for","title":"DeepRV: pre-trained spatial priors for accelerated disease mapping","date":"2025-03-27","arxiv_id":"2503.21473","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-40th-international-conference-on","title":"Proceedings 40th International Conference on Logic Programming","date":"2025-02-11","arxiv_id":"2502.08453","repositories_listed":0,"syntology":null},{"url":null,"slug":"smiles-has-to-go-representation-of-molecules","title":"Representation of Molecules via Algebraic Data Types : Advancing Beyond SMILES & SELFIES","date":"2025-01-23","arxiv_id":"2501.13633","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-distribution-semantics-for-probabilistic","title":"A Distribution Semantics for Probabilistic Term Rewriting","date":"2024-10-19","arxiv_id":"2410.15081","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-latent-disease-factors","title":"Identifying latent disease factors differently expressed in patient subgroups using group factor analysis","date":"2024-10-10","arxiv_id":"2410.07890","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-plans-for-hybrid-particle-filtering","title":"Inference Plans for Hybrid Particle Filtering","date":"2024-08-21","arxiv_id":"2408.11283","repositories_listed":0,"syntology":null}],"syntology_records":20,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_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_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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":19,"papers_where_code_ran_first_page":"/task/probabilistic-programming/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":3,"url":"/task/probabilistic-programming/papers/2","json":"/task/probabilistic-programming/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/probabilistic-programming/papers/3","json":"/task/probabilistic-programming/papers/3.json","rows":73},{"order":"ran","page":1,"of":1,"url":"/task/probabilistic-programming/papers/ran/1","json":"/task/probabilistic-programming/papers/ran/1.json","rows":19}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"1018a90bdd44f83d2b0f0d14509c9ca196325e190edb772acc27f9725ab7b097","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}