{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DGU7LOGK6GHA72OV22UCRZ3DGC","short_pith_number":"pith:DGU7LOGK","canonical_record":{"source":{"id":"1402.1694","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-02-07T16:59:31Z","cross_cats_sorted":["stat.AP","stat.CO"],"title_canon_sha256":"cdd5db2e0adc66b0c3736758829bd01090da7d08f06d3150d95cc73b1fb570a6","abstract_canon_sha256":"9b4ea36b2b151b3c153b0625e1a00f66e7d3903220efd8bd5546baf68a3112b5"},"schema_version":"1.0"},"canonical_sha256":"19a9f5b8caf18e0fe9d5d6a828e76330b3495d7a6e789742a4a6b0113d4d7eaa","source":{"kind":"arxiv","id":"1402.1694","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1694","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1694v4","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1694","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"DGU7LOGK6GHA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DGU7LOGK6GHA72OV","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DGU7LOGK","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DGU7LOGK6GHA72OV22UCRZ3DGC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1694","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-02-07T16:59:31Z","cross_cats_sorted":["stat.AP","stat.CO"],"title_canon_sha256":"cdd5db2e0adc66b0c3736758829bd01090da7d08f06d3150d95cc73b1fb570a6","abstract_canon_sha256":"9b4ea36b2b151b3c153b0625e1a00f66e7d3903220efd8bd5546baf68a3112b5"},"schema_version":"1.0"},"canonical_sha256":"19a9f5b8caf18e0fe9d5d6a828e76330b3495d7a6e789742a4a6b0113d4d7eaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.295376Z","signature_b64":"ywTkuDHqqpNlYU0pbZIEwtVPEh796Y7jpcLfMcHpKhZHDOGHI7Pq978ae935CKeQUbmhBmgyvblzAr/8tnn6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a9f5b8caf18e0fe9d5d6a828e76330b3495d7a6e789742a4a6b0113d4d7eaa","last_reissued_at":"2026-05-18T00:53:21.294952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.294952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1694","source_version":4,"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:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXz8INgx18yp32j5P0B1JrMnCqNol1eVNBsj2NbZL7HixKtIZTaewybQ1wVY8R8FudMYAvVhXAERcA9piJndCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:17:35.971803Z"},"content_sha256":"d1d6329759394e902160af487d878096691633c932b59e52c2094e38149b64e3","schema_version":"1.0","event_id":"sha256:d1d6329759394e902160af487d878096691633c932b59e52c2094e38149b64e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DGU7LOGK6GHA72OV22UCRZ3DGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Aaron Smith, Natesh S. Pillai, Patrick R. Conrad, Youssef M. Marzouk","submitted_at":"2014-02-07T16:59:31Z","abstract_excerpt":"We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis-Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler's exactness or efficiency; our work seeks to address these limitations by expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1694","kind":"arxiv","version":4},"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:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oN3Zuj1yFgkZA1ePh+l5VF+WRRDvVVTn5O/K9DupDA9PXq3Xqb36ahe9wU9kbmC5eZG3gJu8lrEjjU1+pt8hDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:17:35.972478Z"},"content_sha256":"7b33cab7ed28289b97ee71ec83f33d324a2e8405a12ff419db92ca8e12a737a4","schema_version":"1.0","event_id":"sha256:7b33cab7ed28289b97ee71ec83f33d324a2e8405a12ff419db92ca8e12a737a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGU7LOGK6GHA72OV22UCRZ3DGC/bundle.json","state_url":"https://pith.science/pith/DGU7LOGK6GHA72OV22UCRZ3DGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGU7LOGK6GHA72OV22UCRZ3DGC/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-20T17:17:35Z","links":{"resolver":"https://pith.science/pith/DGU7LOGK6GHA72OV22UCRZ3DGC","bundle":"https://pith.science/pith/DGU7LOGK6GHA72OV22UCRZ3DGC/bundle.json","state":"https://pith.science/pith/DGU7LOGK6GHA72OV22UCRZ3DGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGU7LOGK6GHA72OV22UCRZ3DGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DGU7LOGK6GHA72OV22UCRZ3DGC","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":"9b4ea36b2b151b3c153b0625e1a00f66e7d3903220efd8bd5546baf68a3112b5","cross_cats_sorted":["stat.AP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-02-07T16:59:31Z","title_canon_sha256":"cdd5db2e0adc66b0c3736758829bd01090da7d08f06d3150d95cc73b1fb570a6"},"schema_version":"1.0","source":{"id":"1402.1694","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1694","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1694v4","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1694","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"DGU7LOGK6GHA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DGU7LOGK6GHA72OV","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DGU7LOGK","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:7b33cab7ed28289b97ee71ec83f33d324a2e8405a12ff419db92ca8e12a737a4","target":"graph","created_at":"2026-05-18T00:53:21Z","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":"We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis-Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler's exactness or efficiency; our work seeks to address these limitations by expl","authors_text":"Aaron Smith, Natesh S. Pillai, Patrick R. Conrad, Youssef M. Marzouk","cross_cats":["stat.AP","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-02-07T16:59:31Z","title":"Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1694","kind":"arxiv","version":4},"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:d1d6329759394e902160af487d878096691633c932b59e52c2094e38149b64e3","target":"record","created_at":"2026-05-18T00:53:21Z","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":"9b4ea36b2b151b3c153b0625e1a00f66e7d3903220efd8bd5546baf68a3112b5","cross_cats_sorted":["stat.AP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-02-07T16:59:31Z","title_canon_sha256":"cdd5db2e0adc66b0c3736758829bd01090da7d08f06d3150d95cc73b1fb570a6"},"schema_version":"1.0","source":{"id":"1402.1694","kind":"arxiv","version":4}},"canonical_sha256":"19a9f5b8caf18e0fe9d5d6a828e76330b3495d7a6e789742a4a6b0113d4d7eaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19a9f5b8caf18e0fe9d5d6a828e76330b3495d7a6e789742a4a6b0113d4d7eaa","first_computed_at":"2026-05-18T00:53:21.294952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:21.294952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ywTkuDHqqpNlYU0pbZIEwtVPEh796Y7jpcLfMcHpKhZHDOGHI7Pq978ae935CKeQUbmhBmgyvblzAr/8tnn6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:21.295376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1694","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1d6329759394e902160af487d878096691633c932b59e52c2094e38149b64e3","sha256:7b33cab7ed28289b97ee71ec83f33d324a2e8405a12ff419db92ca8e12a737a4"],"state_sha256":"cfa1bf86adab0b0812d82f9473eb8f7218a04f5faa01bf49afb7b6f075a554d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6RRine180b6pSyNrhfadmmIT+wzrMTCiQ7AloN2v2L0KUVC1LALZHPcmeoO0jqyoX2HBjthqVPYa29Urvl5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T17:17:35.975513Z","bundle_sha256":"c0c8b072476bb14b2c318b3a6b11177d307d00052660019e77134b03c6a6241c"}}