{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RABMGRHSXUEYJJVUSRDB6MAWLH","short_pith_number":"pith:RABMGRHS","canonical_record":{"source":{"id":"1304.7465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-28T13:31:44Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"330d804d8023c4cea8bc0e43544310ccbe7e3cdc08e96c318002ac0f38656080","abstract_canon_sha256":"9fd39c40cff7e5883b39987da804419caddbf5621f912e41621b83cf813bd5b5"},"schema_version":"1.0"},"canonical_sha256":"8802c344f2bd0984a6b494461f301659ee3ca9e7b2505aa780a70a4bb81b4082","source":{"kind":"arxiv","id":"1304.7465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7465","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7465v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7465","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"RABMGRHSXUEY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RABMGRHSXUEYJJVU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RABMGRHS","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RABMGRHSXUEYJJVUSRDB6MAWLH","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-28T13:31:44Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"330d804d8023c4cea8bc0e43544310ccbe7e3cdc08e96c318002ac0f38656080","abstract_canon_sha256":"9fd39c40cff7e5883b39987da804419caddbf5621f912e41621b83cf813bd5b5"},"schema_version":"1.0"},"canonical_sha256":"8802c344f2bd0984a6b494461f301659ee3ca9e7b2505aa780a70a4bb81b4082","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.916716Z","signature_b64":"tiPNRLT9N+1Wp59hhfpWodoBg0pb1XuWsVkR6pH1routIq0w/U6ssq/E4XVnFO0o3N4yYQRueW8fB85cKyOnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8802c344f2bd0984a6b494461f301659ee3ca9e7b2505aa780a70a4bb81b4082","last_reissued_at":"2026-05-18T03:26:53.915966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.915966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7465","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:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KDsJR0rpPseeWkDIaK7ahcUhttRj4lj0pYOLs2+wRtwX8PJQ7j20wte3vDct9WfgT4IChDITiy+he/xg5PBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:53:08.480676Z"},"content_sha256":"02a540bc6cb92480ee21aee4c6c4b820e0c4aa0286289cf7067c2e9524db3f69","schema_version":"1.0","event_id":"sha256:02a540bc6cb92480ee21aee4c6c4b820e0c4aa0286289cf7067c2e9524db3f69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RABMGRHSXUEYJJVUSRDB6MAWLH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Initialization of the K-Means Algorithm Using Hierarchical Clustering","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","submitted_at":"2013-04-28T13:31:44Z","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. Many of these methods, however, have superlinear complexity in the number of data points, making them impractical for large data sets. On the other hand, linear methods are often random and/or order-sensitive, which renders their results unrepeatable. Recently, Su and Dy proposed two highly successful hierarch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7465","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:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+LHmcpMU1v66gYnbTB1uo5kasGhwToH/2dWhB1vwZ5F7qh7JWvRi+yDEc+C1uCnfsW1frDU2l4zvM0dJeDjzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:53:08.481037Z"},"content_sha256":"f3ab1f736c71e7c33898b98c83d6d02faf46a4165ab36821f6ca36bd1c53e7db","schema_version":"1.0","event_id":"sha256:f3ab1f736c71e7c33898b98c83d6d02faf46a4165ab36821f6ca36bd1c53e7db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RABMGRHSXUEYJJVUSRDB6MAWLH/bundle.json","state_url":"https://pith.science/pith/RABMGRHSXUEYJJVUSRDB6MAWLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RABMGRHSXUEYJJVUSRDB6MAWLH/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-04T13:53:08Z","links":{"resolver":"https://pith.science/pith/RABMGRHSXUEYJJVUSRDB6MAWLH","bundle":"https://pith.science/pith/RABMGRHSXUEYJJVUSRDB6MAWLH/bundle.json","state":"https://pith.science/pith/RABMGRHSXUEYJJVUSRDB6MAWLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RABMGRHSXUEYJJVUSRDB6MAWLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RABMGRHSXUEYJJVUSRDB6MAWLH","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":"9fd39c40cff7e5883b39987da804419caddbf5621f912e41621b83cf813bd5b5","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-28T13:31:44Z","title_canon_sha256":"330d804d8023c4cea8bc0e43544310ccbe7e3cdc08e96c318002ac0f38656080"},"schema_version":"1.0","source":{"id":"1304.7465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7465","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7465v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7465","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"RABMGRHSXUEY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RABMGRHSXUEYJJVU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RABMGRHS","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:f3ab1f736c71e7c33898b98c83d6d02faf46a4165ab36821f6ca36bd1c53e7db","target":"graph","created_at":"2026-05-18T03:26: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. Many of these methods, however, have superlinear complexity in the number of data points, making them impractical for large data sets. On the other hand, linear methods are often random and/or order-sensitive, which renders their results unrepeatable. Recently, Su and Dy proposed two highly successful hierarch","authors_text":"Hassan A. Kingravi, M. Emre Celebi","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-28T13:31:44Z","title":"Deterministic Initialization of the K-Means Algorithm Using Hierarchical Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7465","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:02a540bc6cb92480ee21aee4c6c4b820e0c4aa0286289cf7067c2e9524db3f69","target":"record","created_at":"2026-05-18T03:26: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":"9fd39c40cff7e5883b39987da804419caddbf5621f912e41621b83cf813bd5b5","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-28T13:31:44Z","title_canon_sha256":"330d804d8023c4cea8bc0e43544310ccbe7e3cdc08e96c318002ac0f38656080"},"schema_version":"1.0","source":{"id":"1304.7465","kind":"arxiv","version":1}},"canonical_sha256":"8802c344f2bd0984a6b494461f301659ee3ca9e7b2505aa780a70a4bb81b4082","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8802c344f2bd0984a6b494461f301659ee3ca9e7b2505aa780a70a4bb81b4082","first_computed_at":"2026-05-18T03:26:53.915966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:53.915966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tiPNRLT9N+1Wp59hhfpWodoBg0pb1XuWsVkR6pH1routIq0w/U6ssq/E4XVnFO0o3N4yYQRueW8fB85cKyOnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:53.916716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02a540bc6cb92480ee21aee4c6c4b820e0c4aa0286289cf7067c2e9524db3f69","sha256:f3ab1f736c71e7c33898b98c83d6d02faf46a4165ab36821f6ca36bd1c53e7db"],"state_sha256":"a20a2a09cf78c0323345b5ed3e963eb440aa48fc50c1071b617e84e639b4a74b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGWIECuFWq8ipRjFJOci9nLX18JQ3U4TMJLu6wqcWYz9FBbeWM0AwST4YC0S9R0OWOucpDlqFYVcd/Q62p3sDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:53:08.483343Z","bundle_sha256":"3a5820916f14c7fc2c2c81a998fd15111e47a477d4630611d7ccc80ae1f2bff3"}}