{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RF52JGSBEXCR3XXLXZ5MIYBZVL","short_pith_number":"pith:RF52JGSB","canonical_record":{"source":{"id":"1307.2520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T17:24:18Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ca34ad6f2680064c37df61362a7bc5f46f947f52321c24cadaabfbc59f2512d2","abstract_canon_sha256":"644e5469756de6e45dacf789edb265ee333d860c2dfeab99a4b278779e042e08"},"schema_version":"1.0"},"canonical_sha256":"897ba49a4125c51ddeebbe7ac46039aad3bfe9d401343a27e86350fd83e6c9eb","source":{"kind":"arxiv","id":"1307.2520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2520","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2520v1","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2520","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"RF52JGSBEXCR","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RF52JGSBEXCR3XXL","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RF52JGSB","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RF52JGSBEXCR3XXLXZ5MIYBZVL","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T17:24:18Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ca34ad6f2680064c37df61362a7bc5f46f947f52321c24cadaabfbc59f2512d2","abstract_canon_sha256":"644e5469756de6e45dacf789edb265ee333d860c2dfeab99a4b278779e042e08"},"schema_version":"1.0"},"canonical_sha256":"897ba49a4125c51ddeebbe7ac46039aad3bfe9d401343a27e86350fd83e6c9eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:52.304464Z","signature_b64":"a2zWzU7I+1bWrlb22lh/GSyhscWan/lM0jKMtL5TchGTJZVXQpijWInScp2QaFELVcBpQCHg5WPBVzHD7JZ0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897ba49a4125c51ddeebbe7ac46039aad3bfe9d401343a27e86350fd83e6c9eb","last_reissued_at":"2026-05-18T03:18:52.303750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:52.303750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2520","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:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14Q3bXHVOg7onHxgyXUcO7SpLpq3jF+vq7sZS1axQF8ruOKrqn7j48ozfQc9H7bbN8h3UI0gRwJnggDoxTKDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:29:29.108050Z"},"content_sha256":"7c2719aae4d19c22ec116cc6e4b1830da5c69f9fd54d4888c14f8b9d77b7c91d","schema_version":"1.0","event_id":"sha256:7c2719aae4d19c22ec116cc6e4b1830da5c69f9fd54d4888c14f8b9d77b7c91d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RF52JGSBEXCR3XXLXZ5MIYBZVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault Tolerant Clustering Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Benjamin Raichel, Nirman Kumar","submitted_at":"2013-07-09T17:24:18Z","abstract_excerpt":"In discrete k-center and k-median clustering, we are given a set of points P in a metric space M, and the task is to output a set C \\subseteq ? P, |C| = k, such that the cost of clustering P using C is as small as possible. For k-center, the cost is the furthest a point has to travel to its nearest center, whereas for k-median, the cost is the sum of all point to nearest center distances. In the fault-tolerant versions of these problems, we are given an additional parameter 1 ?\\leq \\ell \\leq ? k, such that when computing the cost of clustering, points are assigned to their \\ell-th nearest-neig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2520","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:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0fRusIK/B1xqZOcelsn82brae69DlWgIvR689kYALCzoM0pbpXlOj5bI95nkRngvaSiSW4kcoG3ThGLCSSzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:29:29.108423Z"},"content_sha256":"25f73163ad6560bf811d305471783767d6bece1333a2dfaa249b5ae991b70483","schema_version":"1.0","event_id":"sha256:25f73163ad6560bf811d305471783767d6bece1333a2dfaa249b5ae991b70483"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/bundle.json","state_url":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/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-05T08:29:29Z","links":{"resolver":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL","bundle":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/bundle.json","state":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RF52JGSBEXCR3XXLXZ5MIYBZVL","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":"644e5469756de6e45dacf789edb265ee333d860c2dfeab99a4b278779e042e08","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T17:24:18Z","title_canon_sha256":"ca34ad6f2680064c37df61362a7bc5f46f947f52321c24cadaabfbc59f2512d2"},"schema_version":"1.0","source":{"id":"1307.2520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2520","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2520v1","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2520","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"RF52JGSBEXCR","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RF52JGSBEXCR3XXL","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RF52JGSB","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:25f73163ad6560bf811d305471783767d6bece1333a2dfaa249b5ae991b70483","target":"graph","created_at":"2026-05-18T03:18:52Z","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 discrete k-center and k-median clustering, we are given a set of points P in a metric space M, and the task is to output a set C \\subseteq ? P, |C| = k, such that the cost of clustering P using C is as small as possible. For k-center, the cost is the furthest a point has to travel to its nearest center, whereas for k-median, the cost is the sum of all point to nearest center distances. In the fault-tolerant versions of these problems, we are given an additional parameter 1 ?\\leq \\ell \\leq ? k, such that when computing the cost of clustering, points are assigned to their \\ell-th nearest-neig","authors_text":"Benjamin Raichel, Nirman Kumar","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T17:24:18Z","title":"Fault Tolerant Clustering Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2520","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:7c2719aae4d19c22ec116cc6e4b1830da5c69f9fd54d4888c14f8b9d77b7c91d","target":"record","created_at":"2026-05-18T03:18:52Z","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":"644e5469756de6e45dacf789edb265ee333d860c2dfeab99a4b278779e042e08","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T17:24:18Z","title_canon_sha256":"ca34ad6f2680064c37df61362a7bc5f46f947f52321c24cadaabfbc59f2512d2"},"schema_version":"1.0","source":{"id":"1307.2520","kind":"arxiv","version":1}},"canonical_sha256":"897ba49a4125c51ddeebbe7ac46039aad3bfe9d401343a27e86350fd83e6c9eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"897ba49a4125c51ddeebbe7ac46039aad3bfe9d401343a27e86350fd83e6c9eb","first_computed_at":"2026-05-18T03:18:52.303750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:52.303750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2zWzU7I+1bWrlb22lh/GSyhscWan/lM0jKMtL5TchGTJZVXQpijWInScp2QaFELVcBpQCHg5WPBVzHD7JZ0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:52.304464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c2719aae4d19c22ec116cc6e4b1830da5c69f9fd54d4888c14f8b9d77b7c91d","sha256:25f73163ad6560bf811d305471783767d6bece1333a2dfaa249b5ae991b70483"],"state_sha256":"0538b0ea7785a02e95c79532be9117e655c6bc2c21770bc8308fbfc654beacdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01ZTm601yhfTmlu7oFupX0J3d+Es3tUaFVRiHLQ/bt4TEdpvOp94A6Ri+AwI7TqeZdYYd8b9z6TR5fDT5hQzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:29:29.110437Z","bundle_sha256":"b42037f135e2f96524c69369f94acff6cc78338034173afe808461cd8b33a95f"}}