{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NJAZ5WJDIYFUZ37YC6MCHRZC2N","short_pith_number":"pith:NJAZ5WJD","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"},"canonical_sha256":"6a419ed923460b4ceff8179823c722d36a74ee34dbd724d5986ef90d86245f6a","source":{"kind":"arxiv","id":"1410.4161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4161","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4161v2","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4161","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"NJAZ5WJDIYFU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NJAZ5WJDIYFUZ37Y","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NJAZ5WJD","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NJAZ5WJDIYFUZ37YC6MCHRZC2N","target":"record","payload":{"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"},"canonical_sha256":"6a419ed923460b4ceff8179823c722d36a74ee34dbd724d5986ef90d86245f6a","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"},"source_kind":"arxiv","source_id":"1410.4161","source_version":2,"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-18T01:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dB452AHvKyNJMgGyujOKUhChZ9pv4xjJ2Ydkjyo5WKB/o0d9RBauY56oNhOP1W83roJ8vxK7kuk6mQFKpwDWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:20.689456Z"},"content_sha256":"242904ff8d0ab0eec3ce056f2b9cd88d97f5929c83a7ac7599c3a7571c0e437d","schema_version":"1.0","event_id":"sha256:242904ff8d0ab0eec3ce056f2b9cd88d97f5929c83a7ac7599c3a7571c0e437d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NJAZ5WJDIYFUZ37YC6MCHRZC2N","target":"graph","payload":{"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"},"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-18T01:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5yLVrdrc+I75c18L0VoRWTVdogsynjyF+OzpCHLa3Czssdk0Pj2tRKDoePEh4IZYZcWDkvsZVmLVFZbChmZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:20.689803Z"},"content_sha256":"7e81f357566c8248c5ad495ed3f83498e17f01ab5b2ad9ba48778ccc73867e90","schema_version":"1.0","event_id":"sha256:7e81f357566c8248c5ad495ed3f83498e17f01ab5b2ad9ba48778ccc73867e90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/bundle.json","state_url":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/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-30T06:54:20Z","links":{"resolver":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N","bundle":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/bundle.json","state":"https://pith.science/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJAZ5WJDIYFUZ37YC6MCHRZC2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NJAZ5WJDIYFUZ37YC6MCHRZC2N","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":"3f2f08d110482feea8a8acbd2f7cca1a7f663fd336bb6b205df8caf5ffdc6bc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T18:41:14Z","title_canon_sha256":"52213957e283b93dd82d833d3b5985e2e6410b431a6636638db6fb65fa6547ee"},"schema_version":"1.0","source":{"id":"1410.4161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4161","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4161v2","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4161","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"NJAZ5WJDIYFU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NJAZ5WJDIYFUZ37Y","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NJAZ5WJD","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:7e81f357566c8248c5ad495ed3f83498e17f01ab5b2ad9ba48778ccc73867e90","target":"graph","created_at":"2026-05-18T01:32:30Z","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":"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.","authors_text":"Chenchen Wu, Dachuan Xu, Donglei Du, Yishui Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T18:41:14Z","title":"An improved approximation algorithm for k-median problem using a new factor-revealing LP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4161","kind":"arxiv","version":2},"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:242904ff8d0ab0eec3ce056f2b9cd88d97f5929c83a7ac7599c3a7571c0e437d","target":"record","created_at":"2026-05-18T01:32:30Z","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":"3f2f08d110482feea8a8acbd2f7cca1a7f663fd336bb6b205df8caf5ffdc6bc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T18:41:14Z","title_canon_sha256":"52213957e283b93dd82d833d3b5985e2e6410b431a6636638db6fb65fa6547ee"},"schema_version":"1.0","source":{"id":"1410.4161","kind":"arxiv","version":2}},"canonical_sha256":"6a419ed923460b4ceff8179823c722d36a74ee34dbd724d5986ef90d86245f6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a419ed923460b4ceff8179823c722d36a74ee34dbd724d5986ef90d86245f6a","first_computed_at":"2026-05-18T01:32:30.646401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:30.646401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tF1vBMP+bnsHwhmqA5V2mpBDLWleWGd6AEEhAGRYoLS3+GcrebYZ7G9J5lfVmH823VufQDEuabyXuxz47+9MBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:30.646879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:242904ff8d0ab0eec3ce056f2b9cd88d97f5929c83a7ac7599c3a7571c0e437d","sha256:7e81f357566c8248c5ad495ed3f83498e17f01ab5b2ad9ba48778ccc73867e90"],"state_sha256":"238bbcb1ed6ab4123dc511f972514bf77fef683d29056fffb1638c2740c95803"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkQBrAujOx3QEZ7GxwSv042LWx50Bj4PVjrjBK1wHkuUw3RExTT8fxntBva5+zan1gg/Hma8Uh82IeyvSFksCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:54:20.691776Z","bundle_sha256":"475777780e06d64956df451a3422e78fb18b4b3486ce6e1bd6ad3d99c7ca8811"}}