{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MK4OGY7HDLDISIG5HBLLYKHLMY","short_pith_number":"pith:MK4OGY7H","schema_version":"1.0","canonical_sha256":"62b8e363e71ac68920dd3856bc28eb660d9c34b2c134d63c08a1dcab7bbc5e7b","source":{"kind":"arxiv","id":"2208.06847","version":1},"attestation_state":"computed","paper":{"title":"Exact Exponential Algorithms for Clustering Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Nidhi Purohit, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2022-08-14T13:04:00Z","abstract_excerpt":"In this paper we initiate a systematic study of exact algorithms for well-known clustering problems, namely $k$-Median and $k$-Means. In $k$-Median, the input consists of a set $X$ of $n$ points belonging to a metric space, and the task is to select a subset $C \\subseteq X$ of $k$ points as centers, such that the sum of the distances of every point to its nearest center is minimized. In $k$-Means, the objective is to minimize the sum of squares of the distances instead. It is easy to design an algorithm running in time $\\max_{k\\leq n} {n \\choose k} n^{O(1)} = O^*(2^n)$ ($O^*(\\cdot)$ notation h"},"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":"2208.06847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-14T13:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"2a7d17d2f0fd10c018083b5f2e0a79e643bd96f15f041e0b63801e085e8e95d4","abstract_canon_sha256":"b3ea6cf3732169eafb2ee200a811e37c807a7cf52888072cf5258fdc240d8b70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:21.428379Z","signature_b64":"O5NL9FFk/Y7WRBRKakdykCRn8oE3GYwDxXd85n98sYdP5vih9dZWb92mfwv/y56rLaNp8tvbhApslaHngXb/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b8e363e71ac68920dd3856bc28eb660d9c34b2c134d63c08a1dcab7bbc5e7b","last_reissued_at":"2026-07-05T04:48:21.427927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:21.427927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Exponential Algorithms for Clustering Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Nidhi Purohit, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2022-08-14T13:04:00Z","abstract_excerpt":"In this paper we initiate a systematic study of exact algorithms for well-known clustering problems, namely $k$-Median and $k$-Means. In $k$-Median, the input consists of a set $X$ of $n$ points belonging to a metric space, and the task is to select a subset $C \\subseteq X$ of $k$ points as centers, such that the sum of the distances of every point to its nearest center is minimized. In $k$-Means, the objective is to minimize the sum of squares of the distances instead. It is easy to design an algorithm running in time $\\max_{k\\leq n} {n \\choose k} n^{O(1)} = O^*(2^n)$ ($O^*(\\cdot)$ notation h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06847","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/2208.06847/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":"2208.06847","created_at":"2026-07-05T04:48:21.427984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.06847v1","created_at":"2026-07-05T04:48:21.427984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06847","created_at":"2026-07-05T04:48:21.427984+00:00"},{"alias_kind":"pith_short_12","alias_value":"MK4OGY7HDLDI","created_at":"2026-07-05T04:48:21.427984+00:00"},{"alias_kind":"pith_short_16","alias_value":"MK4OGY7HDLDISIG5","created_at":"2026-07-05T04:48:21.427984+00:00"},{"alias_kind":"pith_short_8","alias_value":"MK4OGY7H","created_at":"2026-07-05T04:48:21.427984+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/MK4OGY7HDLDISIG5HBLLYKHLMY","json":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY.json","graph_json":"https://pith.science/api/pith-number/MK4OGY7HDLDISIG5HBLLYKHLMY/graph.json","events_json":"https://pith.science/api/pith-number/MK4OGY7HDLDISIG5HBLLYKHLMY/events.json","paper":"https://pith.science/paper/MK4OGY7H"},"agent_actions":{"view_html":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY","download_json":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY.json","view_paper":"https://pith.science/paper/MK4OGY7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.06847&json=true","fetch_graph":"https://pith.science/api/pith-number/MK4OGY7HDLDISIG5HBLLYKHLMY/graph.json","fetch_events":"https://pith.science/api/pith-number/MK4OGY7HDLDISIG5HBLLYKHLMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/action/storage_attestation","attest_author":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/action/author_attestation","sign_citation":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/action/citation_signature","submit_replication":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/action/replication_record"}},"created_at":"2026-07-05T04:48:21.427984+00:00","updated_at":"2026-07-05T04:48:21.427984+00:00"}