{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZIZIIZZF5QWR5UPZ7IQUHV5VRT","short_pith_number":"pith:ZIZIIZZF","schema_version":"1.0","canonical_sha256":"ca32846725ec2d1ed1f9fa2143d7b58ccceaeef6ad8bdbbc818c16612525d920","source":{"kind":"arxiv","id":"1804.08948","version":1},"attestation_state":"computed","paper":{"title":"Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditya Pancholi, Neelima Gupta","submitted_at":"2018-04-24T10:47:18Z","abstract_excerpt":"In this paper, we study the hard uniform capacitated $k$- median problem using local search heuristic. Obtaining a constant factor approximation for the \\ckm problem is open. All the existing solutions giving constant-factor approximation, violate at least one of the cardinality and the capacity constraints. All except Koruplou et al are based on LP-relaxation.\n  We give $(3+\\epsilon)$ factor approximation algorithm for the problem violating the cardinality by a factor of $8/3 \\approx 2.67$. There is a trade-off between the approximation factor and the cardinality violation between our work an"},"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":"1804.08948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T10:47:18Z","cross_cats_sorted":[],"title_canon_sha256":"91a908387718e968152a15023fbbb6d65559d5becece2bc64c33f038378d6ae7","abstract_canon_sha256":"b4b0093441ee0c8146c888704d06c33a6e5b348e9a24276bae8d0318c13e5689"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.827920Z","signature_b64":"sYpTvJmPYJHM5pxG1qHgiW56M4LaBgc9MIkQ7xyM6Lyzq+KYG7qVN/PVly8F/4NMf3vcdzNlMGRGxCuBPdhYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca32846725ec2d1ed1f9fa2143d7b58ccceaeef6ad8bdbbc818c16612525d920","last_reissued_at":"2026-05-18T00:17:36.827195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.827195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditya Pancholi, Neelima Gupta","submitted_at":"2018-04-24T10:47:18Z","abstract_excerpt":"In this paper, we study the hard uniform capacitated $k$- median problem using local search heuristic. Obtaining a constant factor approximation for the \\ckm problem is open. All the existing solutions giving constant-factor approximation, violate at least one of the cardinality and the capacity constraints. All except Koruplou et al are based on LP-relaxation.\n  We give $(3+\\epsilon)$ factor approximation algorithm for the problem violating the cardinality by a factor of $8/3 \\approx 2.67$. There is a trade-off between the approximation factor and the cardinality violation between our work an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08948","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":"1804.08948","created_at":"2026-05-18T00:17:36.827308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08948v1","created_at":"2026-05-18T00:17:36.827308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08948","created_at":"2026-05-18T00:17:36.827308+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIZIIZZF5QWR","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIZIIZZF5QWR5UPZ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIZIIZZF","created_at":"2026-05-18T12:33:07.085635+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/ZIZIIZZF5QWR5UPZ7IQUHV5VRT","json":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT.json","graph_json":"https://pith.science/api/pith-number/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/graph.json","events_json":"https://pith.science/api/pith-number/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/events.json","paper":"https://pith.science/paper/ZIZIIZZF"},"agent_actions":{"view_html":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT","download_json":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT.json","view_paper":"https://pith.science/paper/ZIZIIZZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08948&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/action/storage_attestation","attest_author":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/action/author_attestation","sign_citation":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/action/citation_signature","submit_replication":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/action/replication_record"}},"created_at":"2026-05-18T00:17:36.827308+00:00","updated_at":"2026-05-18T00:17:36.827308+00:00"}