{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QM4C7XGAVGT5PDMFOLPEVZGYMX","short_pith_number":"pith:QM4C7XGA","schema_version":"1.0","canonical_sha256":"83382fdcc0a9a7d78d8572de4ae4d865c5f27ff3b3b8c8e6c4c3fbc2731c6898","source":{"kind":"arxiv","id":"1907.05943","version":1},"attestation_state":"computed","paper":{"title":"A Study and Analysis of a Feature Subset Selection Technique using Penguin Search Optimization Algorithm (FS-PeSOA)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Agnip Dasgupta, Aniket Ghosh Dastidar, Antara Barman, Ardhendu Banerjee, Sanjay Chakraborty","submitted_at":"2019-07-13T05:27:57Z","abstract_excerpt":"In today world of enormous amounts of data, it is very important to extract useful knowledge from it. This can be accomplished by feature subset selection. Feature subset selection is a method of selecting a minimum number of features with the help of which our machine can learn and predict which class a particular data belongs to. We will introduce a new adaptive algorithm called Feature selection Penguin Search optimization algorithm which is a metaheuristic approach. It is adapted from the natural hunting strategy of penguins in which a group of penguins take jumps at random depths and come"},"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":"1907.05943","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-07-13T05:27:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"03d3ef07d3784eebc0380b97e2e6d1640a079713b2d14ea592b39419f4ccf974","abstract_canon_sha256":"f8bd6cc36e5e59c6f243062be69162b23218fc9399650ba19674629d387816a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:42.936148Z","signature_b64":"H4hr4BYZEis9slwRNfYXOCGbVk535oO9qXrGAVj7G8l45g6pw6Aq+YlQcjkl5zuqlAoj9WvAAcNPn7OjUaEKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83382fdcc0a9a7d78d8572de4ae4d865c5f27ff3b3b8c8e6c4c3fbc2731c6898","last_reissued_at":"2026-05-17T23:40:42.935517Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:42.935517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Study and Analysis of a Feature Subset Selection Technique using Penguin Search Optimization Algorithm (FS-PeSOA)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Agnip Dasgupta, Aniket Ghosh Dastidar, Antara Barman, Ardhendu Banerjee, Sanjay Chakraborty","submitted_at":"2019-07-13T05:27:57Z","abstract_excerpt":"In today world of enormous amounts of data, it is very important to extract useful knowledge from it. This can be accomplished by feature subset selection. Feature subset selection is a method of selecting a minimum number of features with the help of which our machine can learn and predict which class a particular data belongs to. We will introduce a new adaptive algorithm called Feature selection Penguin Search optimization algorithm which is a metaheuristic approach. It is adapted from the natural hunting strategy of penguins in which a group of penguins take jumps at random depths and come"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05943","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.05943","created_at":"2026-05-17T23:40:42.935604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05943v1","created_at":"2026-05-17T23:40:42.935604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05943","created_at":"2026-05-17T23:40:42.935604+00:00"},{"alias_kind":"pith_short_12","alias_value":"QM4C7XGAVGT5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QM4C7XGAVGT5PDMF","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QM4C7XGA","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX","json":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX.json","graph_json":"https://pith.science/api/pith-number/QM4C7XGAVGT5PDMFOLPEVZGYMX/graph.json","events_json":"https://pith.science/api/pith-number/QM4C7XGAVGT5PDMFOLPEVZGYMX/events.json","paper":"https://pith.science/paper/QM4C7XGA"},"agent_actions":{"view_html":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX","download_json":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX.json","view_paper":"https://pith.science/paper/QM4C7XGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05943&json=true","fetch_graph":"https://pith.science/api/pith-number/QM4C7XGAVGT5PDMFOLPEVZGYMX/graph.json","fetch_events":"https://pith.science/api/pith-number/QM4C7XGAVGT5PDMFOLPEVZGYMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX/action/storage_attestation","attest_author":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX/action/author_attestation","sign_citation":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX/action/citation_signature","submit_replication":"https://pith.science/pith/QM4C7XGAVGT5PDMFOLPEVZGYMX/action/replication_record"}},"created_at":"2026-05-17T23:40:42.935604+00:00","updated_at":"2026-05-17T23:40:42.935604+00:00"}