{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NR7MI4WEZK7TJHNIKEPO64ZNNY","short_pith_number":"pith:NR7MI4WE","canonical_record":{"source":{"id":"2104.07974","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-16T08:49:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e28fac34040356f2b10f8634cfd6ca2d7a53e707f443a0eb9250f8a8d9b8dc0e","abstract_canon_sha256":"9e92ea3dcc86d0b26f7d68368a3dd24204c1f3ba6a90b029b0dd57b2bf5c5ded"},"schema_version":"1.0"},"canonical_sha256":"6c7ec472c4cabf349da8511eef732d6e059157a0e8276b62b5ce5c5ae7f694c0","source":{"kind":"arxiv","id":"2104.07974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.07974","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"2104.07974v1","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07974","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"NR7MI4WEZK7T","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"NR7MI4WEZK7TJHNI","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"NR7MI4WE","created_at":"2026-07-05T02:32:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NR7MI4WEZK7TJHNIKEPO64ZNNY","target":"record","payload":{"canonical_record":{"source":{"id":"2104.07974","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-16T08:49:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e28fac34040356f2b10f8634cfd6ca2d7a53e707f443a0eb9250f8a8d9b8dc0e","abstract_canon_sha256":"9e92ea3dcc86d0b26f7d68368a3dd24204c1f3ba6a90b029b0dd57b2bf5c5ded"},"schema_version":"1.0"},"canonical_sha256":"6c7ec472c4cabf349da8511eef732d6e059157a0e8276b62b5ce5c5ae7f694c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:39.596863Z","signature_b64":"jMks5Vf0bRvtvUHp3nD+/ffEUTX9qfNu+5vZOiJW8hnHqrYQZa4RE4ige7MCq8L0fkygrSWqMqs9MXcPCzWAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c7ec472c4cabf349da8511eef732d6e059157a0e8276b62b5ce5c5ae7f694c0","last_reissued_at":"2026-07-05T02:32:39.596384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:39.596384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.07974","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-05T02:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNJFlAZNPSdeDryeY5BpT7zxGJTNRrrX2b0Vjth1GSgbjgYGVsy7v1EXOgZp9wdjdjujhf912mop50xnSznVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:56:08.935016Z"},"content_sha256":"6c35840c78ae35d834586c3b17ad7f4896bd36298398c635304b5efb1250118d","schema_version":"1.0","event_id":"sha256:6c35840c78ae35d834586c3b17ad7f4896bd36298398c635304b5efb1250118d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NR7MI4WEZK7TJHNIKEPO64ZNNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Categorical Clustering with Size Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Nidhi Purohit, Petr A. Golovach","submitted_at":"2021-04-16T08:49:06Z","abstract_excerpt":"In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a_1,\\ldots,a_n} over \\Sigma^m, where \\Sigma is a finite alphabet, and integers k and B. The task is to partition A into k clusters such that the median objective of the clustering in the Hamming norm is at most B. That is, we seek a partition {I_1,\\ldots,I_k} of {1,\\ldots,n} and vectors c_1,\\ldots,c_k\\in\\Sigma^m such that \\sum_{i=1}^k\\sum_{j\\in I_i}d_h(c_i,a_j)\\leq B, where d_H(a,b) is the Hamming distance between vectors a and b. Fomin, Golovach, and Panolan [ICALP 2018] proved that the problem is fixed-parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07974","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/2104.07974/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-05T02:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNaTr5FdTQ9Vm1hgC04qrc24L0QF2AzvzoDtpGcP81v3WAUbQUFk13hQ4PLO1EC+YVTAN11BT84Lpn75NQQ6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:56:08.935627Z"},"content_sha256":"ed25de5f54c5672b93320b5182a319e2f23cbb4be53782c3507eb436b0e6a5c7","schema_version":"1.0","event_id":"sha256:ed25de5f54c5672b93320b5182a319e2f23cbb4be53782c3507eb436b0e6a5c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR7MI4WEZK7TJHNIKEPO64ZNNY/bundle.json","state_url":"https://pith.science/pith/NR7MI4WEZK7TJHNIKEPO64ZNNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR7MI4WEZK7TJHNIKEPO64ZNNY/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-20T23:56:08Z","links":{"resolver":"https://pith.science/pith/NR7MI4WEZK7TJHNIKEPO64ZNNY","bundle":"https://pith.science/pith/NR7MI4WEZK7TJHNIKEPO64ZNNY/bundle.json","state":"https://pith.science/pith/NR7MI4WEZK7TJHNIKEPO64ZNNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR7MI4WEZK7TJHNIKEPO64ZNNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NR7MI4WEZK7TJHNIKEPO64ZNNY","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":"9e92ea3dcc86d0b26f7d68368a3dd24204c1f3ba6a90b029b0dd57b2bf5c5ded","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-16T08:49:06Z","title_canon_sha256":"e28fac34040356f2b10f8634cfd6ca2d7a53e707f443a0eb9250f8a8d9b8dc0e"},"schema_version":"1.0","source":{"id":"2104.07974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.07974","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"2104.07974v1","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07974","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"NR7MI4WEZK7T","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"NR7MI4WEZK7TJHNI","created_at":"2026-07-05T02:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"NR7MI4WE","created_at":"2026-07-05T02:32:39Z"}],"graph_snapshots":[{"event_id":"sha256:ed25de5f54c5672b93320b5182a319e2f23cbb4be53782c3507eb436b0e6a5c7","target":"graph","created_at":"2026-07-05T02:32:39Z","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/2104.07974/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a_1,\\ldots,a_n} over \\Sigma^m, where \\Sigma is a finite alphabet, and integers k and B. The task is to partition A into k clusters such that the median objective of the clustering in the Hamming norm is at most B. That is, we seek a partition {I_1,\\ldots,I_k} of {1,\\ldots,n} and vectors c_1,\\ldots,c_k\\in\\Sigma^m such that \\sum_{i=1}^k\\sum_{j\\in I_i}d_h(c_i,a_j)\\leq B, where d_H(a,b) is the Hamming distance between vectors a and b. Fomin, Golovach, and Panolan [ICALP 2018] proved that the problem is fixed-parameter","authors_text":"Fedor V. Fomin, Nidhi Purohit, Petr A. Golovach","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-16T08:49:06Z","title":"Parameterized Complexity of Categorical Clustering with Size Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07974","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:6c35840c78ae35d834586c3b17ad7f4896bd36298398c635304b5efb1250118d","target":"record","created_at":"2026-07-05T02:32:39Z","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":"9e92ea3dcc86d0b26f7d68368a3dd24204c1f3ba6a90b029b0dd57b2bf5c5ded","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-04-16T08:49:06Z","title_canon_sha256":"e28fac34040356f2b10f8634cfd6ca2d7a53e707f443a0eb9250f8a8d9b8dc0e"},"schema_version":"1.0","source":{"id":"2104.07974","kind":"arxiv","version":1}},"canonical_sha256":"6c7ec472c4cabf349da8511eef732d6e059157a0e8276b62b5ce5c5ae7f694c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c7ec472c4cabf349da8511eef732d6e059157a0e8276b62b5ce5c5ae7f694c0","first_computed_at":"2026-07-05T02:32:39.596384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:32:39.596384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jMks5Vf0bRvtvUHp3nD+/ffEUTX9qfNu+5vZOiJW8hnHqrYQZa4RE4ige7MCq8L0fkygrSWqMqs9MXcPCzWAAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:32:39.596863Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.07974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c35840c78ae35d834586c3b17ad7f4896bd36298398c635304b5efb1250118d","sha256:ed25de5f54c5672b93320b5182a319e2f23cbb4be53782c3507eb436b0e6a5c7"],"state_sha256":"728d2fc17c6e0dceeedecb692f55269af8ef05394ac60643122635d8591b1cac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hl5DHf1TmTS6p4Bvlh+wPHp6f+gCHgfPpb8cyC/+DSijeuVQV6b6aCwmAczJ75U5EJ5n9XyjtdeG/lWZSK2BDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T23:56:08.940514Z","bundle_sha256":"65b88ae35341c674f3175aa7277bb0565e258bf4d59b03e8567c7f98818d61da"}}