{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XQLFCLQ7VYBDUJ3MQ6AJ6XF26B","short_pith_number":"pith:XQLFCLQ7","schema_version":"1.0","canonical_sha256":"bc16512e1fae023a276c87809f5cbaf06904c8c4cc8904e994bdaf6addf16600","source":{"kind":"arxiv","id":"1709.07710","version":1},"attestation_state":"computed","paper":{"title":"Barker's algorithm for Bayesian inference with intractable likelihoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Flavio B. Gon\\c{c}alves, Gareth O. Roberts, Krzysztof {\\L}atuszy\\'nski","submitted_at":"2017-09-22T12:27:22Z","abstract_excerpt":"In this expository paper we abstract and describe a simple MCMC scheme for sampling from intractable target densities. The approach has been introduced in Gon\\c{c}alves et al. (2017a) in the specific context of jump-diffusions, and is based on the Barker's algorithm paired with a simple Bernoulli factory type scheme, the so called 2-coin algorithm. In many settings it is an alternative to standard Metropolis-Hastings pseudo-marginal method for simulating from intractable target densities. Although Barker's is well-known to be slightly less efficient than Metropolis-Hastings, the key advantage "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1709.07710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-09-22T12:27:22Z","cross_cats_sorted":[],"title_canon_sha256":"1caf34c14311c2de1db4b9dbe8d64f6f6a673c8069de4ee7571390d002091d4d","abstract_canon_sha256":"38d2d312cc79a7f5c6a20b3c57fa7e3297850add3826fc64ea8c10d769ddd04c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:32.512347Z","signature_b64":"l9Z0Go0ma5IMqvWBPeCPuuySS2rzQZeOfh6obgvGy65aJYPayuc/d8wyHbabkZAf2fJwheNvHwi7mlXievGtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc16512e1fae023a276c87809f5cbaf06904c8c4cc8904e994bdaf6addf16600","last_reissued_at":"2026-05-18T00:34:32.511978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:32.511978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Barker's algorithm for Bayesian inference with intractable likelihoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Flavio B. Gon\\c{c}alves, Gareth O. Roberts, Krzysztof {\\L}atuszy\\'nski","submitted_at":"2017-09-22T12:27:22Z","abstract_excerpt":"In this expository paper we abstract and describe a simple MCMC scheme for sampling from intractable target densities. The approach has been introduced in Gon\\c{c}alves et al. (2017a) in the specific context of jump-diffusions, and is based on the Barker's algorithm paired with a simple Bernoulli factory type scheme, the so called 2-coin algorithm. In many settings it is an alternative to standard Metropolis-Hastings pseudo-marginal method for simulating from intractable target densities. Although Barker's is well-known to be slightly less efficient than Metropolis-Hastings, the key advantage "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07710","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.07710","created_at":"2026-05-18T00:34:32.512035+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07710v1","created_at":"2026-05-18T00:34:32.512035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07710","created_at":"2026-05-18T00:34:32.512035+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQLFCLQ7VYBD","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQLFCLQ7VYBDUJ3M","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQLFCLQ7","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B","json":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B.json","graph_json":"https://pith.science/api/pith-number/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/graph.json","events_json":"https://pith.science/api/pith-number/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/events.json","paper":"https://pith.science/paper/XQLFCLQ7"},"agent_actions":{"view_html":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B","download_json":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B.json","view_paper":"https://pith.science/paper/XQLFCLQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07710&json=true","fetch_graph":"https://pith.science/api/pith-number/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/graph.json","fetch_events":"https://pith.science/api/pith-number/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/action/storage_attestation","attest_author":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/action/author_attestation","sign_citation":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/action/citation_signature","submit_replication":"https://pith.science/pith/XQLFCLQ7VYBDUJ3MQ6AJ6XF26B/action/replication_record"}},"created_at":"2026-05-18T00:34:32.512035+00:00","updated_at":"2026-05-18T00:34:32.512035+00:00"}