{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UIFCQZPTVGFOVDMQPPD2WLINON","short_pith_number":"pith:UIFCQZPT","canonical_record":{"source":{"id":"1503.00996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-03-03T16:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"2c1949c017fd38e13c5b6b35f9081ca08deeef0a68afbc8ba0dbecd9d7e54c40","abstract_canon_sha256":"997ca4e5037c758791669427b5bca56bd807dbd122df8fc9945244069c4d5d3e"},"schema_version":"1.0"},"canonical_sha256":"a20a2865f3a98aea8d907bc7ab2d0d7365aa4bab0b4f91c2c095fd5c21b28aca","source":{"kind":"arxiv","id":"1503.00996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00996","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00996v2","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00996","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"UIFCQZPTVGFO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UIFCQZPTVGFOVDMQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UIFCQZPT","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UIFCQZPTVGFOVDMQPPD2WLINON","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-03-03T16:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"2c1949c017fd38e13c5b6b35f9081ca08deeef0a68afbc8ba0dbecd9d7e54c40","abstract_canon_sha256":"997ca4e5037c758791669427b5bca56bd807dbd122df8fc9945244069c4d5d3e"},"schema_version":"1.0"},"canonical_sha256":"a20a2865f3a98aea8d907bc7ab2d0d7365aa4bab0b4f91c2c095fd5c21b28aca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:33.608632Z","signature_b64":"m3KgdHSQyCQIXfpYPze+PzuUM1kSfVI5J/e8dSRkyv7LvfrQsq0s8gR7SBbX6LNI/IuCvuRjOCyrelW+XSYFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20a2865f3a98aea8d907bc7ab2d0d7365aa4bab0b4f91c2c095fd5c21b28aca","last_reissued_at":"2026-05-18T02:25:33.608227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:33.608227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00996","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yI0ti7Zwqe2vfpOaBngi3IuCG1qj7GToTR5ehyhtQiWjST8liJOPuCsa35fxpnhVWt894dHjGTJuJLH3a2t3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:44:30.536379Z"},"content_sha256":"2d95d80bfc464bde8b250f80d41f3feb01d02798ac6f4b4c64a0980fbfe033a5","schema_version":"1.0","event_id":"sha256:2d95d80bfc464bde8b250f80d41f3feb01d02798ac6f4b4c64a0980fbfe033a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UIFCQZPTVGFOVDMQPPD2WLINON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Metropolis-Hastings algorithms by Delayed Acceptance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Anthony Lee (U. Warwick), Christian P. Robert (U. Paris-Dauphine, Clara Grazian (Sapienza Universit\\`a di Roma, Marco Banterle (U. Paris-Dauphine), U. Paris-Dauphine), U. Warwick)","submitted_at":"2015-03-03T16:28:15Z","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 a useful generalisation of the Delayed Acceptance approach, devised 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 out-ranks the corresponding reduction in acceptance probability. Each of the components can be sequen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00996","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Dw9kp4i4hsyApoeR2duM8gpIGo21DI0wFgLBdYK68UDxwkOejtarByjSTkt2foeeprruoJKn4IjNrKhMY78Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:44:30.536721Z"},"content_sha256":"ad18ca8092bc447a5e266157d01584fb118806b178c7a02ffda48a8341a8e7ed","schema_version":"1.0","event_id":"sha256:ad18ca8092bc447a5e266157d01584fb118806b178c7a02ffda48a8341a8e7ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIFCQZPTVGFOVDMQPPD2WLINON/bundle.json","state_url":"https://pith.science/pith/UIFCQZPTVGFOVDMQPPD2WLINON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIFCQZPTVGFOVDMQPPD2WLINON/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T16:44:30Z","links":{"resolver":"https://pith.science/pith/UIFCQZPTVGFOVDMQPPD2WLINON","bundle":"https://pith.science/pith/UIFCQZPTVGFOVDMQPPD2WLINON/bundle.json","state":"https://pith.science/pith/UIFCQZPTVGFOVDMQPPD2WLINON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIFCQZPTVGFOVDMQPPD2WLINON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UIFCQZPTVGFOVDMQPPD2WLINON","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"997ca4e5037c758791669427b5bca56bd807dbd122df8fc9945244069c4d5d3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-03-03T16:28:15Z","title_canon_sha256":"2c1949c017fd38e13c5b6b35f9081ca08deeef0a68afbc8ba0dbecd9d7e54c40"},"schema_version":"1.0","source":{"id":"1503.00996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00996","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00996v2","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00996","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"UIFCQZPTVGFO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UIFCQZPTVGFOVDMQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UIFCQZPT","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:ad18ca8092bc447a5e266157d01584fb118806b178c7a02ffda48a8341a8e7ed","target":"graph","created_at":"2026-05-18T02:25:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 a useful generalisation of the Delayed Acceptance approach, devised 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 out-ranks the corresponding reduction in acceptance probability. Each of the components can be sequen","authors_text":"Anthony Lee (U. Warwick), Christian P. Robert (U. Paris-Dauphine, Clara Grazian (Sapienza Universit\\`a di Roma, Marco Banterle (U. Paris-Dauphine), U. Paris-Dauphine), U. Warwick)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-03-03T16:28:15Z","title":"Accelerating Metropolis-Hastings algorithms by Delayed Acceptance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00996","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2d95d80bfc464bde8b250f80d41f3feb01d02798ac6f4b4c64a0980fbfe033a5","target":"record","created_at":"2026-05-18T02:25:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"997ca4e5037c758791669427b5bca56bd807dbd122df8fc9945244069c4d5d3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-03-03T16:28:15Z","title_canon_sha256":"2c1949c017fd38e13c5b6b35f9081ca08deeef0a68afbc8ba0dbecd9d7e54c40"},"schema_version":"1.0","source":{"id":"1503.00996","kind":"arxiv","version":2}},"canonical_sha256":"a20a2865f3a98aea8d907bc7ab2d0d7365aa4bab0b4f91c2c095fd5c21b28aca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a20a2865f3a98aea8d907bc7ab2d0d7365aa4bab0b4f91c2c095fd5c21b28aca","first_computed_at":"2026-05-18T02:25:33.608227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:33.608227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3KgdHSQyCQIXfpYPze+PzuUM1kSfVI5J/e8dSRkyv7LvfrQsq0s8gR7SBbX6LNI/IuCvuRjOCyrelW+XSYFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:33.608632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d95d80bfc464bde8b250f80d41f3feb01d02798ac6f4b4c64a0980fbfe033a5","sha256:ad18ca8092bc447a5e266157d01584fb118806b178c7a02ffda48a8341a8e7ed"],"state_sha256":"311d5e16f9d9741942e7a20902494282346ef29f7472816618a0b5ede5d6fc56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JY7ncvekxRr+ixqj5BtvqUGc1W5PDSIuT7wsx3N1oYVzc8kEWpVKUmLHDKffXiAFsz2mAGz54vhsQlYBts88BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:44:30.538761Z","bundle_sha256":"b7d7877fbec7c9fbe0ea4b010d502d783e8705b8e41992f726c75a9b6e48c141"}}