{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7FA5GU3CKA54KOLKXD3VILWJQG","short_pith_number":"pith:7FA5GU3C","schema_version":"1.0","canonical_sha256":"f941d35362503bc5396ab8f7542ec981bb17d4bd347b6f1cbf878149839b3b6c","source":{"kind":"arxiv","id":"1411.7013","version":3},"attestation_state":"computed","paper":{"title":"$k$-POD: A Method for $k$-Means Clustering of Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Eric C. Chi, Jocelyn T. Chi, Richard G. Baraniuk","submitted_at":"2014-11-25T20:37:58Z","abstract_excerpt":"The $k$-means algorithm is often used in clustering applications but its usage requires a complete data matrix. Missing data, however, is common in many applications. Mainstream approaches to clustering missing data reduce the missing data problem to a complete data formulation through either deletion or imputation but these solutions may incur significant costs. Our $k$-POD method presents a simple extension of $k$-means clustering for missing data that works even when the missingness mechanism is unknown, when external information is unavailable, and when there is significant missingness in "},"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":"1411.7013","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-11-25T20:37:58Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"c4c1a012d8b48e327f7ffe4981620eb91fd214f5d4884b202ac810d3a6062647","abstract_canon_sha256":"b125627ec65e93ff8c5b2d8f17bf7fe9029fcef7f2f46d812970528f99977064"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:07.116019Z","signature_b64":"rAbx2xsMnuumYcowWwcxckkAmvpSnUVSNbDcRiX8Nb+N0boVpwc5CUisqj9MF5ycq+2llMUildBmJhSPwcS6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f941d35362503bc5396ab8f7542ec981bb17d4bd347b6f1cbf878149839b3b6c","last_reissued_at":"2026-05-18T00:14:07.115418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:07.115418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-POD: A Method for $k$-Means Clustering of Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Eric C. Chi, Jocelyn T. Chi, Richard G. Baraniuk","submitted_at":"2014-11-25T20:37:58Z","abstract_excerpt":"The $k$-means algorithm is often used in clustering applications but its usage requires a complete data matrix. Missing data, however, is common in many applications. Mainstream approaches to clustering missing data reduce the missing data problem to a complete data formulation through either deletion or imputation but these solutions may incur significant costs. Our $k$-POD method presents a simple extension of $k$-means clustering for missing data that works even when the missingness mechanism is unknown, when external information is unavailable, and when there is significant missingness in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7013","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":"1411.7013","created_at":"2026-05-18T00:14:07.115503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7013v3","created_at":"2026-05-18T00:14:07.115503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7013","created_at":"2026-05-18T00:14:07.115503+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FA5GU3CKA54","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FA5GU3CKA54KOLK","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FA5GU3C","created_at":"2026-05-18T12:28:16.859392+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/7FA5GU3CKA54KOLKXD3VILWJQG","json":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG.json","graph_json":"https://pith.science/api/pith-number/7FA5GU3CKA54KOLKXD3VILWJQG/graph.json","events_json":"https://pith.science/api/pith-number/7FA5GU3CKA54KOLKXD3VILWJQG/events.json","paper":"https://pith.science/paper/7FA5GU3C"},"agent_actions":{"view_html":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG","download_json":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG.json","view_paper":"https://pith.science/paper/7FA5GU3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7013&json=true","fetch_graph":"https://pith.science/api/pith-number/7FA5GU3CKA54KOLKXD3VILWJQG/graph.json","fetch_events":"https://pith.science/api/pith-number/7FA5GU3CKA54KOLKXD3VILWJQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG/action/storage_attestation","attest_author":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG/action/author_attestation","sign_citation":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG/action/citation_signature","submit_replication":"https://pith.science/pith/7FA5GU3CKA54KOLKXD3VILWJQG/action/replication_record"}},"created_at":"2026-05-18T00:14:07.115503+00:00","updated_at":"2026-05-18T00:14:07.115503+00:00"}