{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:52W23EFADV6QW4JCYQLMCVH77C","short_pith_number":"pith:52W23EFA","schema_version":"1.0","canonical_sha256":"eeadad90a01d7d0b7122c416c154fff8b1e06559a770c0fffac2aede2288de03","source":{"kind":"arxiv","id":"2105.04187","version":4},"attestation_state":"computed","paper":{"title":"A Rigorous Information-Theoretic Definition of Redundancy and Relevancy in Feature Selection Based on (Partial) Information Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Wibral, Patricia Wollstadt, Sebastian Schmitt","submitted_at":"2021-05-10T08:33:10Z","abstract_excerpt":"Selecting a minimal feature set that is maximally informative about a target variable is a central task in machine learning and statistics. Information theory provides a powerful framework for formulating feature selection algorithms -- yet, a rigorous, information-theoretic definition of feature relevancy, which accounts for feature interactions such as redundant and synergistic contributions, is still missing. We argue that this lack is inherent to classical information theory which does not provide measures to decompose the information a set of variables provides about a target into unique,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2105.04187","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-05-10T08:33:10Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"b5abb399c4d9662480bd45a21159755dd2e6076868443ab76f73ca7e6620db8e","abstract_canon_sha256":"44a5cddbc5b596fee254ea4f0a00dac0da38bd472ae967d6d226be0c11ed5a20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:51.656854Z","signature_b64":"iB9QSvsjswa6On2eg9mu9YtLBpNSOpBCdYSsVWkDHTisz2G6AgWEXld4YyVVSX/doA/B5zx2zzeEMUkdy0J8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeadad90a01d7d0b7122c416c154fff8b1e06559a770c0fffac2aede2288de03","last_reissued_at":"2026-07-05T06:06:51.656389Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:51.656389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Rigorous Information-Theoretic Definition of Redundancy and Relevancy in Feature Selection Based on (Partial) Information Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Wibral, Patricia Wollstadt, Sebastian Schmitt","submitted_at":"2021-05-10T08:33:10Z","abstract_excerpt":"Selecting a minimal feature set that is maximally informative about a target variable is a central task in machine learning and statistics. Information theory provides a powerful framework for formulating feature selection algorithms -- yet, a rigorous, information-theoretic definition of feature relevancy, which accounts for feature interactions such as redundant and synergistic contributions, is still missing. We argue that this lack is inherent to classical information theory which does not provide measures to decompose the information a set of variables provides about a target into unique,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.04187","kind":"arxiv","version":4},"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.04187/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.04187","created_at":"2026-07-05T06:06:51.656452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.04187v4","created_at":"2026-07-05T06:06:51.656452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.04187","created_at":"2026-07-05T06:06:51.656452+00:00"},{"alias_kind":"pith_short_12","alias_value":"52W23EFADV6Q","created_at":"2026-07-05T06:06:51.656452+00:00"},{"alias_kind":"pith_short_16","alias_value":"52W23EFADV6QW4JC","created_at":"2026-07-05T06:06:51.656452+00:00"},{"alias_kind":"pith_short_8","alias_value":"52W23EFA","created_at":"2026-07-05T06:06:51.656452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04362","citing_title":"Information-theoretic Quantification of High-order Feature Effects in Classification Problems","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C","json":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C.json","graph_json":"https://pith.science/api/pith-number/52W23EFADV6QW4JCYQLMCVH77C/graph.json","events_json":"https://pith.science/api/pith-number/52W23EFADV6QW4JCYQLMCVH77C/events.json","paper":"https://pith.science/paper/52W23EFA"},"agent_actions":{"view_html":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C","download_json":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C.json","view_paper":"https://pith.science/paper/52W23EFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.04187&json=true","fetch_graph":"https://pith.science/api/pith-number/52W23EFADV6QW4JCYQLMCVH77C/graph.json","fetch_events":"https://pith.science/api/pith-number/52W23EFADV6QW4JCYQLMCVH77C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C/action/storage_attestation","attest_author":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C/action/author_attestation","sign_citation":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C/action/citation_signature","submit_replication":"https://pith.science/pith/52W23EFADV6QW4JCYQLMCVH77C/action/replication_record"}},"created_at":"2026-07-05T06:06:51.656452+00:00","updated_at":"2026-07-05T06:06:51.656452+00:00"}