{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y5GTIQIX3W4BXASW2OUUVASNHU","short_pith_number":"pith:Y5GTIQIX","schema_version":"1.0","canonical_sha256":"c74d344117ddb81b8256d3a94a824d3d0018092911b3599128cc2cc791d7520d","source":{"kind":"arxiv","id":"1608.03226","version":4},"attestation_state":"computed","paper":{"title":"Drift Analysis and Evolutionary Algorithms Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.PR"],"primary_cat":"math.CO","authors_text":"Angelika Steger, Johannes Lengler","submitted_at":"2016-08-10T16:14:57Z","abstract_excerpt":"One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function $f:\\{0,1\\}^n \\to {\\mathbb R}$. The algorithm starts with a random search point $\\xi \\in \\{0,1\\}^n$, and in each round it flips each bit of $\\xi$ with probability $c/n$ independently at random, where $c>0$ is a fixed constant. The thus created offspring $\\xi'$ replaces $\\xi$ if and only if $f(\\xi') \\ge f(\\xi)$. The analysis of the runtime of this simple algorithm on monotone and on linear functions turned out to be highly non-trivial. In this paper we "},"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":"1608.03226","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-10T16:14:57Z","cross_cats_sorted":["cs.NE","math.PR"],"title_canon_sha256":"0bd3cc8635c453fe797096eebb57576080fe25febdd313c75d03479b80eeb107","abstract_canon_sha256":"a1e0d747061b53588073706776e1ad76db48598882c0f86f7c28241786ccdcb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:32.947772Z","signature_b64":"9flz+PjatQ6S07XGAEKzKAyv3OGZMu6R1tXBGmOo9gGySc89fDGHTeYp8oUn/YkxKuTO1GVhUI9L2WtwrlYNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c74d344117ddb81b8256d3a94a824d3d0018092911b3599128cc2cc791d7520d","last_reissued_at":"2026-05-18T00:30:32.947023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:32.947023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drift Analysis and Evolutionary Algorithms Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.PR"],"primary_cat":"math.CO","authors_text":"Angelika Steger, Johannes Lengler","submitted_at":"2016-08-10T16:14:57Z","abstract_excerpt":"One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function $f:\\{0,1\\}^n \\to {\\mathbb R}$. The algorithm starts with a random search point $\\xi \\in \\{0,1\\}^n$, and in each round it flips each bit of $\\xi$ with probability $c/n$ independently at random, where $c>0$ is a fixed constant. The thus created offspring $\\xi'$ replaces $\\xi$ if and only if $f(\\xi') \\ge f(\\xi)$. The analysis of the runtime of this simple algorithm on monotone and on linear functions turned out to be highly non-trivial. In this paper we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03226","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":"1608.03226","created_at":"2026-05-18T00:30:32.947157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03226v4","created_at":"2026-05-18T00:30:32.947157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03226","created_at":"2026-05-18T00:30:32.947157+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5GTIQIX3W4B","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5GTIQIX3W4BXASW","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5GTIQIX","created_at":"2026-05-18T12:30:53.716459+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/Y5GTIQIX3W4BXASW2OUUVASNHU","json":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU.json","graph_json":"https://pith.science/api/pith-number/Y5GTIQIX3W4BXASW2OUUVASNHU/graph.json","events_json":"https://pith.science/api/pith-number/Y5GTIQIX3W4BXASW2OUUVASNHU/events.json","paper":"https://pith.science/paper/Y5GTIQIX"},"agent_actions":{"view_html":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU","download_json":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU.json","view_paper":"https://pith.science/paper/Y5GTIQIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03226&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5GTIQIX3W4BXASW2OUUVASNHU/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5GTIQIX3W4BXASW2OUUVASNHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU/action/storage_attestation","attest_author":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU/action/author_attestation","sign_citation":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU/action/citation_signature","submit_replication":"https://pith.science/pith/Y5GTIQIX3W4BXASW2OUUVASNHU/action/replication_record"}},"created_at":"2026-05-18T00:30:32.947157+00:00","updated_at":"2026-05-18T00:30:32.947157+00:00"}