{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XPBB3DZY2Q2L4Z2MAHGFJWL2DX","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":"f690cf3bb5eb7c15f10746c7262b9b53d643348ea6d9d56a46c13818e128b74a","cross_cats_sorted":["cs.DC","cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-19T15:23:04Z","title_canon_sha256":"1bfeb575c3ce0e1f4b5f098b1537222883b2c7f1427f24756286a96543228cab"},"schema_version":"1.0","source":{"id":"1311.4780","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4780","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4780v2","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4780","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"XPBB3DZY2Q2L","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XPBB3DZY2Q2L4Z2M","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XPBB3DZY","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:d8bd84e3f8f59625b815a1101a42246d0809b75ff3d35c3501e4a081ae71670c","target":"graph","created_at":"2026-05-18T02:55:57Z","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":"Communication costs, resulting from synchronization requirements during learning, can greatly slow down many parallel machine learning algorithms. In this paper, we present a parallel Markov chain Monte Carlo (MCMC) algorithm in which subsets of data are processed independently, with very little communication. First, we arbitrarily partition data onto multiple machines. Then, on each machine, any classical MCMC method (e.g., Gibbs sampling) may be used to draw samples from a posterior distribution given the data subset. Finally, the samples from each machine are combined to form samples from t","authors_text":"Chong Wang, Eric Xing, Willie Neiswanger","cross_cats":["cs.DC","cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-19T15:23:04Z","title":"Asymptotically Exact, Embarrassingly Parallel MCMC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4780","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:8517701a61284fa73867c7511a6dd85a0f08da347e64f021c290ccb1619646f9","target":"record","created_at":"2026-05-18T02:55:57Z","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":"f690cf3bb5eb7c15f10746c7262b9b53d643348ea6d9d56a46c13818e128b74a","cross_cats_sorted":["cs.DC","cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-19T15:23:04Z","title_canon_sha256":"1bfeb575c3ce0e1f4b5f098b1537222883b2c7f1427f24756286a96543228cab"},"schema_version":"1.0","source":{"id":"1311.4780","kind":"arxiv","version":2}},"canonical_sha256":"bbc21d8f38d434be674c01cc54d97a1dfe0a5213ddb8b2ccfffa587eb24cbb9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbc21d8f38d434be674c01cc54d97a1dfe0a5213ddb8b2ccfffa587eb24cbb9d","first_computed_at":"2026-05-18T02:55:57.119226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:57.119226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wnTxPhG7G02Ty6XNDaugxPOiDSPOIRHDbujUg3zCO9+mk0Yrao7+AcrooQM1baLXzDuMYw0MAq4kn1zvJX2zDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:57.119859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4780","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8517701a61284fa73867c7511a6dd85a0f08da347e64f021c290ccb1619646f9","sha256:d8bd84e3f8f59625b815a1101a42246d0809b75ff3d35c3501e4a081ae71670c"],"state_sha256":"64d050e8c5e6f7a8b36c1384c4288aaaef347a855481d2cafdc974c50a978746"}