{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OTIN6KZQNNCWYAZJW66QO32EOI","short_pith_number":"pith:OTIN6KZQ","canonical_record":{"source":{"id":"1309.4602","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-18T10:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"9dd064fe777fb194789af7304cb22e0cf25e60b67e8c42ce9e0674104bfa1f35","abstract_canon_sha256":"e6608cf3b31d87d8f47cd53d9c7cb83de788dd3fd7a16d6a52ef179e49fc71a0"},"schema_version":"1.0"},"canonical_sha256":"74d0df2b306b456c0329b7bd076f447203ddda060ff87f5799015f8bf6a022d6","source":{"kind":"arxiv","id":"1309.4602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4602","created_at":"2026-05-18T03:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4602v1","created_at":"2026-05-18T03:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4602","created_at":"2026-05-18T03:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"OTIN6KZQNNCW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OTIN6KZQNNCWYAZJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OTIN6KZQ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OTIN6KZQNNCWYAZJW66QO32EOI","target":"record","payload":{"canonical_record":{"source":{"id":"1309.4602","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-18T10:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"9dd064fe777fb194789af7304cb22e0cf25e60b67e8c42ce9e0674104bfa1f35","abstract_canon_sha256":"e6608cf3b31d87d8f47cd53d9c7cb83de788dd3fd7a16d6a52ef179e49fc71a0"},"schema_version":"1.0"},"canonical_sha256":"74d0df2b306b456c0329b7bd076f447203ddda060ff87f5799015f8bf6a022d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:58.884699Z","signature_b64":"qpmpn9hTTUGk3/9Pvp3dLSA/SVi86SXndsMftR3+qT1sD1Sku+BEeM5rLadIkNi3zu2abkIFM6SosmuxlmyOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74d0df2b306b456c0329b7bd076f447203ddda060ff87f5799015f8bf6a022d6","last_reissued_at":"2026-05-18T03:12:58.884076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:58.884076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.4602","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:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpsvMyMn25WkGSb7EzG6eHXfKXAhaqMpcL4psnx/nueVyQAfFuqlwEzAbBwIgBy5/n9s3AP7xyxfkAcMjmJhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:04:05.568142Z"},"content_sha256":"fb816dbc8bda3a1dbb7ac8a9aabc4b4577f65eee1daee960b4fe22ea3ba6685b","schema_version":"1.0","event_id":"sha256:fb816dbc8bda3a1dbb7ac8a9aabc4b4577f65eee1daee960b4fe22ea3ba6685b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OTIN6KZQNNCWYAZJW66QO32EOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Approximability Results for the Robust k-Median Problem","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Neumann, Kurt Mehlhorn, Parinya Chalermsook, Sayan Bhattacharya","submitted_at":"2013-09-18T10:11:31Z","abstract_excerpt":"We consider a robust variant of the classical $k$-median problem, introduced by Anthony et al. \\cite{AnthonyGGN10}. In the \\emph{Robust $k$-Median problem}, we are given an $n$-vertex metric space $(V,d)$ and $m$ client sets $\\set{S_i \\subseteq V}_{i=1}^m$. The objective is to open a set $F \\subseteq V$ of $k$ facilities such that the worst case connection cost over all client sets is minimized; in other words, minimize $\\max_{i} \\sum_{v \\in S_i} d(F,v)$. Anthony et al.\\ showed an $O(\\log m)$ approximation algorithm for any metric and APX-hardness even in the case of uniform metric. In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4602","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:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1j/DM3fNI5z7tAvPIXqfMnO+RGUQFjdTlopQAxA/r7DodX1911+ANZkDN9z8O3w8gk9uOfYby120AdDDXJY1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:04:05.568503Z"},"content_sha256":"b6d7df6275989b81a662ca67ea269501809cdc3dd6683441dc4bb000aa91c7d4","schema_version":"1.0","event_id":"sha256:b6d7df6275989b81a662ca67ea269501809cdc3dd6683441dc4bb000aa91c7d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTIN6KZQNNCWYAZJW66QO32EOI/bundle.json","state_url":"https://pith.science/pith/OTIN6KZQNNCWYAZJW66QO32EOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTIN6KZQNNCWYAZJW66QO32EOI/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-06-02T14:04:05Z","links":{"resolver":"https://pith.science/pith/OTIN6KZQNNCWYAZJW66QO32EOI","bundle":"https://pith.science/pith/OTIN6KZQNNCWYAZJW66QO32EOI/bundle.json","state":"https://pith.science/pith/OTIN6KZQNNCWYAZJW66QO32EOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTIN6KZQNNCWYAZJW66QO32EOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OTIN6KZQNNCWYAZJW66QO32EOI","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":"e6608cf3b31d87d8f47cd53d9c7cb83de788dd3fd7a16d6a52ef179e49fc71a0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-18T10:11:31Z","title_canon_sha256":"9dd064fe777fb194789af7304cb22e0cf25e60b67e8c42ce9e0674104bfa1f35"},"schema_version":"1.0","source":{"id":"1309.4602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4602","created_at":"2026-05-18T03:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4602v1","created_at":"2026-05-18T03:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4602","created_at":"2026-05-18T03:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"OTIN6KZQNNCW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OTIN6KZQNNCWYAZJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OTIN6KZQ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b6d7df6275989b81a662ca67ea269501809cdc3dd6683441dc4bb000aa91c7d4","target":"graph","created_at":"2026-05-18T03:12:58Z","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":"We consider a robust variant of the classical $k$-median problem, introduced by Anthony et al. \\cite{AnthonyGGN10}. In the \\emph{Robust $k$-Median problem}, we are given an $n$-vertex metric space $(V,d)$ and $m$ client sets $\\set{S_i \\subseteq V}_{i=1}^m$. The objective is to open a set $F \\subseteq V$ of $k$ facilities such that the worst case connection cost over all client sets is minimized; in other words, minimize $\\max_{i} \\sum_{v \\in S_i} d(F,v)$. Anthony et al.\\ showed an $O(\\log m)$ approximation algorithm for any metric and APX-hardness even in the case of uniform metric. In this pa","authors_text":"Adrian Neumann, Kurt Mehlhorn, Parinya Chalermsook, Sayan Bhattacharya","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-18T10:11:31Z","title":"New Approximability Results for the Robust k-Median Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4602","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:fb816dbc8bda3a1dbb7ac8a9aabc4b4577f65eee1daee960b4fe22ea3ba6685b","target":"record","created_at":"2026-05-18T03:12:58Z","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":"e6608cf3b31d87d8f47cd53d9c7cb83de788dd3fd7a16d6a52ef179e49fc71a0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-09-18T10:11:31Z","title_canon_sha256":"9dd064fe777fb194789af7304cb22e0cf25e60b67e8c42ce9e0674104bfa1f35"},"schema_version":"1.0","source":{"id":"1309.4602","kind":"arxiv","version":1}},"canonical_sha256":"74d0df2b306b456c0329b7bd076f447203ddda060ff87f5799015f8bf6a022d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74d0df2b306b456c0329b7bd076f447203ddda060ff87f5799015f8bf6a022d6","first_computed_at":"2026-05-18T03:12:58.884076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:58.884076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qpmpn9hTTUGk3/9Pvp3dLSA/SVi86SXndsMftR3+qT1sD1Sku+BEeM5rLadIkNi3zu2abkIFM6SosmuxlmyOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:58.884699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb816dbc8bda3a1dbb7ac8a9aabc4b4577f65eee1daee960b4fe22ea3ba6685b","sha256:b6d7df6275989b81a662ca67ea269501809cdc3dd6683441dc4bb000aa91c7d4"],"state_sha256":"b03d59b5aff67c8b03d2182f1591714733d5ef54384831e262c4500dee684481"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxQyTbE1RQ7Khor2S+EkTsCytlVCYxPrF0RAMOzGVxC8bdkNlhjSrgeJbcVhUbtcZyDL7Oi/JOlvvUnSAeVPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:04:05.570390Z","bundle_sha256":"f3065feef5ee301476d131a1f200d1dd7fa36f9ea11b8b9fbe65050d42e55536"}}