{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UVJHVSHSRWQ7QTBWQYPORU6SMP","short_pith_number":"pith:UVJHVSHS","schema_version":"1.0","canonical_sha256":"a5527ac8f28da1f84c36861ee8d3d263fdb42e17b01632f6f9a1bd44490524e3","source":{"kind":"arxiv","id":"1307.2808","version":1},"attestation_state":"computed","paper":{"title":"A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Jian Li, MohammadTaghi Hajiaghayi, Shi Li, Wei Hu","submitted_at":"2013-07-10T14:41:58Z","abstract_excerpt":"In this paper, we consider the fault-tolerant $k$-median problem and give the \\emph{first} constant factor approximation algorithm for it. In the fault-tolerant generalization of classical $k$-median problem, each client $j$ needs to be assigned to at least $r_j \\ge 1$ distinct open facilities. The service cost of $j$ is the sum of its distances to the $r_j$ facilities, and the $k$-median constraint restricts the number of open facilities to at most $k$. Previously, a constant factor was known only for the special case when all $r_j$s are the same, and a logarithmic approximation ratio for the"},"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":"1307.2808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-10T14:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"89f4539c76c160b16dcbd0e2486448f7af246eadc4c455400060c3b9f864e21d","abstract_canon_sha256":"973a9c7489079c319c49408ee7d99445699341d99b94eae434abfbac6b7ce070"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:13.661598Z","signature_b64":"sTvFyMluj3Txn3u4/H6jpM3nwy6ExEOGjvVILcHw5Pg2GN3Q91b5HBVY5hsDrFDi8jS9hoLp33qlyq63WZl2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5527ac8f28da1f84c36861ee8d3d263fdb42e17b01632f6f9a1bd44490524e3","last_reissued_at":"2026-05-18T03:01:13.660881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:13.660881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Jian Li, MohammadTaghi Hajiaghayi, Shi Li, Wei Hu","submitted_at":"2013-07-10T14:41:58Z","abstract_excerpt":"In this paper, we consider the fault-tolerant $k$-median problem and give the \\emph{first} constant factor approximation algorithm for it. In the fault-tolerant generalization of classical $k$-median problem, each client $j$ needs to be assigned to at least $r_j \\ge 1$ distinct open facilities. The service cost of $j$ is the sum of its distances to the $r_j$ facilities, and the $k$-median constraint restricts the number of open facilities to at most $k$. Previously, a constant factor was known only for the special case when all $r_j$s are the same, and a logarithmic approximation ratio for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2808","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":"1307.2808","created_at":"2026-05-18T03:01:13.661005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2808v1","created_at":"2026-05-18T03:01:13.661005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2808","created_at":"2026-05-18T03:01:13.661005+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVJHVSHSRWQ7","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVJHVSHSRWQ7QTBW","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVJHVSHS","created_at":"2026-05-18T12:28:02.375192+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/UVJHVSHSRWQ7QTBWQYPORU6SMP","json":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP.json","graph_json":"https://pith.science/api/pith-number/UVJHVSHSRWQ7QTBWQYPORU6SMP/graph.json","events_json":"https://pith.science/api/pith-number/UVJHVSHSRWQ7QTBWQYPORU6SMP/events.json","paper":"https://pith.science/paper/UVJHVSHS"},"agent_actions":{"view_html":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP","download_json":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP.json","view_paper":"https://pith.science/paper/UVJHVSHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2808&json=true","fetch_graph":"https://pith.science/api/pith-number/UVJHVSHSRWQ7QTBWQYPORU6SMP/graph.json","fetch_events":"https://pith.science/api/pith-number/UVJHVSHSRWQ7QTBWQYPORU6SMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/action/storage_attestation","attest_author":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/action/author_attestation","sign_citation":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/action/citation_signature","submit_replication":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/action/replication_record"}},"created_at":"2026-05-18T03:01:13.661005+00:00","updated_at":"2026-05-18T03:01:13.661005+00:00"}