{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OUBW5RN7GAARIXGTLFAGI6X7ZP","short_pith_number":"pith:OUBW5RN7","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"},"canonical_sha256":"75036ec5bf3001145cd35940647affcbef89350ea00cb0c552755fede561f613","source":{"kind":"arxiv","id":"1708.01146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01146","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01146v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01146","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"OUBW5RN7GAAR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUBW5RN7GAARIXGT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUBW5RN7","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OUBW5RN7GAARIXGTLFAGI6X7ZP","target":"record","payload":{"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"},"canonical_sha256":"75036ec5bf3001145cd35940647affcbef89350ea00cb0c552755fede561f613","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"},"source_kind":"arxiv","source_id":"1708.01146","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:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNjWpKAYtEG9+3Tew515n958DU/nFhWQUFiig3ei4TB1erMthL6JALnj3T8tH/eFfXv6YiDyJhfzXEcggl9xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:50:14.588175Z"},"content_sha256":"e8b5ce60c91b45c29857997304390186f4e436a4b10380e0c8bd87fa36a8d632","schema_version":"1.0","event_id":"sha256:e8b5ce60c91b45c29857997304390186f4e436a4b10380e0c8bd87fa36a8d632"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OUBW5RN7GAARIXGTLFAGI6X7ZP","target":"graph","payload":{"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"},"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:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zianKgKLbOfRThfkQMDso8eGaUm5QTHYm1t8KYIxXCDOG6t5Wt5DJHmbvZ0IC3A0Z87wEurDemXVBj2s8wjxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:50:14.588782Z"},"content_sha256":"4b855162604506c9e98dae1b2ffd98c682f928e982dffb6670dccdfda5fa0901","schema_version":"1.0","event_id":"sha256:4b855162604506c9e98dae1b2ffd98c682f928e982dffb6670dccdfda5fa0901"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/bundle.json","state_url":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/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-07-02T00:50:14Z","links":{"resolver":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP","bundle":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/bundle.json","state":"https://pith.science/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUBW5RN7GAARIXGTLFAGI6X7ZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OUBW5RN7GAARIXGTLFAGI6X7ZP","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":"7c4cc9ac81c3b9eeb6b3c7d924c7e8590c3e7dc3b154ce2d401d0885fbf8b41f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-03T14:02:21Z","title_canon_sha256":"d41f1edb9edd662d85597ea643c5a41659f383fa0cb78c6639ec57d61b61b145"},"schema_version":"1.0","source":{"id":"1708.01146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01146","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01146v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01146","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"OUBW5RN7GAAR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUBW5RN7GAARIXGT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUBW5RN7","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:4b855162604506c9e98dae1b2ffd98c682f928e982dffb6670dccdfda5fa0901","target":"graph","created_at":"2026-05-18T00:38:40Z","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":"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","authors_text":"Aimin Zhou, Guixu Zhang, Jinyuan Zhang, Ke Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-03T14:02:21Z","title":"Preselection via Classification: A Case Study on Evolutionary Multiobjective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01146","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:e8b5ce60c91b45c29857997304390186f4e436a4b10380e0c8bd87fa36a8d632","target":"record","created_at":"2026-05-18T00:38:40Z","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":"7c4cc9ac81c3b9eeb6b3c7d924c7e8590c3e7dc3b154ce2d401d0885fbf8b41f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-03T14:02:21Z","title_canon_sha256":"d41f1edb9edd662d85597ea643c5a41659f383fa0cb78c6639ec57d61b61b145"},"schema_version":"1.0","source":{"id":"1708.01146","kind":"arxiv","version":1}},"canonical_sha256":"75036ec5bf3001145cd35940647affcbef89350ea00cb0c552755fede561f613","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75036ec5bf3001145cd35940647affcbef89350ea00cb0c552755fede561f613","first_computed_at":"2026-05-18T00:38:40.519029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.519029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PyirllRO9liJd/8yvm/0pRzk6nIHJvRWC+47eyciwMcnPq/MOOCNEIDolpt/B/aTylS1rR6JmYWLxN9Rzv1iCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.519631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8b5ce60c91b45c29857997304390186f4e436a4b10380e0c8bd87fa36a8d632","sha256:4b855162604506c9e98dae1b2ffd98c682f928e982dffb6670dccdfda5fa0901"],"state_sha256":"6908b8909ff09a77f1b400bdd86bb1a223ac425bf2c444f2f68e7344528894ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0luVkA0baGDr2Qd3h31nHYUS/K3tjxsNeHRgPMEV4yTKJ315BZJ2A1ugy9SN/NW2K2FkKRg0D5xvCk5lI1isBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T00:50:14.591961Z","bundle_sha256":"ba6afb524bbb019f67e87db135cb3edebf39087f243d2c6ad43e70bc7793543a"}}