{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6RIAK3XJQVY2XPPNC7ZRNJXLJA","short_pith_number":"pith:6RIAK3XJ","schema_version":"1.0","canonical_sha256":"f450056ee98571abbded17f316a6eb482d8bb8074efd481d2ff7d488aee50a7b","source":{"kind":"arxiv","id":"1109.1504","version":2},"attestation_state":"computed","paper":{"title":"A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt","submitted_at":"2011-09-07T16:08:28Z","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"},"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":"1109.1504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-09-07T16:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"323b5473ab93f0f349386c8ec615c0d47e224a3f01cce99e333c13c37fb2e7be","abstract_canon_sha256":"4e58f2e678a3eff62cd5a586446a51c715463f6d6a10cec839b122c845f158ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.876696Z","signature_b64":"YyKP8oerPDQIlMULeEt1ZLPig7EW+/n2KQpSbW2d47C7TiwSY+YSdoOdChNZVK3F/OoXzkhvXO51hge4ybStBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f450056ee98571abbded17f316a6eb482d8bb8074efd481d2ff7d488aee50a7b","last_reissued_at":"2026-05-18T02:21:36.876251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.876251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt","submitted_at":"2011-09-07T16:08:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1504","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":"1109.1504","created_at":"2026-05-18T02:21:36.876328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1504v2","created_at":"2026-05-18T02:21:36.876328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1504","created_at":"2026-05-18T02:21:36.876328+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RIAK3XJQVY2","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RIAK3XJQVY2XPPN","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RIAK3XJ","created_at":"2026-05-18T12:26:22.705136+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/6RIAK3XJQVY2XPPNC7ZRNJXLJA","json":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA.json","graph_json":"https://pith.science/api/pith-number/6RIAK3XJQVY2XPPNC7ZRNJXLJA/graph.json","events_json":"https://pith.science/api/pith-number/6RIAK3XJQVY2XPPNC7ZRNJXLJA/events.json","paper":"https://pith.science/paper/6RIAK3XJ"},"agent_actions":{"view_html":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA","download_json":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA.json","view_paper":"https://pith.science/paper/6RIAK3XJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1504&json=true","fetch_graph":"https://pith.science/api/pith-number/6RIAK3XJQVY2XPPNC7ZRNJXLJA/graph.json","fetch_events":"https://pith.science/api/pith-number/6RIAK3XJQVY2XPPNC7ZRNJXLJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA/action/storage_attestation","attest_author":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA/action/author_attestation","sign_citation":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA/action/citation_signature","submit_replication":"https://pith.science/pith/6RIAK3XJQVY2XPPNC7ZRNJXLJA/action/replication_record"}},"created_at":"2026-05-18T02:21:36.876328+00:00","updated_at":"2026-05-18T02:21:36.876328+00:00"}