{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UGW7DXNW3Z3SDCHTLYYYBA32PB","short_pith_number":"pith:UGW7DXNW","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"},"canonical_sha256":"a1adf1ddb6de772188f35e3180837a787cebbf6d10cc764d4ab0ce8e9bef99c8","source":{"kind":"arxiv","id":"1812.00966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00966","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00966v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00966","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"UGW7DXNW3Z3S","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UGW7DXNW3Z3SDCHT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UGW7DXNW","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UGW7DXNW3Z3SDCHTLYYYBA32PB","target":"record","payload":{"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"},"canonical_sha256":"a1adf1ddb6de772188f35e3180837a787cebbf6d10cc764d4ab0ce8e9bef99c8","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"},"source_kind":"arxiv","source_id":"1812.00966","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UtLhr3PQrkk3bfkf8aiO5cPYvNjFMt8FvkqqJfGdZ1K+uaT4tAtOd7IaymlxTzM1FuM5NIQVNBkaMJU7Hb67DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:05:43.543974Z"},"content_sha256":"2edb0d2967ba4df0680aa08cc9b82929a1eab477fcde29fd40ad2ab3afb8539f","schema_version":"1.0","event_id":"sha256:2edb0d2967ba4df0680aa08cc9b82929a1eab477fcde29fd40ad2ab3afb8539f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UGW7DXNW3Z3SDCHTLYYYBA32PB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzszwiA8LMXu/1Wvslw3Zvb7Vz+g4JBMMQAX9r57LEQnVV0EpmwOj2YZwk2jch2aUG5+Dm0W9KuDspUuOd/1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:05:43.544774Z"},"content_sha256":"137f6dfa549f18dd7be2e4e8648802f82c96283a5972f12d4b5c4bb9e441275a","schema_version":"1.0","event_id":"sha256:137f6dfa549f18dd7be2e4e8648802f82c96283a5972f12d4b5c4bb9e441275a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/bundle.json","state_url":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T21:05:43Z","links":{"resolver":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB","bundle":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/bundle.json","state":"https://pith.science/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGW7DXNW3Z3SDCHTLYYYBA32PB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UGW7DXNW3Z3SDCHTLYYYBA32PB","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":"d0022aaf0e091cb0be87b04a02a8918eb20a7de094f51a65cc389f0b1f76a6db","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-03T18:41:38Z","title_canon_sha256":"887b47a23c6a5d09ed146417186fe0459e39fec478f835115d3d1042c24bc5c5"},"schema_version":"1.0","source":{"id":"1812.00966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00966","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00966v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00966","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"UGW7DXNW3Z3S","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UGW7DXNW3Z3SDCHT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UGW7DXNW","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:137f6dfa549f18dd7be2e4e8648802f82c96283a5972f12d4b5c4bb9e441275a","target":"graph","created_at":"2026-05-17T23:59:18Z","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 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","authors_text":"Dirk Sudholt","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-03T18:41:38Z","title":"Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00966","kind":"arxiv","version":1},"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:2edb0d2967ba4df0680aa08cc9b82929a1eab477fcde29fd40ad2ab3afb8539f","target":"record","created_at":"2026-05-17T23:59:18Z","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":"d0022aaf0e091cb0be87b04a02a8918eb20a7de094f51a65cc389f0b1f76a6db","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-03T18:41:38Z","title_canon_sha256":"887b47a23c6a5d09ed146417186fe0459e39fec478f835115d3d1042c24bc5c5"},"schema_version":"1.0","source":{"id":"1812.00966","kind":"arxiv","version":1}},"canonical_sha256":"a1adf1ddb6de772188f35e3180837a787cebbf6d10cc764d4ab0ce8e9bef99c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1adf1ddb6de772188f35e3180837a787cebbf6d10cc764d4ab0ce8e9bef99c8","first_computed_at":"2026-05-17T23:59:18.517133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.517133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xSwFKeKt0oJFznoWZbZ3eQwpRj8SzJizrJXDU04KuigsoT1pA3wtvtLQ7MOZ9xixSMD0XVMj9E0ynfFHYuYuBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.517644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2edb0d2967ba4df0680aa08cc9b82929a1eab477fcde29fd40ad2ab3afb8539f","sha256:137f6dfa549f18dd7be2e4e8648802f82c96283a5972f12d4b5c4bb9e441275a"],"state_sha256":"6e09c2f250dd70a368eb843fb8f2c3721775dc5e33cadd36000e31b8a588c6da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRmtN9meUFRT11MuQVHmyQJ5tjkMk4D8MjxPW9Y63Xol7R6PYEe7PTZq1EhDh5RuZ8xvTsVjFBGfJTCwZv7jCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:05:43.548336Z","bundle_sha256":"5499bdf8e2bb1d2304c8ad50e96a29ef7128c359ab035c596171425ad29da790"}}