{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZDNWUZ3KC77F6JJAL7N3RWV2YW","short_pith_number":"pith:ZDNWUZ3K","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"},"canonical_sha256":"c8db6a676a17fe5f25205fdbb8dabac58fa2e0aa85060dcde5eb5827435f7323","source":{"kind":"arxiv","id":"1206.4768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4768","created_at":"2026-05-18T03:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4768v1","created_at":"2026-05-18T03:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4768","created_at":"2026-05-18T03:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZDNWUZ3KC77F","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZDNWUZ3KC77F6JJA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZDNWUZ3K","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZDNWUZ3KC77F6JJAL7N3RWV2YW","target":"record","payload":{"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"},"canonical_sha256":"c8db6a676a17fe5f25205fdbb8dabac58fa2e0aa85060dcde5eb5827435f7323","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"},"source_kind":"arxiv","source_id":"1206.4768","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-18T03:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDJbAf8Z85lLs2OSPJnwPjwi+T1QEss82bG5an64OZz7FT5yp0xbFLvW63eBO9DDoouBdWjzDFLxg8mdCLt+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:01:28.093469Z"},"content_sha256":"f894da0e05b23a6545b4b80b21b4f81139518717d0b0f9d28ec3b8ac4019581a","schema_version":"1.0","event_id":"sha256:f894da0e05b23a6545b4b80b21b4f81139518717d0b0f9d28ec3b8ac4019581a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZDNWUZ3KC77F6JJAL7N3RWV2YW","target":"graph","payload":{"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"},"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-18T03:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hsViXMMcTIbk6NLfVF+CGZfQFfBf7Vi83w3UGzXYiyoszsVVjTdWcAwRhoniZ8cvP5x5ZCx7Y80FEdFLgB7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:01:28.093818Z"},"content_sha256":"6781a504de6d2ce0f6c21bd0137ca561eb514ae14e9067dd4d38b907625499ce","schema_version":"1.0","event_id":"sha256:6781a504de6d2ce0f6c21bd0137ca561eb514ae14e9067dd4d38b907625499ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/bundle.json","state_url":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/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-26T11:01:28Z","links":{"resolver":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW","bundle":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/bundle.json","state":"https://pith.science/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDNWUZ3KC77F6JJAL7N3RWV2YW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZDNWUZ3KC77F6JJAL7N3RWV2YW","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":"fee80a8e8f1b7ca5cdbdb859c459694155d62584041971a6c3c3d659c42bf46a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-21T03:14:11Z","title_canon_sha256":"77a73ae24eb5388f364bdabdb5240818ddc69d8d6074941d3f747896536189e9"},"schema_version":"1.0","source":{"id":"1206.4768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4768","created_at":"2026-05-18T03:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4768v1","created_at":"2026-05-18T03:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4768","created_at":"2026-05-18T03:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZDNWUZ3KC77F","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZDNWUZ3KC77F6JJA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZDNWUZ3K","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:6781a504de6d2ce0f6c21bd0137ca561eb514ae14e9067dd4d38b907625499ce","target":"graph","created_at":"2026-05-18T03:53:03Z","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":"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 ","authors_text":"Ronald C. Neath","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-21T03:14:11Z","title":"On Convergence Properties of the Monte Carlo EM Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4768","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:f894da0e05b23a6545b4b80b21b4f81139518717d0b0f9d28ec3b8ac4019581a","target":"record","created_at":"2026-05-18T03:53:03Z","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":"fee80a8e8f1b7ca5cdbdb859c459694155d62584041971a6c3c3d659c42bf46a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-21T03:14:11Z","title_canon_sha256":"77a73ae24eb5388f364bdabdb5240818ddc69d8d6074941d3f747896536189e9"},"schema_version":"1.0","source":{"id":"1206.4768","kind":"arxiv","version":1}},"canonical_sha256":"c8db6a676a17fe5f25205fdbb8dabac58fa2e0aa85060dcde5eb5827435f7323","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8db6a676a17fe5f25205fdbb8dabac58fa2e0aa85060dcde5eb5827435f7323","first_computed_at":"2026-05-18T03:53:03.775157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:03.775157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G30DfGKcZbIB5tW9Y1v2T+6/sB/HbPCIFga4pfKZhnbz0uzuUbN8Myqi/nCRf4p5KL3B4OqcrqwX0RpK06KFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:03.775813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f894da0e05b23a6545b4b80b21b4f81139518717d0b0f9d28ec3b8ac4019581a","sha256:6781a504de6d2ce0f6c21bd0137ca561eb514ae14e9067dd4d38b907625499ce"],"state_sha256":"c92e174f60207f6e49ed6abcaf965371a0eba02dac6efe3983dd93f0207123db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aw7NDNUF2ipHo8wjLcwmyqCu0Fgiuc/L4dpLL721dCo2yv8UooeIc7SvaXrRLuqAYs6fgGPsQjyRsSPg2glZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:01:28.095770Z","bundle_sha256":"8e54695331a530470821b45a5e72bf7d3815aff11013a987104eb116d7e642cd"}}