{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ENLUKESFHGLMW2QGPFCNP7EXOI","short_pith_number":"pith:ENLUKESF","canonical_record":{"source":{"id":"1504.02564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T07:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"13de34588b8740d0cb657d29bd90bbe862793c452a5d8f42b3efcff298355515","abstract_canon_sha256":"94d728f93026d493f7e35e4eefc7566ec86a911c750743bd4dcfef54642fe43e"},"schema_version":"1.0"},"canonical_sha256":"23574512453996cb6a067944d7fc97723cc74653f7f09434aa79209cb1748775","source":{"kind":"arxiv","id":"1504.02564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02564","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02564v1","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02564","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"ENLUKESFHGLM","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ENLUKESFHGLMW2QG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ENLUKESF","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ENLUKESFHGLMW2QGPFCNP7EXOI","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T07:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"13de34588b8740d0cb657d29bd90bbe862793c452a5d8f42b3efcff298355515","abstract_canon_sha256":"94d728f93026d493f7e35e4eefc7566ec86a911c750743bd4dcfef54642fe43e"},"schema_version":"1.0"},"canonical_sha256":"23574512453996cb6a067944d7fc97723cc74653f7f09434aa79209cb1748775","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:07.366770Z","signature_b64":"541g2zlkeWuJE+LqHFRMqaqvm/QP8+oWsKH5YMC2EnHvxuU7xby2QbilrfLEa3EYro65bXLh37MkqJB0XwlmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23574512453996cb6a067944d7fc97723cc74653f7f09434aa79209cb1748775","last_reissued_at":"2026-05-18T02:19:07.366328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:07.366328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02564","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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owmWDoNXzk2Kmx8yCQNXdbd5FbjvZpB5b8NyHQYKQtMJY+wokhhkKzcC6wLvjGEWhMWU8NfQpJQvbRSx1gauAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:56:54.600231Z"},"content_sha256":"ab1cc3c235a47ed34b00726ef1e8ea08f54f49931d1f277356f4cc70fb60d85f","schema_version":"1.0","event_id":"sha256:ab1cc3c235a47ed34b00726ef1e8ea08f54f49931d1f277356f4cc70fb60d85f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ENLUKESFHGLMW2QGPFCNP7EXOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for the Constrained k-means Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anup Bhattacharya, Ragesh Jaiswal","submitted_at":"2015-04-10T07:03:58Z","abstract_excerpt":"The classical center based clustering problems such as $k$-means/median/center assume that the optimal clusters satisfy the locality property that the points in the same cluster are close to each other. A number of clustering problems arise in machine learning where the optimal clusters do not follow such a locality property. Consider a variant of the $k$-means problem that may be regarded as a general version of such problems. Here, the optimal clusters $O_1, ..., O_k$ are an arbitrary partition of the dataset and the goal is to output $k$-centers $c_1, ..., c_k$ such that the objective funct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02564","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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkLU6ezGbY1hbwspuwxY7oNHPNlRvEwGmJO+gH/tKf47kJricK8DiagQ/dzNtPcI+01H7J7SNBQioKeb+9lJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:56:54.600601Z"},"content_sha256":"717e58dc8cf6d30264df9d430e3ab6268288592871ee9cf52227004a762b67a2","schema_version":"1.0","event_id":"sha256:717e58dc8cf6d30264df9d430e3ab6268288592871ee9cf52227004a762b67a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENLUKESFHGLMW2QGPFCNP7EXOI/bundle.json","state_url":"https://pith.science/pith/ENLUKESFHGLMW2QGPFCNP7EXOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENLUKESFHGLMW2QGPFCNP7EXOI/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-02T05:56:54Z","links":{"resolver":"https://pith.science/pith/ENLUKESFHGLMW2QGPFCNP7EXOI","bundle":"https://pith.science/pith/ENLUKESFHGLMW2QGPFCNP7EXOI/bundle.json","state":"https://pith.science/pith/ENLUKESFHGLMW2QGPFCNP7EXOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENLUKESFHGLMW2QGPFCNP7EXOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ENLUKESFHGLMW2QGPFCNP7EXOI","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":"94d728f93026d493f7e35e4eefc7566ec86a911c750743bd4dcfef54642fe43e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T07:03:58Z","title_canon_sha256":"13de34588b8740d0cb657d29bd90bbe862793c452a5d8f42b3efcff298355515"},"schema_version":"1.0","source":{"id":"1504.02564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02564","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02564v1","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02564","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"ENLUKESFHGLM","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ENLUKESFHGLMW2QG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ENLUKESF","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:717e58dc8cf6d30264df9d430e3ab6268288592871ee9cf52227004a762b67a2","target":"graph","created_at":"2026-05-18T02:19:07Z","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 classical center based clustering problems such as $k$-means/median/center assume that the optimal clusters satisfy the locality property that the points in the same cluster are close to each other. A number of clustering problems arise in machine learning where the optimal clusters do not follow such a locality property. Consider a variant of the $k$-means problem that may be regarded as a general version of such problems. Here, the optimal clusters $O_1, ..., O_k$ are an arbitrary partition of the dataset and the goal is to output $k$-centers $c_1, ..., c_k$ such that the objective funct","authors_text":"Amit Kumar, Anup Bhattacharya, Ragesh Jaiswal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T07:03:58Z","title":"Faster Algorithms for the Constrained k-means Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02564","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:ab1cc3c235a47ed34b00726ef1e8ea08f54f49931d1f277356f4cc70fb60d85f","target":"record","created_at":"2026-05-18T02:19:07Z","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":"94d728f93026d493f7e35e4eefc7566ec86a911c750743bd4dcfef54642fe43e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T07:03:58Z","title_canon_sha256":"13de34588b8740d0cb657d29bd90bbe862793c452a5d8f42b3efcff298355515"},"schema_version":"1.0","source":{"id":"1504.02564","kind":"arxiv","version":1}},"canonical_sha256":"23574512453996cb6a067944d7fc97723cc74653f7f09434aa79209cb1748775","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23574512453996cb6a067944d7fc97723cc74653f7f09434aa79209cb1748775","first_computed_at":"2026-05-18T02:19:07.366328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:07.366328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"541g2zlkeWuJE+LqHFRMqaqvm/QP8+oWsKH5YMC2EnHvxuU7xby2QbilrfLEa3EYro65bXLh37MkqJB0XwlmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:07.366770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab1cc3c235a47ed34b00726ef1e8ea08f54f49931d1f277356f4cc70fb60d85f","sha256:717e58dc8cf6d30264df9d430e3ab6268288592871ee9cf52227004a762b67a2"],"state_sha256":"1d50cbb13f91f6bb761b781d7f44b5410bee55733c4910c0eecca5f90b58e654"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9Uyjkz1htvePIkZ5eMfSx1SK15J6ku6EpZ6z+AYrxV+BLOJab9LkDyv1qwpgXcXqWcg9//WxdDt1iz1rQc/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:56:54.602513Z","bundle_sha256":"36a12a38cd59f71496ec3cf9cbcbff3cc4d60427dd59236d1adc7c8a60ea6ac8"}}