{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MKZLRGBLCSLMJWVGDCBVKHEFEW","short_pith_number":"pith:MKZLRGBL","schema_version":"1.0","canonical_sha256":"62b2b8982b1496c4daa61883551c85259926e551a130e34b6670397c1821808b","source":{"kind":"arxiv","id":"1906.09047","version":2},"attestation_state":"computed","paper":{"title":"Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"cs.NE","authors_text":"Carsten Witt, Hsien-Kuei Hwang","submitted_at":"2019-06-21T10:25:39Z","abstract_excerpt":"The expected running time of the classical (1+1) EA on the OneMax benchmark function has recently been determined by Hwang et al. (2018) up to additive errors of $O((\\log n)/n)$. The same approach proposed there also leads to a full asymptotic expansion with errors of the form $O(n^{-K}\\log n)$ for any $K>0$. This precise result is obtained by matched asymptotics with rigorous error analysis (or by solving asymptotically the underlying recurrences via inductive approximation arguments), ideas radically different from well-established techniques for the running time analysis of evolutionary com"},"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":"1906.09047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-06-21T10:25:39Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"b19be5fb5574a816df287bc1cbd3c7f2be6aabbcca2b37f831cdc9198d8db005","abstract_canon_sha256":"ff6563f85bbeec487d81f14899a9fa96c8d9372dcaa39fa9fff8d8522246363b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:32.182417Z","signature_b64":"e+NpyOPZ/BT+Q5BwNUOc6NFEOZYsHkVTs5TSUJgEXJ+naR1jy8VdPssOtEkIzieuRVd73eVEk0BCMdiTmwQfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b2b8982b1496c4daa61883551c85259926e551a130e34b6670397c1821808b","last_reissued_at":"2026-05-17T23:42:32.181784Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:32.181784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"cs.NE","authors_text":"Carsten Witt, Hsien-Kuei Hwang","submitted_at":"2019-06-21T10:25:39Z","abstract_excerpt":"The expected running time of the classical (1+1) EA on the OneMax benchmark function has recently been determined by Hwang et al. (2018) up to additive errors of $O((\\log n)/n)$. The same approach proposed there also leads to a full asymptotic expansion with errors of the form $O(n^{-K}\\log n)$ for any $K>0$. This precise result is obtained by matched asymptotics with rigorous error analysis (or by solving asymptotically the underlying recurrences via inductive approximation arguments), ideas radically different from well-established techniques for the running time analysis of evolutionary com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09047","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":"1906.09047","created_at":"2026-05-17T23:42:32.181880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09047v2","created_at":"2026-05-17T23:42:32.181880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09047","created_at":"2026-05-17T23:42:32.181880+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKZLRGBLCSLM","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKZLRGBLCSLMJWVG","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKZLRGBL","created_at":"2026-05-18T12:33:21.387695+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/MKZLRGBLCSLMJWVGDCBVKHEFEW","json":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW.json","graph_json":"https://pith.science/api/pith-number/MKZLRGBLCSLMJWVGDCBVKHEFEW/graph.json","events_json":"https://pith.science/api/pith-number/MKZLRGBLCSLMJWVGDCBVKHEFEW/events.json","paper":"https://pith.science/paper/MKZLRGBL"},"agent_actions":{"view_html":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW","download_json":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW.json","view_paper":"https://pith.science/paper/MKZLRGBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09047&json=true","fetch_graph":"https://pith.science/api/pith-number/MKZLRGBLCSLMJWVGDCBVKHEFEW/graph.json","fetch_events":"https://pith.science/api/pith-number/MKZLRGBLCSLMJWVGDCBVKHEFEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW/action/storage_attestation","attest_author":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW/action/author_attestation","sign_citation":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW/action/citation_signature","submit_replication":"https://pith.science/pith/MKZLRGBLCSLMJWVGDCBVKHEFEW/action/replication_record"}},"created_at":"2026-05-17T23:42:32.181880+00:00","updated_at":"2026-05-17T23:42:32.181880+00:00"}