{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OUBW5RN7GAARIXGTLFAGI6X7ZP","short_pith_number":"pith:OUBW5RN7","schema_version":"1.0","canonical_sha256":"75036ec5bf3001145cd35940647affcbef89350ea00cb0c552755fede561f613","source":{"kind":"arxiv","id":"1708.01146","version":1},"attestation_state":"computed","paper":{"title":"Preselection via Classification: A Case Study on Evolutionary Multiobjective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Aimin Zhou, Guixu Zhang, Jinyuan Zhang, Ke Tang","submitted_at":"2017-08-03T14:02:21Z","abstract_excerpt":"In evolutionary algorithms, a preselection operator aims to select the promising offspring solutions from a candidate offspring set. It is usually based on the estimated or real objective values of the candidate offspring solutions. In a sense, the preselection can be treated as a classification procedure, which classifies the candidate offspring solutions into promising ones and unpromising ones. Following this idea, we propose a classification based preselection (CPS) strategy for evolutionary multiobjective optimization. When applying classification based preselection, an evolutionary algor"},"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":"1708.01146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-03T14:02:21Z","cross_cats_sorted":[],"title_canon_sha256":"d41f1edb9edd662d85597ea643c5a41659f383fa0cb78c6639ec57d61b61b145","abstract_canon_sha256":"7c4cc9ac81c3b9eeb6b3c7d924c7e8590c3e7dc3b154ce2d401d0885fbf8b41f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.519631Z","signature_b64":"PyirllRO9liJd/8yvm/0pRzk6nIHJvRWC+47eyciwMcnPq/MOOCNEIDolpt/B/aTylS1rR6JmYWLxN9Rzv1iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75036ec5bf3001145cd35940647affcbef89350ea00cb0c552755fede561f613","last_reissued_at":"2026-05-18T00:38:40.519029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.519029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preselection via Classification: A Case Study on Evolutionary Multiobjective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Aimin Zhou, Guixu Zhang, Jinyuan Zhang, Ke Tang","submitted_at":"2017-08-03T14:02:21Z","abstract_excerpt":"In evolutionary algorithms, a preselection operator aims to select the promising offspring solutions from a candidate offspring set. It is usually based on the estimated or real objective values of the candidate offspring solutions. In a sense, the preselection can be treated as a classification procedure, which classifies the candidate offspring solutions into promising ones and unpromising ones. Following this idea, we propose a classification based preselection (CPS) strategy for evolutionary multiobjective optimization. When applying classification based preselection, an evolutionary algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01146","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":"1708.01146","created_at":"2026-05-18T00:38:40.519122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01146v1","created_at":"2026-05-18T00:38:40.519122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01146","created_at":"2026-05-18T00:38:40.519122+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUBW5RN7GAAR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUBW5RN7GAARIXGT","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUBW5RN7","created_at":"2026-05-18T12:31:34.259226+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/OUBW5RN7GAARIXGTLFAGI6X7ZP","json":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP.json","graph_json":"https://pith.science/api/pith-number/OUBW5RN7GAARIXGTLFAGI6X7ZP/graph.json","events_json":"https://pith.science/api/pith-number/OUBW5RN7GAARIXGTLFAGI6X7ZP/events.json","paper":"https://pith.science/paper/OUBW5RN7"},"agent_actions":{"view_html":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP","download_json":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP.json","view_paper":"https://pith.science/paper/OUBW5RN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01146&json=true","fetch_graph":"https://pith.science/api/pith-number/OUBW5RN7GAARIXGTLFAGI6X7ZP/graph.json","fetch_events":"https://pith.science/api/pith-number/OUBW5RN7GAARIXGTLFAGI6X7ZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/action/storage_attestation","attest_author":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/action/author_attestation","sign_citation":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/action/citation_signature","submit_replication":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/action/replication_record"}},"created_at":"2026-05-18T00:38:40.519122+00:00","updated_at":"2026-05-18T00:38:40.519122+00:00"}