{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3QAWXFMCRWUUTEPT6XAIOLMUEM","short_pith_number":"pith:3QAWXFMC","canonical_record":{"source":{"id":"1801.04053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-12T04:09:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8cd48b42d7e6b5dea200975f27af7ccde0e09cf7f00ca23eab279cfd878edddc","abstract_canon_sha256":"965273cc4ea0dba47a83614ad8e5b3db434e4c973574f614b74300449c7e3eb8"},"schema_version":"1.0"},"canonical_sha256":"dc016b95828da94991f3f5c0872d9423099ff347d0837f74e94e2c9137243f6c","source":{"kind":"arxiv","id":"1801.04053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04053","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04053v1","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04053","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"3QAWXFMCRWUU","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QAWXFMCRWUUTEPT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QAWXFMC","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3QAWXFMCRWUUTEPT6XAIOLMUEM","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-12T04:09:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8cd48b42d7e6b5dea200975f27af7ccde0e09cf7f00ca23eab279cfd878edddc","abstract_canon_sha256":"965273cc4ea0dba47a83614ad8e5b3db434e4c973574f614b74300449c7e3eb8"},"schema_version":"1.0"},"canonical_sha256":"dc016b95828da94991f3f5c0872d9423099ff347d0837f74e94e2c9137243f6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:12.032442Z","signature_b64":"0pprT1OlvbpvczFmNdtio5jMNDckrGz2Pn4nP3xi8LB7LklFx8DgYHgugCdWnojTBCfBinVjNxlt4JYmClyQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc016b95828da94991f3f5c0872d9423099ff347d0837f74e94e2c9137243f6c","last_reissued_at":"2026-05-18T00:26:12.031920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:12.031920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04053","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-18T00:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUK6lSeLc4R73FnV7RLsjleNhzxG1MYIuxwX8Xy5mQwEfkgyvrnafUIQFV9QFezHKnKWHOUaxqyu2xqGLuNbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:31.545388Z"},"content_sha256":"781edd09f3a84ff0fe584146b5822b26ed4eecfcffd8857386c60c6d7443b866","schema_version":"1.0","event_id":"sha256:781edd09f3a84ff0fe584146b5822b26ed4eecfcffd8857386c60c6d7443b866"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3QAWXFMCRWUUTEPT6XAIOLMUEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Expectation-Maximization: Applications and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bart Kosko, Osonde Osoba","submitted_at":"2018-01-12T04:09:48Z","abstract_excerpt":"We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local maximum of the likelihood surface if a positivity condition holds. The generalized form of the noisy expectation-maximization (NEM) algorithm allow for arbitrary modes of noise injection including adding and multiplying noise to the data.\n  We demonstrate these noise benefits on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04053","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-18T00:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFDmCsc31VJflYEsiHn3fLSqlVT4/X998+tBb/auzSeAZ0YV2T/TjRh4CkQ7UKYu7zs5xL92I3wPs6ShfmZuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:31.545967Z"},"content_sha256":"5b5a0457a784eb74b39cff9e5f2d3c2d02c057fbc5fdc313de3a6b741ca6fbd6","schema_version":"1.0","event_id":"sha256:5b5a0457a784eb74b39cff9e5f2d3c2d02c057fbc5fdc313de3a6b741ca6fbd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QAWXFMCRWUUTEPT6XAIOLMUEM/bundle.json","state_url":"https://pith.science/pith/3QAWXFMCRWUUTEPT6XAIOLMUEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QAWXFMCRWUUTEPT6XAIOLMUEM/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-07T17:22:31Z","links":{"resolver":"https://pith.science/pith/3QAWXFMCRWUUTEPT6XAIOLMUEM","bundle":"https://pith.science/pith/3QAWXFMCRWUUTEPT6XAIOLMUEM/bundle.json","state":"https://pith.science/pith/3QAWXFMCRWUUTEPT6XAIOLMUEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QAWXFMCRWUUTEPT6XAIOLMUEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3QAWXFMCRWUUTEPT6XAIOLMUEM","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":"965273cc4ea0dba47a83614ad8e5b3db434e4c973574f614b74300449c7e3eb8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-12T04:09:48Z","title_canon_sha256":"8cd48b42d7e6b5dea200975f27af7ccde0e09cf7f00ca23eab279cfd878edddc"},"schema_version":"1.0","source":{"id":"1801.04053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04053","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04053v1","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04053","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"3QAWXFMCRWUU","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QAWXFMCRWUUTEPT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QAWXFMC","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:5b5a0457a784eb74b39cff9e5f2d3c2d02c057fbc5fdc313de3a6b741ca6fbd6","target":"graph","created_at":"2026-05-18T00:26:12Z","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 present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local maximum of the likelihood surface if a positivity condition holds. The generalized form of the noisy expectation-maximization (NEM) algorithm allow for arbitrary modes of noise injection including adding and multiplying noise to the data.\n  We demonstrate these noise benefits on","authors_text":"Bart Kosko, Osonde Osoba","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-12T04:09:48Z","title":"Noisy Expectation-Maximization: Applications and Generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04053","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:781edd09f3a84ff0fe584146b5822b26ed4eecfcffd8857386c60c6d7443b866","target":"record","created_at":"2026-05-18T00:26:12Z","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":"965273cc4ea0dba47a83614ad8e5b3db434e4c973574f614b74300449c7e3eb8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-12T04:09:48Z","title_canon_sha256":"8cd48b42d7e6b5dea200975f27af7ccde0e09cf7f00ca23eab279cfd878edddc"},"schema_version":"1.0","source":{"id":"1801.04053","kind":"arxiv","version":1}},"canonical_sha256":"dc016b95828da94991f3f5c0872d9423099ff347d0837f74e94e2c9137243f6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc016b95828da94991f3f5c0872d9423099ff347d0837f74e94e2c9137243f6c","first_computed_at":"2026-05-18T00:26:12.031920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:12.031920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0pprT1OlvbpvczFmNdtio5jMNDckrGz2Pn4nP3xi8LB7LklFx8DgYHgugCdWnojTBCfBinVjNxlt4JYmClyQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:12.032442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:781edd09f3a84ff0fe584146b5822b26ed4eecfcffd8857386c60c6d7443b866","sha256:5b5a0457a784eb74b39cff9e5f2d3c2d02c057fbc5fdc313de3a6b741ca6fbd6"],"state_sha256":"77fc9844761daba48c828bc818b1a45c85c383075345f5074518e4cd090d09df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wA2PmcisdGAzlpX6hcxZXYbEN/L0maSYkBE8LhJm+VnTRxMnpG085N97tt9CPil7XNeG7eSq35nFWwNAcR5GDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:22:31.549274Z","bundle_sha256":"07447b4ee98f81829baf4aeea81c5f03a53f8321276de06dd75b8ec4aec8e181"}}