{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZIZIIZZF5QWR5UPZ7IQUHV5VRT","short_pith_number":"pith:ZIZIIZZF","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"},"canonical_sha256":"ca32846725ec2d1ed1f9fa2143d7b58ccceaeef6ad8bdbbc818c16612525d920","source":{"kind":"arxiv","id":"1804.08948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08948","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08948v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08948","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZIZIIZZF5QWR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIZIIZZF5QWR5UPZ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIZIIZZF","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZIZIIZZF5QWR5UPZ7IQUHV5VRT","target":"record","payload":{"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"},"canonical_sha256":"ca32846725ec2d1ed1f9fa2143d7b58ccceaeef6ad8bdbbc818c16612525d920","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"},"source_kind":"arxiv","source_id":"1804.08948","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:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pq/PgmTNlBqLY2svTSrBFdjAGoRVwzgzFcWSahQc54tywwxOzmue36629iQ63zSLW6gH/OoUeGUjFoD0A1gwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:28:19.948424Z"},"content_sha256":"65d3b60095c2cc681e3e71d4ebdc136e0f4dd3a89ff814b1e4f928d5cab02c41","schema_version":"1.0","event_id":"sha256:65d3b60095c2cc681e3e71d4ebdc136e0f4dd3a89ff814b1e4f928d5cab02c41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZIZIIZZF5QWR5UPZ7IQUHV5VRT","target":"graph","payload":{"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"},"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:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZeRgX8leK+OiGA2Ja7xycYfEQWrMFM6QBAn5wWRaw9jjhbgSQ537B/3HWd32kHq0IrLw3B03cSj3x8atiYtABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:28:19.949148Z"},"content_sha256":"3602c884a27ee468efb04d7c09b07f7ec6d3bee699321e04c707356eb0564cd7","schema_version":"1.0","event_id":"sha256:3602c884a27ee468efb04d7c09b07f7ec6d3bee699321e04c707356eb0564cd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/bundle.json","state_url":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/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-31T10:28:19Z","links":{"resolver":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT","bundle":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/bundle.json","state":"https://pith.science/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIZIIZZF5QWR5UPZ7IQUHV5VRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZIZIIZZF5QWR5UPZ7IQUHV5VRT","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":"b4b0093441ee0c8146c888704d06c33a6e5b348e9a24276bae8d0318c13e5689","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T10:47:18Z","title_canon_sha256":"91a908387718e968152a15023fbbb6d65559d5becece2bc64c33f038378d6ae7"},"schema_version":"1.0","source":{"id":"1804.08948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08948","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08948v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08948","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZIZIIZZF5QWR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIZIIZZF5QWR5UPZ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIZIIZZF","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:3602c884a27ee468efb04d7c09b07f7ec6d3bee699321e04c707356eb0564cd7","target":"graph","created_at":"2026-05-18T00:17:36Z","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 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","authors_text":"Aditya Pancholi, Neelima Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T10:47:18Z","title":"Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08948","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:65d3b60095c2cc681e3e71d4ebdc136e0f4dd3a89ff814b1e4f928d5cab02c41","target":"record","created_at":"2026-05-18T00:17:36Z","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":"b4b0093441ee0c8146c888704d06c33a6e5b348e9a24276bae8d0318c13e5689","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T10:47:18Z","title_canon_sha256":"91a908387718e968152a15023fbbb6d65559d5becece2bc64c33f038378d6ae7"},"schema_version":"1.0","source":{"id":"1804.08948","kind":"arxiv","version":1}},"canonical_sha256":"ca32846725ec2d1ed1f9fa2143d7b58ccceaeef6ad8bdbbc818c16612525d920","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca32846725ec2d1ed1f9fa2143d7b58ccceaeef6ad8bdbbc818c16612525d920","first_computed_at":"2026-05-18T00:17:36.827195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:36.827195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYpTvJmPYJHM5pxG1qHgiW56M4LaBgc9MIkQ7xyM6Lyzq+KYG7qVN/PVly8F/4NMf3vcdzNlMGRGxCuBPdhYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:36.827920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65d3b60095c2cc681e3e71d4ebdc136e0f4dd3a89ff814b1e4f928d5cab02c41","sha256:3602c884a27ee468efb04d7c09b07f7ec6d3bee699321e04c707356eb0564cd7"],"state_sha256":"163c4f4cce8b6c21be9a506e560cc0f16c8b1e4fe1ede16fe34d801b6f5deff5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCmAEQCWcASSHmnHrr89bd65QCRxKzGsL4ydi/HkGABOD5nJebp7xZS9tAGRPM8wHDHxRH4gWyUTAbBgNtNGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:28:19.952608Z","bundle_sha256":"13a609c2d6f8b4c76ab400607350b8cba3c3815fbd19472106787dbe34c6ac9d"}}