{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A4WFUTPG72BBKOTR55N3AOFU74","short_pith_number":"pith:A4WFUTPG","schema_version":"1.0","canonical_sha256":"072c5a4de6fe82153a71ef5bb038b4ff2a3445bc5e77772c04d88564f2cfa83f","source":{"kind":"arxiv","id":"1407.7663","version":2},"attestation_state":"computed","paper":{"title":"Level-based Analysis of Genetic Algorithms and other Search Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.NE","authors_text":"Anton V. Eremeev, Dogan Corus, Duc-Cuong Dang, Per Kristian Lehre","submitted_at":"2014-07-29T08:42:04Z","abstract_excerpt":"Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived using a handful of key analytic techniques, including drift analysis. However, since few of these techniques apply effortlessly to population-based EAs, most time-complexity results concern simplified EAs, such as the (1+1) EA.\n  This paper describes the level-based theorem, a new technique tailored to population-based processes. It applies to any non-elitist p"},"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":"1407.7663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-29T08:42:04Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"1b1ea9aab739bb35ab3b120b8f69111cdf088b1c0ab22fd17477fe1b96a0d3dc","abstract_canon_sha256":"fce5eb4365279491ccbc96042c08d92e5469e14bd792ecd17a12e4e6feccc724"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.012332Z","signature_b64":"k1LFM2MjtPCMq4K4Yhju+rKBVHr79xcnXcEVYvE/6kKwrHma3YMwe2ns3r+/aZZ0KlkoG3cWftCh1gEyvw72Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"072c5a4de6fe82153a71ef5bb038b4ff2a3445bc5e77772c04d88564f2cfa83f","last_reissued_at":"2026-05-18T01:01:09.011663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.011663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Level-based Analysis of Genetic Algorithms and other Search Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.NE","authors_text":"Anton V. Eremeev, Dogan Corus, Duc-Cuong Dang, Per Kristian Lehre","submitted_at":"2014-07-29T08:42:04Z","abstract_excerpt":"Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived using a handful of key analytic techniques, including drift analysis. However, since few of these techniques apply effortlessly to population-based EAs, most time-complexity results concern simplified EAs, such as the (1+1) EA.\n  This paper describes the level-based theorem, a new technique tailored to population-based processes. It applies to any non-elitist p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7663","kind":"arxiv","version":2},"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":"1407.7663","created_at":"2026-05-18T01:01:09.011773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7663v2","created_at":"2026-05-18T01:01:09.011773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7663","created_at":"2026-05-18T01:01:09.011773+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4WFUTPG72BB","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4WFUTPG72BBKOTR","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4WFUTPG","created_at":"2026-05-18T12:28:19.803747+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/A4WFUTPG72BBKOTR55N3AOFU74","json":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74.json","graph_json":"https://pith.science/api/pith-number/A4WFUTPG72BBKOTR55N3AOFU74/graph.json","events_json":"https://pith.science/api/pith-number/A4WFUTPG72BBKOTR55N3AOFU74/events.json","paper":"https://pith.science/paper/A4WFUTPG"},"agent_actions":{"view_html":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74","download_json":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74.json","view_paper":"https://pith.science/paper/A4WFUTPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7663&json=true","fetch_graph":"https://pith.science/api/pith-number/A4WFUTPG72BBKOTR55N3AOFU74/graph.json","fetch_events":"https://pith.science/api/pith-number/A4WFUTPG72BBKOTR55N3AOFU74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/action/storage_attestation","attest_author":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/action/author_attestation","sign_citation":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/action/citation_signature","submit_replication":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/action/replication_record"}},"created_at":"2026-05-18T01:01:09.011773+00:00","updated_at":"2026-05-18T01:01:09.011773+00:00"}