{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6RIAK3XJQVY2XPPNC7ZRNJXLJA","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":"4e58f2e678a3eff62cd5a586446a51c715463f6d6a10cec839b122c845f158ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-09-07T16:08:28Z","title_canon_sha256":"323b5473ab93f0f349386c8ec615c0d47e224a3f01cce99e333c13c37fb2e7be"},"schema_version":"1.0","source":{"id":"1109.1504","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1504","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1504v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1504","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"6RIAK3XJQVY2","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6RIAK3XJQVY2XPPN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6RIAK3XJ","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:24300b9e3e756279f1738ea18f68210a1b36cf5d8a1ebe138d87115231439c21","target":"graph","created_at":"2026-05-18T02:21:36Z","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":"We present a new method for proving lower bounds on the expected running time of evolutionary algorithms. It is based on fitness-level partitions and an additional condition on transition probabilities between fitness levels. The method is versatile, intuitive, elegant, and very powerful. It yields exact or near-exact lower bounds for LO, OneMax, long k-paths, and all functions with a unique optimum. Most lower bounds are very general: they hold for all evolutionary algorithms that only use bit-flip mutation as variation operator---i.e. for all selection operators and population models. The lo","authors_text":"Dirk Sudholt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-09-07T16:08:28Z","title":"A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1504","kind":"arxiv","version":2},"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:ba96850fe160494f016cd4d3a838def3b89155b57af92f36ca1fd2dd9af2cc50","target":"record","created_at":"2026-05-18T02:21:36Z","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":"4e58f2e678a3eff62cd5a586446a51c715463f6d6a10cec839b122c845f158ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-09-07T16:08:28Z","title_canon_sha256":"323b5473ab93f0f349386c8ec615c0d47e224a3f01cce99e333c13c37fb2e7be"},"schema_version":"1.0","source":{"id":"1109.1504","kind":"arxiv","version":2}},"canonical_sha256":"f450056ee98571abbded17f316a6eb482d8bb8074efd481d2ff7d488aee50a7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f450056ee98571abbded17f316a6eb482d8bb8074efd481d2ff7d488aee50a7b","first_computed_at":"2026-05-18T02:21:36.876251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.876251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YyKP8oerPDQIlMULeEt1ZLPig7EW+/n2KQpSbW2d47C7TiwSY+YSdoOdChNZVK3F/OoXzkhvXO51hge4ybStBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.876696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1504","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba96850fe160494f016cd4d3a838def3b89155b57af92f36ca1fd2dd9af2cc50","sha256:24300b9e3e756279f1738ea18f68210a1b36cf5d8a1ebe138d87115231439c21"],"state_sha256":"2f22d21d2e2fd80064909db299aee310b4dbc8c33d41d0e372db805301f45679"}