{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6MYMBC7CCDFVZ2PKZE2BLJSBJO","short_pith_number":"pith:6MYMBC7C","canonical_record":{"source":{"id":"1511.08551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-27T03:46:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4def2c0603b79dada71e3e59412b27d590f3f46676ef9edf1f30fda4d95ebe12","abstract_canon_sha256":"b9bc811c393b0cfefea060e089f1eb9818d1ac16aa2a8434c1f5f43d15471e7b"},"schema_version":"1.0"},"canonical_sha256":"f330c08be210cb5ce9eac93415a6414b919b68552439336c96bfd1cf5211feab","source":{"kind":"arxiv","id":"1511.08551","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08551","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08551v2","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08551","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"6MYMBC7CCDFV","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6MYMBC7CCDFVZ2PK","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6MYMBC7C","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6MYMBC7CCDFVZ2PKZE2BLJSBJO","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-27T03:46:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4def2c0603b79dada71e3e59412b27d590f3f46676ef9edf1f30fda4d95ebe12","abstract_canon_sha256":"b9bc811c393b0cfefea060e089f1eb9818d1ac16aa2a8434c1f5f43d15471e7b"},"schema_version":"1.0"},"canonical_sha256":"f330c08be210cb5ce9eac93415a6414b919b68552439336c96bfd1cf5211feab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.997350Z","signature_b64":"ZdfWma9E8VGfY+bQ3Po4zabk8eS3NjwFo7ZmpGs6e6u/JVTyolIRWhTpOGQRM6xJuK8EMCdjXVaNhmufboDSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f330c08be210cb5ce9eac93415a6414b919b68552439336c96bfd1cf5211feab","last_reissued_at":"2026-05-18T01:25:10.996640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.996640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08551","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-18T01:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0+02TDTcPQBVNIubDk90sbppHPFvoeeEogEnqJmTdZnRG7XufPGnRsq4epDtAzJG6oU+0oMrbtdZhQJ0s6PBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:35:25.966133Z"},"content_sha256":"d1942bc9fe585f226c26b669f746f7e75d5df50754eb885c2450941dca4bf517","schema_version":"1.0","event_id":"sha256:d1942bc9fe585f226c26b669f746f7e75d5df50754eb885c2450941dca4bf517"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6MYMBC7CCDFVZ2PKZE2BLJSBJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regularized EM Algorithms: A Unified Framework and Statistical Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Constantine Caramanis, Xinyang Yi","submitted_at":"2015-11-27T03:46:36Z","abstract_excerpt":"Latent variable models are a fundamental modeling tool in machine learning applications, but they present significant computational and analytical challenges. The popular EM algorithm and its variants, is a much used algorithmic tool; yet our rigorous understanding of its performance is highly incomplete. Recently, work in Balakrishnan et al. (2014) has demonstrated that for an important class of problems, EM exhibits linear local convergence. In the high-dimensional setting, however, the M-step may not be well defined. We address precisely this setting through a unified treatment using regula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08551","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-18T01:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iv4aVqj0CW9F1aKbzCyVJOULv8CxhG9J6zX8IGGwVdJTc7JrhSI6IzJ18mSpzmP0qhuhnZOv8eObtCQEYsasDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:35:25.966486Z"},"content_sha256":"1c92a6b702172f58015511ff73589e533c38d8ef82f7764f396512a94e130dd9","schema_version":"1.0","event_id":"sha256:1c92a6b702172f58015511ff73589e533c38d8ef82f7764f396512a94e130dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MYMBC7CCDFVZ2PKZE2BLJSBJO/bundle.json","state_url":"https://pith.science/pith/6MYMBC7CCDFVZ2PKZE2BLJSBJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MYMBC7CCDFVZ2PKZE2BLJSBJO/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-19T18:35:25Z","links":{"resolver":"https://pith.science/pith/6MYMBC7CCDFVZ2PKZE2BLJSBJO","bundle":"https://pith.science/pith/6MYMBC7CCDFVZ2PKZE2BLJSBJO/bundle.json","state":"https://pith.science/pith/6MYMBC7CCDFVZ2PKZE2BLJSBJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MYMBC7CCDFVZ2PKZE2BLJSBJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6MYMBC7CCDFVZ2PKZE2BLJSBJO","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":"b9bc811c393b0cfefea060e089f1eb9818d1ac16aa2a8434c1f5f43d15471e7b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-27T03:46:36Z","title_canon_sha256":"4def2c0603b79dada71e3e59412b27d590f3f46676ef9edf1f30fda4d95ebe12"},"schema_version":"1.0","source":{"id":"1511.08551","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08551","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08551v2","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08551","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"6MYMBC7CCDFV","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6MYMBC7CCDFVZ2PK","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6MYMBC7C","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:1c92a6b702172f58015511ff73589e533c38d8ef82f7764f396512a94e130dd9","target":"graph","created_at":"2026-05-18T01:25:10Z","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":"Latent variable models are a fundamental modeling tool in machine learning applications, but they present significant computational and analytical challenges. The popular EM algorithm and its variants, is a much used algorithmic tool; yet our rigorous understanding of its performance is highly incomplete. Recently, work in Balakrishnan et al. (2014) has demonstrated that for an important class of problems, EM exhibits linear local convergence. In the high-dimensional setting, however, the M-step may not be well defined. We address precisely this setting through a unified treatment using regula","authors_text":"Constantine Caramanis, Xinyang Yi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-27T03:46:36Z","title":"Regularized EM Algorithms: A Unified Framework and Statistical Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08551","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:d1942bc9fe585f226c26b669f746f7e75d5df50754eb885c2450941dca4bf517","target":"record","created_at":"2026-05-18T01:25:10Z","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":"b9bc811c393b0cfefea060e089f1eb9818d1ac16aa2a8434c1f5f43d15471e7b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-27T03:46:36Z","title_canon_sha256":"4def2c0603b79dada71e3e59412b27d590f3f46676ef9edf1f30fda4d95ebe12"},"schema_version":"1.0","source":{"id":"1511.08551","kind":"arxiv","version":2}},"canonical_sha256":"f330c08be210cb5ce9eac93415a6414b919b68552439336c96bfd1cf5211feab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f330c08be210cb5ce9eac93415a6414b919b68552439336c96bfd1cf5211feab","first_computed_at":"2026-05-18T01:25:10.996640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:10.996640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZdfWma9E8VGfY+bQ3Po4zabk8eS3NjwFo7ZmpGs6e6u/JVTyolIRWhTpOGQRM6xJuK8EMCdjXVaNhmufboDSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:10.997350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08551","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1942bc9fe585f226c26b669f746f7e75d5df50754eb885c2450941dca4bf517","sha256:1c92a6b702172f58015511ff73589e533c38d8ef82f7764f396512a94e130dd9"],"state_sha256":"b432223396ae5b4fa0d151d01dc24dc08f645c80af59b60f60c7cd514168b76e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zF3e49TwM2Rg3QAjSTZ9WAnrbUYPCEBpimaW+UHKuLOqiTs9MuXaERAnzMO134cD71mlNT/IC1PeZMPGiqFABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T18:35:25.968607Z","bundle_sha256":"f9fdd95a70d01cce92479704c7964d71493f7230bd24e97030deea22e63066c1"}}