{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RK2ZB6FSGYNWCX4QR44QNKQHLK","short_pith_number":"pith:RK2ZB6FS","schema_version":"1.0","canonical_sha256":"8ab590f8b2361b615f908f3906aa075aa180fa53e8a18c37977eac70f158119d","source":{"kind":"arxiv","id":"2607.07615","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.07615","created_at":"2026-07-09T01:20:36.853170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07615v1","created_at":"2026-07-09T01:20:36.853170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07615","created_at":"2026-07-09T01:20:36.853170+00:00"},{"alias_kind":"pith_short_12","alias_value":"RK2ZB6FSGYNW","created_at":"2026-07-09T01:20:36.853170+00:00"},{"alias_kind":"pith_short_16","alias_value":"RK2ZB6FSGYNWCX4Q","created_at":"2026-07-09T01:20:36.853170+00:00"},{"alias_kind":"pith_short_8","alias_value":"RK2ZB6FS","created_at":"2026-07-09T01:20:36.853170+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/RK2ZB6FSGYNWCX4QR44QNKQHLK","json":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK.json","graph_json":"https://pith.science/api/pith-number/RK2ZB6FSGYNWCX4QR44QNKQHLK/graph.json","events_json":"https://pith.science/api/pith-number/RK2ZB6FSGYNWCX4QR44QNKQHLK/events.json","paper":"https://pith.science/paper/RK2ZB6FS"},"agent_actions":{"view_html":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK","download_json":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK.json","view_paper":"https://pith.science/paper/RK2ZB6FS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07615&json=true","fetch_graph":"https://pith.science/api/pith-number/RK2ZB6FSGYNWCX4QR44QNKQHLK/graph.json","fetch_events":"https://pith.science/api/pith-number/RK2ZB6FSGYNWCX4QR44QNKQHLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/action/storage_attestation","attest_author":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/action/author_attestation","sign_citation":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/action/citation_signature","submit_replication":"https://pith.science/pith/RK2ZB6FSGYNWCX4QR44QNKQHLK/action/replication_record"}},"created_at":"2026-07-09T01:20:36.853170+00:00","updated_at":"2026-07-09T01:20:36.853170+00:00"}