{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H4J2A33FXP6DDXTFXPIEWAN44Q","short_pith_number":"pith:H4J2A33F","schema_version":"1.0","canonical_sha256":"3f13a06f65bbfc31de65bbd04b01bce42bacac23fd9900eeabc2f0d395f7f6ee","source":{"kind":"arxiv","id":"1506.08155","version":3},"attestation_state":"computed","paper":{"title":"Efficiency of delayed-acceptance random walk Metropolis algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre Thiery, Andrew Golightly, Chris Sherlock","submitted_at":"2015-06-26T16:55:12Z","abstract_excerpt":"Delayed-acceptance Metropolis-Hastings and delayed-acceptance pseudo-marginal Metropolis-Hastings algorithms can be applied when it is computationally expensive to calculate the true posterior or an unbiased stochastic approximation thereof, but a computationally cheap deterministic approximation is available. An initial accept-reject stage uses the cheap approximation for computing the Metropolis-Hastings ratio; proposals which are accepted at this stage are then subjected to a further accept-reject step which corrects for the error in the approximation. Since the expensive posterior, or the "},"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":"1506.08155","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-26T16:55:12Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"eeb34d1337714edffa5a698852320524fcdebd417cdc779f778ae1a94b80c332","abstract_canon_sha256":"f6c3e9924bbcdfc86b8f7987e4cc5766592110ae71aa3f005e731b98c4934ec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:17:16.938034Z","signature_b64":"vP2piM22OWUi97mZez8Js3p4fgSd3NUJMTJsvP71MdEcQVe0+n8p59tEVFGygib4Gx7HCqQegpyOCMvHkVqeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f13a06f65bbfc31de65bbd04b01bce42bacac23fd9900eeabc2f0d395f7f6ee","last_reissued_at":"2026-07-05T02:17:16.937500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:17:16.937500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiency of delayed-acceptance random walk Metropolis algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre Thiery, Andrew Golightly, Chris Sherlock","submitted_at":"2015-06-26T16:55:12Z","abstract_excerpt":"Delayed-acceptance Metropolis-Hastings and delayed-acceptance pseudo-marginal Metropolis-Hastings algorithms can be applied when it is computationally expensive to calculate the true posterior or an unbiased stochastic approximation thereof, but a computationally cheap deterministic approximation is available. An initial accept-reject stage uses the cheap approximation for computing the Metropolis-Hastings ratio; proposals which are accepted at this stage are then subjected to a further accept-reject step which corrects for the error in the approximation. Since the expensive posterior, or the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08155","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1506.08155/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1506.08155","created_at":"2026-07-05T02:17:16.937564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08155v3","created_at":"2026-07-05T02:17:16.937564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08155","created_at":"2026-07-05T02:17:16.937564+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4J2A33FXP6D","created_at":"2026-07-05T02:17:16.937564+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4J2A33FXP6DDXTF","created_at":"2026-07-05T02:17:16.937564+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4J2A33F","created_at":"2026-07-05T02:17:16.937564+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.04611","citing_title":"Particle Gibbs without the Gibbs bit","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q","json":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q.json","graph_json":"https://pith.science/api/pith-number/H4J2A33FXP6DDXTFXPIEWAN44Q/graph.json","events_json":"https://pith.science/api/pith-number/H4J2A33FXP6DDXTFXPIEWAN44Q/events.json","paper":"https://pith.science/paper/H4J2A33F"},"agent_actions":{"view_html":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q","download_json":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q.json","view_paper":"https://pith.science/paper/H4J2A33F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08155&json=true","fetch_graph":"https://pith.science/api/pith-number/H4J2A33FXP6DDXTFXPIEWAN44Q/graph.json","fetch_events":"https://pith.science/api/pith-number/H4J2A33FXP6DDXTFXPIEWAN44Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q/action/storage_attestation","attest_author":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q/action/author_attestation","sign_citation":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q/action/citation_signature","submit_replication":"https://pith.science/pith/H4J2A33FXP6DDXTFXPIEWAN44Q/action/replication_record"}},"created_at":"2026-07-05T02:17:16.937564+00:00","updated_at":"2026-07-05T02:17:16.937564+00:00"}