{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:74XKAST2BYVR67IPMJ6QF44ZWC","short_pith_number":"pith:74XKAST2","schema_version":"1.0","canonical_sha256":"ff2ea04a7a0e2b1f7d0f627d02f399b09f65d740a7b2c75bc445ca529cf5c9ea","source":{"kind":"arxiv","id":"2509.16085","version":2},"attestation_state":"computed","paper":{"title":"An adaptive subsampling method for large-sample feature screening","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Cheng Meng, Kejun He, Xiaxue Ouyang","submitted_at":"2025-09-19T15:30:00Z","abstract_excerpt":"We consider the sure independence screening (SIS) method, a standard feature screening approach that aims to eliminate non-informative features in ultrahigh-dimensional datasets. Although effective, SIS incurs a computational cost of order $O(np)$ for a predictor matrix of size $n\\times p$, which can be prohibitively expensive when both n and p are considerable. Motivated by the multi-armed bandit (MAB) problem, we propose a more computationally efficient feature screening algorithm that reduces the cost to $O(\\sqrt{n}p)$. The core idea is to progressively increase the subsample size and 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":"2509.16085","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-09-19T15:30:00Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"70da676890752b650d0d0967deceab98723675a543f782e27f7aa4253570ffb4","abstract_canon_sha256":"6597324535ff8a576ba5a963e74a8c014c69bbe85bbd0fc01818707fd2c17702"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:22.158427Z","signature_b64":"gG2lfj4TqStaLsqJcT9d1NFfQf364jSQUB6QXL++wjyy4nu0CKurUcE2TY11Ne72S4IFObN6TNKiUQUy2X7uDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2ea04a7a0e2b1f7d0f627d02f399b09f65d740a7b2c75bc445ca529cf5c9ea","last_reissued_at":"2026-06-24T01:14:22.157842Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:22.157842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An adaptive subsampling method for large-sample feature screening","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Cheng Meng, Kejun He, Xiaxue Ouyang","submitted_at":"2025-09-19T15:30:00Z","abstract_excerpt":"We consider the sure independence screening (SIS) method, a standard feature screening approach that aims to eliminate non-informative features in ultrahigh-dimensional datasets. Although effective, SIS incurs a computational cost of order $O(np)$ for a predictor matrix of size $n\\times p$, which can be prohibitively expensive when both n and p are considerable. Motivated by the multi-armed bandit (MAB) problem, we propose a more computationally efficient feature screening algorithm that reduces the cost to $O(\\sqrt{n}p)$. The core idea is to progressively increase the subsample size and elimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.16085","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.16085/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":"2509.16085","created_at":"2026-06-24T01:14:22.157911+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.16085v2","created_at":"2026-06-24T01:14:22.157911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.16085","created_at":"2026-06-24T01:14:22.157911+00:00"},{"alias_kind":"pith_short_12","alias_value":"74XKAST2BYVR","created_at":"2026-06-24T01:14:22.157911+00:00"},{"alias_kind":"pith_short_16","alias_value":"74XKAST2BYVR67IP","created_at":"2026-06-24T01:14:22.157911+00:00"},{"alias_kind":"pith_short_8","alias_value":"74XKAST2","created_at":"2026-06-24T01:14:22.157911+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/74XKAST2BYVR67IPMJ6QF44ZWC","json":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC.json","graph_json":"https://pith.science/api/pith-number/74XKAST2BYVR67IPMJ6QF44ZWC/graph.json","events_json":"https://pith.science/api/pith-number/74XKAST2BYVR67IPMJ6QF44ZWC/events.json","paper":"https://pith.science/paper/74XKAST2"},"agent_actions":{"view_html":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC","download_json":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC.json","view_paper":"https://pith.science/paper/74XKAST2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.16085&json=true","fetch_graph":"https://pith.science/api/pith-number/74XKAST2BYVR67IPMJ6QF44ZWC/graph.json","fetch_events":"https://pith.science/api/pith-number/74XKAST2BYVR67IPMJ6QF44ZWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC/action/storage_attestation","attest_author":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC/action/author_attestation","sign_citation":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC/action/citation_signature","submit_replication":"https://pith.science/pith/74XKAST2BYVR67IPMJ6QF44ZWC/action/replication_record"}},"created_at":"2026-06-24T01:14:22.157911+00:00","updated_at":"2026-06-24T01:14:22.157911+00:00"}