{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FYXGBPJX7ZG7RUD5FUSTD6PHQV","short_pith_number":"pith:FYXGBPJX","canonical_record":{"source":{"id":"1901.09881","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-28T18:54:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"844f4ed94ef34fdcd583da8f37257dcaa16fa49950b1561414f861c80db2bc5f","abstract_canon_sha256":"c064e78c2d273765cb71f22e8b51fc08590930904b3ee2e7fc7ea650529179d0"},"schema_version":"1.0"},"canonical_sha256":"2e2e60bd37fe4df8d07d2d2531f9e7855b8dc7f31d88bd166ba752b1032a7117","source":{"kind":"arxiv","id":"1901.09881","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09881","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09881v3","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09881","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"FYXGBPJX7ZG7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FYXGBPJX7ZG7RUD5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FYXGBPJX","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FYXGBPJX7ZG7RUD5FUSTD6PHQV","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09881","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-28T18:54:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"844f4ed94ef34fdcd583da8f37257dcaa16fa49950b1561414f861c80db2bc5f","abstract_canon_sha256":"c064e78c2d273765cb71f22e8b51fc08590930904b3ee2e7fc7ea650529179d0"},"schema_version":"1.0"},"canonical_sha256":"2e2e60bd37fe4df8d07d2d2531f9e7855b8dc7f31d88bd166ba752b1032a7117","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:42.661964Z","signature_b64":"Tw9Yc9VMLk58KWRtwQ2vR4aU/b2cCCkx9N9Qw82iBoCUXPAtOLFEV+fjI6W7uLDScDphV6PYxCETM4fYv2SaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e2e60bd37fe4df8d07d2d2531f9e7855b8dc7f31d88bd166ba752b1032a7117","last_reissued_at":"2026-05-17T23:43:42.661292Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:42.661292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09881","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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H36qciBEonKbNvn1fP/A6ssD2aj3pQ2YCy03qFsmBz0zE4mLJNJlzLFlCNG/LQGc4Ix58RfQvL9G4ot1OVSaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:33:10.776954Z"},"content_sha256":"b6d82cfdb1f0cf2ec71a7de46429595112e5ac15d72cbabf58f6686a2d563612","schema_version":"1.0","event_id":"sha256:b6d82cfdb1f0cf2ec71a7de46429595112e5ac15d72cbabf58f6686a2d563612"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FYXGBPJX7ZG7RUD5FUSTD6PHQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Metropolis-Hastings for Exact Bayesian Inference with Large Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandre Bouchard-C\\^ot\\'e, Arnaud Doucet, George Deligiannidis, Paul Vanetti, Robert Cornish","submitted_at":"2019-01-28T18:54:11Z","abstract_excerpt":"Bayesian inference via standard Markov Chain Monte Carlo (MCMC) methods is too computationally intensive to handle large datasets, since the cost per step usually scales like $\\Theta(n)$ in the number of data points $n$. We propose the Scalable Metropolis-Hastings (SMH) kernel that exploits Gaussian concentration of the posterior to require processing on average only $O(1)$ or even $O(1/\\sqrt{n})$ data points per step. This scheme is based on a combination of factorized acceptance probabilities, procedures for fast simulation of Bernoulli processes, and control variate ideas. Contrary to many "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09881","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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsFn6vs4G1Mvzy1lJRdMGg2nb3Lzf2g4dtwbPbr1t3RIaH6VU7iReXh2GnQNL8ZBBYRUfjMEh5SCA1nYHjuLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:33:10.777299Z"},"content_sha256":"6522946d46854d6d832c476f96e638eb91694d5013ad277dd6736b0f37cc8c37","schema_version":"1.0","event_id":"sha256:6522946d46854d6d832c476f96e638eb91694d5013ad277dd6736b0f37cc8c37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYXGBPJX7ZG7RUD5FUSTD6PHQV/bundle.json","state_url":"https://pith.science/pith/FYXGBPJX7ZG7RUD5FUSTD6PHQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYXGBPJX7ZG7RUD5FUSTD6PHQV/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-06-03T04:33:10Z","links":{"resolver":"https://pith.science/pith/FYXGBPJX7ZG7RUD5FUSTD6PHQV","bundle":"https://pith.science/pith/FYXGBPJX7ZG7RUD5FUSTD6PHQV/bundle.json","state":"https://pith.science/pith/FYXGBPJX7ZG7RUD5FUSTD6PHQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYXGBPJX7ZG7RUD5FUSTD6PHQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FYXGBPJX7ZG7RUD5FUSTD6PHQV","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":"c064e78c2d273765cb71f22e8b51fc08590930904b3ee2e7fc7ea650529179d0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-28T18:54:11Z","title_canon_sha256":"844f4ed94ef34fdcd583da8f37257dcaa16fa49950b1561414f861c80db2bc5f"},"schema_version":"1.0","source":{"id":"1901.09881","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09881","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09881v3","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09881","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"FYXGBPJX7ZG7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FYXGBPJX7ZG7RUD5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FYXGBPJX","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:6522946d46854d6d832c476f96e638eb91694d5013ad277dd6736b0f37cc8c37","target":"graph","created_at":"2026-05-17T23:43:42Z","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":"Bayesian inference via standard Markov Chain Monte Carlo (MCMC) methods is too computationally intensive to handle large datasets, since the cost per step usually scales like $\\Theta(n)$ in the number of data points $n$. We propose the Scalable Metropolis-Hastings (SMH) kernel that exploits Gaussian concentration of the posterior to require processing on average only $O(1)$ or even $O(1/\\sqrt{n})$ data points per step. This scheme is based on a combination of factorized acceptance probabilities, procedures for fast simulation of Bernoulli processes, and control variate ideas. Contrary to many ","authors_text":"Alexandre Bouchard-C\\^ot\\'e, Arnaud Doucet, George Deligiannidis, Paul Vanetti, Robert Cornish","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-28T18:54:11Z","title":"Scalable Metropolis-Hastings for Exact Bayesian Inference with Large Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09881","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:b6d82cfdb1f0cf2ec71a7de46429595112e5ac15d72cbabf58f6686a2d563612","target":"record","created_at":"2026-05-17T23:43:42Z","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":"c064e78c2d273765cb71f22e8b51fc08590930904b3ee2e7fc7ea650529179d0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-28T18:54:11Z","title_canon_sha256":"844f4ed94ef34fdcd583da8f37257dcaa16fa49950b1561414f861c80db2bc5f"},"schema_version":"1.0","source":{"id":"1901.09881","kind":"arxiv","version":3}},"canonical_sha256":"2e2e60bd37fe4df8d07d2d2531f9e7855b8dc7f31d88bd166ba752b1032a7117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e2e60bd37fe4df8d07d2d2531f9e7855b8dc7f31d88bd166ba752b1032a7117","first_computed_at":"2026-05-17T23:43:42.661292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:42.661292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tw9Yc9VMLk58KWRtwQ2vR4aU/b2cCCkx9N9Qw82iBoCUXPAtOLFEV+fjI6W7uLDScDphV6PYxCETM4fYv2SaCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:42.661964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09881","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6d82cfdb1f0cf2ec71a7de46429595112e5ac15d72cbabf58f6686a2d563612","sha256:6522946d46854d6d832c476f96e638eb91694d5013ad277dd6736b0f37cc8c37"],"state_sha256":"fcf24e29b5bc477bbf3003d89106e41dd15dc20201549ca56573d235acf82001"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QG2Zn6qSJf1bWsiTTf8+qzoP7RS8iP1/0X6vCysxnMKGaGWBqWwnIKXF/gC1HWd20fdRCb14oovSa/jxVxjkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:33:10.779216Z","bundle_sha256":"bfd830c974e98f67aadf724b6ce17028db297c7b12fecccf4945b161db9cc47e"}}