{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RK2ZB6FSGYNWCX4QR44QNKQHLK","short_pith_number":"pith:RK2ZB6FS","canonical_record":{"source":{"id":"2607.07615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T16:30:33Z","cross_cats_sorted":[],"title_canon_sha256":"9d5d5b8cf2e344c5584bff7ebde99b2d855068a9fe86187235d602dff63c1622","abstract_canon_sha256":"7eefa6046c0771a59c0249319f91bd50161db6aa671f5ffc5683ef777f5e03f5"},"schema_version":"1.0"},"canonical_sha256":"8ab590f8b2361b615f908f3906aa075aa180fa53e8a18c37977eac70f158119d","source":{"kind":"arxiv","id":"2607.07615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07615","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07615v1","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07615","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"pith_short_12","alias_value":"RK2ZB6FSGYNW","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"pith_short_16","alias_value":"RK2ZB6FSGYNWCX4Q","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"pith_short_8","alias_value":"RK2ZB6FS","created_at":"2026-07-09T01:20:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RK2ZB6FSGYNWCX4QR44QNKQHLK","target":"record","payload":{"canonical_record":{"source":{"id":"2607.07615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T16:30:33Z","cross_cats_sorted":[],"title_canon_sha256":"9d5d5b8cf2e344c5584bff7ebde99b2d855068a9fe86187235d602dff63c1622","abstract_canon_sha256":"7eefa6046c0771a59c0249319f91bd50161db6aa671f5ffc5683ef777f5e03f5"},"schema_version":"1.0"},"canonical_sha256":"8ab590f8b2361b615f908f3906aa075aa180fa53e8a18c37977eac70f158119d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:36.853628Z","signature_b64":"lJx7hoCw+Nj74bRA+NN0bE7S25hrxZGQl6aNEOCoFYuXA2YSwjY1RjA1v51l/6+FyDokiewuUsB6eyUaXH/nAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ab590f8b2361b615f908f3906aa075aa180fa53e8a18c37977eac70f158119d","last_reissued_at":"2026-07-09T01:20:36.853109Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:36.853109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.07615","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-07-09T01:20:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lh+R2KGF+60vqRAD7unfArWVL/wXjvDsgxKGGremLIfRH5Zn3xtR2YRwYrH/a5IqRKa84meFtU4yvKAAaBS+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:12:56.139114Z"},"content_sha256":"a34fd8fe8d9b5e54eb81116b3ca5fd76f41a607daa3b68ddb53b2079ab721938","schema_version":"1.0","event_id":"sha256:a34fd8fe8d9b5e54eb81116b3ca5fd76f41a607daa3b68ddb53b2079ab721938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RK2ZB6FSGYNWCX4QR44QNKQHLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Randomized and Deterministic k-Clustering on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonis Skarlatos, Rajath Rao K. N., Sebastian Forster, Yasamin Nazari","submitted_at":"2026-07-08T16:30:33Z","abstract_excerpt":"In this paper, we study the $(k,z)$-clustering and $k$-center problems on graphs, where $(k,z)$-clustering generalizes the $k$-median ($z=1$) and $k$-means ($z=2$) problems. We obtain the following main results. Our first contribution is the first deterministic algorithm for $k$-center on graphs that achieves a $(2+\\varepsilon)$-approximation in $\\tilde{O}(m)$ time. This affirmatively resolves an open problem raised by Abboud, Cohen-Addad, Lee, and Manurangsi [SOSA 2023]. Our techniques also extend to the $k$-center with outliers problem, where up to $t$ points may be discarded. Our second con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07615","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07615/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-09T01:20:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zvC0N4IuSnVexHbGMxDrg4zSP9lElF6exDuatgCXHwMUOI41errk68j1PU0pHehD7bTWrxTNjCwmqxlHZFdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:12:56.140071Z"},"content_sha256":"af2d31f0862b652844be9b7fdf83ae12bee9b4b0c6834bf3c592de8ed5c820e7","schema_version":"1.0","event_id":"sha256:af2d31f0862b652844be9b7fdf83ae12bee9b4b0c6834bf3c592de8ed5c820e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/bundle.json","state_url":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/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-08-17T21:12:56Z","links":{"resolver":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK","bundle":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/bundle.json","state":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RK2ZB6FSGYNWCX4QR44QNKQHLK","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":"7eefa6046c0771a59c0249319f91bd50161db6aa671f5ffc5683ef777f5e03f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T16:30:33Z","title_canon_sha256":"9d5d5b8cf2e344c5584bff7ebde99b2d855068a9fe86187235d602dff63c1622"},"schema_version":"1.0","source":{"id":"2607.07615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07615","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07615v1","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07615","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"pith_short_12","alias_value":"RK2ZB6FSGYNW","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"pith_short_16","alias_value":"RK2ZB6FSGYNWCX4Q","created_at":"2026-07-09T01:20:36Z"},{"alias_kind":"pith_short_8","alias_value":"RK2ZB6FS","created_at":"2026-07-09T01:20:36Z"}],"graph_snapshots":[{"event_id":"sha256:af2d31f0862b652844be9b7fdf83ae12bee9b4b0c6834bf3c592de8ed5c820e7","target":"graph","created_at":"2026-07-09T01:20:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.07615/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the $(k,z)$-clustering and $k$-center problems on graphs, where $(k,z)$-clustering generalizes the $k$-median ($z=1$) and $k$-means ($z=2$) problems. We obtain the following main results. Our first contribution is the first deterministic algorithm for $k$-center on graphs that achieves a $(2+\\varepsilon)$-approximation in $\\tilde{O}(m)$ time. This affirmatively resolves an open problem raised by Abboud, Cohen-Addad, Lee, and Manurangsi [SOSA 2023]. Our techniques also extend to the $k$-center with outliers problem, where up to $t$ points may be discarded. Our second con","authors_text":"Antonis Skarlatos, Rajath Rao K. N., Sebastian Forster, Yasamin Nazari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07615","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:a34fd8fe8d9b5e54eb81116b3ca5fd76f41a607daa3b68ddb53b2079ab721938","target":"record","created_at":"2026-07-09T01:20:36Z","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":"7eefa6046c0771a59c0249319f91bd50161db6aa671f5ffc5683ef777f5e03f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T16:30:33Z","title_canon_sha256":"9d5d5b8cf2e344c5584bff7ebde99b2d855068a9fe86187235d602dff63c1622"},"schema_version":"1.0","source":{"id":"2607.07615","kind":"arxiv","version":1}},"canonical_sha256":"8ab590f8b2361b615f908f3906aa075aa180fa53e8a18c37977eac70f158119d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ab590f8b2361b615f908f3906aa075aa180fa53e8a18c37977eac70f158119d","first_computed_at":"2026-07-09T01:20:36.853109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:36.853109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJx7hoCw+Nj74bRA+NN0bE7S25hrxZGQl6aNEOCoFYuXA2YSwjY1RjA1v51l/6+FyDokiewuUsB6eyUaXH/nAw==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:36.853628Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a34fd8fe8d9b5e54eb81116b3ca5fd76f41a607daa3b68ddb53b2079ab721938","sha256:af2d31f0862b652844be9b7fdf83ae12bee9b4b0c6834bf3c592de8ed5c820e7"],"state_sha256":"e2b93964117ab47c0f31a13b7d664e250ce76b22cb584abd666e3fb1ba3c3520"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AljKVjiitzmgJjGyinmMToplq8CmRu0kRT3O50gUG/Kd3xsffESqxiwCmk2lK35Yg2BBz2vTljBsuGbh+zzOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T21:12:56.358177Z","bundle_sha256":"1f126cd61f1dbde0c25f52d96e80b578aadd87564fb683532c3f3a6b8a2ae8c2"}}