{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MK4OGY7HDLDISIG5HBLLYKHLMY","short_pith_number":"pith:MK4OGY7H","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"},"canonical_sha256":"62b8e363e71ac68920dd3856bc28eb660d9c34b2c134d63c08a1dcab7bbc5e7b","source":{"kind":"arxiv","id":"2208.06847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06847","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06847v1","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06847","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_12","alias_value":"MK4OGY7HDLDI","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_16","alias_value":"MK4OGY7HDLDISIG5","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_8","alias_value":"MK4OGY7H","created_at":"2026-07-05T04:48:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MK4OGY7HDLDISIG5HBLLYKHLMY","target":"record","payload":{"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"},"canonical_sha256":"62b8e363e71ac68920dd3856bc28eb660d9c34b2c134d63c08a1dcab7bbc5e7b","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"},"source_kind":"arxiv","source_id":"2208.06847","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-05T04:48:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NS+YCZkVz4O3pz8KjII5paA/HDZdLg7tWCdsI0KoP3iXN/TGI9fAfYpVPcGQnt7IJDj+d9Ik2sGvbkNvKpqtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:26:07.031844Z"},"content_sha256":"cc53a8b512df890f8777cec031eccba3f789e8fc83a5ecdbbdb82a3dd93277d7","schema_version":"1.0","event_id":"sha256:cc53a8b512df890f8777cec031eccba3f789e8fc83a5ecdbbdb82a3dd93277d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MK4OGY7HDLDISIG5HBLLYKHLMY","target":"graph","payload":{"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"},"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-05T04:48:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvb6pP/rMx7XyQrJAOKpXbD7wEwHbj1sN6veO92Uz+qfI18eFjrthRzgHF4AZMAabMlm/CAh0rcvxCVAMSZIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:26:07.032172Z"},"content_sha256":"fa6e1db146dd15a5d2202ecffbb482ac6135dd9623796ac177e71f68707feb92","schema_version":"1.0","event_id":"sha256:fa6e1db146dd15a5d2202ecffbb482ac6135dd9623796ac177e71f68707feb92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/bundle.json","state_url":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/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-14T06:26:07Z","links":{"resolver":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY","bundle":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/bundle.json","state":"https://pith.science/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MK4OGY7HDLDISIG5HBLLYKHLMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MK4OGY7HDLDISIG5HBLLYKHLMY","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":"b3ea6cf3732169eafb2ee200a811e37c807a7cf52888072cf5258fdc240d8b70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-14T13:04:00Z","title_canon_sha256":"2a7d17d2f0fd10c018083b5f2e0a79e643bd96f15f041e0b63801e085e8e95d4"},"schema_version":"1.0","source":{"id":"2208.06847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06847","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06847v1","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06847","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_12","alias_value":"MK4OGY7HDLDI","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_16","alias_value":"MK4OGY7HDLDISIG5","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_8","alias_value":"MK4OGY7H","created_at":"2026-07-05T04:48:21Z"}],"graph_snapshots":[{"event_id":"sha256:fa6e1db146dd15a5d2202ecffbb482ac6135dd9623796ac177e71f68707feb92","target":"graph","created_at":"2026-07-05T04:48:21Z","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/2208.06847/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fedor V. Fomin, Nidhi Purohit, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-14T13:04:00Z","title":"Exact Exponential Algorithms for Clustering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06847","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:cc53a8b512df890f8777cec031eccba3f789e8fc83a5ecdbbdb82a3dd93277d7","target":"record","created_at":"2026-07-05T04:48:21Z","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":"b3ea6cf3732169eafb2ee200a811e37c807a7cf52888072cf5258fdc240d8b70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-14T13:04:00Z","title_canon_sha256":"2a7d17d2f0fd10c018083b5f2e0a79e643bd96f15f041e0b63801e085e8e95d4"},"schema_version":"1.0","source":{"id":"2208.06847","kind":"arxiv","version":1}},"canonical_sha256":"62b8e363e71ac68920dd3856bc28eb660d9c34b2c134d63c08a1dcab7bbc5e7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62b8e363e71ac68920dd3856bc28eb660d9c34b2c134d63c08a1dcab7bbc5e7b","first_computed_at":"2026-07-05T04:48:21.427927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:21.427927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O5NL9FFk/Y7WRBRKakdykCRn8oE3GYwDxXd85n98sYdP5vih9dZWb92mfwv/y56rLaNp8tvbhApslaHngXb/BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:21.428379Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.06847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc53a8b512df890f8777cec031eccba3f789e8fc83a5ecdbbdb82a3dd93277d7","sha256:fa6e1db146dd15a5d2202ecffbb482ac6135dd9623796ac177e71f68707feb92"],"state_sha256":"587b69df987983320edefe66b6cd8d1580a4882f5dc01d8b5a43520d6ba8ba2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjKZQBoi+dX9em7KD3kc5aOBw9joQI5CMmlsZqbmbWQlKXBeb5NpDqIM4j4XsN9lpF27VfYmGROxsy2WdI+iBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:26:07.034657Z","bundle_sha256":"955976dacc8abdecefd64f9b4ca353a2a14a8fd42ab5cafe20402227b575d039"}}