{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HZBFOCH2EJCXXIMWUOFFN2ZNRO","short_pith_number":"pith:HZBFOCH2","schema_version":"1.0","canonical_sha256":"3e425708fa22457ba196a38a56eb2d8b81de601710a89c613928f4b0d3e8cee6","source":{"kind":"arxiv","id":"1406.2660","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Metropolis-Hastings algorithms: Delayed acceptance with prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Christian P. Robert (CEREMADE, Clara Grazian (CEREMADE, Marco Banterle (CEREMADE, Universite Paris-Dauphine, Universite Paris-Dauphine), University of Warwick)","submitted_at":"2014-06-10T18:48:32Z","abstract_excerpt":"MCMC algorithms such as Metropolis-Hastings algorithms are slowed down by the computation of complex target distributions as exemplified by huge datasets. We offer in this paper an approach to reduce the computational costs of such algorithms by a simple and universal divide-and-conquer strategy. The idea behind the generic acceleration is to divide the acceptance step into several parts, aiming at a major reduction in computing time that outranks the corresponding reduction in acceptance probability. The division decomposes the \"prior x likelihood\" term into a product such that some of its co"},"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":"1406.2660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-06-10T18:48:32Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"a76d16f1bab5597e02f8b1114b8b524e6c5745d0cba1b32a38f2eac6371552f1","abstract_canon_sha256":"ff4495348bbb85a01c5ca5ec678d37641556740e05a974080298a6b41accd6b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:01.226765Z","signature_b64":"St8W0YwQFdMGpuDA8K89hskt6uQoZTs4Q+Hl2BF1JO4/mEQFR0Di93aElSpYz11VjRAKKbJEqOR5YgVCXAiTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e425708fa22457ba196a38a56eb2d8b81de601710a89c613928f4b0d3e8cee6","last_reissued_at":"2026-05-18T02:50:01.226291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:01.226291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Metropolis-Hastings algorithms: Delayed acceptance with prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Christian P. Robert (CEREMADE, Clara Grazian (CEREMADE, Marco Banterle (CEREMADE, Universite Paris-Dauphine, Universite Paris-Dauphine), University of Warwick)","submitted_at":"2014-06-10T18:48:32Z","abstract_excerpt":"MCMC algorithms such as Metropolis-Hastings algorithms are slowed down by the computation of complex target distributions as exemplified by huge datasets. We offer in this paper an approach to reduce the computational costs of such algorithms by a simple and universal divide-and-conquer strategy. The idea behind the generic acceleration is to divide the acceptance step into several parts, aiming at a major reduction in computing time that outranks the corresponding reduction in acceptance probability. The division decomposes the \"prior x likelihood\" term into a product such that some of its co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2660","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":"1406.2660","created_at":"2026-05-18T02:50:01.226361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2660v1","created_at":"2026-05-18T02:50:01.226361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2660","created_at":"2026-05-18T02:50:01.226361+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZBFOCH2EJCX","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZBFOCH2EJCXXIMW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZBFOCH2","created_at":"2026-05-18T12:28:33.132498+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/HZBFOCH2EJCXXIMWUOFFN2ZNRO","json":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO.json","graph_json":"https://pith.science/api/pith-number/HZBFOCH2EJCXXIMWUOFFN2ZNRO/graph.json","events_json":"https://pith.science/api/pith-number/HZBFOCH2EJCXXIMWUOFFN2ZNRO/events.json","paper":"https://pith.science/paper/HZBFOCH2"},"agent_actions":{"view_html":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO","download_json":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO.json","view_paper":"https://pith.science/paper/HZBFOCH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2660&json=true","fetch_graph":"https://pith.science/api/pith-number/HZBFOCH2EJCXXIMWUOFFN2ZNRO/graph.json","fetch_events":"https://pith.science/api/pith-number/HZBFOCH2EJCXXIMWUOFFN2ZNRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO/action/storage_attestation","attest_author":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO/action/author_attestation","sign_citation":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO/action/citation_signature","submit_replication":"https://pith.science/pith/HZBFOCH2EJCXXIMWUOFFN2ZNRO/action/replication_record"}},"created_at":"2026-05-18T02:50:01.226361+00:00","updated_at":"2026-05-18T02:50:01.226361+00:00"}