{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VMBNVBCK2R3O5ABLLVMTN37XTP","short_pith_number":"pith:VMBNVBCK","schema_version":"1.0","canonical_sha256":"ab02da844ad476ee802b5d5936eff79bfef0641be3a68605b8d73016949b722c","source":{"kind":"arxiv","id":"1005.0366","version":3},"attestation_state":"computed","paper":{"title":"Pattern Alternating Maximization Algorithm for Missing Data in Large P, Small N Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Daniel J. Stekhoven, Nicolas St\\\"adler, Peter B\\\"uhlmann","submitted_at":"2010-05-03T18:22:14Z","abstract_excerpt":"We propose a new and computationally efficient algorithm for maximizing the observed log-likelihood for a multivariate normal data matrix with missing values. We show that our procedure based on iteratively regressing the missing on the observed variables, generalizes the standard EM algorithm by alternating between different complete data spaces and performing the E-Step incrementally. In this non-standard setup we prove numerical convergence to a stationary point of the observed log-likelihood.\n  For high-dimensional data, where the number of variables may greatly exceed sample size, we add "},"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":"1005.0366","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-05-03T18:22:14Z","cross_cats_sorted":[],"title_canon_sha256":"b8ec4ece30ceca311cfdfa35bc5dfc93404c967e31685c9f9ae189b32c2d359a","abstract_canon_sha256":"9d14ed3443f242b35524fb96919198d49ef56cfd016c998218ba2ce9e8a8989a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:25.933171Z","signature_b64":"29EaIx19L5TloWuaZysM+nYWfSdnWcN8237cBwOcDH4sd8shxfe/A0jbsD9Cxs1y8yTZVm/89+/8nKtMSxpwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab02da844ad476ee802b5d5936eff79bfef0641be3a68605b8d73016949b722c","last_reissued_at":"2026-05-18T03:40:25.932249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:25.932249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern Alternating Maximization Algorithm for Missing Data in Large P, Small N Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Daniel J. Stekhoven, Nicolas St\\\"adler, Peter B\\\"uhlmann","submitted_at":"2010-05-03T18:22:14Z","abstract_excerpt":"We propose a new and computationally efficient algorithm for maximizing the observed log-likelihood for a multivariate normal data matrix with missing values. We show that our procedure based on iteratively regressing the missing on the observed variables, generalizes the standard EM algorithm by alternating between different complete data spaces and performing the E-Step incrementally. In this non-standard setup we prove numerical convergence to a stationary point of the observed log-likelihood.\n  For high-dimensional data, where the number of variables may greatly exceed sample size, we add "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0366","kind":"arxiv","version":3},"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":"1005.0366","created_at":"2026-05-18T03:40:25.932399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.0366v3","created_at":"2026-05-18T03:40:25.932399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0366","created_at":"2026-05-18T03:40:25.932399+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMBNVBCK2R3O","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMBNVBCK2R3O5ABL","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMBNVBCK","created_at":"2026-05-18T12:26:15.391820+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/VMBNVBCK2R3O5ABLLVMTN37XTP","json":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP.json","graph_json":"https://pith.science/api/pith-number/VMBNVBCK2R3O5ABLLVMTN37XTP/graph.json","events_json":"https://pith.science/api/pith-number/VMBNVBCK2R3O5ABLLVMTN37XTP/events.json","paper":"https://pith.science/paper/VMBNVBCK"},"agent_actions":{"view_html":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP","download_json":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP.json","view_paper":"https://pith.science/paper/VMBNVBCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.0366&json=true","fetch_graph":"https://pith.science/api/pith-number/VMBNVBCK2R3O5ABLLVMTN37XTP/graph.json","fetch_events":"https://pith.science/api/pith-number/VMBNVBCK2R3O5ABLLVMTN37XTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP/action/storage_attestation","attest_author":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP/action/author_attestation","sign_citation":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP/action/citation_signature","submit_replication":"https://pith.science/pith/VMBNVBCK2R3O5ABLLVMTN37XTP/action/replication_record"}},"created_at":"2026-05-18T03:40:25.932399+00:00","updated_at":"2026-05-18T03:40:25.932399+00:00"}