{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZW6QQJA4VMEKK3HZB7VL7WRIHU","short_pith_number":"pith:ZW6QQJA4","canonical_record":{"source":{"id":"1704.02515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-08T17:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"e703ced153ba498bb0c79af42eff1d978b03622f3ef1052f9ca7de1b46682583","abstract_canon_sha256":"e7ff9cf27edd951911f4cf3dcea3f9d5bec302db3fd4aefe123736b56955919e"},"schema_version":"1.0"},"canonical_sha256":"cdbd08241cab08a56cf90feabfda283d147969c519936979a75fb549a96a5117","source":{"kind":"arxiv","id":"1704.02515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02515","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02515v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02515","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZW6QQJA4VMEK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZW6QQJA4VMEKK3HZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZW6QQJA4","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZW6QQJA4VMEKK3HZB7VL7WRIHU","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-08T17:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"e703ced153ba498bb0c79af42eff1d978b03622f3ef1052f9ca7de1b46682583","abstract_canon_sha256":"e7ff9cf27edd951911f4cf3dcea3f9d5bec302db3fd4aefe123736b56955919e"},"schema_version":"1.0"},"canonical_sha256":"cdbd08241cab08a56cf90feabfda283d147969c519936979a75fb549a96a5117","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:45.263617Z","signature_b64":"v7Ghuykkog5APou057W2LS/SPO8gBcTxuNXPBw+BK55nNL8QTKLXFjX+Ldc3v23oi2jzzJ49R4s4tyDjzWa2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdbd08241cab08a56cf90feabfda283d147969c519936979a75fb549a96a5117","last_reissued_at":"2026-05-18T00:46:45.262896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:45.262896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02515","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-18T00:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbXQmC0DkvYwDez2XjM9qRqs/z/OUAztcGT8COAQwN/NhNC6mah8E9FxQLdXVzBF17A/MTS1xl/9Zj+K1EOBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:20:55.437643Z"},"content_sha256":"4b484dd5ac4e44659beba5a7c433eaa2f0f8c4942d9bb8e451ad8dd415e7b743","schema_version":"1.0","event_id":"sha256:4b484dd5ac4e44659beba5a7c433eaa2f0f8c4942d9bb8e451ad8dd415e7b743"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZW6QQJA4VMEKK3HZB7VL7WRIHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced $k$-Center Clustering When $k$ Is A Constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hu Ding","submitted_at":"2017-04-08T17:30:26Z","abstract_excerpt":"The problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds. The problem is motivated by the applications in processing and analyzing large-scale data in high dimension. We provide a simple nearly linear time $4$-approximation algorithm when the number of clusters $k$ is assumed to be a constant. Comparing with existing method, our algorithm improves the approximation ratio and significantly reduces the time complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02515","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-18T00:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hmg2S6dPAPi0jHaNvt1qk5KBsivvDJKQd1KPg9hproE/yAE4cxfu4MyJIqpjDhL83/9BpkXsEU8j/34QRkHAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:20:55.437987Z"},"content_sha256":"a45b3d1005ef205a4f6543de8d39877e3951e4f968df81fbd717e2a8f0a690e6","schema_version":"1.0","event_id":"sha256:a45b3d1005ef205a4f6543de8d39877e3951e4f968df81fbd717e2a8f0a690e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/bundle.json","state_url":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/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-07-04T07:20:55Z","links":{"resolver":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU","bundle":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/bundle.json","state":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZW6QQJA4VMEKK3HZB7VL7WRIHU","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":"e7ff9cf27edd951911f4cf3dcea3f9d5bec302db3fd4aefe123736b56955919e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-08T17:30:26Z","title_canon_sha256":"e703ced153ba498bb0c79af42eff1d978b03622f3ef1052f9ca7de1b46682583"},"schema_version":"1.0","source":{"id":"1704.02515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02515","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02515v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02515","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZW6QQJA4VMEK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZW6QQJA4VMEKK3HZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZW6QQJA4","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a45b3d1005ef205a4f6543de8d39877e3951e4f968df81fbd717e2a8f0a690e6","target":"graph","created_at":"2026-05-18T00:46:45Z","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 problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds. The problem is motivated by the applications in processing and analyzing large-scale data in high dimension. We provide a simple nearly linear time $4$-approximation algorithm when the number of clusters $k$ is assumed to be a constant. Comparing with existing method, our algorithm improves the approximation ratio and significantly reduces the time complexi","authors_text":"Hu Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-08T17:30:26Z","title":"Balanced $k$-Center Clustering When $k$ Is A Constant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02515","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:4b484dd5ac4e44659beba5a7c433eaa2f0f8c4942d9bb8e451ad8dd415e7b743","target":"record","created_at":"2026-05-18T00:46:45Z","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":"e7ff9cf27edd951911f4cf3dcea3f9d5bec302db3fd4aefe123736b56955919e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-08T17:30:26Z","title_canon_sha256":"e703ced153ba498bb0c79af42eff1d978b03622f3ef1052f9ca7de1b46682583"},"schema_version":"1.0","source":{"id":"1704.02515","kind":"arxiv","version":1}},"canonical_sha256":"cdbd08241cab08a56cf90feabfda283d147969c519936979a75fb549a96a5117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdbd08241cab08a56cf90feabfda283d147969c519936979a75fb549a96a5117","first_computed_at":"2026-05-18T00:46:45.262896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:45.262896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v7Ghuykkog5APou057W2LS/SPO8gBcTxuNXPBw+BK55nNL8QTKLXFjX+Ldc3v23oi2jzzJ49R4s4tyDjzWa2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:45.263617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b484dd5ac4e44659beba5a7c433eaa2f0f8c4942d9bb8e451ad8dd415e7b743","sha256:a45b3d1005ef205a4f6543de8d39877e3951e4f968df81fbd717e2a8f0a690e6"],"state_sha256":"1b77220504dd84da267045d872986a4731fbf261394a3dc2e945416a916131b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqx6eTN22V6Qj8UNoSTQSyUmDQ5jkbxiIaQHkP8rdi8hM8tMFUQmBXDQ5Ak4po1MTSJwT1q18u0Y6I9efyfACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T07:20:55.439851Z","bundle_sha256":"4e8dd5aa45d3bcfe897c1a21672ddd2302f4263e091ef6ed3ec2fe43b4ffca36"}}