{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UGW7DXNW3Z3SDCHTLYYYBA32PB","short_pith_number":"pith:UGW7DXNW","schema_version":"1.0","canonical_sha256":"a1adf1ddb6de772188f35e3180837a787cebbf6d10cc764d4ab0ce8e9bef99c8","source":{"kind":"arxiv","id":"1812.00966","version":1},"attestation_state":"computed","paper":{"title":"Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt","submitted_at":"2018-12-03T18:41:38Z","abstract_excerpt":"We analyse the performance of well-known evolutionary algorithms (1+1)EA and (1+$\\lambda$)EA in the prior noise model, where in each fitness evaluation the search point is altered before evaluation with probability $p$. We present refined results for the expected optimisation time of the (1+1)EA and the (1+$\\lambda$)EA on the function LeadingOnes, where bits have to be optimised in sequence. Previous work showed that the (1+1)EA on LeadingOnes runs in polynomial expected time if $p = O((\\log n)/n^2)$ and needs superpolynomial expected time if $p = \\omega((\\log n)/n)$, leaving a huge gap for wh"},"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":"1812.00966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-03T18:41:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"887b47a23c6a5d09ed146417186fe0459e39fec478f835115d3d1042c24bc5c5","abstract_canon_sha256":"d0022aaf0e091cb0be87b04a02a8918eb20a7de094f51a65cc389f0b1f76a6db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.517644Z","signature_b64":"xSwFKeKt0oJFznoWZbZ3eQwpRj8SzJizrJXDU04KuigsoT1pA3wtvtLQ7MOZ9xixSMD0XVMj9E0ynfFHYuYuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1adf1ddb6de772188f35e3180837a787cebbf6d10cc764d4ab0ce8e9bef99c8","last_reissued_at":"2026-05-17T23:59:18.517133Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.517133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt","submitted_at":"2018-12-03T18:41:38Z","abstract_excerpt":"We analyse the performance of well-known evolutionary algorithms (1+1)EA and (1+$\\lambda$)EA in the prior noise model, where in each fitness evaluation the search point is altered before evaluation with probability $p$. We present refined results for the expected optimisation time of the (1+1)EA and the (1+$\\lambda$)EA on the function LeadingOnes, where bits have to be optimised in sequence. Previous work showed that the (1+1)EA on LeadingOnes runs in polynomial expected time if $p = O((\\log n)/n^2)$ and needs superpolynomial expected time if $p = \\omega((\\log n)/n)$, leaving a huge gap for wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00966","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":"1812.00966","created_at":"2026-05-17T23:59:18.517227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00966v1","created_at":"2026-05-17T23:59:18.517227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00966","created_at":"2026-05-17T23:59:18.517227+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGW7DXNW3Z3S","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGW7DXNW3Z3SDCHT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGW7DXNW","created_at":"2026-05-18T12:32:56.356000+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/UGW7DXNW3Z3SDCHTLYYYBA32PB","json":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB.json","graph_json":"https://pith.science/api/pith-number/UGW7DXNW3Z3SDCHTLYYYBA32PB/graph.json","events_json":"https://pith.science/api/pith-number/UGW7DXNW3Z3SDCHTLYYYBA32PB/events.json","paper":"https://pith.science/paper/UGW7DXNW"},"agent_actions":{"view_html":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB","download_json":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB.json","view_paper":"https://pith.science/paper/UGW7DXNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00966&json=true","fetch_graph":"https://pith.science/api/pith-number/UGW7DXNW3Z3SDCHTLYYYBA32PB/graph.json","fetch_events":"https://pith.science/api/pith-number/UGW7DXNW3Z3SDCHTLYYYBA32PB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/action/storage_attestation","attest_author":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/action/author_attestation","sign_citation":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/action/citation_signature","submit_replication":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/action/replication_record"}},"created_at":"2026-05-17T23:59:18.517227+00:00","updated_at":"2026-05-17T23:59:18.517227+00:00"}