{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L4HK2U2X5R46IBPPZWCLPXY7GG","short_pith_number":"pith:L4HK2U2X","canonical_record":{"source":{"id":"1406.4454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-17T18:00:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ddfc99eec975089f3612a7790103e72ba31a24c2fc645294135e6a4922e52667","abstract_canon_sha256":"160916387f27d26a75ac75d0c4c1689629ad0cdc5e0ad7040577bfcaff0d5a93"},"schema_version":"1.0"},"canonical_sha256":"5f0ead5357ec79e405efcd84b7df1f318112802d5ef8f96605708925a6bb35f3","source":{"kind":"arxiv","id":"1406.4454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4454","created_at":"2026-05-18T02:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4454v1","created_at":"2026-05-18T02:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4454","created_at":"2026-05-18T02:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"L4HK2U2X5R46","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L4HK2U2X5R46IBPP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L4HK2U2X","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L4HK2U2X5R46IBPPZWCLPXY7GG","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-17T18:00:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ddfc99eec975089f3612a7790103e72ba31a24c2fc645294135e6a4922e52667","abstract_canon_sha256":"160916387f27d26a75ac75d0c4c1689629ad0cdc5e0ad7040577bfcaff0d5a93"},"schema_version":"1.0"},"canonical_sha256":"5f0ead5357ec79e405efcd84b7df1f318112802d5ef8f96605708925a6bb35f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:32.023617Z","signature_b64":"tkvLPYA6dwKQvicgRILlsfk8mCw59rihd9wn98IDcI01+BvV1mYWiCx6F+mjJ6x5P3KEGVvcKMHBYwLHKxKJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0ead5357ec79e405efcd84b7df1f318112802d5ef8f96605708925a6bb35f3","last_reissued_at":"2026-05-18T02:49:32.023205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:32.023205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4454","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:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dp3DmL2NKYiSje/jKWTzNwEDOCsTF3Cz5fYwsx3on7+oX4r55meU7YF1sVxSNq1zu2Nbt+8REL8vs6UHTTEVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:58.050469Z"},"content_sha256":"13549c94c905fbb1f2cd0dc352a988604b4ac526871e71ff335e57d6a1366242","schema_version":"1.0","event_id":"sha256:13549c94c905fbb1f2cd0dc352a988604b4ac526871e71ff335e57d6a1366242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L4HK2U2X5R46IBPPZWCLPXY7GG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Shanfei Li","submitted_at":"2014-06-17T18:00:48Z","abstract_excerpt":"In the $k$-median problem, given a set of locations, the goal is to select a subset of at most $k$ centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of the $k$-median problem, in which each selected center can only serve a limited number of locations.\n  Inspired by the algorithm of Charikar, Guha, Tardos and Shmoys, we give a $(6+10\\alpha)$-approximation algorithm for this problem with increasing the capacities by a factor of $2+\\frac{2}{\\alpha}, \\alpha\\geq 4$, which improves the previous best $(32 l^2+28 l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4454","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:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xk969vPRDhBLTryEz0Ixpsr+WSa9lzRejk4SKmr6zLTPGV910y1MuG7S9h7Hm1wIZhPTgR8aY9ct/1ICkUukBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:58.051190Z"},"content_sha256":"cf92fd3aa086a7776c975b0a317c04c2f31c1d43f23c7f7abfb2d5cf0a2f7d10","schema_version":"1.0","event_id":"sha256:cf92fd3aa086a7776c975b0a317c04c2f31c1d43f23c7f7abfb2d5cf0a2f7d10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/bundle.json","state_url":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/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-05-25T11:42:58Z","links":{"resolver":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG","bundle":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/bundle.json","state":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L4HK2U2X5R46IBPPZWCLPXY7GG","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":"160916387f27d26a75ac75d0c4c1689629ad0cdc5e0ad7040577bfcaff0d5a93","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-17T18:00:48Z","title_canon_sha256":"ddfc99eec975089f3612a7790103e72ba31a24c2fc645294135e6a4922e52667"},"schema_version":"1.0","source":{"id":"1406.4454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4454","created_at":"2026-05-18T02:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4454v1","created_at":"2026-05-18T02:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4454","created_at":"2026-05-18T02:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"L4HK2U2X5R46","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L4HK2U2X5R46IBPP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L4HK2U2X","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:cf92fd3aa086a7776c975b0a317c04c2f31c1d43f23c7f7abfb2d5cf0a2f7d10","target":"graph","created_at":"2026-05-18T02:49:32Z","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":"In the $k$-median problem, given a set of locations, the goal is to select a subset of at most $k$ centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of the $k$-median problem, in which each selected center can only serve a limited number of locations.\n  Inspired by the algorithm of Charikar, Guha, Tardos and Shmoys, we give a $(6+10\\alpha)$-approximation algorithm for this problem with increasing the capacities by a factor of $2+\\frac{2}{\\alpha}, \\alpha\\geq 4$, which improves the previous best $(32 l^2+28 l","authors_text":"Shanfei Li","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-17T18:00:48Z","title":"An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4454","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:13549c94c905fbb1f2cd0dc352a988604b4ac526871e71ff335e57d6a1366242","target":"record","created_at":"2026-05-18T02:49:32Z","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":"160916387f27d26a75ac75d0c4c1689629ad0cdc5e0ad7040577bfcaff0d5a93","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-17T18:00:48Z","title_canon_sha256":"ddfc99eec975089f3612a7790103e72ba31a24c2fc645294135e6a4922e52667"},"schema_version":"1.0","source":{"id":"1406.4454","kind":"arxiv","version":1}},"canonical_sha256":"5f0ead5357ec79e405efcd84b7df1f318112802d5ef8f96605708925a6bb35f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0ead5357ec79e405efcd84b7df1f318112802d5ef8f96605708925a6bb35f3","first_computed_at":"2026-05-18T02:49:32.023205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:32.023205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tkvLPYA6dwKQvicgRILlsfk8mCw59rihd9wn98IDcI01+BvV1mYWiCx6F+mjJ6x5P3KEGVvcKMHBYwLHKxKJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:32.023617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13549c94c905fbb1f2cd0dc352a988604b4ac526871e71ff335e57d6a1366242","sha256:cf92fd3aa086a7776c975b0a317c04c2f31c1d43f23c7f7abfb2d5cf0a2f7d10"],"state_sha256":"2d441ae8e079ec377a4357e5c8cb55468577f882eeec99022b468d73396de860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWmDye7feM8wDIDM6FWXREjt6P+tZFqfYTGEw6P7nheaShiK1b5xIE3XZCZtTVuNtiCppu/LWMue3vjm2vnjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:42:58.054877Z","bundle_sha256":"0e65c0d2f7a46214b1f092163a9de0f370d362d7aeb08205bca94e5be4bb2cf2"}}