{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BAKKMJ42PG43EY6X7RQAGAY73X","short_pith_number":"pith:BAKKMJ42","schema_version":"1.0","canonical_sha256":"0814a6279a79b9b263d7fc6003031fddd28b94c900e615bb42c7d5c63a79948f","source":{"kind":"arxiv","id":"2607.23086","version":1},"attestation_state":"computed","paper":{"title":"The normalized expectation-maximization (N-EM) algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Guo-Liang Tian, Xuanyu Liu, Yuanfan Zhao","submitted_at":"2026-07-25T07:28:35Z","abstract_excerpt":"Although the $\\textit{expectation-maximization}$ (EM) algorithm is a powerful optimization tool in statistics, it can only be applied to missing/incomplete data problems or to problems with a latent-variable structure. It is well known that the introduction of latent variables (or the data augmentation) is an art; i.e., it could only be done case by case. In this paper, we propose a new algorithm, a so-called $\\textit{normalized EM}$ (N-EM) algorithm, for a class of log-likelihood functions with integrals. As an extension of the original EM algorithm, the N-EM algorithm inherits all advantages"},"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":"2607.23086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-07-25T07:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"26b1b2b5a28d5799580922fd18132917f72359b06d0446a3cca65ae0621f95bf","abstract_canon_sha256":"8ce05dfd6c6d7306524d2560f6ebfe71b248e32480dffa4a486f101dc0e0abbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:22:05.892788Z","signature_b64":"XMDk5u2uxoxuVttx4/fkElkgxU8b+5H8ECF/rlm6YadbgJeswMYg/d1ypPGzBDK/WPhhRGA3R2AXKxqVpMtXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0814a6279a79b9b263d7fc6003031fddd28b94c900e615bb42c7d5c63a79948f","last_reissued_at":"2026-07-28T01:22:05.891711Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:22:05.891711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The normalized expectation-maximization (N-EM) algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Guo-Liang Tian, Xuanyu Liu, Yuanfan Zhao","submitted_at":"2026-07-25T07:28:35Z","abstract_excerpt":"Although the $\\textit{expectation-maximization}$ (EM) algorithm is a powerful optimization tool in statistics, it can only be applied to missing/incomplete data problems or to problems with a latent-variable structure. It is well known that the introduction of latent variables (or the data augmentation) is an art; i.e., it could only be done case by case. In this paper, we propose a new algorithm, a so-called $\\textit{normalized EM}$ (N-EM) algorithm, for a class of log-likelihood functions with integrals. As an extension of the original EM algorithm, the N-EM algorithm inherits all advantages"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.23086/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.23086","created_at":"2026-07-28T01:22:05.892202+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.23086v1","created_at":"2026-07-28T01:22:05.892202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23086","created_at":"2026-07-28T01:22:05.892202+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAKKMJ42PG43","created_at":"2026-07-28T01:22:05.892202+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAKKMJ42PG43EY6X","created_at":"2026-07-28T01:22:05.892202+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAKKMJ42","created_at":"2026-07-28T01:22:05.892202+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/BAKKMJ42PG43EY6X7RQAGAY73X","json":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X.json","graph_json":"https://pith.science/api/pith-number/BAKKMJ42PG43EY6X7RQAGAY73X/graph.json","events_json":"https://pith.science/api/pith-number/BAKKMJ42PG43EY6X7RQAGAY73X/events.json","paper":"https://pith.science/paper/BAKKMJ42"},"agent_actions":{"view_html":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X","download_json":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X.json","view_paper":"https://pith.science/paper/BAKKMJ42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.23086&json=true","fetch_graph":"https://pith.science/api/pith-number/BAKKMJ42PG43EY6X7RQAGAY73X/graph.json","fetch_events":"https://pith.science/api/pith-number/BAKKMJ42PG43EY6X7RQAGAY73X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X/action/storage_attestation","attest_author":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X/action/author_attestation","sign_citation":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X/action/citation_signature","submit_replication":"https://pith.science/pith/BAKKMJ42PG43EY6X7RQAGAY73X/action/replication_record"}},"created_at":"2026-07-28T01:22:05.892202+00:00","updated_at":"2026-07-28T01:22:05.892202+00:00"}