{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NJAZ5WJDIYFUZ37YC6MCHRZC2N","short_pith_number":"pith:NJAZ5WJD","schema_version":"1.0","canonical_sha256":"6a419ed923460b4ceff8179823c722d36a74ee34dbd724d5986ef90d86245f6a","source":{"kind":"arxiv","id":"1410.4161","version":2},"attestation_state":"computed","paper":{"title":"An improved approximation algorithm for k-median problem using a new factor-revealing LP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chenchen Wu, Dachuan Xu, Donglei Du, Yishui Wang","submitted_at":"2014-10-15T18:41:14Z","abstract_excerpt":"The k-median problem is a well-known strongly NP-hard combinatorial optimization problem of both theoretical and practical significance. The previous best approximation ratio for this problem is 2.611+\\epsilon (Bryka et al. 2014) based on an (1, 1.95238219) bi-factor approximation algorithm for the classical facility location problem (FLP). This work offers an improved algorithm with an approximation ratio 2.592 +\\epsilon based on a new (1, 1.93910094) bi-factor approximation algorithm for the FLP."},"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":"1410.4161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T18:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"52213957e283b93dd82d833d3b5985e2e6410b431a6636638db6fb65fa6547ee","abstract_canon_sha256":"3f2f08d110482feea8a8acbd2f7cca1a7f663fd336bb6b205df8caf5ffdc6bc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:30.646879Z","signature_b64":"tF1vBMP+bnsHwhmqA5V2mpBDLWleWGd6AEEhAGRYoLS3+GcrebYZ7G9J5lfVmH823VufQDEuabyXuxz47+9MBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a419ed923460b4ceff8179823c722d36a74ee34dbd724d5986ef90d86245f6a","last_reissued_at":"2026-05-18T01:32:30.646401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:30.646401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved approximation algorithm for k-median problem using a new factor-revealing LP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chenchen Wu, Dachuan Xu, Donglei Du, Yishui Wang","submitted_at":"2014-10-15T18:41:14Z","abstract_excerpt":"The k-median problem is a well-known strongly NP-hard combinatorial optimization problem of both theoretical and practical significance. The previous best approximation ratio for this problem is 2.611+\\epsilon (Bryka et al. 2014) based on an (1, 1.95238219) bi-factor approximation algorithm for the classical facility location problem (FLP). This work offers an improved algorithm with an approximation ratio 2.592 +\\epsilon based on a new (1, 1.93910094) bi-factor approximation algorithm for the FLP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4161","kind":"arxiv","version":2},"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":"1410.4161","created_at":"2026-05-18T01:32:30.646473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4161v2","created_at":"2026-05-18T01:32:30.646473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4161","created_at":"2026-05-18T01:32:30.646473+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJAZ5WJDIYFU","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJAZ5WJDIYFUZ37Y","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJAZ5WJD","created_at":"2026-05-18T12:28:41.024544+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/NJAZ5WJDIYFUZ37YC6MCHRZC2N","json":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N.json","graph_json":"https://pith.science/api/pith-number/NJAZ5WJDIYFUZ37YC6MCHRZC2N/graph.json","events_json":"https://pith.science/api/pith-number/NJAZ5WJDIYFUZ37YC6MCHRZC2N/events.json","paper":"https://pith.science/paper/NJAZ5WJD"},"agent_actions":{"view_html":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N","download_json":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N.json","view_paper":"https://pith.science/paper/NJAZ5WJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4161&json=true","fetch_graph":"https://pith.science/api/pith-number/NJAZ5WJDIYFUZ37YC6MCHRZC2N/graph.json","fetch_events":"https://pith.science/api/pith-number/NJAZ5WJDIYFUZ37YC6MCHRZC2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/action/storage_attestation","attest_author":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/action/author_attestation","sign_citation":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/action/citation_signature","submit_replication":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/action/replication_record"}},"created_at":"2026-05-18T01:32:30.646473+00:00","updated_at":"2026-05-18T01:32:30.646473+00:00"}