{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HUCZDXSHREJOAY64SMPKAQ3VLE","short_pith_number":"pith:HUCZDXSH","schema_version":"1.0","canonical_sha256":"3d0591de478912e063dc931ea04375590c9843cbc5a4a92fd6f31573aaeb65aa","source":{"kind":"arxiv","id":"1104.2203","version":1},"attestation_state":"computed","paper":{"title":"The MM Alternative to EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Kenneth Lange, Tong Tong Wu","submitted_at":"2011-04-12T13:14:51Z","abstract_excerpt":"The EM algorithm is a special case of a more general algorithm called the MM algorithm. Specific MM algorithms often have nothing to do with missing data. The first M step of an MM algorithm creates a surrogate function that is optimized in the second M step. In minimization, MM stands for majorize--minimize; in maximization, it stands for minorize--maximize. This two-step process always drives the objective function in the right direction. Construction of MM algorithms relies on recognizing and manipulating inequalities rather than calculating conditional expectations. This survey walks the r"},"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":"1104.2203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-04-12T13:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"87cf438243949ed6b71fe011f6ab53663522fec4635ededcd980b4d42255dfd6","abstract_canon_sha256":"882a028d5b8a5e432ca7adbada011a6dd3074441fe5715972b034dd2cd292ebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.756293Z","signature_b64":"8WPK2pX+6YMwAghEK9vzMS63NFiJ0VsUrKxz0UombZNuTpDKHb7HTrRrmcXD1OpYl8SRkRb7eC2MArf4ePj1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0591de478912e063dc931ea04375590c9843cbc5a4a92fd6f31573aaeb65aa","last_reissued_at":"2026-05-18T04:24:35.755783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.755783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The MM Alternative to EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Kenneth Lange, Tong Tong Wu","submitted_at":"2011-04-12T13:14:51Z","abstract_excerpt":"The EM algorithm is a special case of a more general algorithm called the MM algorithm. Specific MM algorithms often have nothing to do with missing data. The first M step of an MM algorithm creates a surrogate function that is optimized in the second M step. In minimization, MM stands for majorize--minimize; in maximization, it stands for minorize--maximize. This two-step process always drives the objective function in the right direction. Construction of MM algorithms relies on recognizing and manipulating inequalities rather than calculating conditional expectations. This survey walks the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2203","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":"1104.2203","created_at":"2026-05-18T04:24:35.755853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2203v1","created_at":"2026-05-18T04:24:35.755853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2203","created_at":"2026-05-18T04:24:35.755853+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUCZDXSHREJO","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUCZDXSHREJOAY64","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUCZDXSH","created_at":"2026-05-18T12:26:30.835961+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/HUCZDXSHREJOAY64SMPKAQ3VLE","json":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE.json","graph_json":"https://pith.science/api/pith-number/HUCZDXSHREJOAY64SMPKAQ3VLE/graph.json","events_json":"https://pith.science/api/pith-number/HUCZDXSHREJOAY64SMPKAQ3VLE/events.json","paper":"https://pith.science/paper/HUCZDXSH"},"agent_actions":{"view_html":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE","download_json":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE.json","view_paper":"https://pith.science/paper/HUCZDXSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2203&json=true","fetch_graph":"https://pith.science/api/pith-number/HUCZDXSHREJOAY64SMPKAQ3VLE/graph.json","fetch_events":"https://pith.science/api/pith-number/HUCZDXSHREJOAY64SMPKAQ3VLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE/action/storage_attestation","attest_author":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE/action/author_attestation","sign_citation":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE/action/citation_signature","submit_replication":"https://pith.science/pith/HUCZDXSHREJOAY64SMPKAQ3VLE/action/replication_record"}},"created_at":"2026-05-18T04:24:35.755853+00:00","updated_at":"2026-05-18T04:24:35.755853+00:00"}