{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LABNDNPIHTDOKZOPAESKGPA4ML","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"953771bae166584e7178bf3065504dc7b406a3a13fb9de0f726556a5a5628df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-11T08:02:09Z","title_canon_sha256":"41224b375ebb6e45427e63d2fc9a35cedb312f4cb37419536963aae2370a4218"},"schema_version":"1.0","source":{"id":"1312.3061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3061","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3061v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3061","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"LABNDNPIHTDO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LABNDNPIHTDOKZOP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LABNDNPI","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:de9b938b2ec631a2866875bed806ce2686421c100d3af5ce1bd67fcc89dea7ef","target":"graph","created_at":"2026-05-18T03:05:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gang Zeng, Jingdong Wang, Jing Wang, Qifa Ke, Shipeng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-11T08:02:09Z","title":"Fast Approximate $K$-Means via Cluster Closures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3061","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:046c1051908af619e2885e40c445bb390e89951c84ba77f5ae465da619e9a09b","target":"record","created_at":"2026-05-18T03:05:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"953771bae166584e7178bf3065504dc7b406a3a13fb9de0f726556a5a5628df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-11T08:02:09Z","title_canon_sha256":"41224b375ebb6e45427e63d2fc9a35cedb312f4cb37419536963aae2370a4218"},"schema_version":"1.0","source":{"id":"1312.3061","kind":"arxiv","version":1}},"canonical_sha256":"5802d1b5e83cc6e565cf0124a33c1c62de8fca10379fbd91f023858e8c92948d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5802d1b5e83cc6e565cf0124a33c1c62de8fca10379fbd91f023858e8c92948d","first_computed_at":"2026-05-18T03:05:00.608900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.608900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UGhHvZYdTugtKNrMiLrn1zd+p0Yo4KzZcrlaGNRx5snFlPscFiBwbG26k/NFZXKOgdc5Y32IwSJuXry8MrYGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.609542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:046c1051908af619e2885e40c445bb390e89951c84ba77f5ae465da619e9a09b","sha256:de9b938b2ec631a2866875bed806ce2686421c100d3af5ce1bd67fcc89dea7ef"],"state_sha256":"ac5602c402ea703393a9af426a6a860d4061b358897f543af3c67bafe197f2ae"}