{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZACXSWLVRO3XJLKYT3GZSFSCUV","short_pith_number":"pith:ZACXSWLV","canonical_record":{"source":{"id":"1405.0182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-01T15:13:51Z","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"title_canon_sha256":"44f8424175d71a7def233a6b64c8e87a3b6ca490da18c57ed5e8c969bafbaf49","abstract_canon_sha256":"36421ae35bc43353131f4713c88204871e2bb600fb0478745f5aa1b965323787"},"schema_version":"1.0"},"canonical_sha256":"c8057959758bb774ad589ecd991642a549ef65ed30bdcc0044d6d3fafeffd51d","source":{"kind":"arxiv","id":"1405.0182","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0182","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0182v2","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0182","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZACXSWLVRO3X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZACXSWLVRO3XJLKY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZACXSWLV","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZACXSWLVRO3XJLKYT3GZSFSCUV","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-01T15:13:51Z","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"title_canon_sha256":"44f8424175d71a7def233a6b64c8e87a3b6ca490da18c57ed5e8c969bafbaf49","abstract_canon_sha256":"36421ae35bc43353131f4713c88204871e2bb600fb0478745f5aa1b965323787"},"schema_version":"1.0"},"canonical_sha256":"c8057959758bb774ad589ecd991642a549ef65ed30bdcc0044d6d3fafeffd51d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:55.530142Z","signature_b64":"IH0KynhsOkzs2NB2ion+AIb26dutD69SKx6xTs9QYyMSFADRJeqNmyE2WSqm2xzGjm0d11CSdO09JUgHBAJ8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8057959758bb774ad589ecd991642a549ef65ed30bdcc0044d6d3fafeffd51d","last_reissued_at":"2026-05-18T01:34:55.529610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:55.529610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0182","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-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqXNaOnqWMkaCa4Bbj10FYvGNWuk9UMRS3DgCMRsl84nnNoqdPF23iqH11VgB2zw3Hn5Ud+RcLaR/eJoIi8TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:28:37.860697Z"},"content_sha256":"ed9e2da7ada0859e5ec224944b5545416f6a4b7f19168cce239fc799827263a2","schema_version":"1.0","event_id":"sha256:ed9e2da7ada0859e5ec224944b5545416f6a4b7f19168cce239fc799827263a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZACXSWLVRO3XJLKYT3GZSFSCUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ergodicity of Approximate MCMC Chains with Applications to Large Data Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaron Smith, Natesh S. Pillai","submitted_at":"2014-05-01T15:13:51Z","abstract_excerpt":"In many modern applications, difficulty in evaluating the posterior density makes performing even a single MCMC step slow. This difficulty can be caused by intractable likelihood functions, but also appears for routine problems with large data sets. Many researchers have responded by running approximate versions of MCMC algorithms. In this note, we develop quantitative bounds for showing the ergodicity of these approximate samplers. We then use these bounds to study the bias-variance trade-off of approximate MCMC algorithms. We apply our results to simple versions of recently proposed algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0182","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-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNx9IxejWBgpHbnohGPf0FJNInytxv/oUyydUbTFe7kEC+m5wS7mI6YFbxbN/ByTfwKKdQ2zrQ3bVWWHrTUiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:28:37.861292Z"},"content_sha256":"247fc399ab65d091c460ec37904ad850e3a1f78800a8ac443cc13cd1b895e0e3","schema_version":"1.0","event_id":"sha256:247fc399ab65d091c460ec37904ad850e3a1f78800a8ac443cc13cd1b895e0e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZACXSWLVRO3XJLKYT3GZSFSCUV/bundle.json","state_url":"https://pith.science/pith/ZACXSWLVRO3XJLKYT3GZSFSCUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZACXSWLVRO3XJLKYT3GZSFSCUV/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-30T09:28:37Z","links":{"resolver":"https://pith.science/pith/ZACXSWLVRO3XJLKYT3GZSFSCUV","bundle":"https://pith.science/pith/ZACXSWLVRO3XJLKYT3GZSFSCUV/bundle.json","state":"https://pith.science/pith/ZACXSWLVRO3XJLKYT3GZSFSCUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZACXSWLVRO3XJLKYT3GZSFSCUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZACXSWLVRO3XJLKYT3GZSFSCUV","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":"36421ae35bc43353131f4713c88204871e2bb600fb0478745f5aa1b965323787","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-01T15:13:51Z","title_canon_sha256":"44f8424175d71a7def233a6b64c8e87a3b6ca490da18c57ed5e8c969bafbaf49"},"schema_version":"1.0","source":{"id":"1405.0182","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0182","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0182v2","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0182","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZACXSWLVRO3X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZACXSWLVRO3XJLKY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZACXSWLV","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:247fc399ab65d091c460ec37904ad850e3a1f78800a8ac443cc13cd1b895e0e3","target":"graph","created_at":"2026-05-18T01:34:55Z","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":"In many modern applications, difficulty in evaluating the posterior density makes performing even a single MCMC step slow. This difficulty can be caused by intractable likelihood functions, but also appears for routine problems with large data sets. Many researchers have responded by running approximate versions of MCMC algorithms. In this note, we develop quantitative bounds for showing the ergodicity of these approximate samplers. We then use these bounds to study the bias-variance trade-off of approximate MCMC algorithms. We apply our results to simple versions of recently proposed algorith","authors_text":"Aaron Smith, Natesh S. Pillai","cross_cats":["math.PR","stat.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-01T15:13:51Z","title":"Ergodicity of Approximate MCMC Chains with Applications to Large Data Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0182","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:ed9e2da7ada0859e5ec224944b5545416f6a4b7f19168cce239fc799827263a2","target":"record","created_at":"2026-05-18T01:34:55Z","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":"36421ae35bc43353131f4713c88204871e2bb600fb0478745f5aa1b965323787","cross_cats_sorted":["math.PR","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-01T15:13:51Z","title_canon_sha256":"44f8424175d71a7def233a6b64c8e87a3b6ca490da18c57ed5e8c969bafbaf49"},"schema_version":"1.0","source":{"id":"1405.0182","kind":"arxiv","version":2}},"canonical_sha256":"c8057959758bb774ad589ecd991642a549ef65ed30bdcc0044d6d3fafeffd51d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8057959758bb774ad589ecd991642a549ef65ed30bdcc0044d6d3fafeffd51d","first_computed_at":"2026-05-18T01:34:55.529610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:55.529610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IH0KynhsOkzs2NB2ion+AIb26dutD69SKx6xTs9QYyMSFADRJeqNmyE2WSqm2xzGjm0d11CSdO09JUgHBAJ8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:55.530142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0182","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed9e2da7ada0859e5ec224944b5545416f6a4b7f19168cce239fc799827263a2","sha256:247fc399ab65d091c460ec37904ad850e3a1f78800a8ac443cc13cd1b895e0e3"],"state_sha256":"82704eaf503059fcf44da0886233cea0ccc9acb9e35ce1d34f3ee6b42fdf2e18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJg13JHKxO0mv/Mxn0E+F/tx78iwsqERUaZeHZQ1uDe92puKV6xDAVH+0arrQYxVWuLCBfyrJx6x9h+03W76Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:28:37.864494Z","bundle_sha256":"7a0586deb43c27da4d2836887c8e2e71594e0416225205b5ec50c162d08da621"}}