{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PAJ7NX555ADHLV3Z7CPQL4KGQ4","short_pith_number":"pith:PAJ7NX55","canonical_record":{"source":{"id":"1507.06110","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-22T09:25:21Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"03151299627ea792d85f48abe2be5745fbf3cd0c0150a96c3d0e1113ca5af578","abstract_canon_sha256":"23a31c8fd2fc8af2acf74dbe1d5f00ffc2da6cffeafdfa76559a3f45d761fdb1"},"schema_version":"1.0"},"canonical_sha256":"7813f6dfbde80675d779f89f05f1468725402a1173d0b1ad1f35bfebd3813e20","source":{"kind":"arxiv","id":"1507.06110","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06110","created_at":"2026-05-18T00:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06110v3","created_at":"2026-05-18T00:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06110","created_at":"2026-05-18T00:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"PAJ7NX555ADH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"PAJ7NX555ADHLV3Z","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"PAJ7NX55","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PAJ7NX555ADHLV3Z7CPQL4KGQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06110","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-22T09:25:21Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"03151299627ea792d85f48abe2be5745fbf3cd0c0150a96c3d0e1113ca5af578","abstract_canon_sha256":"23a31c8fd2fc8af2acf74dbe1d5f00ffc2da6cffeafdfa76559a3f45d761fdb1"},"schema_version":"1.0"},"canonical_sha256":"7813f6dfbde80675d779f89f05f1468725402a1173d0b1ad1f35bfebd3813e20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:10.079260Z","signature_b64":"j8DuNOUONNvdPNJfXmY2jYY8yHy1hxskNnnjf2V4vnMyOpA+KPxyf/oowlvar986YFKWzEogaCrmmqReBmjBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7813f6dfbde80675d779f89f05f1468725402a1173d0b1ad1f35bfebd3813e20","last_reissued_at":"2026-05-18T00:48:10.078557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:10.078557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06110","source_version":3,"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-18T00:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LarAg1iRJ1JVmZFTNe2N9v+79eyyM/A9aEOKHzhT2hQuOdaF+DUdV7ISqqWjAhzlsbdGcKuQZ/5kaxToEmrNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:30:46.733065Z"},"content_sha256":"41a55a293fdd343d70219648e59d28ee8195848260f449004499e073db7c0beb","schema_version":"1.0","event_id":"sha256:41a55a293fdd343d70219648e59d28ee8195848260f449004499e073db7c0beb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PAJ7NX555ADHLV3Z7CPQL4KGQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding Up MCMC by Delayed Acceptance and Data Subsampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Matias Quiroz, Mattias Villani, Minh-Ngoc Tran, Robert Kohn","submitted_at":"2015-07-22T09:25:21Z","abstract_excerpt":"The complexity of the Metropolis-Hastings (MH) algorithm arises from the requirement of a likelihood evaluation for the full data set in each iteration. Payne and Mallick (2015) propose to speed up the algorithm by a delayed acceptance approach where the acceptance decision proceeds in two stages. In the first stage, an estimate of the likelihood based on a random subsample determines if it is likely that the draw will be accepted and, if so, the second stage uses the full data likelihood to decide upon final acceptance. Evaluating the full data likelihood is thus avoided for draws that are un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06110","kind":"arxiv","version":3},"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-18T00:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DyQh7Bu7w6WHgTmOYjHqIrsMz/AQZElqcj/nCWyDivfzqwKWcABlcxZf42d8kTxJ/vy6ftWTJRldXcghIfHcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:30:46.733433Z"},"content_sha256":"6c06abb3292259d993e966e9a5f6a210fe0f730bbd53ec1fd6172c367418c201","schema_version":"1.0","event_id":"sha256:6c06abb3292259d993e966e9a5f6a210fe0f730bbd53ec1fd6172c367418c201"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAJ7NX555ADHLV3Z7CPQL4KGQ4/bundle.json","state_url":"https://pith.science/pith/PAJ7NX555ADHLV3Z7CPQL4KGQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAJ7NX555ADHLV3Z7CPQL4KGQ4/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-05-28T03:30:46Z","links":{"resolver":"https://pith.science/pith/PAJ7NX555ADHLV3Z7CPQL4KGQ4","bundle":"https://pith.science/pith/PAJ7NX555ADHLV3Z7CPQL4KGQ4/bundle.json","state":"https://pith.science/pith/PAJ7NX555ADHLV3Z7CPQL4KGQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAJ7NX555ADHLV3Z7CPQL4KGQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PAJ7NX555ADHLV3Z7CPQL4KGQ4","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":"23a31c8fd2fc8af2acf74dbe1d5f00ffc2da6cffeafdfa76559a3f45d761fdb1","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-22T09:25:21Z","title_canon_sha256":"03151299627ea792d85f48abe2be5745fbf3cd0c0150a96c3d0e1113ca5af578"},"schema_version":"1.0","source":{"id":"1507.06110","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06110","created_at":"2026-05-18T00:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06110v3","created_at":"2026-05-18T00:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06110","created_at":"2026-05-18T00:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"PAJ7NX555ADH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"PAJ7NX555ADHLV3Z","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"PAJ7NX55","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:6c06abb3292259d993e966e9a5f6a210fe0f730bbd53ec1fd6172c367418c201","target":"graph","created_at":"2026-05-18T00:48:10Z","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":"The complexity of the Metropolis-Hastings (MH) algorithm arises from the requirement of a likelihood evaluation for the full data set in each iteration. Payne and Mallick (2015) propose to speed up the algorithm by a delayed acceptance approach where the acceptance decision proceeds in two stages. In the first stage, an estimate of the likelihood based on a random subsample determines if it is likely that the draw will be accepted and, if so, the second stage uses the full data likelihood to decide upon final acceptance. Evaluating the full data likelihood is thus avoided for draws that are un","authors_text":"Matias Quiroz, Mattias Villani, Minh-Ngoc Tran, Robert Kohn","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-22T09:25:21Z","title":"Speeding Up MCMC by Delayed Acceptance and Data Subsampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06110","kind":"arxiv","version":3},"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:41a55a293fdd343d70219648e59d28ee8195848260f449004499e073db7c0beb","target":"record","created_at":"2026-05-18T00:48:10Z","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":"23a31c8fd2fc8af2acf74dbe1d5f00ffc2da6cffeafdfa76559a3f45d761fdb1","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-22T09:25:21Z","title_canon_sha256":"03151299627ea792d85f48abe2be5745fbf3cd0c0150a96c3d0e1113ca5af578"},"schema_version":"1.0","source":{"id":"1507.06110","kind":"arxiv","version":3}},"canonical_sha256":"7813f6dfbde80675d779f89f05f1468725402a1173d0b1ad1f35bfebd3813e20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7813f6dfbde80675d779f89f05f1468725402a1173d0b1ad1f35bfebd3813e20","first_computed_at":"2026-05-18T00:48:10.078557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:10.078557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j8DuNOUONNvdPNJfXmY2jYY8yHy1hxskNnnjf2V4vnMyOpA+KPxyf/oowlvar986YFKWzEogaCrmmqReBmjBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:10.079260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06110","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41a55a293fdd343d70219648e59d28ee8195848260f449004499e073db7c0beb","sha256:6c06abb3292259d993e966e9a5f6a210fe0f730bbd53ec1fd6172c367418c201"],"state_sha256":"b5ade4741706eb6b301399d8bc0a5a4a171848e556df3419ed96069fc5da3991"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0/4xzFChUna6zsQJKvPaZeKTMtXkPVNptd0g2FWqfRYPBJ6qzd5ft0aoXXd/rEkg0cqAkbUixCSMMUiiksNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:30:46.735426Z","bundle_sha256":"cc92b4517c147d762924a3d67d0bc6d309d6f7b85536adf91950e0331b024bf6"}}