{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GVCS35NJJLXGJVQAJKPC4HPRJ6","short_pith_number":"pith:GVCS35NJ","schema_version":"1.0","canonical_sha256":"35452df5a94aee64d6004a9e2e1df14f83a375d93b681a499a3de3828843275d","source":{"kind":"arxiv","id":"1611.01541","version":1},"attestation_state":"computed","paper":{"title":"Classification with Ultrahigh-Dimensional Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hyokyoung Hong, Jian Kang, Ji Zhu, Kevin He, Yanming Li, Yi Li","submitted_at":"2016-11-04T21:21:53Z","abstract_excerpt":"Although much progress has been made in classification with high-dimensional features \\citep{Fan_Fan:2008, JGuo:2010, CaiSun:2014, PRXu:2014}, classification with ultrahigh-dimensional features, wherein the features much outnumber the sample size, defies most existing work. This paper introduces a novel and computationally feasible multivariate screening and classification method for ultrahigh-dimensional data. Leveraging inter-feature correlations, the proposed method enables detection of marginally weak and sparse signals and recovery of the true informative feature set, and achieves asympto"},"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":"1611.01541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-04T21:21:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fb60c982cbab06449fc5b25b65bc61a58297bffa843aa8e0c3b8f6301ac17885","abstract_canon_sha256":"8598c653045961294cdc460624129ac7c80b86666bb5b35f20084e4b550dda2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.089466Z","signature_b64":"7YiSCgIhs6zK9eezQqqs4wX0OeRGS52030v1w7lzKDoqGtXQzBxQY6Q6cGJ4sF8Wux7nKpnYyDpQ4anS1oFQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35452df5a94aee64d6004a9e2e1df14f83a375d93b681a499a3de3828843275d","last_reissued_at":"2026-05-18T00:59:34.088913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.088913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification with Ultrahigh-Dimensional Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hyokyoung Hong, Jian Kang, Ji Zhu, Kevin He, Yanming Li, Yi Li","submitted_at":"2016-11-04T21:21:53Z","abstract_excerpt":"Although much progress has been made in classification with high-dimensional features \\citep{Fan_Fan:2008, JGuo:2010, CaiSun:2014, PRXu:2014}, classification with ultrahigh-dimensional features, wherein the features much outnumber the sample size, defies most existing work. This paper introduces a novel and computationally feasible multivariate screening and classification method for ultrahigh-dimensional data. Leveraging inter-feature correlations, the proposed method enables detection of marginally weak and sparse signals and recovery of the true informative feature set, and achieves asympto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01541","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":"1611.01541","created_at":"2026-05-18T00:59:34.089012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01541v1","created_at":"2026-05-18T00:59:34.089012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01541","created_at":"2026-05-18T00:59:34.089012+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVCS35NJJLXG","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVCS35NJJLXGJVQA","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVCS35NJ","created_at":"2026-05-18T12:30:19.053100+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/GVCS35NJJLXGJVQAJKPC4HPRJ6","json":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6.json","graph_json":"https://pith.science/api/pith-number/GVCS35NJJLXGJVQAJKPC4HPRJ6/graph.json","events_json":"https://pith.science/api/pith-number/GVCS35NJJLXGJVQAJKPC4HPRJ6/events.json","paper":"https://pith.science/paper/GVCS35NJ"},"agent_actions":{"view_html":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6","download_json":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6.json","view_paper":"https://pith.science/paper/GVCS35NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01541&json=true","fetch_graph":"https://pith.science/api/pith-number/GVCS35NJJLXGJVQAJKPC4HPRJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/GVCS35NJJLXGJVQAJKPC4HPRJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6/action/storage_attestation","attest_author":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6/action/author_attestation","sign_citation":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6/action/citation_signature","submit_replication":"https://pith.science/pith/GVCS35NJJLXGJVQAJKPC4HPRJ6/action/replication_record"}},"created_at":"2026-05-18T00:59:34.089012+00:00","updated_at":"2026-05-18T00:59:34.089012+00:00"}