{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DMDL5XW2W2IPECCQNEB5M2I7RN","short_pith_number":"pith:DMDL5XW2","schema_version":"1.0","canonical_sha256":"1b06bededab690f208506903d6691f8b6e0b1bdfb0deb7b7616ac34730bf99ee","source":{"kind":"arxiv","id":"1410.2838","version":1},"attestation_state":"computed","paper":{"title":"Approximate False Positive Rate Control in Selection Frequency for Random Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.LG","authors_text":"Ender Konukoglu, Melanie Ganz","submitted_at":"2014-10-10T16:43:16Z","abstract_excerpt":"Random Forest has become one of the most popular tools for feature selection. Its ability to deal with high-dimensional data makes this algorithm especially useful for studies in neuroimaging and bioinformatics. Despite its popularity and wide use, feature selection in Random Forest still lacks a crucial ingredient: false positive rate control. To date there is no efficient, principled and computationally light-weight solution to this shortcoming. As a result, researchers using Random Forest for feature selection have to resort to using heuristically set thresholds on feature rankings. This ar"},"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":"1410.2838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-10T16:43:16Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"a0e20bc9b7e168be094043a38771226209a4b0a74c417dff7c875f94320c0282","abstract_canon_sha256":"221e8314f4e6e83ad9d90788289bc6120072c1fa2a456508c6dbe3a15f41a83b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:37.056229Z","signature_b64":"i8xxHfI6TC3pkqZ8eNBQeeayYaLFyt04fhPUXVB3kVPibGy66QNfXJlYwhwpxvN3TO0RLBGzuMW0uAB22IMJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b06bededab690f208506903d6691f8b6e0b1bdfb0deb7b7616ac34730bf99ee","last_reissued_at":"2026-05-18T02:40:37.055555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:37.055555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate False Positive Rate Control in Selection Frequency for Random Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.LG","authors_text":"Ender Konukoglu, Melanie Ganz","submitted_at":"2014-10-10T16:43:16Z","abstract_excerpt":"Random Forest has become one of the most popular tools for feature selection. Its ability to deal with high-dimensional data makes this algorithm especially useful for studies in neuroimaging and bioinformatics. Despite its popularity and wide use, feature selection in Random Forest still lacks a crucial ingredient: false positive rate control. To date there is no efficient, principled and computationally light-weight solution to this shortcoming. As a result, researchers using Random Forest for feature selection have to resort to using heuristically set thresholds on feature rankings. This ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2838","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":""},"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":"1410.2838","created_at":"2026-05-18T02:40:37.055649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2838v1","created_at":"2026-05-18T02:40:37.055649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2838","created_at":"2026-05-18T02:40:37.055649+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMDL5XW2W2IP","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMDL5XW2W2IPECCQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMDL5XW2","created_at":"2026-05-18T12:28:25.294606+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/DMDL5XW2W2IPECCQNEB5M2I7RN","json":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN.json","graph_json":"https://pith.science/api/pith-number/DMDL5XW2W2IPECCQNEB5M2I7RN/graph.json","events_json":"https://pith.science/api/pith-number/DMDL5XW2W2IPECCQNEB5M2I7RN/events.json","paper":"https://pith.science/paper/DMDL5XW2"},"agent_actions":{"view_html":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN","download_json":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN.json","view_paper":"https://pith.science/paper/DMDL5XW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2838&json=true","fetch_graph":"https://pith.science/api/pith-number/DMDL5XW2W2IPECCQNEB5M2I7RN/graph.json","fetch_events":"https://pith.science/api/pith-number/DMDL5XW2W2IPECCQNEB5M2I7RN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN/action/storage_attestation","attest_author":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN/action/author_attestation","sign_citation":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN/action/citation_signature","submit_replication":"https://pith.science/pith/DMDL5XW2W2IPECCQNEB5M2I7RN/action/replication_record"}},"created_at":"2026-05-18T02:40:37.055649+00:00","updated_at":"2026-05-18T02:40:37.055649+00:00"}