{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6X32JTZKW36RBNGT6RWSBMWY4A","short_pith_number":"pith:6X32JTZK","schema_version":"1.0","canonical_sha256":"f5f7a4cf2ab6fd10b4d3f46d20b2d8e02a11b5641aa1346a0dcc8ae7f7d1b6c7","source":{"kind":"arxiv","id":"1511.07494","version":1},"attestation_state":"computed","paper":{"title":"An approximation algorithm for Uniform Capacitated k-Median problem with 1 + {\\epsilon} capacity violation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaros{\\l}aw Byrka, Sumedha Uniyal","submitted_at":"2015-11-23T22:25:40Z","abstract_excerpt":"We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the number of facilities or the capacities. While the standard LP-relaxation can only be used for algorithms violating one of the two by a factor of at least two, Shi Li [SODA'15, SODA'16] gave algorithms violating the number of facilities by a factor of 1+{\\epsilon} exploring properties of extended relaxations.\n  In this paper we develop a constant factor approximation algorithm for Uniform Capacitated k-Median violating only the capacities by a factor of 1+{\\epsilon}. Th"},"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":"1511.07494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T22:25:40Z","cross_cats_sorted":[],"title_canon_sha256":"129ea2509114207bc61bfaee867aebe2ae53e0c7bf4e00e28e75306958cac3ed","abstract_canon_sha256":"20bbadd8f8b35c7b341721bbaec13d86db1253a89d2b397614c7d18d3e0da711"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.650538Z","signature_b64":"luf6e0xNNCB2T08fHV1uWIaaiXMNPJKrznJ15kUQmRFz2iXFUGAtQdNmMkppy/1TcGVFRTwxwSiFmrE4tDywAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5f7a4cf2ab6fd10b4d3f46d20b2d8e02a11b5641aa1346a0dcc8ae7f7d1b6c7","last_reissued_at":"2026-05-18T01:26:04.649977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.649977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An approximation algorithm for Uniform Capacitated k-Median problem with 1 + {\\epsilon} capacity violation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaros{\\l}aw Byrka, Sumedha Uniyal","submitted_at":"2015-11-23T22:25:40Z","abstract_excerpt":"We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the number of facilities or the capacities. While the standard LP-relaxation can only be used for algorithms violating one of the two by a factor of at least two, Shi Li [SODA'15, SODA'16] gave algorithms violating the number of facilities by a factor of 1+{\\epsilon} exploring properties of extended relaxations.\n  In this paper we develop a constant factor approximation algorithm for Uniform Capacitated k-Median violating only the capacities by a factor of 1+{\\epsilon}. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07494","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":"1511.07494","created_at":"2026-05-18T01:26:04.650098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07494v1","created_at":"2026-05-18T01:26:04.650098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07494","created_at":"2026-05-18T01:26:04.650098+00:00"},{"alias_kind":"pith_short_12","alias_value":"6X32JTZKW36R","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6X32JTZKW36RBNGT","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6X32JTZK","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A","json":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A.json","graph_json":"https://pith.science/api/pith-number/6X32JTZKW36RBNGT6RWSBMWY4A/graph.json","events_json":"https://pith.science/api/pith-number/6X32JTZKW36RBNGT6RWSBMWY4A/events.json","paper":"https://pith.science/paper/6X32JTZK"},"agent_actions":{"view_html":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A","download_json":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A.json","view_paper":"https://pith.science/paper/6X32JTZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07494&json=true","fetch_graph":"https://pith.science/api/pith-number/6X32JTZKW36RBNGT6RWSBMWY4A/graph.json","fetch_events":"https://pith.science/api/pith-number/6X32JTZKW36RBNGT6RWSBMWY4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A/action/storage_attestation","attest_author":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A/action/author_attestation","sign_citation":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A/action/citation_signature","submit_replication":"https://pith.science/pith/6X32JTZKW36RBNGT6RWSBMWY4A/action/replication_record"}},"created_at":"2026-05-18T01:26:04.650098+00:00","updated_at":"2026-05-18T01:26:04.650098+00:00"}