{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L4HK2U2X5R46IBPPZWCLPXY7GG","short_pith_number":"pith:L4HK2U2X","schema_version":"1.0","canonical_sha256":"5f0ead5357ec79e405efcd84b7df1f318112802d5ef8f96605708925a6bb35f3","source":{"kind":"arxiv","id":"1406.4454","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.4454","created_at":"2026-05-18T02:49:32.023262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4454v1","created_at":"2026-05-18T02:49:32.023262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4454","created_at":"2026-05-18T02:49:32.023262+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4HK2U2X5R46","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4HK2U2X5R46IBPP","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4HK2U2X","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.04614","citing_title":"On Tight FPT Time Approximation Algorithms for k-Clustering Problems","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG","json":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG.json","graph_json":"https://pith.science/api/pith-number/L4HK2U2X5R46IBPPZWCLPXY7GG/graph.json","events_json":"https://pith.science/api/pith-number/L4HK2U2X5R46IBPPZWCLPXY7GG/events.json","paper":"https://pith.science/paper/L4HK2U2X"},"agent_actions":{"view_html":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG","download_json":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG.json","view_paper":"https://pith.science/paper/L4HK2U2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4454&json=true","fetch_graph":"https://pith.science/api/pith-number/L4HK2U2X5R46IBPPZWCLPXY7GG/graph.json","fetch_events":"https://pith.science/api/pith-number/L4HK2U2X5R46IBPPZWCLPXY7GG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/action/storage_attestation","attest_author":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/action/author_attestation","sign_citation":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/action/citation_signature","submit_replication":"https://pith.science/pith/L4HK2U2X5R46IBPPZWCLPXY7GG/action/replication_record"}},"created_at":"2026-05-18T02:49:32.023262+00:00","updated_at":"2026-05-18T02:49:32.023262+00:00"}