{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XQRRDHDOFMH5BXE7KWZVRLDW5N","short_pith_number":"pith:XQRRDHDO","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"},"canonical_sha256":"bc23119c6e2b0fd0dc9f55b358ac76eb4e3cbe08b1c271c6d6e3c39ab53184b4","source":{"kind":"arxiv","id":"1809.00942","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00942","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00942v2","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00942","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"pith_short_12","alias_value":"XQRRDHDOFMH5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XQRRDHDOFMH5BXE7","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XQRRDHDO","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XQRRDHDOFMH5BXE7KWZVRLDW5N","target":"record","payload":{"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"},"canonical_sha256":"bc23119c6e2b0fd0dc9f55b358ac76eb4e3cbe08b1c271c6d6e3c39ab53184b4","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"},"source_kind":"arxiv","source_id":"1809.00942","source_version":2,"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-18T00:01:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjgSefER7j+3VQ85MADDah+/R68TVicxpEYmd/ZS28MwJ/HViThCATBTxbt9c6b2DWBm4ZlH8TTnDKiSWN/QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:14:07.027280Z"},"content_sha256":"0ebb51abe6664a2f400ff312a987f9043a1c495fe83d28de111abd6e1dae0e37","schema_version":"1.0","event_id":"sha256:0ebb51abe6664a2f400ff312a987f9043a1c495fe83d28de111abd6e1dae0e37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XQRRDHDOFMH5BXE7KWZVRLDW5N","target":"graph","payload":{"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"},"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-18T00:01:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aa6UXnASKv+5uI6Xq461gEE+0CLbEWI8o507OxODaRraj9vo1Qwo7LwyHjbzW9kuAIij4Velyzwnxqtf0YbaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:14:07.027635Z"},"content_sha256":"237b838f5210c75d365e9b27675bf8f0aa508f138dce40cd3d551ccc9a09af69","schema_version":"1.0","event_id":"sha256:237b838f5210c75d365e9b27675bf8f0aa508f138dce40cd3d551ccc9a09af69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/bundle.json","state_url":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/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-01T21:14:07Z","links":{"resolver":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N","bundle":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/bundle.json","state":"https://pith.science/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQRRDHDOFMH5BXE7KWZVRLDW5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XQRRDHDOFMH5BXE7KWZVRLDW5N","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":"279c5a4ff6e16fdbbbe509ef3a2903ca3cf8355ea5d520919e5e3ce6d8319ef4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-04T13:29:28Z","title_canon_sha256":"5547b81dbb5f95decae20b7f3cbb0c891f0af3415a83148cc6c84c38b2bff8f8"},"schema_version":"1.0","source":{"id":"1809.00942","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00942","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00942v2","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00942","created_at":"2026-05-18T00:01:28Z"},{"alias_kind":"pith_short_12","alias_value":"XQRRDHDOFMH5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XQRRDHDOFMH5BXE7","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XQRRDHDO","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:237b838f5210c75d365e9b27675bf8f0aa508f138dce40cd3d551ccc9a09af69","target":"graph","created_at":"2026-05-18T00:01:28Z","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 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","authors_text":"Arnold Filtser, Ohad Trabelsi, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-04T13:29:28Z","title":"Relaxed Voronoi: a Simple Framework for Terminal-Clustering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00942","kind":"arxiv","version":2},"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:0ebb51abe6664a2f400ff312a987f9043a1c495fe83d28de111abd6e1dae0e37","target":"record","created_at":"2026-05-18T00:01:28Z","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":"279c5a4ff6e16fdbbbe509ef3a2903ca3cf8355ea5d520919e5e3ce6d8319ef4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-04T13:29:28Z","title_canon_sha256":"5547b81dbb5f95decae20b7f3cbb0c891f0af3415a83148cc6c84c38b2bff8f8"},"schema_version":"1.0","source":{"id":"1809.00942","kind":"arxiv","version":2}},"canonical_sha256":"bc23119c6e2b0fd0dc9f55b358ac76eb4e3cbe08b1c271c6d6e3c39ab53184b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc23119c6e2b0fd0dc9f55b358ac76eb4e3cbe08b1c271c6d6e3c39ab53184b4","first_computed_at":"2026-05-18T00:01:28.497672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:28.497672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BdiOqOMXMnpFvXhdnXfY66XA9lhvPlnbB4acEjrHqPw1gC7oR3R+8QgIC+YOkhZnG0S6Cuew2XSUhiDTOYM/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:28.498073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00942","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ebb51abe6664a2f400ff312a987f9043a1c495fe83d28de111abd6e1dae0e37","sha256:237b838f5210c75d365e9b27675bf8f0aa508f138dce40cd3d551ccc9a09af69"],"state_sha256":"fc5387c23c9684a593c61f87112507a6bbd7e0b84f7be4b5c80128323388ba18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2g+u7/MRbF8Bcr/RfM5v6kQyVsfwX1g50seRSvXSgh6CVRj757Nj0KECs4ff6C2JT4sbBMIKrxdyh15hAH/qCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:14:07.029515Z","bundle_sha256":"5f7362877334b1ae640b33bf706718a47a78d20609ef353c1416b497f79f872f"}}