{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BLC4PT5GSIUV223WLO3Q4BHNKO","short_pith_number":"pith:BLC4PT5G","canonical_record":{"source":{"id":"1401.2912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T16:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"556781e6d8a13262a1337b2458a790beea43d9692216feccc0a64d6aefee803d","abstract_canon_sha256":"f8f6267b6351f3a1c557e249a9af4d586746bf3d916da2e40a81e5d1b0ca9e8c"},"schema_version":"1.0"},"canonical_sha256":"0ac5c7cfa692295d6b765bb70e04ed5382770cc7f813224cd1e53ce252b2974f","source":{"kind":"arxiv","id":"1401.2912","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2912","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2912v2","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2912","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"BLC4PT5GSIUV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BLC4PT5GSIUV223W","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BLC4PT5G","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BLC4PT5GSIUV223WLO3Q4BHNKO","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T16:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"556781e6d8a13262a1337b2458a790beea43d9692216feccc0a64d6aefee803d","abstract_canon_sha256":"f8f6267b6351f3a1c557e249a9af4d586746bf3d916da2e40a81e5d1b0ca9e8c"},"schema_version":"1.0"},"canonical_sha256":"0ac5c7cfa692295d6b765bb70e04ed5382770cc7f813224cd1e53ce252b2974f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:19.947477Z","signature_b64":"HMp5YpeUAHEijD/oqpLzdAogL0+MxYm+8Bv7P6aQkkGBW1ChacHpfn6tLjSPuPltbAqyfo3PR9AKmVrxA1niDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac5c7cfa692295d6b765bb70e04ed5382770cc7f813224cd1e53ce252b2974f","last_reissued_at":"2026-05-18T03:02:19.946724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:19.946724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2912","source_version":2,"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:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J72A+PTx7kjJndvQusyLTfKy88A1xFAyeMU8Sj3FPKrsJBlWNZ5ytJ5nFq7S8c2gztZz4mzQIL7j3wYhJ///Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:34:55.750799Z"},"content_sha256":"f9a0237e1ce6fb721a011ea93101a4e5f358ece327801d38741f53c5b03c6298","schema_version":"1.0","event_id":"sha256:f9a0237e1ce6fb721a011ea93101a4e5f358ece327801d38741f53c5b03c6298"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BLC4PT5GSIUV223WLO3Q4BHNKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tight lower bound instance for k-means++ in constant dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anup Bhattacharya, Nir Ailon, Ragesh Jaiswal","submitted_at":"2014-01-13T16:57:57Z","abstract_excerpt":"The k-means++ seeding algorithm is one of the most popular algorithms that is used for finding the initial $k$ centers when using the k-means heuristic. The algorithm is a simple sampling procedure and can be described as follows: Pick the first center randomly from the given points. For $i > 1$, pick a point to be the $i^{th}$ center with probability proportional to the square of the Euclidean distance of this point to the closest previously $(i-1)$ chosen centers.\n  The k-means++ seeding algorithm is not only simple and fast but also gives an $O(\\log{k})$ approximation in expectation as show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2912","kind":"arxiv","version":2},"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:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTU1rAyOdIPGVGwdtP6BljhXYEV2OfneN7dhiwRhx+w3Ko8Y6Mfbc6Lfy1kkLQH06RsM2jMsI8VPQ+QNfoGWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:34:55.751164Z"},"content_sha256":"ef6260cfee15f633233b464a0eaebf0eb8cb7d3cd432f0c5651969f484044aa9","schema_version":"1.0","event_id":"sha256:ef6260cfee15f633233b464a0eaebf0eb8cb7d3cd432f0c5651969f484044aa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLC4PT5GSIUV223WLO3Q4BHNKO/bundle.json","state_url":"https://pith.science/pith/BLC4PT5GSIUV223WLO3Q4BHNKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLC4PT5GSIUV223WLO3Q4BHNKO/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-02T06:34:55Z","links":{"resolver":"https://pith.science/pith/BLC4PT5GSIUV223WLO3Q4BHNKO","bundle":"https://pith.science/pith/BLC4PT5GSIUV223WLO3Q4BHNKO/bundle.json","state":"https://pith.science/pith/BLC4PT5GSIUV223WLO3Q4BHNKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLC4PT5GSIUV223WLO3Q4BHNKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BLC4PT5GSIUV223WLO3Q4BHNKO","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":"f8f6267b6351f3a1c557e249a9af4d586746bf3d916da2e40a81e5d1b0ca9e8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T16:57:57Z","title_canon_sha256":"556781e6d8a13262a1337b2458a790beea43d9692216feccc0a64d6aefee803d"},"schema_version":"1.0","source":{"id":"1401.2912","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2912","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2912v2","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2912","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"BLC4PT5GSIUV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BLC4PT5GSIUV223W","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BLC4PT5G","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:ef6260cfee15f633233b464a0eaebf0eb8cb7d3cd432f0c5651969f484044aa9","target":"graph","created_at":"2026-05-18T03:02:19Z","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":"The k-means++ seeding algorithm is one of the most popular algorithms that is used for finding the initial $k$ centers when using the k-means heuristic. The algorithm is a simple sampling procedure and can be described as follows: Pick the first center randomly from the given points. For $i > 1$, pick a point to be the $i^{th}$ center with probability proportional to the square of the Euclidean distance of this point to the closest previously $(i-1)$ chosen centers.\n  The k-means++ seeding algorithm is not only simple and fast but also gives an $O(\\log{k})$ approximation in expectation as show","authors_text":"Anup Bhattacharya, Nir Ailon, Ragesh Jaiswal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T16:57:57Z","title":"A tight lower bound instance for k-means++ in constant dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2912","kind":"arxiv","version":2},"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:f9a0237e1ce6fb721a011ea93101a4e5f358ece327801d38741f53c5b03c6298","target":"record","created_at":"2026-05-18T03:02:19Z","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":"f8f6267b6351f3a1c557e249a9af4d586746bf3d916da2e40a81e5d1b0ca9e8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T16:57:57Z","title_canon_sha256":"556781e6d8a13262a1337b2458a790beea43d9692216feccc0a64d6aefee803d"},"schema_version":"1.0","source":{"id":"1401.2912","kind":"arxiv","version":2}},"canonical_sha256":"0ac5c7cfa692295d6b765bb70e04ed5382770cc7f813224cd1e53ce252b2974f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ac5c7cfa692295d6b765bb70e04ed5382770cc7f813224cd1e53ce252b2974f","first_computed_at":"2026-05-18T03:02:19.946724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:19.946724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HMp5YpeUAHEijD/oqpLzdAogL0+MxYm+8Bv7P6aQkkGBW1ChacHpfn6tLjSPuPltbAqyfo3PR9AKmVrxA1niDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:19.947477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2912","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9a0237e1ce6fb721a011ea93101a4e5f358ece327801d38741f53c5b03c6298","sha256:ef6260cfee15f633233b464a0eaebf0eb8cb7d3cd432f0c5651969f484044aa9"],"state_sha256":"1c95322fd0b3d9ca0e1e3c169a838efd8aa47f7469bb856deb526c3394a8978d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsR0BqWSOC2NF8BpLbr/wlr7qcub3RJpYXZrXE8N6U255paGaYE3eM8f1qlF4jzdfa5Yn7xX1RNta8I4akZZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:34:55.753376Z","bundle_sha256":"1286b2c3b6c666779b6110891e86f70f8f45c8ec908a175eec428b296a823581"}}