{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AXQ65RIFBV7BJT44R3QAKHJU6P","short_pith_number":"pith:AXQ65RIF","canonical_record":{"source":{"id":"1209.1960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-10T12:22:06Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"6fe7138ad635ce2405454779353b151e5d59e668e4e63f9ce30a3b24e4796285","abstract_canon_sha256":"ebac0bc24b30731e73cbf21501748bed29a04ad347cfc01289526f3cccdf8d3e"},"schema_version":"1.0"},"canonical_sha256":"05e1eec5050d7e14cf9c8ee0051d34f3c75df9e6a80b1689c41bbc4f94d3bdeb","source":{"kind":"arxiv","id":"1209.1960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1960","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1960v1","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1960","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"AXQ65RIFBV7B","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AXQ65RIFBV7BJT44","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AXQ65RIF","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AXQ65RIFBV7BJT44R3QAKHJU6P","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-10T12:22:06Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"6fe7138ad635ce2405454779353b151e5d59e668e4e63f9ce30a3b24e4796285","abstract_canon_sha256":"ebac0bc24b30731e73cbf21501748bed29a04ad347cfc01289526f3cccdf8d3e"},"schema_version":"1.0"},"canonical_sha256":"05e1eec5050d7e14cf9c8ee0051d34f3c75df9e6a80b1689c41bbc4f94d3bdeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:53.688426Z","signature_b64":"BtrRB5l0OyXtN+tOeWZ5o9CNUoyQbgaAhuwSQh6i6WVl9Os3rVDNrPW/mT4Xby4rqRwh6d1szMiM2Pg08l4MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05e1eec5050d7e14cf9c8ee0051d34f3c75df9e6a80b1689c41bbc4f94d3bdeb","last_reissued_at":"2026-05-18T03:45:53.687889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:53.687889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1960","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4cPrzBzCIkz+YDXRQNKoYoWuXS3zyyOD6ELoe8CqrT6WWYJkLsSs9vknPGZNbs2P3tf48j3dOPukHmSvQc6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:38:54.070592Z"},"content_sha256":"50116b0ce963f6e2cefccf4a7f078170972016de887c005b1698028dbf850911","schema_version":"1.0","event_id":"sha256:50116b0ce963f6e2cefccf4a7f078170972016de887c005b1698028dbf850911"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AXQ65RIFBV7BJT44R3QAKHJU6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hassan A. Kingravi, M. Emre Celebi, Patricio A. Vela","submitted_at":"2012-09-10T12:22:06Z","abstract_excerpt":"K-means is undoubtedly the most widely used partitional clustering algorithm. Unfortunately, due to its gradient descent nature, this algorithm is highly sensitive to the initial placement of the cluster centers. Numerous initialization methods have been proposed to address this problem. In this paper, we first present an overview of these methods with an emphasis on their computational efficiency. We then compare eight commonly used linear time complexity initialization methods on a large and diverse collection of data sets using various performance criteria. Finally, we analyze the experimen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1960","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtmW2qo0+/+5y/hSyx963RA99T0TehVozGdSpSmt+00XBzpRY75210VwWE4ID2MNCVqh79rpMB6u8rtSG3V1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:38:54.070937Z"},"content_sha256":"d51338b216521706b5d95150634f8f1c4db1638e400b1c716d23176a809a58bf","schema_version":"1.0","event_id":"sha256:d51338b216521706b5d95150634f8f1c4db1638e400b1c716d23176a809a58bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXQ65RIFBV7BJT44R3QAKHJU6P/bundle.json","state_url":"https://pith.science/pith/AXQ65RIFBV7BJT44R3QAKHJU6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXQ65RIFBV7BJT44R3QAKHJU6P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T12:38:54Z","links":{"resolver":"https://pith.science/pith/AXQ65RIFBV7BJT44R3QAKHJU6P","bundle":"https://pith.science/pith/AXQ65RIFBV7BJT44R3QAKHJU6P/bundle.json","state":"https://pith.science/pith/AXQ65RIFBV7BJT44R3QAKHJU6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXQ65RIFBV7BJT44R3QAKHJU6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AXQ65RIFBV7BJT44R3QAKHJU6P","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":"ebac0bc24b30731e73cbf21501748bed29a04ad347cfc01289526f3cccdf8d3e","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-10T12:22:06Z","title_canon_sha256":"6fe7138ad635ce2405454779353b151e5d59e668e4e63f9ce30a3b24e4796285"},"schema_version":"1.0","source":{"id":"1209.1960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1960","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1960v1","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1960","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"AXQ65RIFBV7B","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AXQ65RIFBV7BJT44","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AXQ65RIF","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:d51338b216521706b5d95150634f8f1c4db1638e400b1c716d23176a809a58bf","target":"graph","created_at":"2026-05-18T03:45:53Z","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 is undoubtedly the most widely used partitional clustering algorithm. Unfortunately, due to its gradient descent nature, this algorithm is highly sensitive to the initial placement of the cluster centers. Numerous initialization methods have been proposed to address this problem. In this paper, we first present an overview of these methods with an emphasis on their computational efficiency. We then compare eight commonly used linear time complexity initialization methods on a large and diverse collection of data sets using various performance criteria. Finally, we analyze the experimen","authors_text":"Hassan A. Kingravi, M. Emre Celebi, Patricio A. Vela","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-10T12:22:06Z","title":"A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1960","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:50116b0ce963f6e2cefccf4a7f078170972016de887c005b1698028dbf850911","target":"record","created_at":"2026-05-18T03:45:53Z","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":"ebac0bc24b30731e73cbf21501748bed29a04ad347cfc01289526f3cccdf8d3e","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-10T12:22:06Z","title_canon_sha256":"6fe7138ad635ce2405454779353b151e5d59e668e4e63f9ce30a3b24e4796285"},"schema_version":"1.0","source":{"id":"1209.1960","kind":"arxiv","version":1}},"canonical_sha256":"05e1eec5050d7e14cf9c8ee0051d34f3c75df9e6a80b1689c41bbc4f94d3bdeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05e1eec5050d7e14cf9c8ee0051d34f3c75df9e6a80b1689c41bbc4f94d3bdeb","first_computed_at":"2026-05-18T03:45:53.687889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:53.687889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtrRB5l0OyXtN+tOeWZ5o9CNUoyQbgaAhuwSQh6i6WVl9Os3rVDNrPW/mT4Xby4rqRwh6d1szMiM2Pg08l4MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:53.688426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50116b0ce963f6e2cefccf4a7f078170972016de887c005b1698028dbf850911","sha256:d51338b216521706b5d95150634f8f1c4db1638e400b1c716d23176a809a58bf"],"state_sha256":"4d9af2fc5f33e10bf6f3ac2140bdc16ced7371200c557ff8e4a48a0e32a7ef1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sERCmeSaCh2mySsPMqfEatTLoROpaAK9ftral8ri1hhLAXCFOF+FZ4QSFszQD8b1CyVm7mJZ0JEXYCEIJuk+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:38:54.073027Z","bundle_sha256":"8ea9984c64412044c20d8d3179633049da5be7f9030473e0992f89f3f49d527d"}}