{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QVXHBIGHLJYX2G5SCYI4JUKCXL","short_pith_number":"pith:QVXHBIGH","schema_version":"1.0","canonical_sha256":"856e70a0c75a717d1bb21611c4d142bae34f1eb581f126600109420a23fb819d","source":{"kind":"arxiv","id":"1811.12824","version":1},"attestation_state":"computed","paper":{"title":"Runtime Analysis for Self-adaptive Mutation Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG"],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carsten Witt, Jing Yang","submitted_at":"2018-11-30T14:38:05Z","abstract_excerpt":"We propose and analyze a self-adaptive version of the $(1,\\lambda)$ evolutionary algorithm in which the current mutation rate is part of the individual and thus also subject to mutation. A rigorous runtime analysis on the OneMax benchmark function reveals that a simple local mutation scheme for the rate leads to an expected optimization time (number of fitness evaluations) of $O(n\\lambda/\\log\\lambda+n\\log n)$ when $\\lambda$ is at least $C \\ln n$ for some constant $C > 0$. For all values of $\\lambda \\ge C \\ln n$, this performance is asymptotically best possible among all $\\lambda$-parallel muta"},"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":"1811.12824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-30T14:38:05Z","cross_cats_sorted":["cs.AI","cs.DS","cs.LG"],"title_canon_sha256":"7a2315a4d142ee17342335dcdca24ac61cfab35084a15cb371c517007c1b0804","abstract_canon_sha256":"5340402784a08d96743e7a03ab1323d50c7e7cd60ac7582875c28c478ba66335"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:28.373830Z","signature_b64":"tMketZh7LojTqDpDbh16zYXksrJYx04vdka04ghHY8Fm9okNSy5SjgTBczmzawksc7V1/8q9lOhY5KcahgDHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"856e70a0c75a717d1bb21611c4d142bae34f1eb581f126600109420a23fb819d","last_reissued_at":"2026-05-17T23:59:28.373128Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:28.373128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Runtime Analysis for Self-adaptive Mutation Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG"],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carsten Witt, Jing Yang","submitted_at":"2018-11-30T14:38:05Z","abstract_excerpt":"We propose and analyze a self-adaptive version of the $(1,\\lambda)$ evolutionary algorithm in which the current mutation rate is part of the individual and thus also subject to mutation. A rigorous runtime analysis on the OneMax benchmark function reveals that a simple local mutation scheme for the rate leads to an expected optimization time (number of fitness evaluations) of $O(n\\lambda/\\log\\lambda+n\\log n)$ when $\\lambda$ is at least $C \\ln n$ for some constant $C > 0$. For all values of $\\lambda \\ge C \\ln n$, this performance is asymptotically best possible among all $\\lambda$-parallel muta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12824","kind":"arxiv","version":1},"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":"1811.12824","created_at":"2026-05-17T23:59:28.373238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12824v1","created_at":"2026-05-17T23:59:28.373238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12824","created_at":"2026-05-17T23:59:28.373238+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVXHBIGHLJYX","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVXHBIGHLJYX2G5S","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVXHBIGH","created_at":"2026-05-18T12:32:46.962924+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/QVXHBIGHLJYX2G5SCYI4JUKCXL","json":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL.json","graph_json":"https://pith.science/api/pith-number/QVXHBIGHLJYX2G5SCYI4JUKCXL/graph.json","events_json":"https://pith.science/api/pith-number/QVXHBIGHLJYX2G5SCYI4JUKCXL/events.json","paper":"https://pith.science/paper/QVXHBIGH"},"agent_actions":{"view_html":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL","download_json":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL.json","view_paper":"https://pith.science/paper/QVXHBIGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12824&json=true","fetch_graph":"https://pith.science/api/pith-number/QVXHBIGHLJYX2G5SCYI4JUKCXL/graph.json","fetch_events":"https://pith.science/api/pith-number/QVXHBIGHLJYX2G5SCYI4JUKCXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL/action/storage_attestation","attest_author":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL/action/author_attestation","sign_citation":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL/action/citation_signature","submit_replication":"https://pith.science/pith/QVXHBIGHLJYX2G5SCYI4JUKCXL/action/replication_record"}},"created_at":"2026-05-17T23:59:28.373238+00:00","updated_at":"2026-05-17T23:59:28.373238+00:00"}