{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VKQCU7DZR3GEKAJAVYTJ5EMOOA","short_pith_number":"pith:VKQCU7DZ","schema_version":"1.0","canonical_sha256":"aaa02a7c798ecc450120ae269e918e701162ccd60f4e6c70bef55ccf724a1ec3","source":{"kind":"arxiv","id":"1606.03326","version":1},"attestation_state":"computed","paper":{"title":"A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NE","authors_text":"Chao Qian, Yang Yu, Zhi-Hua Zhou","submitted_at":"2016-06-10T13:59:16Z","abstract_excerpt":"Evolutionary algorithms (EAs) are population-based general-purpose optimization algorithms, and have been successfully applied in various real-world optimization tasks. However, previous theoretical studies often employ EAs with only a parent or offspring population and focus on specific problems. Furthermore, they often only show upper bounds on the running time, while lower bounds are also necessary to get a complete understanding of an algorithm. In this paper, we analyze the running time of the ($\\mu$+$\\lambda$)-EA (a general population-based EA with mutation only) on the class of pseudo-B"},"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":"1606.03326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T13:59:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5c75c8bd75f45ddbf433d88a434ca552697b57b86caae316c58eb47dc78d2461","abstract_canon_sha256":"f1f0747d2fce0aedb3f1c38bfbf41c8c02666d029606361cd40f591b3f3e8823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.129172Z","signature_b64":"x+DpJMrxAKoFQREwKfFSEhhZcWNrFfd3jKVP00qJh/2ZOXXZ4hy2IpQF35XT8exUrt0CAuz3YT8Ze9FrJKnOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa02a7c798ecc450120ae269e918e701162ccd60f4e6c70bef55ccf724a1ec3","last_reissued_at":"2026-05-18T01:12:37.128803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.128803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NE","authors_text":"Chao Qian, Yang Yu, Zhi-Hua Zhou","submitted_at":"2016-06-10T13:59:16Z","abstract_excerpt":"Evolutionary algorithms (EAs) are population-based general-purpose optimization algorithms, and have been successfully applied in various real-world optimization tasks. However, previous theoretical studies often employ EAs with only a parent or offspring population and focus on specific problems. Furthermore, they often only show upper bounds on the running time, while lower bounds are also necessary to get a complete understanding of an algorithm. In this paper, we analyze the running time of the ($\\mu$+$\\lambda$)-EA (a general population-based EA with mutation only) on the class of pseudo-B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03326","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":"1606.03326","created_at":"2026-05-18T01:12:37.128857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03326v1","created_at":"2026-05-18T01:12:37.128857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03326","created_at":"2026-05-18T01:12:37.128857+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKQCU7DZR3GE","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKQCU7DZR3GEKAJA","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKQCU7DZ","created_at":"2026-05-18T12:30:48.956258+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/VKQCU7DZR3GEKAJAVYTJ5EMOOA","json":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA.json","graph_json":"https://pith.science/api/pith-number/VKQCU7DZR3GEKAJAVYTJ5EMOOA/graph.json","events_json":"https://pith.science/api/pith-number/VKQCU7DZR3GEKAJAVYTJ5EMOOA/events.json","paper":"https://pith.science/paper/VKQCU7DZ"},"agent_actions":{"view_html":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA","download_json":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA.json","view_paper":"https://pith.science/paper/VKQCU7DZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03326&json=true","fetch_graph":"https://pith.science/api/pith-number/VKQCU7DZR3GEKAJAVYTJ5EMOOA/graph.json","fetch_events":"https://pith.science/api/pith-number/VKQCU7DZR3GEKAJAVYTJ5EMOOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/action/storage_attestation","attest_author":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/action/author_attestation","sign_citation":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/action/citation_signature","submit_replication":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/action/replication_record"}},"created_at":"2026-05-18T01:12:37.128857+00:00","updated_at":"2026-05-18T01:12:37.128857+00:00"}