{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y5GTIQIX3W4BXASW2OUUVASNHU","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":"a1e0d747061b53588073706776e1ad76db48598882c0f86f7c28241786ccdcb4","cross_cats_sorted":["cs.NE","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-10T16:14:57Z","title_canon_sha256":"0bd3cc8635c453fe797096eebb57576080fe25febdd313c75d03479b80eeb107"},"schema_version":"1.0","source":{"id":"1608.03226","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03226","created_at":"2026-05-18T00:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03226v4","created_at":"2026-05-18T00:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03226","created_at":"2026-05-18T00:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"Y5GTIQIX3W4B","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y5GTIQIX3W4BXASW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y5GTIQIX","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:b862241d99c6cf775f571fccf084f94305629f2dbff1c73a4456f2c0a5f627a8","target":"graph","created_at":"2026-05-18T00:30:32Z","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":"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 ","authors_text":"Angelika Steger, Johannes Lengler","cross_cats":["cs.NE","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-10T16:14:57Z","title":"Drift Analysis and Evolutionary Algorithms Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03226","kind":"arxiv","version":4},"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:4bb0c05cf2329a824950c4a7ed62127fea400e71501e557cf08b57a7624f80dc","target":"record","created_at":"2026-05-18T00:30:32Z","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":"a1e0d747061b53588073706776e1ad76db48598882c0f86f7c28241786ccdcb4","cross_cats_sorted":["cs.NE","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-10T16:14:57Z","title_canon_sha256":"0bd3cc8635c453fe797096eebb57576080fe25febdd313c75d03479b80eeb107"},"schema_version":"1.0","source":{"id":"1608.03226","kind":"arxiv","version":4}},"canonical_sha256":"c74d344117ddb81b8256d3a94a824d3d0018092911b3599128cc2cc791d7520d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c74d344117ddb81b8256d3a94a824d3d0018092911b3599128cc2cc791d7520d","first_computed_at":"2026-05-18T00:30:32.947023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:32.947023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9flz+PjatQ6S07XGAEKzKAyv3OGZMu6R1tXBGmOo9gGySc89fDGHTeYp8oUn/YkxKuTO1GVhUI9L2WtwrlYNCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:32.947772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03226","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bb0c05cf2329a824950c4a7ed62127fea400e71501e557cf08b57a7624f80dc","sha256:b862241d99c6cf775f571fccf084f94305629f2dbff1c73a4456f2c0a5f627a8"],"state_sha256":"3356cf2af55c213614300d0dc7e624aa16d6af33112f249838ca23698e371f82"}