{"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/papers/ran/1","list_of":"/task/probabilistic-programming","task":"Probabilistic Programming","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,19],"of":19,"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"},"first_page":"/task/probabilistic-programming/papers/ran/1","prev":null,"next":null,"papers":[{"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/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":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 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":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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/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/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/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/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/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/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/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/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/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}}],"record_sha256":"288d8b63579a419c0f8d4bbe2dce38980f65729ca5f9023df43a7dcb08dee358","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}