{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AJIQLYL2TY66KNHXUQB42N7P6U","short_pith_number":"pith:AJIQLYL2","canonical_record":{"source":{"id":"1402.0570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T01:37:24Z","cross_cats_sorted":[],"title_canon_sha256":"c7b82277766ef0ec9ba4c796501c321973fb177b8602972dfdef06d21a0381e3","abstract_canon_sha256":"eedead4337bc81b4c26670f5d16996d1b6000311959ff358da1ac5af03b961ad"},"schema_version":"1.0"},"canonical_sha256":"025105e17a9e3de534f7a403cd37eff53d8f5195f5dc731eb9c087ca1cc8d671","source":{"kind":"arxiv","id":"1402.0570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0570","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0570v1","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0570","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"AJIQLYL2TY66","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AJIQLYL2TY66KNHX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AJIQLYL2","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AJIQLYL2TY66KNHXUQB42N7P6U","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T01:37:24Z","cross_cats_sorted":[],"title_canon_sha256":"c7b82277766ef0ec9ba4c796501c321973fb177b8602972dfdef06d21a0381e3","abstract_canon_sha256":"eedead4337bc81b4c26670f5d16996d1b6000311959ff358da1ac5af03b961ad"},"schema_version":"1.0"},"canonical_sha256":"025105e17a9e3de534f7a403cd37eff53d8f5195f5dc731eb9c087ca1cc8d671","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:13.842839Z","signature_b64":"K6O20/JaXZ4goKqOk9kfG0Zr2hXtdb/CAFeqZPg9a39akqkdrDT5vdqYtFh4xqbt6pVUEBRxIxkyHCyZNonIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025105e17a9e3de534f7a403cd37eff53d8f5195f5dc731eb9c087ca1cc8d671","last_reissued_at":"2026-05-18T03:00:13.842000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:13.842000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0570","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QO3MkdZJtczGkPzaiFxPI5XLBYNipCcrUtQ2rzadH0sHwiJ0wH1VEIz4rsd5j0ijLLiZpL3BOTULNVA0lqmaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:03:17.826214Z"},"content_sha256":"05730137762ebc1551cf5796e3eabd11d460d066f03980bd1ac5d821000bfab9","schema_version":"1.0","event_id":"sha256:05730137762ebc1551cf5796e3eabd11d460d066f03980bd1ac5d821000bfab9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AJIQLYL2TY66KNHXUQB42N7P6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Feature Subset Selection Algorithm Automatic Recommendation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Baowen Xu, Guangtao Wang, Heli Sun, Qinbao Song, Xueying Zhang, Yuming Zhou","submitted_at":"2014-02-04T01:37:24Z","abstract_excerpt":"Many feature subset selection (FSS) algorithms have been proposed, but not all of them are appropriate for a given feature selection problem. At the same time, so far there is rarely a good way to choose appropriate FSS algorithms for the problem at hand. Thus, FSS algorithm automatic recommendation is very important and practically useful. In this paper, a meta learning based FSS algorithm automatic recommendation method is presented. The proposed method first identifies the data sets that are most similar to the one at hand by the k-nearest neighbor classification algorithm, and the distance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0570","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgLcvFHmpDoeX4KcxY1Thqjhpgt6F8gJc/7GSxmGBPs3oVm+sDnb7Gx9n/F6zhZQ2xX8Db075VGrNVMv3njyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:03:17.826803Z"},"content_sha256":"9104e59c9797205550eda56777f51ac3354a475e66ead857c07b611bca6c4108","schema_version":"1.0","event_id":"sha256:9104e59c9797205550eda56777f51ac3354a475e66ead857c07b611bca6c4108"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/bundle.json","state_url":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJIQLYL2TY66KNHXUQB42N7P6U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T17:03:17Z","links":{"resolver":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U","bundle":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/bundle.json","state":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJIQLYL2TY66KNHXUQB42N7P6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AJIQLYL2TY66KNHXUQB42N7P6U","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":"eedead4337bc81b4c26670f5d16996d1b6000311959ff358da1ac5af03b961ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T01:37:24Z","title_canon_sha256":"c7b82277766ef0ec9ba4c796501c321973fb177b8602972dfdef06d21a0381e3"},"schema_version":"1.0","source":{"id":"1402.0570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0570","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0570v1","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0570","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"AJIQLYL2TY66","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AJIQLYL2TY66KNHX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AJIQLYL2","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:9104e59c9797205550eda56777f51ac3354a475e66ead857c07b611bca6c4108","target":"graph","created_at":"2026-05-18T03:00:13Z","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":"Many feature subset selection (FSS) algorithms have been proposed, but not all of them are appropriate for a given feature selection problem. At the same time, so far there is rarely a good way to choose appropriate FSS algorithms for the problem at hand. Thus, FSS algorithm automatic recommendation is very important and practically useful. In this paper, a meta learning based FSS algorithm automatic recommendation method is presented. The proposed method first identifies the data sets that are most similar to the one at hand by the k-nearest neighbor classification algorithm, and the distance","authors_text":"Baowen Xu, Guangtao Wang, Heli Sun, Qinbao Song, Xueying Zhang, Yuming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T01:37:24Z","title":"A Feature Subset Selection Algorithm Automatic Recommendation Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0570","kind":"arxiv","version":1},"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:05730137762ebc1551cf5796e3eabd11d460d066f03980bd1ac5d821000bfab9","target":"record","created_at":"2026-05-18T03:00:13Z","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":"eedead4337bc81b4c26670f5d16996d1b6000311959ff358da1ac5af03b961ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T01:37:24Z","title_canon_sha256":"c7b82277766ef0ec9ba4c796501c321973fb177b8602972dfdef06d21a0381e3"},"schema_version":"1.0","source":{"id":"1402.0570","kind":"arxiv","version":1}},"canonical_sha256":"025105e17a9e3de534f7a403cd37eff53d8f5195f5dc731eb9c087ca1cc8d671","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"025105e17a9e3de534f7a403cd37eff53d8f5195f5dc731eb9c087ca1cc8d671","first_computed_at":"2026-05-18T03:00:13.842000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:13.842000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6O20/JaXZ4goKqOk9kfG0Zr2hXtdb/CAFeqZPg9a39akqkdrDT5vdqYtFh4xqbt6pVUEBRxIxkyHCyZNonIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:13.842839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05730137762ebc1551cf5796e3eabd11d460d066f03980bd1ac5d821000bfab9","sha256:9104e59c9797205550eda56777f51ac3354a475e66ead857c07b611bca6c4108"],"state_sha256":"149525f6018f7fc8016aa26824c423ef2d970e20d5284fe4a514e0c390a11711"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1txPCt8VEV8RekJTRl0VNRjca8GO/51/6Yqia5r/w38nlaILkZn47WipWtBwPXbWzHlbpN+eln0PFMhlYUgAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:03:17.829328Z","bundle_sha256":"7b3e4564fe0728c5494a2022606fe0b58b968ef625da4605cf90a32ad1d7e0b4"}}