{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LABNDNPIHTDOKZOPAESKGPA4ML","short_pith_number":"pith:LABNDNPI","schema_version":"1.0","canonical_sha256":"5802d1b5e83cc6e565cf0124a33c1c62de8fca10379fbd91f023858e8c92948d","source":{"kind":"arxiv","id":"1312.3061","version":1},"attestation_state":"computed","paper":{"title":"Fast Approximate $K$-Means via Cluster Closures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gang Zeng, Jingdong Wang, Jing Wang, Qifa Ke, Shipeng Li","submitted_at":"2013-12-11T08:02:09Z","abstract_excerpt":"$K$-means, a simple and effective clustering algorithm, is one of the most widely used algorithms in multimedia and computer vision community. Traditional $k$-means is an iterative algorithm---in each iteration new cluster centers are computed and each data point is re-assigned to its nearest center. The cluster re-assignment step becomes prohibitively expensive when the number of data points and cluster centers are large.\n  In this paper, we propose a novel approximate $k$-means algorithm to greatly reduce the computational complexity in the assignment step. Our approach is motivated by the o"},"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":"1312.3061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-11T08:02:09Z","cross_cats_sorted":[],"title_canon_sha256":"41224b375ebb6e45427e63d2fc9a35cedb312f4cb37419536963aae2370a4218","abstract_canon_sha256":"953771bae166584e7178bf3065504dc7b406a3a13fb9de0f726556a5a5628df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.609542Z","signature_b64":"UGhHvZYdTugtKNrMiLrn1zd+p0Yo4KzZcrlaGNRx5snFlPscFiBwbG26k/NFZXKOgdc5Y32IwSJuXry8MrYGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5802d1b5e83cc6e565cf0124a33c1c62de8fca10379fbd91f023858e8c92948d","last_reissued_at":"2026-05-18T03:05:00.608900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.608900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximate $K$-Means via Cluster Closures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gang Zeng, Jingdong Wang, Jing Wang, Qifa Ke, Shipeng Li","submitted_at":"2013-12-11T08:02:09Z","abstract_excerpt":"$K$-means, a simple and effective clustering algorithm, is one of the most widely used algorithms in multimedia and computer vision community. Traditional $k$-means is an iterative algorithm---in each iteration new cluster centers are computed and each data point is re-assigned to its nearest center. The cluster re-assignment step becomes prohibitively expensive when the number of data points and cluster centers are large.\n  In this paper, we propose a novel approximate $k$-means algorithm to greatly reduce the computational complexity in the assignment step. Our approach is motivated by the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3061","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":"1312.3061","created_at":"2026-05-18T03:05:00.608992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3061v1","created_at":"2026-05-18T03:05:00.608992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3061","created_at":"2026-05-18T03:05:00.608992+00:00"},{"alias_kind":"pith_short_12","alias_value":"LABNDNPIHTDO","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LABNDNPIHTDOKZOP","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LABNDNPI","created_at":"2026-05-18T12:27:51.066281+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/LABNDNPIHTDOKZOPAESKGPA4ML","json":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML.json","graph_json":"https://pith.science/api/pith-number/LABNDNPIHTDOKZOPAESKGPA4ML/graph.json","events_json":"https://pith.science/api/pith-number/LABNDNPIHTDOKZOPAESKGPA4ML/events.json","paper":"https://pith.science/paper/LABNDNPI"},"agent_actions":{"view_html":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML","download_json":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML.json","view_paper":"https://pith.science/paper/LABNDNPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3061&json=true","fetch_graph":"https://pith.science/api/pith-number/LABNDNPIHTDOKZOPAESKGPA4ML/graph.json","fetch_events":"https://pith.science/api/pith-number/LABNDNPIHTDOKZOPAESKGPA4ML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML/action/storage_attestation","attest_author":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML/action/author_attestation","sign_citation":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML/action/citation_signature","submit_replication":"https://pith.science/pith/LABNDNPIHTDOKZOPAESKGPA4ML/action/replication_record"}},"created_at":"2026-05-18T03:05:00.608992+00:00","updated_at":"2026-05-18T03:05:00.608992+00:00"}