{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L4SMG66LKLKAC4KNK5RN6D2M3G","short_pith_number":"pith:L4SMG66L","schema_version":"1.0","canonical_sha256":"5f24c37bcb52d401714d5762df0f4cd98894caec993936e6cd3ea508daeb0a0d","source":{"kind":"arxiv","id":"1806.07533","version":1},"attestation_state":"computed","paper":{"title":"An Asynchronous Distributed Expectation Maximization Algorithm For Massive Data: The DEM Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Chuanhai Liu, Glen DePalma, Sanvesh Srivastava","submitted_at":"2018-06-20T03:20:04Z","abstract_excerpt":"The family of Expectation-Maximization (EM) algorithms provides a general approach to fitting flexible models for large and complex data. The expectation (E) step of EM-type algorithms is time-consuming in massive data applications because it requires multiple passes through the full data. We address this problem by proposing an asynchronous and distributed generalization of the EM called the Distributed EM (DEM). Using DEM, existing EM-type algorithms are easily extended to massive data settings by exploiting the divide-and-conquer technique and widely available computing power, such as grid "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1806.07533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-06-20T03:20:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"aa63c1cea6a2133b282e77bd1a1f03e4f35018b096a3eadb4532b5439a7d90ad","abstract_canon_sha256":"f92aa60e3f534b0230a1fabfaf23d63267eaa72839b0a3abcd35ab869bd6fb2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:47.472533Z","signature_b64":"vlVTsR+PCgF5n24JE9qqNoRfGX3mvr/WnRFVmr1bLeKoiZAl0a1CrnXVeSJQxJol/8rDaw+j/3YTxxbamfLdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f24c37bcb52d401714d5762df0f4cd98894caec993936e6cd3ea508daeb0a0d","last_reissued_at":"2026-05-18T00:12:47.471784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:47.471784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Asynchronous Distributed Expectation Maximization Algorithm For Massive Data: The DEM Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Chuanhai Liu, Glen DePalma, Sanvesh Srivastava","submitted_at":"2018-06-20T03:20:04Z","abstract_excerpt":"The family of Expectation-Maximization (EM) algorithms provides a general approach to fitting flexible models for large and complex data. The expectation (E) step of EM-type algorithms is time-consuming in massive data applications because it requires multiple passes through the full data. We address this problem by proposing an asynchronous and distributed generalization of the EM called the Distributed EM (DEM). Using DEM, existing EM-type algorithms are easily extended to massive data settings by exploiting the divide-and-conquer technique and widely available computing power, such as grid "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07533","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.07533","created_at":"2026-05-18T00:12:47.471921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07533v1","created_at":"2026-05-18T00:12:47.471921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07533","created_at":"2026-05-18T00:12:47.471921+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4SMG66LKLKA","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4SMG66LKLKAC4KN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4SMG66L","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G","json":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G.json","graph_json":"https://pith.science/api/pith-number/L4SMG66LKLKAC4KNK5RN6D2M3G/graph.json","events_json":"https://pith.science/api/pith-number/L4SMG66LKLKAC4KNK5RN6D2M3G/events.json","paper":"https://pith.science/paper/L4SMG66L"},"agent_actions":{"view_html":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G","download_json":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G.json","view_paper":"https://pith.science/paper/L4SMG66L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07533&json=true","fetch_graph":"https://pith.science/api/pith-number/L4SMG66LKLKAC4KNK5RN6D2M3G/graph.json","fetch_events":"https://pith.science/api/pith-number/L4SMG66LKLKAC4KNK5RN6D2M3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G/action/storage_attestation","attest_author":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G/action/author_attestation","sign_citation":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G/action/citation_signature","submit_replication":"https://pith.science/pith/L4SMG66LKLKAC4KNK5RN6D2M3G/action/replication_record"}},"created_at":"2026-05-18T00:12:47.471921+00:00","updated_at":"2026-05-18T00:12:47.471921+00:00"}