{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SBCKMUFPBRJHGBHZIVTTHACJZL","short_pith_number":"pith:SBCKMUFP","canonical_record":{"source":{"id":"1505.02827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-11T22:51:02Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"4fcf6fd582afe5e17da40cf2e5b24d330e4b2d140f9c721a7b9e0a679cdc2e3d","abstract_canon_sha256":"df6aeedc18562fad9057db68f313c9dc4d34e1881d921d816ea8632895bbf354"},"schema_version":"1.0"},"canonical_sha256":"9044a650af0c527304f94567338049cadaf0ba9d438ab4fee5c555644a819422","source":{"kind":"arxiv","id":"1505.02827","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02827","created_at":"2026-05-18T02:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02827v1","created_at":"2026-05-18T02:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02827","created_at":"2026-05-18T02:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"SBCKMUFPBRJH","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SBCKMUFPBRJHGBHZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SBCKMUFP","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SBCKMUFPBRJHGBHZIVTTHACJZL","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-11T22:51:02Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"4fcf6fd582afe5e17da40cf2e5b24d330e4b2d140f9c721a7b9e0a679cdc2e3d","abstract_canon_sha256":"df6aeedc18562fad9057db68f313c9dc4d34e1881d921d816ea8632895bbf354"},"schema_version":"1.0"},"canonical_sha256":"9044a650af0c527304f94567338049cadaf0ba9d438ab4fee5c555644a819422","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:15.940469Z","signature_b64":"izUcCN0Tb+nBVcBNEkmKhuBVq3hHBIcoSDx+hGIxAv9OI8tRF0M/X/uxcIE3BxJTgNB8Gb4bqqbk6FTqoRlmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9044a650af0c527304f94567338049cadaf0ba9d438ab4fee5c555644a819422","last_reissued_at":"2026-05-18T02:14:15.939757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:15.939757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02827","source_version":1,"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:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAB4LN9RmdjV3ATkVm2Sgjb0BekqcOYJlWqEsVFqc6UfhVJ7Vl3tUC+gSdyLOeklfKEtrU0S5VCf74gD84WNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:43:52.833234Z"},"content_sha256":"9390ffc95ae00ce34dafa32c5cff14d5fe49d52c3a64459b48ad7eca70026680","schema_version":"1.0","event_id":"sha256:9390ffc95ae00ce34dafa32c5cff14d5fe49d52c3a64459b48ad7eca70026680"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SBCKMUFPBRJHGBHZIVTTHACJZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Markov chain Monte Carlo methods for tall data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"stat.ME","authors_text":"Arnaud Doucet, Chris Holmes, R\\'emi Bardenet","submitted_at":"2015-05-11T22:51:02Z","abstract_excerpt":"Markov chain Monte Carlo methods are often deemed too computationally intensive to be of any practical use for big data applications, and in particular for inference on datasets containing a large number $n$ of individual data points, also known as tall datasets. In scenarios where data are assumed independent, various approaches to scale up the Metropolis-Hastings algorithm in a Bayesian inference context have been recently proposed in machine learning and computational statistics. These approaches can be grouped into two categories: divide-and-conquer approaches and, subsampling-based algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02827","kind":"arxiv","version":1},"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:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yUmzRLqQIX+iWvEpdhTNZbpu67benVELlpnB3WerrS0hoM1Ek6Xyp9rArU45uD+QpRFtw8a3NyV2+7/sQEg4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:43:52.833912Z"},"content_sha256":"067635e7210ed59d99b05f967378a251e3fec5d0296001d4863e6149f119ff2c","schema_version":"1.0","event_id":"sha256:067635e7210ed59d99b05f967378a251e3fec5d0296001d4863e6149f119ff2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBCKMUFPBRJHGBHZIVTTHACJZL/bundle.json","state_url":"https://pith.science/pith/SBCKMUFPBRJHGBHZIVTTHACJZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBCKMUFPBRJHGBHZIVTTHACJZL/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-23T02:43:52Z","links":{"resolver":"https://pith.science/pith/SBCKMUFPBRJHGBHZIVTTHACJZL","bundle":"https://pith.science/pith/SBCKMUFPBRJHGBHZIVTTHACJZL/bundle.json","state":"https://pith.science/pith/SBCKMUFPBRJHGBHZIVTTHACJZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBCKMUFPBRJHGBHZIVTTHACJZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SBCKMUFPBRJHGBHZIVTTHACJZL","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":"df6aeedc18562fad9057db68f313c9dc4d34e1881d921d816ea8632895bbf354","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-11T22:51:02Z","title_canon_sha256":"4fcf6fd582afe5e17da40cf2e5b24d330e4b2d140f9c721a7b9e0a679cdc2e3d"},"schema_version":"1.0","source":{"id":"1505.02827","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02827","created_at":"2026-05-18T02:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02827v1","created_at":"2026-05-18T02:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02827","created_at":"2026-05-18T02:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"SBCKMUFPBRJH","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SBCKMUFPBRJHGBHZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SBCKMUFP","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:067635e7210ed59d99b05f967378a251e3fec5d0296001d4863e6149f119ff2c","target":"graph","created_at":"2026-05-18T02:14:15Z","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":"Markov chain Monte Carlo methods are often deemed too computationally intensive to be of any practical use for big data applications, and in particular for inference on datasets containing a large number $n$ of individual data points, also known as tall datasets. In scenarios where data are assumed independent, various approaches to scale up the Metropolis-Hastings algorithm in a Bayesian inference context have been recently proposed in machine learning and computational statistics. These approaches can be grouped into two categories: divide-and-conquer approaches and, subsampling-based algori","authors_text":"Arnaud Doucet, Chris Holmes, R\\'emi Bardenet","cross_cats":["stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-11T22:51:02Z","title":"On Markov chain Monte Carlo methods for tall data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02827","kind":"arxiv","version":1},"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:9390ffc95ae00ce34dafa32c5cff14d5fe49d52c3a64459b48ad7eca70026680","target":"record","created_at":"2026-05-18T02:14:15Z","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":"df6aeedc18562fad9057db68f313c9dc4d34e1881d921d816ea8632895bbf354","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-05-11T22:51:02Z","title_canon_sha256":"4fcf6fd582afe5e17da40cf2e5b24d330e4b2d140f9c721a7b9e0a679cdc2e3d"},"schema_version":"1.0","source":{"id":"1505.02827","kind":"arxiv","version":1}},"canonical_sha256":"9044a650af0c527304f94567338049cadaf0ba9d438ab4fee5c555644a819422","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9044a650af0c527304f94567338049cadaf0ba9d438ab4fee5c555644a819422","first_computed_at":"2026-05-18T02:14:15.939757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:15.939757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izUcCN0Tb+nBVcBNEkmKhuBVq3hHBIcoSDx+hGIxAv9OI8tRF0M/X/uxcIE3BxJTgNB8Gb4bqqbk6FTqoRlmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:15.940469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02827","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9390ffc95ae00ce34dafa32c5cff14d5fe49d52c3a64459b48ad7eca70026680","sha256:067635e7210ed59d99b05f967378a251e3fec5d0296001d4863e6149f119ff2c"],"state_sha256":"3011c3c3fa9c85b78cc98116e2417e0b994e9d9843d3d6b41bde4510cdcf561a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzPf9Snr1Gq5rnrSXfpPK5jEgQw489/p8Cda2hZdm/8jkD70kPEgOQhh25ftIb//Lhul8c6Lx6NRTfEc6BMLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T02:43:52.837991Z","bundle_sha256":"76d86c80f9d6d295d4e1360d4ab7687622e17e15d279fa07d60f52de174efd96"}}