{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UVJHVSHSRWQ7QTBWQYPORU6SMP","short_pith_number":"pith:UVJHVSHS","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"},"canonical_sha256":"a5527ac8f28da1f84c36861ee8d3d263fdb42e17b01632f6f9a1bd44490524e3","source":{"kind":"arxiv","id":"1307.2808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2808","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2808v1","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2808","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"UVJHVSHSRWQ7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UVJHVSHSRWQ7QTBW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UVJHVSHS","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UVJHVSHSRWQ7QTBWQYPORU6SMP","target":"record","payload":{"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"},"canonical_sha256":"a5527ac8f28da1f84c36861ee8d3d263fdb42e17b01632f6f9a1bd44490524e3","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"},"source_kind":"arxiv","source_id":"1307.2808","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-18T03:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9dUDSkkwizbIgts5QIHKYOvoJf/byspoH7PaI+cNAhti+ohDcgS6LTGq+F+5hevqB3H8CKbpiaiVHERMIfACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:32:07.258484Z"},"content_sha256":"bc57274e012fde5c69e417340e110721f2d94f1bf96af5649697667b8e141501","schema_version":"1.0","event_id":"sha256:bc57274e012fde5c69e417340e110721f2d94f1bf96af5649697667b8e141501"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UVJHVSHSRWQ7QTBWQYPORU6SMP","target":"graph","payload":{"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"},"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-18T03:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2/4gKyi4xsep1JRTIM/iezIyr+hVjxPOAgj0emDJxKB0Voh7b5gxsthqA5Dd43KhsmH/mOlBUEmxNkhzbv0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:32:07.259085Z"},"content_sha256":"00b4f3d8861be575f339777a6912feab4f150533888218e8eed1e6800d220534","schema_version":"1.0","event_id":"sha256:00b4f3d8861be575f339777a6912feab4f150533888218e8eed1e6800d220534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/bundle.json","state_url":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/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-31T22:32:07Z","links":{"resolver":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP","bundle":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/bundle.json","state":"https://pith.science/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVJHVSHSRWQ7QTBWQYPORU6SMP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UVJHVSHSRWQ7QTBWQYPORU6SMP","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":"973a9c7489079c319c49408ee7d99445699341d99b94eae434abfbac6b7ce070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-10T14:41:58Z","title_canon_sha256":"89f4539c76c160b16dcbd0e2486448f7af246eadc4c455400060c3b9f864e21d"},"schema_version":"1.0","source":{"id":"1307.2808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2808","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2808v1","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2808","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"UVJHVSHSRWQ7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UVJHVSHSRWQ7QTBW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UVJHVSHS","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:00b4f3d8861be575f339777a6912feab4f150533888218e8eed1e6800d220534","target":"graph","created_at":"2026-05-18T03:01:13Z","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 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","authors_text":"Barna Saha, Jian Li, MohammadTaghi Hajiaghayi, Shi Li, Wei Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-10T14:41:58Z","title":"A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2808","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:bc57274e012fde5c69e417340e110721f2d94f1bf96af5649697667b8e141501","target":"record","created_at":"2026-05-18T03:01:13Z","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":"973a9c7489079c319c49408ee7d99445699341d99b94eae434abfbac6b7ce070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-10T14:41:58Z","title_canon_sha256":"89f4539c76c160b16dcbd0e2486448f7af246eadc4c455400060c3b9f864e21d"},"schema_version":"1.0","source":{"id":"1307.2808","kind":"arxiv","version":1}},"canonical_sha256":"a5527ac8f28da1f84c36861ee8d3d263fdb42e17b01632f6f9a1bd44490524e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5527ac8f28da1f84c36861ee8d3d263fdb42e17b01632f6f9a1bd44490524e3","first_computed_at":"2026-05-18T03:01:13.660881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:13.660881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sTvFyMluj3Txn3u4/H6jpM3nwy6ExEOGjvVILcHw5Pg2GN3Q91b5HBVY5hsDrFDi8jS9hoLp33qlyq63WZl2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:13.661598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc57274e012fde5c69e417340e110721f2d94f1bf96af5649697667b8e141501","sha256:00b4f3d8861be575f339777a6912feab4f150533888218e8eed1e6800d220534"],"state_sha256":"416d1582275be30f4447eab9151ec327346c5dae4869eebbb924d3d606e0229b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vpWFChLjocT1w9fhwRE0sXAEIjXAuEG7svNwgl8Icg01FhHBTFagkmw4/+lnS8q8yKQQo+ioJAlRf0bKAlhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:32:07.261913Z","bundle_sha256":"02e26ee7ae532493bfa7d46818c4b61864487dfdb04473782404db65f363ce1a"}}