{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZDNWUZ3KC77F6JJAL7N3RWV2YW","short_pith_number":"pith:ZDNWUZ3K","schema_version":"1.0","canonical_sha256":"c8db6a676a17fe5f25205fdbb8dabac58fa2e0aa85060dcde5eb5827435f7323","source":{"kind":"arxiv","id":"1206.4768","version":1},"attestation_state":"computed","paper":{"title":"On Convergence Properties of the Monte Carlo EM Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Ronald C. Neath","submitted_at":"2012-06-21T03:14:11Z","abstract_excerpt":"The Expectation-Maximization (EM) algorithm (Dempster, Laird and Rubin, 1977) is a popular method for computing maximum likelihood estimates (MLEs) in problems with missing data. Each iteration of the al- gorithm formally consists of an E-step: evaluate the expected complete-data log-likelihood given the observed data, with expectation taken at current pa- rameter estimate; and an M-step: maximize the resulting expression to find the updated estimate. Conditions that guarantee convergence of the EM se- quence to a unique MLE were found by Boyles (1983) and Wu (1983). In complicated models for "},"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":"1206.4768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-21T03:14:11Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"77a73ae24eb5388f364bdabdb5240818ddc69d8d6074941d3f747896536189e9","abstract_canon_sha256":"fee80a8e8f1b7ca5cdbdb859c459694155d62584041971a6c3c3d659c42bf46a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:03.775813Z","signature_b64":"G30DfGKcZbIB5tW9Y1v2T+6/sB/HbPCIFga4pfKZhnbz0uzuUbN8Myqi/nCRf4p5KL3B4OqcrqwX0RpK06KFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8db6a676a17fe5f25205fdbb8dabac58fa2e0aa85060dcde5eb5827435f7323","last_reissued_at":"2026-05-18T03:53:03.775157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:03.775157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Convergence Properties of the Monte Carlo EM Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Ronald C. Neath","submitted_at":"2012-06-21T03:14:11Z","abstract_excerpt":"The Expectation-Maximization (EM) algorithm (Dempster, Laird and Rubin, 1977) is a popular method for computing maximum likelihood estimates (MLEs) in problems with missing data. Each iteration of the al- gorithm formally consists of an E-step: evaluate the expected complete-data log-likelihood given the observed data, with expectation taken at current pa- rameter estimate; and an M-step: maximize the resulting expression to find the updated estimate. Conditions that guarantee convergence of the EM se- quence to a unique MLE were found by Boyles (1983) and Wu (1983). In complicated models for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4768","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":"1206.4768","created_at":"2026-05-18T03:53:03.775264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4768v1","created_at":"2026-05-18T03:53:03.775264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4768","created_at":"2026-05-18T03:53:03.775264+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDNWUZ3KC77F","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDNWUZ3KC77F6JJA","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDNWUZ3K","created_at":"2026-05-18T12:27:30.460161+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/ZDNWUZ3KC77F6JJAL7N3RWV2YW","json":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW.json","graph_json":"https://pith.science/api/pith-number/ZDNWUZ3KC77F6JJAL7N3RWV2YW/graph.json","events_json":"https://pith.science/api/pith-number/ZDNWUZ3KC77F6JJAL7N3RWV2YW/events.json","paper":"https://pith.science/paper/ZDNWUZ3K"},"agent_actions":{"view_html":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW","download_json":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW.json","view_paper":"https://pith.science/paper/ZDNWUZ3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4768&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDNWUZ3KC77F6JJAL7N3RWV2YW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDNWUZ3KC77F6JJAL7N3RWV2YW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/action/storage_attestation","attest_author":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/action/author_attestation","sign_citation":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/action/citation_signature","submit_replication":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/action/replication_record"}},"created_at":"2026-05-18T03:53:03.775264+00:00","updated_at":"2026-05-18T03:53:03.775264+00:00"}