{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XQRRDHDOFMH5BXE7KWZVRLDW5N","short_pith_number":"pith:XQRRDHDO","schema_version":"1.0","canonical_sha256":"bc23119c6e2b0fd0dc9f55b358ac76eb4e3cbe08b1c271c6d6e3c39ab53184b4","source":{"kind":"arxiv","id":"1809.00942","version":2},"attestation_state":"computed","paper":{"title":"Relaxed Voronoi: a Simple Framework for Terminal-Clustering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Ohad Trabelsi, Robert Krauthgamer","submitted_at":"2018-09-04T13:29:28Z","abstract_excerpt":"We reprove three known algorithmic bounds for terminal-clustering problems, using a single framework that leads to simpler proofs. In this genre of problems, the input is a metric space $(X,d)$ (possibly arising from a graph) and a subset of terminals $K\\subset X$, and the goal is to partition the points $X$ such that each part, called a cluster, contains exactly one terminal (possibly with connectivity requirements) so as to minimize some objective. The three bounds we reprove are for Steiner Point Removal on trees [Gupta, SODA 2001], for Metric $0$-Extension in bounded doubling dimension [Le"},"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":"1809.00942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-04T13:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"5547b81dbb5f95decae20b7f3cbb0c891f0af3415a83148cc6c84c38b2bff8f8","abstract_canon_sha256":"279c5a4ff6e16fdbbbe509ef3a2903ca3cf8355ea5d520919e5e3ce6d8319ef4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:28.498073Z","signature_b64":"BdiOqOMXMnpFvXhdnXfY66XA9lhvPlnbB4acEjrHqPw1gC7oR3R+8QgIC+YOkhZnG0S6Cuew2XSUhiDTOYM/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc23119c6e2b0fd0dc9f55b358ac76eb4e3cbe08b1c271c6d6e3c39ab53184b4","last_reissued_at":"2026-05-18T00:01:28.497672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:28.497672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Voronoi: a Simple Framework for Terminal-Clustering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Ohad Trabelsi, Robert Krauthgamer","submitted_at":"2018-09-04T13:29:28Z","abstract_excerpt":"We reprove three known algorithmic bounds for terminal-clustering problems, using a single framework that leads to simpler proofs. In this genre of problems, the input is a metric space $(X,d)$ (possibly arising from a graph) and a subset of terminals $K\\subset X$, and the goal is to partition the points $X$ such that each part, called a cluster, contains exactly one terminal (possibly with connectivity requirements) so as to minimize some objective. The three bounds we reprove are for Steiner Point Removal on trees [Gupta, SODA 2001], for Metric $0$-Extension in bounded doubling dimension [Le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00942","kind":"arxiv","version":2},"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":"1809.00942","created_at":"2026-05-18T00:01:28.497730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00942v2","created_at":"2026-05-18T00:01:28.497730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00942","created_at":"2026-05-18T00:01:28.497730+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQRRDHDOFMH5","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQRRDHDOFMH5BXE7","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQRRDHDO","created_at":"2026-05-18T12:33:01.666342+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/XQRRDHDOFMH5BXE7KWZVRLDW5N","json":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N.json","graph_json":"https://pith.science/api/pith-number/XQRRDHDOFMH5BXE7KWZVRLDW5N/graph.json","events_json":"https://pith.science/api/pith-number/XQRRDHDOFMH5BXE7KWZVRLDW5N/events.json","paper":"https://pith.science/paper/XQRRDHDO"},"agent_actions":{"view_html":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N","download_json":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N.json","view_paper":"https://pith.science/paper/XQRRDHDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00942&json=true","fetch_graph":"https://pith.science/api/pith-number/XQRRDHDOFMH5BXE7KWZVRLDW5N/graph.json","fetch_events":"https://pith.science/api/pith-number/XQRRDHDOFMH5BXE7KWZVRLDW5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/action/storage_attestation","attest_author":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/action/author_attestation","sign_citation":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/action/citation_signature","submit_replication":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/action/replication_record"}},"created_at":"2026-05-18T00:01:28.497730+00:00","updated_at":"2026-05-18T00:01:28.497730+00:00"}