{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J3P44I2PX33QQ256RDKKUKJB6T","short_pith_number":"pith:J3P44I2P","schema_version":"1.0","canonical_sha256":"4edfce234fbef7086bbe88d4aa2921f4d271cc10f5d2374d090a07d07a03866a","source":{"kind":"arxiv","id":"1811.11971","version":2},"attestation_state":"computed","paper":{"title":"Simple stopping criteria for information theoretic feature selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.CV","authors_text":"Jose C. Principe, Shujian Yu","submitted_at":"2018-11-29T05:24:28Z","abstract_excerpt":"Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between the selected features and the class labels is maximized. Despite the simplicity of this objective, there still remain several open problems in optimization. These include, for example, the automatic determination of the optimal subset size (i.e., the number of features) or a stopping criterion if the greedy searching strategy is adopted. In th"},"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":"1811.11971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-29T05:24:28Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ab9902fef24dc01a5418804be8a6b407630c4cc5d44ded4c49a3a1b6b8ff1887","abstract_canon_sha256":"1d6b00ef8e779ea4cd08f0bd69233da1c7caf7f6164839b67e6deaa05a5ebb78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:19.005507Z","signature_b64":"8EuYAThGK36u4nAKgwzbt4y7nQRKCtkgOs8Zhd1xsYs/FHhpNI/0uuGuWJLAoM9w/5KRSPIO+T0RT4KgUED8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4edfce234fbef7086bbe88d4aa2921f4d271cc10f5d2374d090a07d07a03866a","last_reissued_at":"2026-05-17T23:55:19.004818Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:19.004818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple stopping criteria for information theoretic feature selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.CV","authors_text":"Jose C. Principe, Shujian Yu","submitted_at":"2018-11-29T05:24:28Z","abstract_excerpt":"Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between the selected features and the class labels is maximized. Despite the simplicity of this objective, there still remain several open problems in optimization. These include, for example, the automatic determination of the optimal subset size (i.e., the number of features) or a stopping criterion if the greedy searching strategy is adopted. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11971","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":""},"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":"1811.11971","created_at":"2026-05-17T23:55:19.004916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11971v2","created_at":"2026-05-17T23:55:19.004916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11971","created_at":"2026-05-17T23:55:19.004916+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3P44I2PX33Q","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3P44I2PX33QQ256","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3P44I2P","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T","json":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T.json","graph_json":"https://pith.science/api/pith-number/J3P44I2PX33QQ256RDKKUKJB6T/graph.json","events_json":"https://pith.science/api/pith-number/J3P44I2PX33QQ256RDKKUKJB6T/events.json","paper":"https://pith.science/paper/J3P44I2P"},"agent_actions":{"view_html":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T","download_json":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T.json","view_paper":"https://pith.science/paper/J3P44I2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11971&json=true","fetch_graph":"https://pith.science/api/pith-number/J3P44I2PX33QQ256RDKKUKJB6T/graph.json","fetch_events":"https://pith.science/api/pith-number/J3P44I2PX33QQ256RDKKUKJB6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T/action/storage_attestation","attest_author":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T/action/author_attestation","sign_citation":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T/action/citation_signature","submit_replication":"https://pith.science/pith/J3P44I2PX33QQ256RDKKUKJB6T/action/replication_record"}},"created_at":"2026-05-17T23:55:19.004916+00:00","updated_at":"2026-05-17T23:55:19.004916+00:00"}