{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZAAYDZONE6XUEMBD36QXXJEOTN","short_pith_number":"pith:ZAAYDZON","schema_version":"1.0","canonical_sha256":"c80181e5cd27af423023dfa17ba48e9b7d691bc331b766b868546e76c1efd55c","source":{"kind":"arxiv","id":"1802.02251","version":1},"attestation_state":"computed","paper":{"title":"An Imputation-Consistency Algorithm for High-Dimensional Missing Data Problems and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Bochao Jia, Faming Liang, Jingnan Xue, Qizhai Li, Ye Luo","submitted_at":"2018-02-06T22:45:38Z","abstract_excerpt":"Missing data are frequently encountered in high-dimensional problems, but they are usually difficult to deal with using standard algorithms, such as the expectation-maximization (EM) algorithm and its variants. To tackle this difficulty, some problem-specific algorithms have been developed in the literature, but there still lacks a general algorithm. This work is to fill the gap: we propose a general algorithm for high-dimensional missing data problems. The proposed algorithm works by iterating between an imputation step and a consistency step. At the imputation step, the missing data are impu"},"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":"1802.02251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-06T22:45:38Z","cross_cats_sorted":[],"title_canon_sha256":"901cb48e6c1701cfac5700fc054270cd13549a78e24702aa07e0fdb967ec3e41","abstract_canon_sha256":"a3792eefaf7e53a5f0d52019cdb0e8af0716eb06b48a7651a6d6ee936bc53b66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:08.774103Z","signature_b64":"04+OCfXntc9M2pHTQFWXsXpwlJKReoDUAegCNaqDd8LboRulSl8lZqSQ9XmGSB/SPpfPIYb1eEmOEGPOM7DVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c80181e5cd27af423023dfa17ba48e9b7d691bc331b766b868546e76c1efd55c","last_reissued_at":"2026-05-18T00:24:08.773475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:08.773475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Imputation-Consistency Algorithm for High-Dimensional Missing Data Problems and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Bochao Jia, Faming Liang, Jingnan Xue, Qizhai Li, Ye Luo","submitted_at":"2018-02-06T22:45:38Z","abstract_excerpt":"Missing data are frequently encountered in high-dimensional problems, but they are usually difficult to deal with using standard algorithms, such as the expectation-maximization (EM) algorithm and its variants. To tackle this difficulty, some problem-specific algorithms have been developed in the literature, but there still lacks a general algorithm. This work is to fill the gap: we propose a general algorithm for high-dimensional missing data problems. The proposed algorithm works by iterating between an imputation step and a consistency step. At the imputation step, the missing data are impu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02251","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":"1802.02251","created_at":"2026-05-18T00:24:08.773563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02251v1","created_at":"2026-05-18T00:24:08.773563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02251","created_at":"2026-05-18T00:24:08.773563+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAAYDZONE6XU","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAAYDZONE6XUEMBD","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAAYDZON","created_at":"2026-05-18T12:33:04.347982+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/ZAAYDZONE6XUEMBD36QXXJEOTN","json":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN.json","graph_json":"https://pith.science/api/pith-number/ZAAYDZONE6XUEMBD36QXXJEOTN/graph.json","events_json":"https://pith.science/api/pith-number/ZAAYDZONE6XUEMBD36QXXJEOTN/events.json","paper":"https://pith.science/paper/ZAAYDZON"},"agent_actions":{"view_html":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN","download_json":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN.json","view_paper":"https://pith.science/paper/ZAAYDZON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02251&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAAYDZONE6XUEMBD36QXXJEOTN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAAYDZONE6XUEMBD36QXXJEOTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN/action/storage_attestation","attest_author":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN/action/author_attestation","sign_citation":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN/action/citation_signature","submit_replication":"https://pith.science/pith/ZAAYDZONE6XUEMBD36QXXJEOTN/action/replication_record"}},"created_at":"2026-05-18T00:24:08.773563+00:00","updated_at":"2026-05-18T00:24:08.773563+00:00"}