{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IYNACOCSB5CGVSILQDWYMRNWJN","short_pith_number":"pith:IYNACOCS","schema_version":"1.0","canonical_sha256":"461a0138520f446ac90b80ed8645b64b4eb4825d653186e4fbe91e053fc96e81","source":{"kind":"arxiv","id":"1804.09891","version":1},"attestation_state":"computed","paper":{"title":"Optimal-margin evolutionary classifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"David C. Reutens, Mohammad Reza Bonyadi","submitted_at":"2018-04-26T05:29:45Z","abstract_excerpt":"We introduce a novel approach for discriminative classification using evolutionary algorithms. We first propose an algorithm to optimize the total loss value using a modified 0-1 loss function in a one-dimensional space for classification. We then extend this algorithm for multi-dimensional classification using an evolutionary algorithm. The proposed evolutionary algorithm aims to find a hyperplane which best classifies instances while minimizes the classification risk. We test particle swarm optimization, evolutionary strategy, and covariance matrix adaptation evolutionary strategy for optimi"},"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":"1804.09891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-26T05:29:45Z","cross_cats_sorted":[],"title_canon_sha256":"de46b3b39eeb1b00722cf54ae4533b29813a6bc68158b91d697cd9230bb02584","abstract_canon_sha256":"00ea471aae3481324bb92f2abc2b7ddb53fe9fc6eb69d8a1e540f24d6bbd74f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:27.554453Z","signature_b64":"Dfq7d/1hE4uS1tjtLec/trdHAr6zVTfJY7nWf7RAYOF48SjC3POmg5XbM06gQSkXuivJpQ/kdYQ3VgrAh0myAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"461a0138520f446ac90b80ed8645b64b4eb4825d653186e4fbe91e053fc96e81","last_reissued_at":"2026-05-18T00:17:27.553756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:27.553756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal-margin evolutionary classifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"David C. Reutens, Mohammad Reza Bonyadi","submitted_at":"2018-04-26T05:29:45Z","abstract_excerpt":"We introduce a novel approach for discriminative classification using evolutionary algorithms. We first propose an algorithm to optimize the total loss value using a modified 0-1 loss function in a one-dimensional space for classification. We then extend this algorithm for multi-dimensional classification using an evolutionary algorithm. The proposed evolutionary algorithm aims to find a hyperplane which best classifies instances while minimizes the classification risk. We test particle swarm optimization, evolutionary strategy, and covariance matrix adaptation evolutionary strategy for optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09891","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":"1804.09891","created_at":"2026-05-18T00:17:27.553874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09891v1","created_at":"2026-05-18T00:17:27.553874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09891","created_at":"2026-05-18T00:17:27.553874+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYNACOCSB5CG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYNACOCSB5CGVSIL","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYNACOCS","created_at":"2026-05-18T12:32:31.084164+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/IYNACOCSB5CGVSILQDWYMRNWJN","json":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN.json","graph_json":"https://pith.science/api/pith-number/IYNACOCSB5CGVSILQDWYMRNWJN/graph.json","events_json":"https://pith.science/api/pith-number/IYNACOCSB5CGVSILQDWYMRNWJN/events.json","paper":"https://pith.science/paper/IYNACOCS"},"agent_actions":{"view_html":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN","download_json":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN.json","view_paper":"https://pith.science/paper/IYNACOCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09891&json=true","fetch_graph":"https://pith.science/api/pith-number/IYNACOCSB5CGVSILQDWYMRNWJN/graph.json","fetch_events":"https://pith.science/api/pith-number/IYNACOCSB5CGVSILQDWYMRNWJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN/action/storage_attestation","attest_author":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN/action/author_attestation","sign_citation":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN/action/citation_signature","submit_replication":"https://pith.science/pith/IYNACOCSB5CGVSILQDWYMRNWJN/action/replication_record"}},"created_at":"2026-05-18T00:17:27.553874+00:00","updated_at":"2026-05-18T00:17:27.553874+00:00"}