{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XPBB3DZY2Q2L4Z2MAHGFJWL2DX","short_pith_number":"pith:XPBB3DZY","canonical_record":{"source":{"id":"1311.4780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-19T15:23:04Z","cross_cats_sorted":["cs.DC","cs.LG","stat.CO"],"title_canon_sha256":"1bfeb575c3ce0e1f4b5f098b1537222883b2c7f1427f24756286a96543228cab","abstract_canon_sha256":"f690cf3bb5eb7c15f10746c7262b9b53d643348ea6d9d56a46c13818e128b74a"},"schema_version":"1.0"},"canonical_sha256":"bbc21d8f38d434be674c01cc54d97a1dfe0a5213ddb8b2ccfffa587eb24cbb9d","source":{"kind":"arxiv","id":"1311.4780","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XPBB3DZY2Q2L4Z2MAHGFJWL2DX","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-19T15:23:04Z","cross_cats_sorted":["cs.DC","cs.LG","stat.CO"],"title_canon_sha256":"1bfeb575c3ce0e1f4b5f098b1537222883b2c7f1427f24756286a96543228cab","abstract_canon_sha256":"f690cf3bb5eb7c15f10746c7262b9b53d643348ea6d9d56a46c13818e128b74a"},"schema_version":"1.0"},"canonical_sha256":"bbc21d8f38d434be674c01cc54d97a1dfe0a5213ddb8b2ccfffa587eb24cbb9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:57.119859Z","signature_b64":"wnTxPhG7G02Ty6XNDaugxPOiDSPOIRHDbujUg3zCO9+mk0Yrao7+AcrooQM1baLXzDuMYw0MAq4kn1zvJX2zDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbc21d8f38d434be674c01cc54d97a1dfe0a5213ddb8b2ccfffa587eb24cbb9d","last_reissued_at":"2026-05-18T02:55:57.119226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:57.119226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4780","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-18T02:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJc5c7WkCvH2poOJKrQlodh26qV19DNPZ3H4UUf8jUcXLmgVwpHHr86NPypjuvksBm4BTo3yCFEDDAfY0viYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:54:52.052681Z"},"content_sha256":"8517701a61284fa73867c7511a6dd85a0f08da347e64f021c290ccb1619646f9","schema_version":"1.0","event_id":"sha256:8517701a61284fa73867c7511a6dd85a0f08da347e64f021c290ccb1619646f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XPBB3DZY2Q2L4Z2MAHGFJWL2DX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Exact, Embarrassingly Parallel MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Chong Wang, Eric Xing, Willie Neiswanger","submitted_at":"2013-11-19T15:23:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4780","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-18T02:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x31eKb6WuZYjt65PV3rCO8/QzbE8/yx6NH+L2HBnuSVcQjfpowmJxZPYHelc9rUxHGAWt2redDmGcw2OqcTzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:54:52.053027Z"},"content_sha256":"d8bd84e3f8f59625b815a1101a42246d0809b75ff3d35c3501e4a081ae71670c","schema_version":"1.0","event_id":"sha256:d8bd84e3f8f59625b815a1101a42246d0809b75ff3d35c3501e4a081ae71670c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPBB3DZY2Q2L4Z2MAHGFJWL2DX/bundle.json","state_url":"https://pith.science/pith/XPBB3DZY2Q2L4Z2MAHGFJWL2DX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPBB3DZY2Q2L4Z2MAHGFJWL2DX/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-26T18:54:52Z","links":{"resolver":"https://pith.science/pith/XPBB3DZY2Q2L4Z2MAHGFJWL2DX","bundle":"https://pith.science/pith/XPBB3DZY2Q2L4Z2MAHGFJWL2DX/bundle.json","state":"https://pith.science/pith/XPBB3DZY2Q2L4Z2MAHGFJWL2DX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPBB3DZY2Q2L4Z2MAHGFJWL2DX/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYSnpoEZo/Czn9Xuo24X+yFIytHnQiujO11FqoEo12+tANy+H/Yo8dzj4eH4qvh9N65V+SYjQ1X+1f11rkxpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:54:52.055565Z","bundle_sha256":"8edbe834a871048b5533d7d763cfd620c1cc715c8239a6e9e47212854445d031"}}