{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3QRPG3E3VOB75PWXTC6NB2RHJE","short_pith_number":"pith:3QRPG3E3","canonical_record":{"source":{"id":"1408.2156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-09T21:40:15Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"d4aa17e552df2cad835b6a5afd487c8efab53b0589f9b7d113978696a257b597","abstract_canon_sha256":"f5435181f07a9581b3d0285f803704eae116fb2e8c0bddbf301a735387538618"},"schema_version":"1.0"},"canonical_sha256":"dc22f36c9bab83febed798bcd0ea27492fd5bdc07bda5cfce82a0ec854fa64ec","source":{"kind":"arxiv","id":"1408.2156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2156","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2156v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2156","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"3QRPG3E3VOB7","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3QRPG3E3VOB75PWX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3QRPG3E3","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3QRPG3E3VOB75PWXTC6NB2RHJE","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-09T21:40:15Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"d4aa17e552df2cad835b6a5afd487c8efab53b0589f9b7d113978696a257b597","abstract_canon_sha256":"f5435181f07a9581b3d0285f803704eae116fb2e8c0bddbf301a735387538618"},"schema_version":"1.0"},"canonical_sha256":"dc22f36c9bab83febed798bcd0ea27492fd5bdc07bda5cfce82a0ec854fa64ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.227070Z","signature_b64":"N49HL92pQGy+M+jj44mBuGgkkk+SI4B2HWRxc2BR8UWNhO1r67wYdKb768RNTJ0icXTYhWMQZorTs03mxOz/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc22f36c9bab83febed798bcd0ea27492fd5bdc07bda5cfce82a0ec854fa64ec","last_reissued_at":"2026-05-18T02:45:30.226492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.226492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2156","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RrdpE0OgIii25e6W4Xez022rf6oIsfkufuKPfDMBBOXeY0f6jdTwUBLYtk5L2bP5xZ3GigP2Z4imqEhZqzEmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:30.139797Z"},"content_sha256":"63f856ca9cf0a993c4c901e86031a92007e4995cff2d44544d11d14984916b00","schema_version":"1.0","event_id":"sha256:63f856ca9cf0a993c4c901e86031a92007e4995cff2d44544d11d14984916b00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3QRPG3E3VOB75PWXTC6NB2RHJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical guarantees for the EM algorithm: From population to sample-based analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Bin Yu, Martin J. Wainwright, Sivaraman Balakrishnan","submitted_at":"2014-08-09T21:40:15Z","abstract_excerpt":"We develop a general framework for proving rigorous guarantees on the performance of the EM algorithm and a variant known as gradient EM. Our analysis is divided into two parts: a treatment of these algorithms at the population level (in the limit of infinite data), followed by results that apply to updates based on a finite set of samples. First, we characterize the domain of attraction of any global maximizer of the population likelihood. This characterization is based on a novel view of the EM updates as a perturbed form of likelihood ascent, or in parallel, of the gradient EM updates as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2156","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nz3M8gLvq4zH162LnsMBPeZ3xbszpF9g1qbxq4Xk1rzgpGz6G+eoz0mqwjrCJBhSbhYeK5CuXXOB0barpPp4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:30.140473Z"},"content_sha256":"c5f65445cb25a16c96c7c9dde6c879cd78168012afe024040cace1e3f6addca8","schema_version":"1.0","event_id":"sha256:c5f65445cb25a16c96c7c9dde6c879cd78168012afe024040cace1e3f6addca8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QRPG3E3VOB75PWXTC6NB2RHJE/bundle.json","state_url":"https://pith.science/pith/3QRPG3E3VOB75PWXTC6NB2RHJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QRPG3E3VOB75PWXTC6NB2RHJE/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-01T19:00:30Z","links":{"resolver":"https://pith.science/pith/3QRPG3E3VOB75PWXTC6NB2RHJE","bundle":"https://pith.science/pith/3QRPG3E3VOB75PWXTC6NB2RHJE/bundle.json","state":"https://pith.science/pith/3QRPG3E3VOB75PWXTC6NB2RHJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QRPG3E3VOB75PWXTC6NB2RHJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3QRPG3E3VOB75PWXTC6NB2RHJE","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":"f5435181f07a9581b3d0285f803704eae116fb2e8c0bddbf301a735387538618","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-09T21:40:15Z","title_canon_sha256":"d4aa17e552df2cad835b6a5afd487c8efab53b0589f9b7d113978696a257b597"},"schema_version":"1.0","source":{"id":"1408.2156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2156","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2156v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2156","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"3QRPG3E3VOB7","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3QRPG3E3VOB75PWX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3QRPG3E3","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:c5f65445cb25a16c96c7c9dde6c879cd78168012afe024040cace1e3f6addca8","target":"graph","created_at":"2026-05-18T02:45:30Z","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":"We develop a general framework for proving rigorous guarantees on the performance of the EM algorithm and a variant known as gradient EM. Our analysis is divided into two parts: a treatment of these algorithms at the population level (in the limit of infinite data), followed by results that apply to updates based on a finite set of samples. First, we characterize the domain of attraction of any global maximizer of the population likelihood. This characterization is based on a novel view of the EM updates as a perturbed form of likelihood ascent, or in parallel, of the gradient EM updates as a ","authors_text":"Bin Yu, Martin J. Wainwright, Sivaraman Balakrishnan","cross_cats":["cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-09T21:40:15Z","title":"Statistical guarantees for the EM algorithm: From population to sample-based analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2156","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:63f856ca9cf0a993c4c901e86031a92007e4995cff2d44544d11d14984916b00","target":"record","created_at":"2026-05-18T02:45:30Z","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":"f5435181f07a9581b3d0285f803704eae116fb2e8c0bddbf301a735387538618","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-08-09T21:40:15Z","title_canon_sha256":"d4aa17e552df2cad835b6a5afd487c8efab53b0589f9b7d113978696a257b597"},"schema_version":"1.0","source":{"id":"1408.2156","kind":"arxiv","version":1}},"canonical_sha256":"dc22f36c9bab83febed798bcd0ea27492fd5bdc07bda5cfce82a0ec854fa64ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc22f36c9bab83febed798bcd0ea27492fd5bdc07bda5cfce82a0ec854fa64ec","first_computed_at":"2026-05-18T02:45:30.226492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:30.226492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N49HL92pQGy+M+jj44mBuGgkkk+SI4B2HWRxc2BR8UWNhO1r67wYdKb768RNTJ0icXTYhWMQZorTs03mxOz/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:30.227070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63f856ca9cf0a993c4c901e86031a92007e4995cff2d44544d11d14984916b00","sha256:c5f65445cb25a16c96c7c9dde6c879cd78168012afe024040cace1e3f6addca8"],"state_sha256":"b397a3cbd8d964d7105f2673c6298e125860ac4111741aed452fb0de5b4186bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mf7pD/aye0scYjmts5NK18Ja1HU/ZPzf4WYoVYkafJGos2Mm7500B0yeCQL421alGth8vXu8cXH62l6tn4fcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:00:30.142280Z","bundle_sha256":"748344cf4dc2912db9ddfc1163e2942d54fc1c3dc9757e37ecde1372d55bd573"}}