{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G73IJQXRLFNB7YKO6KAWKY7FXR","short_pith_number":"pith:G73IJQXR","canonical_record":{"source":{"id":"1808.00068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T20:38:19Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"343a28f89261a4b04fe906c7cff15f325bc9a34e4f333e538e5ac51d883da917","abstract_canon_sha256":"f0135feb28ff19df798e82389e7456872f884afdb9505bca4fd17f54a93129b2"},"schema_version":"1.0"},"canonical_sha256":"37f684c2f1595a1fe14ef2816563e5bc76ce58d8fa50f006dced6863270e0dff","source":{"kind":"arxiv","id":"1808.00068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00068","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00068v1","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00068","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"G73IJQXRLFNB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G73IJQXRLFNB7YKO","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G73IJQXR","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G73IJQXRLFNB7YKO6KAWKY7FXR","target":"record","payload":{"canonical_record":{"source":{"id":"1808.00068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T20:38:19Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"343a28f89261a4b04fe906c7cff15f325bc9a34e4f333e538e5ac51d883da917","abstract_canon_sha256":"f0135feb28ff19df798e82389e7456872f884afdb9505bca4fd17f54a93129b2"},"schema_version":"1.0"},"canonical_sha256":"37f684c2f1595a1fe14ef2816563e5bc76ce58d8fa50f006dced6863270e0dff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.237045Z","signature_b64":"tPdH2lJVGPPCVJoalGzjcIEy7xH65f1FFZifPGbxJulHBca3Iq9Df+MY7/dTNEqz/SpcsONxoDva117NFL0+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f684c2f1595a1fe14ef2816563e5bc76ce58d8fa50f006dced6863270e0dff","last_reissued_at":"2026-05-18T00:00:08.236394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.236394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.00068","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-18T00:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZT6PU7f2J2nqeYnpBEWtnU7daa+UtIx4mWSflpE3+njSLGuAJnc9GRnStE2kYcDGOzvXtc8DJojwsCIAquxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:16:59.254634Z"},"content_sha256":"ee3e5db5dfd964d00dc40fe1e88cd073cfce1833ffa6ab5ea3a3d074054570d4","schema_version":"1.0","event_id":"sha256:ee3e5db5dfd964d00dc40fe1e88cd073cfce1833ffa6ab5ea3a3d074054570d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G73IJQXRLFNB7YKO6KAWKY7FXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fuzzy-Rough based Binary Shuffled Frog Leaping Algorithm for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chang Wook Ahn, Javad Rahimipour Anaraki, Mahdi Eftekhari, Saeed Samet","submitted_at":"2018-07-31T20:38:19Z","abstract_excerpt":"Feature selection and attribute reduction are crucial problems, and widely used techniques in the field of machine learning, data mining and pattern recognition to overcome the well-known phenomenon of the Curse of Dimensionality, by either selecting a subset of features or removing unrelated ones. This paper presents a new feature selection method that efficiently carries out attribute reduction, thereby selecting the most informative features of a dataset. It consists of two components: 1) a measure for feature subset evaluation, and 2) a search strategy. For the evaluation measure, we have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00068","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-18T00:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0ZwtFAByk6DWed4ax0HA+eR25B/uoj8FZgtHld2pes9N8VBOotsDO4tjuQOwf5P+ozKWeQjxxcrF+1wKBvxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:16:59.255345Z"},"content_sha256":"7df4be8dec3a0465c596cf82f826b6a5b5ae9fbdb853839c782b1fa105949758","schema_version":"1.0","event_id":"sha256:7df4be8dec3a0465c596cf82f826b6a5b5ae9fbdb853839c782b1fa105949758"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/bundle.json","state_url":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/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-08T04:16:59Z","links":{"resolver":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR","bundle":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/bundle.json","state":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G73IJQXRLFNB7YKO6KAWKY7FXR","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":"f0135feb28ff19df798e82389e7456872f884afdb9505bca4fd17f54a93129b2","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T20:38:19Z","title_canon_sha256":"343a28f89261a4b04fe906c7cff15f325bc9a34e4f333e538e5ac51d883da917"},"schema_version":"1.0","source":{"id":"1808.00068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00068","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00068v1","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00068","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"G73IJQXRLFNB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G73IJQXRLFNB7YKO","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G73IJQXR","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:7df4be8dec3a0465c596cf82f826b6a5b5ae9fbdb853839c782b1fa105949758","target":"graph","created_at":"2026-05-18T00:00:08Z","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 and attribute reduction are crucial problems, and widely used techniques in the field of machine learning, data mining and pattern recognition to overcome the well-known phenomenon of the Curse of Dimensionality, by either selecting a subset of features or removing unrelated ones. This paper presents a new feature selection method that efficiently carries out attribute reduction, thereby selecting the most informative features of a dataset. It consists of two components: 1) a measure for feature subset evaluation, and 2) a search strategy. For the evaluation measure, we have ","authors_text":"Chang Wook Ahn, Javad Rahimipour Anaraki, Mahdi Eftekhari, Saeed Samet","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T20:38:19Z","title":"A Fuzzy-Rough based Binary Shuffled Frog Leaping Algorithm for Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00068","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:ee3e5db5dfd964d00dc40fe1e88cd073cfce1833ffa6ab5ea3a3d074054570d4","target":"record","created_at":"2026-05-18T00:00:08Z","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":"f0135feb28ff19df798e82389e7456872f884afdb9505bca4fd17f54a93129b2","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T20:38:19Z","title_canon_sha256":"343a28f89261a4b04fe906c7cff15f325bc9a34e4f333e538e5ac51d883da917"},"schema_version":"1.0","source":{"id":"1808.00068","kind":"arxiv","version":1}},"canonical_sha256":"37f684c2f1595a1fe14ef2816563e5bc76ce58d8fa50f006dced6863270e0dff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37f684c2f1595a1fe14ef2816563e5bc76ce58d8fa50f006dced6863270e0dff","first_computed_at":"2026-05-18T00:00:08.236394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:08.236394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tPdH2lJVGPPCVJoalGzjcIEy7xH65f1FFZifPGbxJulHBca3Iq9Df+MY7/dTNEqz/SpcsONxoDva117NFL0+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:08.237045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee3e5db5dfd964d00dc40fe1e88cd073cfce1833ffa6ab5ea3a3d074054570d4","sha256:7df4be8dec3a0465c596cf82f826b6a5b5ae9fbdb853839c782b1fa105949758"],"state_sha256":"9ab9c891c0d5feb8e1485165549e0a759c6ed9cf5adcbd093b4d4a476114cd67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXUQdKJeoyS2d+W+OglMZVUTBAAUew+MS6fNKPTkQB2pJNzG9Rzo7fiuRw53f0gVokcKA8N6m5PH96IJ53o9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:16:59.259035Z","bundle_sha256":"059dab0c7cf5f7c379d1dd76c29c09f3a01fa39386581760a2ec843a3046c6a5"}}