{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KAGHOI7UIR56J2PQLEC4Y3HR5E","short_pith_number":"pith:KAGHOI7U","canonical_record":{"source":{"id":"1508.07630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-30T20:03:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3f2ff257658d015fedf8aa4a9d167b3b661231b7099fd2b36469f1db1b17e52c","abstract_canon_sha256":"fe51457844b762b2e4fe133bb53b3f2d0ee81e81f76855f2e15a703698ac9b69"},"schema_version":"1.0"},"canonical_sha256":"500c7723f4447be4e9f05905cc6cf1e90ccfa334b7840e52fa51a0d3ec4f21fc","source":{"kind":"arxiv","id":"1508.07630","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07630","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07630v3","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07630","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"KAGHOI7UIR56","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAGHOI7UIR56J2PQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAGHOI7U","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KAGHOI7UIR56J2PQLEC4Y3HR5E","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-30T20:03:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3f2ff257658d015fedf8aa4a9d167b3b661231b7099fd2b36469f1db1b17e52c","abstract_canon_sha256":"fe51457844b762b2e4fe133bb53b3f2d0ee81e81f76855f2e15a703698ac9b69"},"schema_version":"1.0"},"canonical_sha256":"500c7723f4447be4e9f05905cc6cf1e90ccfa334b7840e52fa51a0d3ec4f21fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.293194Z","signature_b64":"KXz0ps/nWB++DK88De7ydconQ0Y8R+qQfzHWk6/yQNq8ky/iIlH+o94CbEGrv1gaylbbs/h3vHhLZaNiK2wKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"500c7723f4447be4e9f05905cc6cf1e90ccfa334b7840e52fa51a0d3ec4f21fc","last_reissued_at":"2026-05-18T01:19:35.292783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.292783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07630","source_version":3,"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-18T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9ZMTgWCSzI51FWgauN5RTLxRBxfeQabgrS3ZxgpalgHRYezK+xbGIwfNEXvdpywB2u3XoF5b4QyAJk13rZnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:35:36.800178Z"},"content_sha256":"4a833c4bfb6702f3b41f54fd7d9308d5d19f01119c8b4a6a2fb5b6d83925d804","schema_version":"1.0","event_id":"sha256:4a833c4bfb6702f3b41f54fd7d9308d5d19f01119c8b4a6a2fb5b6d83925d804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KAGHOI7UIR56J2PQLEC4Y3HR5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature Selection via Binary Simultaneous Perturbation Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Milad Malekipirbazari, Vural Aksakalli","submitted_at":"2015-08-30T20:03:53Z","abstract_excerpt":"Feature selection (FS) has become an indispensable task in dealing with today's highly complex pattern recognition problems with massive number of features. In this study, we propose a new wrapper approach for FS based on binary simultaneous perturbation stochastic approximation (BSPSA). This pseudo-gradient descent stochastic algorithm starts with an initial feature vector and moves toward the optimal feature vector via successive iterations. In each iteration, the current feature vector's individual components are perturbed simultaneously by random offsets from a qualified probability distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07630","kind":"arxiv","version":3},"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-18T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8K2aSaSWPEFWbqvNZZCNTsAPzzePfjgxkaE7r0VZZtVwUNVK14Yb5uh+f6S2UKGdDBC0RFQ/wP8TO3ndJqGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:35:36.800534Z"},"content_sha256":"4911db8b1f82d08dedb8dbfd64c20b78ddbae589cc1af7661d05e622aed8100c","schema_version":"1.0","event_id":"sha256:4911db8b1f82d08dedb8dbfd64c20b78ddbae589cc1af7661d05e622aed8100c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAGHOI7UIR56J2PQLEC4Y3HR5E/bundle.json","state_url":"https://pith.science/pith/KAGHOI7UIR56J2PQLEC4Y3HR5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAGHOI7UIR56J2PQLEC4Y3HR5E/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-06-26T04:35:36Z","links":{"resolver":"https://pith.science/pith/KAGHOI7UIR56J2PQLEC4Y3HR5E","bundle":"https://pith.science/pith/KAGHOI7UIR56J2PQLEC4Y3HR5E/bundle.json","state":"https://pith.science/pith/KAGHOI7UIR56J2PQLEC4Y3HR5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAGHOI7UIR56J2PQLEC4Y3HR5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KAGHOI7UIR56J2PQLEC4Y3HR5E","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":"fe51457844b762b2e4fe133bb53b3f2d0ee81e81f76855f2e15a703698ac9b69","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-30T20:03:53Z","title_canon_sha256":"3f2ff257658d015fedf8aa4a9d167b3b661231b7099fd2b36469f1db1b17e52c"},"schema_version":"1.0","source":{"id":"1508.07630","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07630","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07630v3","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07630","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"KAGHOI7UIR56","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAGHOI7UIR56J2PQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAGHOI7U","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:4911db8b1f82d08dedb8dbfd64c20b78ddbae589cc1af7661d05e622aed8100c","target":"graph","created_at":"2026-05-18T01:19:35Z","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":"Feature selection (FS) has become an indispensable task in dealing with today's highly complex pattern recognition problems with massive number of features. In this study, we propose a new wrapper approach for FS based on binary simultaneous perturbation stochastic approximation (BSPSA). This pseudo-gradient descent stochastic algorithm starts with an initial feature vector and moves toward the optimal feature vector via successive iterations. In each iteration, the current feature vector's individual components are perturbed simultaneously by random offsets from a qualified probability distri","authors_text":"Milad Malekipirbazari, Vural Aksakalli","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-30T20:03:53Z","title":"Feature Selection via Binary Simultaneous Perturbation Stochastic Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07630","kind":"arxiv","version":3},"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:4a833c4bfb6702f3b41f54fd7d9308d5d19f01119c8b4a6a2fb5b6d83925d804","target":"record","created_at":"2026-05-18T01:19:35Z","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":"fe51457844b762b2e4fe133bb53b3f2d0ee81e81f76855f2e15a703698ac9b69","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-30T20:03:53Z","title_canon_sha256":"3f2ff257658d015fedf8aa4a9d167b3b661231b7099fd2b36469f1db1b17e52c"},"schema_version":"1.0","source":{"id":"1508.07630","kind":"arxiv","version":3}},"canonical_sha256":"500c7723f4447be4e9f05905cc6cf1e90ccfa334b7840e52fa51a0d3ec4f21fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"500c7723f4447be4e9f05905cc6cf1e90ccfa334b7840e52fa51a0d3ec4f21fc","first_computed_at":"2026-05-18T01:19:35.292783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:35.292783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KXz0ps/nWB++DK88De7ydconQ0Y8R+qQfzHWk6/yQNq8ky/iIlH+o94CbEGrv1gaylbbs/h3vHhLZaNiK2wKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:35.293194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07630","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a833c4bfb6702f3b41f54fd7d9308d5d19f01119c8b4a6a2fb5b6d83925d804","sha256:4911db8b1f82d08dedb8dbfd64c20b78ddbae589cc1af7661d05e622aed8100c"],"state_sha256":"c5e6db199deaea889efee3054c0935aa57fb0d4713f0ff587e603d5903526e1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXwItQ5sGKg3MX34yF/GjqRMfxN3p7thW/jUW/D1lVaklHv+53HtAWN+4U77LGOMO4+E8asnvHn3gpCsgE2ICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T04:35:36.802568Z","bundle_sha256":"f8557452a2a505d9a16c441884be5f393ce933c130b58bce20ea46128a2baecc"}}