{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OQRLQYVH24NXYQ7OECE2YAZN5P","short_pith_number":"pith:OQRLQYVH","schema_version":"1.0","canonical_sha256":"7422b862a7d71b7c43ee2089ac032debd41368ab820e4a135bf601b4b11ae411","source":{"kind":"arxiv","id":"2007.14920","version":1},"attestation_state":"computed","paper":{"title":"Fibonacci and k-Subsecting Recursive Feature Elimination","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dariusz Brzezinski","submitted_at":"2020-07-29T15:53:04Z","abstract_excerpt":"Feature selection is a data mining task with the potential of speeding up classification algorithms, enhancing model comprehensibility, and improving learning accuracy. However, finding a subset of features that is optimal in terms of predictive accuracy is usually computationally intractable. Out of several heuristic approaches to dealing with this problem, the Recursive Feature Elimination (RFE) algorithm has received considerable interest from data mining practitioners. In this paper, we propose two novel algorithms inspired by RFE, called Fibonacci- and k-Subsecting Recursive Feature Elimi"},"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":"2007.14920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-29T15:53:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5886e6c5b650e6151768cfe43e036eba67a0171640decb9558e48065af047d98","abstract_canon_sha256":"d359b421b6cfa7cb7a4929f4f5f7a65411c337385e17fccaa84a4f82b4be045a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:20.303794Z","signature_b64":"J6tmFtdcS0C7EY84hFRrwkR+KV/NazF7YzMVWtczPpXXtno4WwiOmdsyTR4B1e+6tMp9WUmgBlnDnTY3w/q4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7422b862a7d71b7c43ee2089ac032debd41368ab820e4a135bf601b4b11ae411","last_reissued_at":"2026-07-05T01:23:20.303394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:20.303394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fibonacci and k-Subsecting Recursive Feature Elimination","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dariusz Brzezinski","submitted_at":"2020-07-29T15:53:04Z","abstract_excerpt":"Feature selection is a data mining task with the potential of speeding up classification algorithms, enhancing model comprehensibility, and improving learning accuracy. However, finding a subset of features that is optimal in terms of predictive accuracy is usually computationally intractable. Out of several heuristic approaches to dealing with this problem, the Recursive Feature Elimination (RFE) algorithm has received considerable interest from data mining practitioners. In this paper, we propose two novel algorithms inspired by RFE, called Fibonacci- and k-Subsecting Recursive Feature Elimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14920","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/2007.14920/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":"2007.14920","created_at":"2026-07-05T01:23:20.303456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.14920v1","created_at":"2026-07-05T01:23:20.303456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14920","created_at":"2026-07-05T01:23:20.303456+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQRLQYVH24NX","created_at":"2026-07-05T01:23:20.303456+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQRLQYVH24NXYQ7O","created_at":"2026-07-05T01:23:20.303456+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQRLQYVH","created_at":"2026-07-05T01:23:20.303456+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/OQRLQYVH24NXYQ7OECE2YAZN5P","json":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P.json","graph_json":"https://pith.science/api/pith-number/OQRLQYVH24NXYQ7OECE2YAZN5P/graph.json","events_json":"https://pith.science/api/pith-number/OQRLQYVH24NXYQ7OECE2YAZN5P/events.json","paper":"https://pith.science/paper/OQRLQYVH"},"agent_actions":{"view_html":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P","download_json":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P.json","view_paper":"https://pith.science/paper/OQRLQYVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.14920&json=true","fetch_graph":"https://pith.science/api/pith-number/OQRLQYVH24NXYQ7OECE2YAZN5P/graph.json","fetch_events":"https://pith.science/api/pith-number/OQRLQYVH24NXYQ7OECE2YAZN5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P/action/storage_attestation","attest_author":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P/action/author_attestation","sign_citation":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P/action/citation_signature","submit_replication":"https://pith.science/pith/OQRLQYVH24NXYQ7OECE2YAZN5P/action/replication_record"}},"created_at":"2026-07-05T01:23:20.303456+00:00","updated_at":"2026-07-05T01:23:20.303456+00:00"}