{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KJZ34VSVKS5ED7PUJ73GFEYY7W","short_pith_number":"pith:KJZ34VSV","schema_version":"1.0","canonical_sha256":"5273be565554ba41fdf44ff6629318fdbd9ed3444c6d9b5688a3bfae1e53ee40","source":{"kind":"arxiv","id":"2606.08713","version":1},"attestation_state":"computed","paper":{"title":"The price of incrementality in k-center clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma","submitted_at":"2026-06-07T16:09:04Z","abstract_excerpt":"The $k$-center problem is one of the best-studied and most intuitive clustering formulations. It asks, given a set of $n$ points in a metric space, for $k$ of the points to be designated as cluster centers, so that the maximum distance of an input point to its nearest center is minimized. Gonzalez's greedy algorithm from 1985 is a simple and efficient way to find a $2$-approximate solution. The algorithm has the attractive feature of \\emph{incrementality}: it outputs the centers one by one, with a guaranteed $2$-approximation for every prefix of the obtained sequence of centers.\n  Incrementali"},"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":"2606.08713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-07T16:09:04Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"04c8562a6dde3e974e85d8daff8c63064dc6babb894e1b4004712495b5dfd52a","abstract_canon_sha256":"2c617f010babf576e2b3e4b31e7bbcf96477838dbb6385d81d1818a373e21ab0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:48.037533Z","signature_b64":"TQFfOqDM+/YwC/hC26qMfNgOxcX7OqRxljvcY99sqG6tS0ITuTh8VH6X+Dgi2Cbz/YWsKCu20vvfGTm2j5qGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5273be565554ba41fdf44ff6629318fdbd9ed3444c6d9b5688a3bfae1e53ee40","last_reissued_at":"2026-06-09T01:05:48.037121Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:48.037121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The price of incrementality in k-center clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma","submitted_at":"2026-06-07T16:09:04Z","abstract_excerpt":"The $k$-center problem is one of the best-studied and most intuitive clustering formulations. It asks, given a set of $n$ points in a metric space, for $k$ of the points to be designated as cluster centers, so that the maximum distance of an input point to its nearest center is minimized. Gonzalez's greedy algorithm from 1985 is a simple and efficient way to find a $2$-approximate solution. The algorithm has the attractive feature of \\emph{incrementality}: it outputs the centers one by one, with a guaranteed $2$-approximation for every prefix of the obtained sequence of centers.\n  Incrementali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08713","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/2606.08713/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":"2606.08713","created_at":"2026-06-09T01:05:48.037188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08713v1","created_at":"2026-06-09T01:05:48.037188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08713","created_at":"2026-06-09T01:05:48.037188+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJZ34VSVKS5E","created_at":"2026-06-09T01:05:48.037188+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJZ34VSVKS5ED7PU","created_at":"2026-06-09T01:05:48.037188+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJZ34VSV","created_at":"2026-06-09T01:05:48.037188+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/KJZ34VSVKS5ED7PUJ73GFEYY7W","json":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W.json","graph_json":"https://pith.science/api/pith-number/KJZ34VSVKS5ED7PUJ73GFEYY7W/graph.json","events_json":"https://pith.science/api/pith-number/KJZ34VSVKS5ED7PUJ73GFEYY7W/events.json","paper":"https://pith.science/paper/KJZ34VSV"},"agent_actions":{"view_html":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W","download_json":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W.json","view_paper":"https://pith.science/paper/KJZ34VSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08713&json=true","fetch_graph":"https://pith.science/api/pith-number/KJZ34VSVKS5ED7PUJ73GFEYY7W/graph.json","fetch_events":"https://pith.science/api/pith-number/KJZ34VSVKS5ED7PUJ73GFEYY7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W/action/storage_attestation","attest_author":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W/action/author_attestation","sign_citation":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W/action/citation_signature","submit_replication":"https://pith.science/pith/KJZ34VSVKS5ED7PUJ73GFEYY7W/action/replication_record"}},"created_at":"2026-06-09T01:05:48.037188+00:00","updated_at":"2026-06-09T01:05:48.037188+00:00"}