{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RF52JGSBEXCR3XXLXZ5MIYBZVL","short_pith_number":"pith:RF52JGSB","schema_version":"1.0","canonical_sha256":"897ba49a4125c51ddeebbe7ac46039aad3bfe9d401343a27e86350fd83e6c9eb","source":{"kind":"arxiv","id":"1307.2520","version":1},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.2520","created_at":"2026-05-18T03:18:52.303845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2520v1","created_at":"2026-05-18T03:18:52.303845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2520","created_at":"2026-05-18T03:18:52.303845+00:00"},{"alias_kind":"pith_short_12","alias_value":"RF52JGSBEXCR","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RF52JGSBEXCR3XXL","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RF52JGSB","created_at":"2026-05-18T12:27:57.521954+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/RF52JGSBEXCR3XXLXZ5MIYBZVL","json":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL.json","graph_json":"https://pith.science/api/pith-number/RF52JGSBEXCR3XXLXZ5MIYBZVL/graph.json","events_json":"https://pith.science/api/pith-number/RF52JGSBEXCR3XXLXZ5MIYBZVL/events.json","paper":"https://pith.science/paper/RF52JGSB"},"agent_actions":{"view_html":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL","download_json":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL.json","view_paper":"https://pith.science/paper/RF52JGSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2520&json=true","fetch_graph":"https://pith.science/api/pith-number/RF52JGSBEXCR3XXLXZ5MIYBZVL/graph.json","fetch_events":"https://pith.science/api/pith-number/RF52JGSBEXCR3XXLXZ5MIYBZVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/action/storage_attestation","attest_author":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/action/author_attestation","sign_citation":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/action/citation_signature","submit_replication":"https://pith.science/pith/RF52JGSBEXCR3XXLXZ5MIYBZVL/action/replication_record"}},"created_at":"2026-05-18T03:18:52.303845+00:00","updated_at":"2026-05-18T03:18:52.303845+00:00"}