{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:MH3T3CQ24W2CVNJLCDU6DQPV5G","short_pith_number":"pith:MH3T3CQ2","schema_version":"1.0","canonical_sha256":"61f73d8a1ae5b42ab52b10e9e1c1f5e9906d984065179a72602a5f50b7bda2d7","source":{"kind":"arxiv","id":"1011.4028","version":4},"attestation_state":"computed","paper":{"title":"On the approximation ability of evolutionary optimization with application to minimum set cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Xin Yao, Yang Yu, Zhi-Hua Zhou","submitted_at":"2010-11-17T19:08:42Z","abstract_excerpt":"Evolutionary algorithms (EAs) are heuristic algorithms inspired by natural evolution. They are often used to obtain satisficing solutions in practice. In this paper, we investigate a largely underexplored issue: the approximation performance of EAs in terms of how close the solution obtained is to an optimal solution. We study an EA framework named simple EA with isolated population (SEIP) that can be implemented as a single- or multi-objective EA. We analyze the approximation performance of SEIP using the partial ratio, which characterizes the approximation ratio that can be guaranteed. Speci"},"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":"1011.4028","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-11-17T19:08:42Z","cross_cats_sorted":[],"title_canon_sha256":"89ac90d928a00d9f7d7fc847e2232b582e6ad0a57ff2377e95dd6c1eb2fbef1b","abstract_canon_sha256":"f870474bb8c28cccead3f04a2fedaaa9bb1e83482438790c9f56bf2d0f5502e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.387123Z","signature_b64":"vNKALfljJobnf7eXh5WqiLIiOMXHbbMAPrtYSDC1JsTGHZiQHKumz+AIM/EJSdiJ0lTH34W4gaY30jDt1SxZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f73d8a1ae5b42ab52b10e9e1c1f5e9906d984065179a72602a5f50b7bda2d7","last_reissued_at":"2026-05-18T02:23:36.386511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.386511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the approximation ability of evolutionary optimization with application to minimum set cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Xin Yao, Yang Yu, Zhi-Hua Zhou","submitted_at":"2010-11-17T19:08:42Z","abstract_excerpt":"Evolutionary algorithms (EAs) are heuristic algorithms inspired by natural evolution. They are often used to obtain satisficing solutions in practice. In this paper, we investigate a largely underexplored issue: the approximation performance of EAs in terms of how close the solution obtained is to an optimal solution. We study an EA framework named simple EA with isolated population (SEIP) that can be implemented as a single- or multi-objective EA. We analyze the approximation performance of SEIP using the partial ratio, which characterizes the approximation ratio that can be guaranteed. Speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4028","kind":"arxiv","version":4},"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":"1011.4028","created_at":"2026-05-18T02:23:36.386602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4028v4","created_at":"2026-05-18T02:23:36.386602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4028","created_at":"2026-05-18T02:23:36.386602+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH3T3CQ24W2C","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH3T3CQ24W2CVNJL","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH3T3CQ2","created_at":"2026-05-18T12:26:10.704358+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/MH3T3CQ24W2CVNJLCDU6DQPV5G","json":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G.json","graph_json":"https://pith.science/api/pith-number/MH3T3CQ24W2CVNJLCDU6DQPV5G/graph.json","events_json":"https://pith.science/api/pith-number/MH3T3CQ24W2CVNJLCDU6DQPV5G/events.json","paper":"https://pith.science/paper/MH3T3CQ2"},"agent_actions":{"view_html":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G","download_json":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G.json","view_paper":"https://pith.science/paper/MH3T3CQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4028&json=true","fetch_graph":"https://pith.science/api/pith-number/MH3T3CQ24W2CVNJLCDU6DQPV5G/graph.json","fetch_events":"https://pith.science/api/pith-number/MH3T3CQ24W2CVNJLCDU6DQPV5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G/action/storage_attestation","attest_author":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G/action/author_attestation","sign_citation":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G/action/citation_signature","submit_replication":"https://pith.science/pith/MH3T3CQ24W2CVNJLCDU6DQPV5G/action/replication_record"}},"created_at":"2026-05-18T02:23:36.386602+00:00","updated_at":"2026-05-18T02:23:36.386602+00:00"}