{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:O5YSJ363KVMYTYUSCCJ6OULMS2","short_pith_number":"pith:O5YSJ363","canonical_record":{"source":{"id":"2607.24145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-27T08:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"0a8f06c7f2235f6d8968469d3439699ed5f503d1298b341fe135da681d266451","abstract_canon_sha256":"5429d55e0ebfb9cf69137be33d9fdfb0cdb43f0377915ca2231968fbf2ce8653"},"schema_version":"1.0"},"canonical_sha256":"777124efdb555989e2921093e7516c96868be528b4f2e88060d0e00db64ce4cb","source":{"kind":"arxiv","id":"2607.24145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24145","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24145v1","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24145","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"O5YSJ363KVMY","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"pith_short_16","alias_value":"O5YSJ363KVMYTYUS","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"pith_short_8","alias_value":"O5YSJ363","created_at":"2026-07-28T01:23:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:O5YSJ363KVMYTYUSCCJ6OULMS2","target":"record","payload":{"canonical_record":{"source":{"id":"2607.24145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-27T08:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"0a8f06c7f2235f6d8968469d3439699ed5f503d1298b341fe135da681d266451","abstract_canon_sha256":"5429d55e0ebfb9cf69137be33d9fdfb0cdb43f0377915ca2231968fbf2ce8653"},"schema_version":"1.0"},"canonical_sha256":"777124efdb555989e2921093e7516c96868be528b4f2e88060d0e00db64ce4cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:47.086067Z","signature_b64":"/mwscktyF4IgcfxlSfvT8JXfIp2xkwUx/8qntXkefRq7x2d4iXNDuX+ZKV56l9iqBW+YOzBHeSMBbww1tzptDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"777124efdb555989e2921093e7516c96868be528b4f2e88060d0e00db64ce4cb","last_reissued_at":"2026-07-28T01:23:47.085243Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:47.085243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.24145","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-28T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0oQXn3u0X6t+mV/66VMERI703wb0ok86hkwY9sQwTdYpDMTf6+piGstiQRRLXhBq62hm49dL5HiEYIgVVJUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:00:19.266033Z"},"content_sha256":"f722a32ea722e665f146d890bf79b594f3e68634e7741c0bcd1629f9ee83022c","schema_version":"1.0","event_id":"sha256:f722a32ea722e665f146d890bf79b594f3e68634e7741c0bcd1629f9ee83022c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:O5YSJ363KVMYTYUSCCJ6OULMS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Empirical Study of Feature Selection Granularity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arthur Zimek, Muhammad Rajabinasab","submitted_at":"2026-07-27T08:24:40Z","abstract_excerpt":"Feature selection aims to identify the most informative and relevant features for a given dataset, either in terms of capturing the underlying data structure and distribution better, or with respect to the performance on a downstream task. Existing research in this area has largely focused on developing novel algorithms (in both supervised and unsupervised settings), proposing new evaluation metrics and frameworks, or benchmarking the performance of existing methods. In this work, we examine feature selection through an algorithmic design perspective. Conventional feature selection algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24145","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/2607.24145/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-28T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXWLRzLnWTRNx9s1k7NE0z2jt+ZRHwwLBLVOhmfL3kEIl+ILAWoYkyIl/KzmWQLBWO7lRx7B87kP+ESNZOu+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:00:19.266655Z"},"content_sha256":"5168ae0dd2ac56cfff7532ef0593930197c3e53b4dc7b0191ed48a411579edee","schema_version":"1.0","event_id":"sha256:5168ae0dd2ac56cfff7532ef0593930197c3e53b4dc7b0191ed48a411579edee"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:O5YSJ363KVMYTYUSCCJ6OULMS2","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.eswa.2024.126254 resolves to 'Randomized PCA forest for approximate k-nearest neighbor search'. A reader following the printed text alone cannot reach it.","snippet":"Rajabinasab, M., Pakdaman, F., Zimek, A., Gabbouj, M.: Randomized pca for- est for approximate k-nearest neighbor search. Expert Systems with Applications 281, 126254 (2025).https://doi.org/https://doi.org/10.1016/j.eswa.2024. 126254","arxiv_id":"2607.24145","detector":"doi_compliance","evidence":{"ref_index":26,"verdict_class":"incontrovertible","resolved_title":"Randomized PCA forest for approximate k-nearest neighbor search","printed_excerpt":"10.1016/j.eswa.2024","reconstructed_doi":"10.1016/j.eswa.2024.126254"},"severity":"advisory","ref_index":26,"audited_at":"2026-07-31T22:41:40.447477Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.eswa.2024.126254","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"eb593fcf650be49adc99b1199eb3f9e7d8a7a9ecd5076b612287e7b96bb02a41","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Randomized PCA forest for approximate k-nearest neighbor search","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14550,"payload_sha256":"d430f485a8d6d749419ff7d53d72380fa3f1aed04dfae9161f24b6f5f8ea1f01","signature_b64":"q+aqOPifo6hpsL1f8FvXfApp13lMhW2Amlap7L6rLaQab3Xo/z8MdjkCwE14Zm6m1UEsLrqWcPOMEjgH/iwVBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T22:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qumdUpyAlTNC0XZHU8r0Osh37NzPYuX1BARrOjKr3J7QyzJZyggQ2zMQ1aMXhLQYLl31wnBEgepu7hUX8rL4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:00:19.285717Z"},"content_sha256":"4fba06af628fada7f78c753ff8d9d87ad0fc87fb3dc7927c121dbe17dbf52673","schema_version":"1.0","event_id":"sha256:4fba06af628fada7f78c753ff8d9d87ad0fc87fb3dc7927c121dbe17dbf52673"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:O5YSJ363KVMYTYUSCCJ6OULMS2","target":"integrity","payload":{"note":"Identifier '10.1016/s0004-3702(97' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial In- telligence97(1-2), 273–324 (1997).https://doi.org/10.1016/S0004-3702(97) 00043-X,https://doi.org/10.1016/S0004-3702(97)00043-X","arxiv_id":"2607.24145","detector":"doi_compliance","evidence":{"doi":"10.1016/s0004-3702(97","arxiv_id":null,"ref_index":13,"raw_excerpt":"Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial In- telligence97(1-2), 273–324 (1997).https://doi.org/10.1016/S0004-3702(97) 00043-X,https://doi.org/10.1016/S0004-3702(97)00043-X","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":13,"audited_at":"2026-07-31T22:41:40.447477Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0004-3702(97","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"174e5f068f327f01f928e4648273b4ef66a4c2587bffc0c3f3ce2cc4fa34512a","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14549,"payload_sha256":"b32abc20244e97cf908e0f6902bd08ef17125aaf5395a02c50b9385f742e510c","signature_b64":"pi1PQ0zPwS8rqHmXLv6tbA1RM61wGCTxFdu+jEz3G0lC0kU2/p3DO+4Au1k7HNVrmgEyuKVc8f/TqXmAe+cMBQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T22:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USHmFKCH4zMH6VaA1KhcW1WSDN+HQhYO2+5HNezHlUIsy4RwREVh6QBExqEbeA5h6Eu/Axh5PjuY+q68cHs5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:00:19.286146Z"},"content_sha256":"73456d49259beb7afb1d0bfe3977ad68051edf2f08b1f07eb3e16ab037d635a3","schema_version":"1.0","event_id":"sha256:73456d49259beb7afb1d0bfe3977ad68051edf2f08b1f07eb3e16ab037d635a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5YSJ363KVMYTYUSCCJ6OULMS2/bundle.json","state_url":"https://pith.science/pith/O5YSJ363KVMYTYUSCCJ6OULMS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5YSJ363KVMYTYUSCCJ6OULMS2/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-06T15:00:19Z","links":{"resolver":"https://pith.science/pith/O5YSJ363KVMYTYUSCCJ6OULMS2","bundle":"https://pith.science/pith/O5YSJ363KVMYTYUSCCJ6OULMS2/bundle.json","state":"https://pith.science/pith/O5YSJ363KVMYTYUSCCJ6OULMS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5YSJ363KVMYTYUSCCJ6OULMS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O5YSJ363KVMYTYUSCCJ6OULMS2","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5429d55e0ebfb9cf69137be33d9fdfb0cdb43f0377915ca2231968fbf2ce8653","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-27T08:24:40Z","title_canon_sha256":"0a8f06c7f2235f6d8968469d3439699ed5f503d1298b341fe135da681d266451"},"schema_version":"1.0","source":{"id":"2607.24145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24145","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24145v1","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24145","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"O5YSJ363KVMY","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"pith_short_16","alias_value":"O5YSJ363KVMYTYUS","created_at":"2026-07-28T01:23:47Z"},{"alias_kind":"pith_short_8","alias_value":"O5YSJ363","created_at":"2026-07-28T01:23:47Z"}],"graph_snapshots":[{"event_id":"sha256:5168ae0dd2ac56cfff7532ef0593930197c3e53b4dc7b0191ed48a411579edee","target":"graph","created_at":"2026-07-28T01:23:47Z","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/2607.24145/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Feature selection aims to identify the most informative and relevant features for a given dataset, either in terms of capturing the underlying data structure and distribution better, or with respect to the performance on a downstream task. Existing research in this area has largely focused on developing novel algorithms (in both supervised and unsupervised settings), proposing new evaluation metrics and frameworks, or benchmarking the performance of existing methods. In this work, we examine feature selection through an algorithmic design perspective. Conventional feature selection algorithms ","authors_text":"Arthur Zimek, Muhammad Rajabinasab","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-27T08:24:40Z","title":"An Empirical Study of Feature Selection Granularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24145","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:f722a32ea722e665f146d890bf79b594f3e68634e7741c0bcd1629f9ee83022c","target":"record","created_at":"2026-07-28T01:23:47Z","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":"5429d55e0ebfb9cf69137be33d9fdfb0cdb43f0377915ca2231968fbf2ce8653","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-27T08:24:40Z","title_canon_sha256":"0a8f06c7f2235f6d8968469d3439699ed5f503d1298b341fe135da681d266451"},"schema_version":"1.0","source":{"id":"2607.24145","kind":"arxiv","version":1}},"canonical_sha256":"777124efdb555989e2921093e7516c96868be528b4f2e88060d0e00db64ce4cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"777124efdb555989e2921093e7516c96868be528b4f2e88060d0e00db64ce4cb","first_computed_at":"2026-07-28T01:23:47.085243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T01:23:47.085243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/mwscktyF4IgcfxlSfvT8JXfIp2xkwUx/8qntXkefRq7x2d4iXNDuX+ZKV56l9iqBW+YOzBHeSMBbww1tzptDw==","signature_status":"signed_v1","signed_at":"2026-07-28T01:23:47.086067Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.24145","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:4fba06af628fada7f78c753ff8d9d87ad0fc87fb3dc7927c121dbe17dbf52673","sha256:73456d49259beb7afb1d0bfe3977ad68051edf2f08b1f07eb3e16ab037d635a3"]}],"invalid_events":[],"applied_event_ids":["sha256:f722a32ea722e665f146d890bf79b594f3e68634e7741c0bcd1629f9ee83022c","sha256:5168ae0dd2ac56cfff7532ef0593930197c3e53b4dc7b0191ed48a411579edee"],"state_sha256":"179b9939e8061cc1bce7bd31d15aff2a68588561f9c1eee0cb5d85b477e7ab1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKkmh+GjxH+QRZ6Cz+0EyE4lc4eodmMFeZHpFm6IGsVVwo2vxqv3hHrGKE9OaLifoLgMQvSpM0Snf9u2lN/zAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T15:00:19.288858Z","bundle_sha256":"0dc97efc0a6d3886f01ae4c9d50d07103e82309fe93435224c848230e4df37ea"}}