{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SHLVTORMPPJWATWM7L2CYBH5YE","short_pith_number":"pith:SHLVTORM","canonical_record":{"source":{"id":"2105.03753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-08T18:04:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"42201c917451c61abd1af3b1a71f1474cb2faefc8ed760187654a32df78d9442","abstract_canon_sha256":"c32e0a8a8570d01e57ce355c6ecba45da6cd215ee9d72548e11e4e89227472b1"},"schema_version":"1.0"},"canonical_sha256":"91d759ba2c7bd3604eccfaf42c04fdc116d9cda5589c5ffa9a6d80429a75378e","source":{"kind":"arxiv","id":"2105.03753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.03753","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"2105.03753v2","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03753","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"SHLVTORMPPJW","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"pith_short_16","alias_value":"SHLVTORMPPJWATWM","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"pith_short_8","alias_value":"SHLVTORM","created_at":"2026-07-05T03:07:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SHLVTORMPPJWATWM7L2CYBH5YE","target":"record","payload":{"canonical_record":{"source":{"id":"2105.03753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-08T18:04:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"42201c917451c61abd1af3b1a71f1474cb2faefc8ed760187654a32df78d9442","abstract_canon_sha256":"c32e0a8a8570d01e57ce355c6ecba45da6cd215ee9d72548e11e4e89227472b1"},"schema_version":"1.0"},"canonical_sha256":"91d759ba2c7bd3604eccfaf42c04fdc116d9cda5589c5ffa9a6d80429a75378e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:06.419688Z","signature_b64":"xSzzwoqPkVBXkPpOyKeazQ/OBbLI4F494UT0jekBUu4PyU1Jd+1H+spcvZIHFkxCwS7ngzqscdJ9I/F/Gj3bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91d759ba2c7bd3604eccfaf42c04fdc116d9cda5589c5ffa9a6d80429a75378e","last_reissued_at":"2026-07-05T03:07:06.419274Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:06.419274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.03753","source_version":2,"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-05T03:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gtduXmanJTFm7GPq8FKhQ1UxUwCxCxMAv42vL4F2Yuj+khXFf8lQGOhQvskhVZmS+cTSb/b9IFgo+A3rFyNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:16.874641Z"},"content_sha256":"306f755bb5f2d354efba0e324e19c7bf165a7a42591ee90c7a1d847c87033494","schema_version":"1.0","event_id":"sha256:306f755bb5f2d354efba0e324e19c7bf165a7a42591ee90c7a1d847c87033494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SHLVTORMPPJWATWM7L2CYBH5YE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Feature Selection for Categorical Data Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Kirill Simonov, Petr A. Golovach, Sayan Bandyapadhyay","submitted_at":"2021-05-08T18:04:09Z","abstract_excerpt":"We develop new algorithmic methods with provable guarantees for feature selection in regard to categorical data clustering. While feature selection is one of the most common approaches to reduce dimensionality in practice, most of the known feature selection methods are heuristics. We study the following mathematical model. We assume that there are some inadvertent (or undesirable) features of the input data that unnecessarily increase the cost of clustering. Consequently, we want to select a subset of the original features from the data such that there is a small-cost clustering on the select"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03753","kind":"arxiv","version":2},"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/2105.03753/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-05T03:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4/M97TU1mZ6p6RfwBL2tmz+COnlzcJWMROS4eyuGO4ap6khlo0PGyWWzEXqKs3loxIPIO+b+ygI8Du3AI86CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:16.875197Z"},"content_sha256":"e6d24c7fbc98a10a5f678f5d12bda0a30cde02849a529e3bbd66703766a46318","schema_version":"1.0","event_id":"sha256:e6d24c7fbc98a10a5f678f5d12bda0a30cde02849a529e3bbd66703766a46318"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHLVTORMPPJWATWM7L2CYBH5YE/bundle.json","state_url":"https://pith.science/pith/SHLVTORMPPJWATWM7L2CYBH5YE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHLVTORMPPJWATWM7L2CYBH5YE/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:41:16Z","links":{"resolver":"https://pith.science/pith/SHLVTORMPPJWATWM7L2CYBH5YE","bundle":"https://pith.science/pith/SHLVTORMPPJWATWM7L2CYBH5YE/bundle.json","state":"https://pith.science/pith/SHLVTORMPPJWATWM7L2CYBH5YE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHLVTORMPPJWATWM7L2CYBH5YE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SHLVTORMPPJWATWM7L2CYBH5YE","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":"c32e0a8a8570d01e57ce355c6ecba45da6cd215ee9d72548e11e4e89227472b1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-08T18:04:09Z","title_canon_sha256":"42201c917451c61abd1af3b1a71f1474cb2faefc8ed760187654a32df78d9442"},"schema_version":"1.0","source":{"id":"2105.03753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.03753","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"2105.03753v2","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03753","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"SHLVTORMPPJW","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"pith_short_16","alias_value":"SHLVTORMPPJWATWM","created_at":"2026-07-05T03:07:06Z"},{"alias_kind":"pith_short_8","alias_value":"SHLVTORM","created_at":"2026-07-05T03:07:06Z"}],"graph_snapshots":[{"event_id":"sha256:e6d24c7fbc98a10a5f678f5d12bda0a30cde02849a529e3bbd66703766a46318","target":"graph","created_at":"2026-07-05T03:07:06Z","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/2105.03753/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop new algorithmic methods with provable guarantees for feature selection in regard to categorical data clustering. While feature selection is one of the most common approaches to reduce dimensionality in practice, most of the known feature selection methods are heuristics. We study the following mathematical model. We assume that there are some inadvertent (or undesirable) features of the input data that unnecessarily increase the cost of clustering. Consequently, we want to select a subset of the original features from the data such that there is a small-cost clustering on the select","authors_text":"Fedor V. Fomin, Kirill Simonov, Petr A. Golovach, Sayan Bandyapadhyay","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-08T18:04:09Z","title":"Parameterized Complexity of Feature Selection for Categorical Data Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03753","kind":"arxiv","version":2},"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:306f755bb5f2d354efba0e324e19c7bf165a7a42591ee90c7a1d847c87033494","target":"record","created_at":"2026-07-05T03:07:06Z","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":"c32e0a8a8570d01e57ce355c6ecba45da6cd215ee9d72548e11e4e89227472b1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-08T18:04:09Z","title_canon_sha256":"42201c917451c61abd1af3b1a71f1474cb2faefc8ed760187654a32df78d9442"},"schema_version":"1.0","source":{"id":"2105.03753","kind":"arxiv","version":2}},"canonical_sha256":"91d759ba2c7bd3604eccfaf42c04fdc116d9cda5589c5ffa9a6d80429a75378e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91d759ba2c7bd3604eccfaf42c04fdc116d9cda5589c5ffa9a6d80429a75378e","first_computed_at":"2026-07-05T03:07:06.419274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:07:06.419274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xSzzwoqPkVBXkPpOyKeazQ/OBbLI4F494UT0jekBUu4PyU1Jd+1H+spcvZIHFkxCwS7ngzqscdJ9I/F/Gj3bAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:07:06.419688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.03753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:306f755bb5f2d354efba0e324e19c7bf165a7a42591ee90c7a1d847c87033494","sha256:e6d24c7fbc98a10a5f678f5d12bda0a30cde02849a529e3bbd66703766a46318"],"state_sha256":"a84e203b554876911a67158d028d316d4dc673253d9a362bfa575dfe755ab44a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXH8hV36NMq8d/975CXgGpOD1EBsfIW36+4oYaplSgJjBhphonO4Uu23muCShZUH7ZUAuvBO5C9OHo+M6G8xDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:41:16.879900Z","bundle_sha256":"0f73edc0e4f56984beae8154059f06bc7b63a946ec8c71a4780478f819dc3db2"}}