{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3KRX37I7ZTIZD5JSVPB6V5ZAYC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1c4015e9924e109e2799782745e47281a2610c1de584a47a0222d606665076e2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-04T21:56:25Z","title_canon_sha256":"0f5a9006d119b2d85b8e92c4892e7bfc053c4ff24fe1156fbfd646039730929c"},"schema_version":"1.0","source":{"id":"1709.01177","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01177","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01177v2","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01177","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"3KRX37I7ZTIZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3KRX37I7ZTIZD5JS","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3KRX37I7","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:3fb995bf6e4cbce0e30cc7571c7b610d33f803bdbaca668a535de70f9e7e8d06","target":"graph","created_at":"2026-05-18T00:35:54Z","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"},"paper":{"abstract_excerpt":"Dealing with datasets of very high dimension is a major challenge in machine learning. In this paper, we consider the problem of feature selection in applications where the memory is not large enough to contain all features. In this setting, we propose a novel tree-based feature selection approach that builds a sequence of randomized trees on small subsamples of variables mixing both variables already identified as relevant by previous models and variables randomly selected among the other variables. As our main contribution, we provide an in-depth theoretical analysis of this method in infini","authors_text":"Antonio Sutera, C\\'elia Ch\\^atel, Gilles Louppe, Louis Wehenkel, Pierre Geurts","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-04T21:56:25Z","title":"Random Subspace with Trees for Feature Selection Under Memory Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01177","kind":"arxiv","version":2},"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:fcb2bc884e61356ca1472845a37f417d3395dae5820baac52e0653b8fc3aacff","target":"record","created_at":"2026-05-18T00:35:54Z","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":"1c4015e9924e109e2799782745e47281a2610c1de584a47a0222d606665076e2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-04T21:56:25Z","title_canon_sha256":"0f5a9006d119b2d85b8e92c4892e7bfc053c4ff24fe1156fbfd646039730929c"},"schema_version":"1.0","source":{"id":"1709.01177","kind":"arxiv","version":2}},"canonical_sha256":"daa37dfd1fccd191f532abc3eaf720c09d85ae0f906a0531b4a6fb3afa739bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daa37dfd1fccd191f532abc3eaf720c09d85ae0f906a0531b4a6fb3afa739bdb","first_computed_at":"2026-05-18T00:35:54.894962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:54.894962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UYrQIv4N6T9krgqlnL0MCxNb9nlojtYwP98zNICkrDOdLew2NXdgRewapM2es87l/pdwHQ1asvvY9N151QXGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:54.895437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01177","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcb2bc884e61356ca1472845a37f417d3395dae5820baac52e0653b8fc3aacff","sha256:3fb995bf6e4cbce0e30cc7571c7b610d33f803bdbaca668a535de70f9e7e8d06"],"state_sha256":"6971142fa6618bae0449a239e35b051655e356d1325b6c36ade53191224bc28b"}