{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ILMB6GMGZQB3BMNIOA6NZE2ROM","short_pith_number":"pith:ILMB6GMG","schema_version":"1.0","canonical_sha256":"42d81f1986cc03b0b1a8703cdc93517304280b4c27479dc663463a9a72f73652","source":{"kind":"arxiv","id":"1602.02514","version":6},"attestation_state":"computed","paper":{"title":"Fast K-Means with Accurate Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Fran\\c{c}ois Fleuret, James Newling","submitted_at":"2016-02-08T10:19:09Z","abstract_excerpt":"We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 times faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimates of the distance bounds used to reduce the number of distance calculations, and get a speedup in 36 of 44 experiments, up to 1.8 times faster.\n  We have conducted experiments with our own implementations of existing methods to ensure homogeneous evaluation of performance, and we"},"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":"1602.02514","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-08T10:19:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5661df38335792e271dc13fa75acfd2123af7962fe8402a75f119957057723d7","abstract_canon_sha256":"e71639908ae36618aa5ae0b48eaf2717b3387b37f20bfbfb1c1d0af080fb2efe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.129609Z","signature_b64":"/e8hm/aYAzRKZwj8iz4CzpWozMnEOYLrWi2xbtzQJna1qBL3LygWahprGg1AuhuOFzcdnZFL8R0LW8w5XXGyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42d81f1986cc03b0b1a8703cdc93517304280b4c27479dc663463a9a72f73652","last_reissued_at":"2026-05-18T01:04:50.129085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.129085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast K-Means with Accurate Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Fran\\c{c}ois Fleuret, James Newling","submitted_at":"2016-02-08T10:19:09Z","abstract_excerpt":"We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 times faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimates of the distance bounds used to reduce the number of distance calculations, and get a speedup in 36 of 44 experiments, up to 1.8 times faster.\n  We have conducted experiments with our own implementations of existing methods to ensure homogeneous evaluation of performance, and we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02514","kind":"arxiv","version":6},"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":"1602.02514","created_at":"2026-05-18T01:04:50.129151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02514v6","created_at":"2026-05-18T01:04:50.129151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02514","created_at":"2026-05-18T01:04:50.129151+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILMB6GMGZQB3","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILMB6GMGZQB3BMNI","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILMB6GMG","created_at":"2026-05-18T12:30:22.444734+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/ILMB6GMGZQB3BMNIOA6NZE2ROM","json":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM.json","graph_json":"https://pith.science/api/pith-number/ILMB6GMGZQB3BMNIOA6NZE2ROM/graph.json","events_json":"https://pith.science/api/pith-number/ILMB6GMGZQB3BMNIOA6NZE2ROM/events.json","paper":"https://pith.science/paper/ILMB6GMG"},"agent_actions":{"view_html":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM","download_json":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM.json","view_paper":"https://pith.science/paper/ILMB6GMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02514&json=true","fetch_graph":"https://pith.science/api/pith-number/ILMB6GMGZQB3BMNIOA6NZE2ROM/graph.json","fetch_events":"https://pith.science/api/pith-number/ILMB6GMGZQB3BMNIOA6NZE2ROM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM/action/storage_attestation","attest_author":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM/action/author_attestation","sign_citation":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM/action/citation_signature","submit_replication":"https://pith.science/pith/ILMB6GMGZQB3BMNIOA6NZE2ROM/action/replication_record"}},"created_at":"2026-05-18T01:04:50.129151+00:00","updated_at":"2026-05-18T01:04:50.129151+00:00"}