{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:27PW6K2KPQ4525TLQDHEHD3PYM","short_pith_number":"pith:27PW6K2K","canonical_record":{"source":{"id":"1806.10551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-20T08:31:14Z","cross_cats_sorted":[],"title_canon_sha256":"1bf4b7302166e2ca93bbb103433496a4092d343c53d33b4ebef851749b2722e9","abstract_canon_sha256":"ed56705a80fa8baf61852cb5d666f14e69108219bf4e1bf6d3bdb6e48de71abf"},"schema_version":"1.0"},"canonical_sha256":"d7df6f2b4a7c39dd766b80ce438f6fc331577c83e5a1243b98fba1b60fa148f1","source":{"kind":"arxiv","id":"1806.10551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10551","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10551v1","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10551","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"27PW6K2KPQ45","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"27PW6K2KPQ4525TL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"27PW6K2K","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:27PW6K2KPQ4525TLQDHEHD3PYM","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-20T08:31:14Z","cross_cats_sorted":[],"title_canon_sha256":"1bf4b7302166e2ca93bbb103433496a4092d343c53d33b4ebef851749b2722e9","abstract_canon_sha256":"ed56705a80fa8baf61852cb5d666f14e69108219bf4e1bf6d3bdb6e48de71abf"},"schema_version":"1.0"},"canonical_sha256":"d7df6f2b4a7c39dd766b80ce438f6fc331577c83e5a1243b98fba1b60fa148f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:12.042721Z","signature_b64":"SXeotdZMBJcCBfLIIvITpDOOU+PTsC7IyM3lU+UhFNwemKZjMNlYxuuV74vTRkQM/vZq9L+OvZ2OxU9VHrKcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7df6f2b4a7c39dd766b80ce438f6fc331577c83e5a1243b98fba1b60fa148f1","last_reissued_at":"2026-05-18T00:12:12.042009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:12.042009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10551","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:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pl/6V7DVIHb3CuBPI0Jck2hGnnG/3KhGcRuOMTLgwG5bZKtnGQbEO+uzQpYtJAkj4siFUu2Jyj7M6bk5ZRmJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:24:05.608384Z"},"content_sha256":"da59ee7f22fcbec47e49f249b0c56f5bb38a856895d105380b43f1160cf7eea4","schema_version":"1.0","event_id":"sha256:da59ee7f22fcbec47e49f249b0c56f5bb38a856895d105380b43f1160cf7eea4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:27PW6K2KPQ4525TLQDHEHD3PYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tunable Particle Swarm Size Optimization Algorithm for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Naresh Mallenahalli, T. Hitendra Sarma","submitted_at":"2018-06-20T08:31:14Z","abstract_excerpt":"Feature selection is the process of identifying statistically most relevant features to improve the predictive capabilities of the classifiers. To find the best features subsets, the population based approaches like Particle Swarm Optimization(PSO) and genetic algorithms are being widely employed. However, it is a general observation that not having right set of particles in the swarm may result in sub-optimal solutions, affecting the accuracies of classifiers. To address this issue, we propose a novel tunable swarm size approach to reconfigure the particles in a standard PSO, based on the dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10551","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:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mm2ufM5W/t071CbcoxTj6wCGRuxBcW9/msqv6Eqn5+qAtUIiQYCQrjCNN66LVSibM4vc81ApaqPPgv/zNoaaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:24:05.608740Z"},"content_sha256":"a6a27f9a98360777b8dde3bcbe67bf244aea010e1223e11f5af2b3c2ecf6363a","schema_version":"1.0","event_id":"sha256:a6a27f9a98360777b8dde3bcbe67bf244aea010e1223e11f5af2b3c2ecf6363a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27PW6K2KPQ4525TLQDHEHD3PYM/bundle.json","state_url":"https://pith.science/pith/27PW6K2KPQ4525TLQDHEHD3PYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27PW6K2KPQ4525TLQDHEHD3PYM/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-23T12:24:05Z","links":{"resolver":"https://pith.science/pith/27PW6K2KPQ4525TLQDHEHD3PYM","bundle":"https://pith.science/pith/27PW6K2KPQ4525TLQDHEHD3PYM/bundle.json","state":"https://pith.science/pith/27PW6K2KPQ4525TLQDHEHD3PYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27PW6K2KPQ4525TLQDHEHD3PYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:27PW6K2KPQ4525TLQDHEHD3PYM","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":"ed56705a80fa8baf61852cb5d666f14e69108219bf4e1bf6d3bdb6e48de71abf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-20T08:31:14Z","title_canon_sha256":"1bf4b7302166e2ca93bbb103433496a4092d343c53d33b4ebef851749b2722e9"},"schema_version":"1.0","source":{"id":"1806.10551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10551","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10551v1","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10551","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"27PW6K2KPQ45","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"27PW6K2KPQ4525TL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"27PW6K2K","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a6a27f9a98360777b8dde3bcbe67bf244aea010e1223e11f5af2b3c2ecf6363a","target":"graph","created_at":"2026-05-18T00:12:12Z","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 is the process of identifying statistically most relevant features to improve the predictive capabilities of the classifiers. To find the best features subsets, the population based approaches like Particle Swarm Optimization(PSO) and genetic algorithms are being widely employed. However, it is a general observation that not having right set of particles in the swarm may result in sub-optimal solutions, affecting the accuracies of classifiers. To address this issue, we propose a novel tunable swarm size approach to reconfigure the particles in a standard PSO, based on the dat","authors_text":"Naresh Mallenahalli, T. Hitendra Sarma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-20T08:31:14Z","title":"A Tunable Particle Swarm Size Optimization Algorithm for Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10551","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:da59ee7f22fcbec47e49f249b0c56f5bb38a856895d105380b43f1160cf7eea4","target":"record","created_at":"2026-05-18T00:12:12Z","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":"ed56705a80fa8baf61852cb5d666f14e69108219bf4e1bf6d3bdb6e48de71abf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-20T08:31:14Z","title_canon_sha256":"1bf4b7302166e2ca93bbb103433496a4092d343c53d33b4ebef851749b2722e9"},"schema_version":"1.0","source":{"id":"1806.10551","kind":"arxiv","version":1}},"canonical_sha256":"d7df6f2b4a7c39dd766b80ce438f6fc331577c83e5a1243b98fba1b60fa148f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7df6f2b4a7c39dd766b80ce438f6fc331577c83e5a1243b98fba1b60fa148f1","first_computed_at":"2026-05-18T00:12:12.042009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:12.042009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SXeotdZMBJcCBfLIIvITpDOOU+PTsC7IyM3lU+UhFNwemKZjMNlYxuuV74vTRkQM/vZq9L+OvZ2OxU9VHrKcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:12.042721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da59ee7f22fcbec47e49f249b0c56f5bb38a856895d105380b43f1160cf7eea4","sha256:a6a27f9a98360777b8dde3bcbe67bf244aea010e1223e11f5af2b3c2ecf6363a"],"state_sha256":"ee617055a73ef87888ac96088804d41265e0d4e5306fce5031490468b20d914d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"530LRqE/YfPWSQIWxcXrwnXay47DRKaIz1K67JUKlTCMmS4rp75r/o6bMl3lE6600Uyr08kYCmyuNn0k8xFmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:24:05.610886Z","bundle_sha256":"591cf2ecb50073235ba8167a282d92b9a12b42af3cc62ad0f7f294169332caae"}}