{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MVNLK7VZMTXPGPB4DULXMUS7SV","short_pith_number":"pith:MVNLK7VZ","schema_version":"1.0","canonical_sha256":"655ab57eb964eef33c3c1d1776525f957d319388a286eb8fc3adef7bfbc4adb2","source":{"kind":"arxiv","id":"2302.13221","version":4},"attestation_state":"computed","paper":{"title":"Beyond Discrete Selection: Continuous Embedding Space Optimization for Generative Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dongjie Wang, Meng Xiao, Min Wu, Pengfei Wang, Yanjie Fu, Yuanchun Zhou","submitted_at":"2023-02-26T03:18:45Z","abstract_excerpt":"The goal of Feature Selection - comprising filter, wrapper, and embedded approaches - is to find the optimal feature subset for designated downstream tasks. Nevertheless, current feature selection methods are limited by: 1) the selection criteria of these methods are varied for different domains, making them hard to generalize; 2) the selection performance of these approaches drops significantly when processing high-dimensional feature space coupled with small sample size. In light of these challenges, we pose the question: can selected feature subsets be more robust, accurate, and input dimen"},"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":"2302.13221","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-26T03:18:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"95c2a7d6c913518d9f930d6f8f7e6ae98b9ed9d6560fd7a8177e66c4d99779da","abstract_canon_sha256":"0e43b58a4e3ce5bebeb76c79298f34a788ee5d4344ceabe150678afe2242c4b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:53.925482Z","signature_b64":"95HRMlsrEPvNPnFdXoMKXb0xVFWbzMvK9MUVlTCNPVen4TXR8FaGHKFrgQQjEFf6vzKxwq3Y2fzIxt5ZdOXgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"655ab57eb964eef33c3c1d1776525f957d319388a286eb8fc3adef7bfbc4adb2","last_reissued_at":"2026-07-05T06:50:53.924912Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:53.924912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Discrete Selection: Continuous Embedding Space Optimization for Generative Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dongjie Wang, Meng Xiao, Min Wu, Pengfei Wang, Yanjie Fu, Yuanchun Zhou","submitted_at":"2023-02-26T03:18:45Z","abstract_excerpt":"The goal of Feature Selection - comprising filter, wrapper, and embedded approaches - is to find the optimal feature subset for designated downstream tasks. Nevertheless, current feature selection methods are limited by: 1) the selection criteria of these methods are varied for different domains, making them hard to generalize; 2) the selection performance of these approaches drops significantly when processing high-dimensional feature space coupled with small sample size. In light of these challenges, we pose the question: can selected feature subsets be more robust, accurate, and input dimen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13221","kind":"arxiv","version":4},"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/2302.13221/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":"2302.13221","created_at":"2026-07-05T06:50:53.924970+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.13221v4","created_at":"2026-07-05T06:50:53.924970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13221","created_at":"2026-07-05T06:50:53.924970+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVNLK7VZMTXP","created_at":"2026-07-05T06:50:53.924970+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVNLK7VZMTXPGPB4","created_at":"2026-07-05T06:50:53.924970+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVNLK7VZ","created_at":"2026-07-05T06:50:53.924970+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24155","citing_title":"Biological Pathway Guided Gene Selection Through Collaborative Reinforcement Learning","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV","json":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV.json","graph_json":"https://pith.science/api/pith-number/MVNLK7VZMTXPGPB4DULXMUS7SV/graph.json","events_json":"https://pith.science/api/pith-number/MVNLK7VZMTXPGPB4DULXMUS7SV/events.json","paper":"https://pith.science/paper/MVNLK7VZ"},"agent_actions":{"view_html":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV","download_json":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV.json","view_paper":"https://pith.science/paper/MVNLK7VZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.13221&json=true","fetch_graph":"https://pith.science/api/pith-number/MVNLK7VZMTXPGPB4DULXMUS7SV/graph.json","fetch_events":"https://pith.science/api/pith-number/MVNLK7VZMTXPGPB4DULXMUS7SV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV/action/storage_attestation","attest_author":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV/action/author_attestation","sign_citation":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV/action/citation_signature","submit_replication":"https://pith.science/pith/MVNLK7VZMTXPGPB4DULXMUS7SV/action/replication_record"}},"created_at":"2026-07-05T06:50:53.924970+00:00","updated_at":"2026-07-05T06:50:53.924970+00:00"}