{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JJVMKZU2FW526FAFLARYQPDXWX","short_pith_number":"pith:JJVMKZU2","canonical_record":{"source":{"id":"1902.08559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-22T17:05:18Z","cross_cats_sorted":[],"title_canon_sha256":"a7f4f6689fee38d3dd530051ff39d8d3d9934683f11ab9fa55eb106120a0b242","abstract_canon_sha256":"e7bfd11216b66920f104cc09eb3b7ff72b454d3517c69cd96c03fabacc9904b5"},"schema_version":"1.0"},"canonical_sha256":"4a6ac5669a2dbbaf14055823883c77b5c4898a87a8b1c5d69fd1826d7935e8e2","source":{"kind":"arxiv","id":"1902.08559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08559","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08559v1","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08559","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"JJVMKZU2FW52","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JJVMKZU2FW526FAF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JJVMKZU2","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JJVMKZU2FW526FAFLARYQPDXWX","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-22T17:05:18Z","cross_cats_sorted":[],"title_canon_sha256":"a7f4f6689fee38d3dd530051ff39d8d3d9934683f11ab9fa55eb106120a0b242","abstract_canon_sha256":"e7bfd11216b66920f104cc09eb3b7ff72b454d3517c69cd96c03fabacc9904b5"},"schema_version":"1.0"},"canonical_sha256":"4a6ac5669a2dbbaf14055823883c77b5c4898a87a8b1c5d69fd1826d7935e8e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:56.817894Z","signature_b64":"+39fmovwxUjUkxBjVRO6b7+Dij+3DytBfxUdc+XbSiAY02q0A6RNLQkLOGclPoHbdhO7CgV+fRSE/U7QKSzDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a6ac5669a2dbbaf14055823883c77b5c4898a87a8b1c5d69fd1826d7935e8e2","last_reissued_at":"2026-05-17T23:52:56.817242Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:56.817242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08559","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-05-17T23:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JI6Ft/pZN+CkwUVuPpQR4LixabBhkIO3spPLROX21yS56TIZO2EszY5hwvl+blH9AFeFFHP2WR79I1Js+o0mAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:39:28.520221Z"},"content_sha256":"3b59bb90811f13a900d9de3bde140859fbc8282149a0eeb279fc1d334fcb71d2","schema_version":"1.0","event_id":"sha256:3b59bb90811f13a900d9de3bde140859fbc8282149a0eeb279fc1d334fcb71d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JJVMKZU2FW526FAFLARYQPDXWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized k-Clustering: The distance matters!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2019-02-22T17:05:18Z","abstract_excerpt":"We consider the $k$-Clustering problem, which is for a given multiset of $n$ vectors $X\\subset \\mathbb{Z}^d$ and a nonnegative number $D$, to decide whether $X$ can be partitioned into $k$ clusters $C_1, \\dots, C_k$ such that the cost\n  \\[\\sum_{i=1}^k \\min_{c_i\\in \\mathbb{R}^d}\\sum_{x \\in C_i} \\|x-c_i\\|_p^p \\leq D,\\] where $\\|\\cdot\\|_p$ is the Minkowski ($L_p$) norm of order $p$. For $p=1$, $k$-Clustering is the well-known $k$-Median. For $p=2$, the case of the Euclidean distance, $k$-Clustering is $k$-Means. We show that the parameterized complexity of $k$-Clustering strongly depends on the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08559","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":""},"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-05-17T23:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWuhuD0JJIDQraC8XGMKhwoW8CUQW/NVWvncpXWxWu/kp5ngjzNhy1+elxREjNDD7a4KaLAhSsgAKBExvke5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:39:28.520824Z"},"content_sha256":"ea2906b74426da2e28b05a59da82a250c492feb3eb74554e54153d9d30ea7774","schema_version":"1.0","event_id":"sha256:ea2906b74426da2e28b05a59da82a250c492feb3eb74554e54153d9d30ea7774"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJVMKZU2FW526FAFLARYQPDXWX/bundle.json","state_url":"https://pith.science/pith/JJVMKZU2FW526FAFLARYQPDXWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJVMKZU2FW526FAFLARYQPDXWX/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-05-25T16:39:28Z","links":{"resolver":"https://pith.science/pith/JJVMKZU2FW526FAFLARYQPDXWX","bundle":"https://pith.science/pith/JJVMKZU2FW526FAFLARYQPDXWX/bundle.json","state":"https://pith.science/pith/JJVMKZU2FW526FAFLARYQPDXWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJVMKZU2FW526FAFLARYQPDXWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JJVMKZU2FW526FAFLARYQPDXWX","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":"e7bfd11216b66920f104cc09eb3b7ff72b454d3517c69cd96c03fabacc9904b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-22T17:05:18Z","title_canon_sha256":"a7f4f6689fee38d3dd530051ff39d8d3d9934683f11ab9fa55eb106120a0b242"},"schema_version":"1.0","source":{"id":"1902.08559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08559","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08559v1","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08559","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"JJVMKZU2FW52","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JJVMKZU2FW526FAF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JJVMKZU2","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:ea2906b74426da2e28b05a59da82a250c492feb3eb74554e54153d9d30ea7774","target":"graph","created_at":"2026-05-17T23:52:56Z","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"},"paper":{"abstract_excerpt":"We consider the $k$-Clustering problem, which is for a given multiset of $n$ vectors $X\\subset \\mathbb{Z}^d$ and a nonnegative number $D$, to decide whether $X$ can be partitioned into $k$ clusters $C_1, \\dots, C_k$ such that the cost\n  \\[\\sum_{i=1}^k \\min_{c_i\\in \\mathbb{R}^d}\\sum_{x \\in C_i} \\|x-c_i\\|_p^p \\leq D,\\] where $\\|\\cdot\\|_p$ is the Minkowski ($L_p$) norm of order $p$. For $p=1$, $k$-Clustering is the well-known $k$-Median. For $p=2$, the case of the Euclidean distance, $k$-Clustering is $k$-Means. We show that the parameterized complexity of $k$-Clustering strongly depends on the d","authors_text":"Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-22T17:05:18Z","title":"Parameterized k-Clustering: The distance matters!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08559","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:3b59bb90811f13a900d9de3bde140859fbc8282149a0eeb279fc1d334fcb71d2","target":"record","created_at":"2026-05-17T23:52:56Z","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":"e7bfd11216b66920f104cc09eb3b7ff72b454d3517c69cd96c03fabacc9904b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-22T17:05:18Z","title_canon_sha256":"a7f4f6689fee38d3dd530051ff39d8d3d9934683f11ab9fa55eb106120a0b242"},"schema_version":"1.0","source":{"id":"1902.08559","kind":"arxiv","version":1}},"canonical_sha256":"4a6ac5669a2dbbaf14055823883c77b5c4898a87a8b1c5d69fd1826d7935e8e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a6ac5669a2dbbaf14055823883c77b5c4898a87a8b1c5d69fd1826d7935e8e2","first_computed_at":"2026-05-17T23:52:56.817242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:56.817242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+39fmovwxUjUkxBjVRO6b7+Dij+3DytBfxUdc+XbSiAY02q0A6RNLQkLOGclPoHbdhO7CgV+fRSE/U7QKSzDBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:56.817894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b59bb90811f13a900d9de3bde140859fbc8282149a0eeb279fc1d334fcb71d2","sha256:ea2906b74426da2e28b05a59da82a250c492feb3eb74554e54153d9d30ea7774"],"state_sha256":"d2bb92f2b02e5b4aaefdb840901792938cd6c184a7971bb2c3a62ed3c5e065be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/zSKPG8o5vD95Ii5/4/Vh1jV+qh95hlqYDsXh7XW3bMEJU2rwa29iOEysmVoZhlZwoJCN605z4Ltmth4W+XDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:39:28.523235Z","bundle_sha256":"705a9ee8775049d4daae11b0620a44fe9a2574fc15cb2a51fa292ad96d67758f"}}