{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P7PN7UYVJ3TF6QYNCHL5NEEO3F","short_pith_number":"pith:P7PN7UYV","schema_version":"1.0","canonical_sha256":"7fdedfd3154ee65f430d11d7d6908ed94ec37e1af82b0d6277efd079c5300351","source":{"kind":"arxiv","id":"1109.3994","version":1},"attestation_state":"computed","paper":{"title":"k-means Approach to the Karhunen-Loeve Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Jacek Tabor, Krzysztof Misztal, Przemyslaw Spurek","submitted_at":"2011-09-19T10:48:27Z","abstract_excerpt":"We present a simultaneous generalization of the well-known Karhunen-Loeve (PCA) and k-means algorithms. The basic idea lies in approximating the data with k affine subspaces of a given dimension n. In the case n=0 we obtain the classical k-means, while for k=1 we obtain PCA algorithm. We show that for some data exploration problems this method gives better result then either of the classical approaches."},"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":"1109.3994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-19T10:48:27Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"ee16e683c2553738f274adfb381a2b5f6ce668f9073dc23e803733ecdeeb2348","abstract_canon_sha256":"2ad2d0610b2b808260fc008726d498eb4d85800ad713eedb9394831f0c4d2450"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:45.389429Z","signature_b64":"wKk4YoSEVSEDVaSu5b1Z0Uw/y9hxbWwT3G531zSFHJGn5TjWxEfYdev+b4vfbNSJMFSp+JITYqPD5iJ8aaJaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fdedfd3154ee65f430d11d7d6908ed94ec37e1af82b0d6277efd079c5300351","last_reissued_at":"2026-05-18T04:12:45.388858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:45.388858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-means Approach to the Karhunen-Loeve Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Jacek Tabor, Krzysztof Misztal, Przemyslaw Spurek","submitted_at":"2011-09-19T10:48:27Z","abstract_excerpt":"We present a simultaneous generalization of the well-known Karhunen-Loeve (PCA) and k-means algorithms. The basic idea lies in approximating the data with k affine subspaces of a given dimension n. In the case n=0 we obtain the classical k-means, while for k=1 we obtain PCA algorithm. We show that for some data exploration problems this method gives better result then either of the classical approaches."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3994","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":"1109.3994","created_at":"2026-05-18T04:12:45.388927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3994v1","created_at":"2026-05-18T04:12:45.388927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3994","created_at":"2026-05-18T04:12:45.388927+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7PN7UYVJ3TF","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7PN7UYVJ3TF6QYN","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7PN7UYV","created_at":"2026-05-18T12:26:39.201973+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/P7PN7UYVJ3TF6QYNCHL5NEEO3F","json":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F.json","graph_json":"https://pith.science/api/pith-number/P7PN7UYVJ3TF6QYNCHL5NEEO3F/graph.json","events_json":"https://pith.science/api/pith-number/P7PN7UYVJ3TF6QYNCHL5NEEO3F/events.json","paper":"https://pith.science/paper/P7PN7UYV"},"agent_actions":{"view_html":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F","download_json":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F.json","view_paper":"https://pith.science/paper/P7PN7UYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3994&json=true","fetch_graph":"https://pith.science/api/pith-number/P7PN7UYVJ3TF6QYNCHL5NEEO3F/graph.json","fetch_events":"https://pith.science/api/pith-number/P7PN7UYVJ3TF6QYNCHL5NEEO3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F/action/storage_attestation","attest_author":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F/action/author_attestation","sign_citation":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F/action/citation_signature","submit_replication":"https://pith.science/pith/P7PN7UYVJ3TF6QYNCHL5NEEO3F/action/replication_record"}},"created_at":"2026-05-18T04:12:45.388927+00:00","updated_at":"2026-05-18T04:12:45.388927+00:00"}