{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Z725V4ZXCOMDPFWSDVGSTZEPPZ","short_pith_number":"pith:Z725V4ZX","canonical_record":{"source":{"id":"2404.02090","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-04-02T16:35:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ce2a9cb5697afcfadcf788a1c685de754591ad33212b2297453ab7e849669602","abstract_canon_sha256":"ed7cb8424797161dc6b2458be81e91e2dd69dfc3af265695376edb79215ff407"},"schema_version":"1.0"},"canonical_sha256":"cff5daf33713983796d21d4d29e48f7e6dbf131b9c1cd4a43cbb2aa12906d06e","source":{"kind":"arxiv","id":"2404.02090","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02090","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02090v4","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02090","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"Z725V4ZXCOMD","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"pith_short_16","alias_value":"Z725V4ZXCOMDPFWS","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"pith_short_8","alias_value":"Z725V4ZX","created_at":"2026-07-05T08:44:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Z725V4ZXCOMDPFWSDVGSTZEPPZ","target":"record","payload":{"canonical_record":{"source":{"id":"2404.02090","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-04-02T16:35:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ce2a9cb5697afcfadcf788a1c685de754591ad33212b2297453ab7e849669602","abstract_canon_sha256":"ed7cb8424797161dc6b2458be81e91e2dd69dfc3af265695376edb79215ff407"},"schema_version":"1.0"},"canonical_sha256":"cff5daf33713983796d21d4d29e48f7e6dbf131b9c1cd4a43cbb2aa12906d06e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:13.279420Z","signature_b64":"ooB4W775hgQ7ofxpF/YL7JyjJPSPZpYLa+pu4uoFd2hxUsjfhrnXZ7ltv+0ryA+8f+zLVb5bFqRqLl0zh4Z/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cff5daf33713983796d21d4d29e48f7e6dbf131b9c1cd4a43cbb2aa12906d06e","last_reissued_at":"2026-07-05T08:44:13.278965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:13.278965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.02090","source_version":4,"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-07-05T08:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzUnULsZgaVI72/oJwYixgpa9m6MeIOgpV4MOJvqJnPIz0az8Nf4UI1lox6jmMOUCB2uZUxiQl4MsYC7df59Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:57:56.189844Z"},"content_sha256":"3783d36cc3290bcd8b4aba12f498c122daaeaf8078a3d4a429be569083d05ac6","schema_version":"1.0","event_id":"sha256:3783d36cc3290bcd8b4aba12f498c122daaeaf8078a3d4a429be569083d05ac6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Z725V4ZXCOMDPFWSDVGSTZEPPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Already Moderate Population Sizes Provably Yield Strong Robustness to Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Alexandra Ivanova, Benjamin Doerr, Denis Antipov","submitted_at":"2024-04-02T16:35:52Z","abstract_excerpt":"Experience shows that typical evolutionary algorithms can cope well with stochastic disturbances such as noisy function evaluations.\n  In this first mathematical runtime analysis of the $(1+\\lambda)$ and $(1,\\lambda)$ evolutionary algorithms in the presence of prior bit-wise noise, we show that both algorithms can tolerate constant noise probabilities without increasing the asymptotic runtime on the OneMax benchmark. For this, a population size $\\lambda$ suffices that is at least logarithmic in the problem size $n$. The only previous result in this direction regarded the less realistic one-bit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02090","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.02090/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2L6nUQ+BE/bJmPwWuYudzz0K6kHyR3aibgLkAICwAWAcWDQXgGflhgdDrkBJMqWCc5iWsZwUKLeMEfwN2CMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:57:56.190542Z"},"content_sha256":"865d4d1d83564a6c7a8f55cfd0fce096334bc34440fbcc2dabfb7dbdad4e63c0","schema_version":"1.0","event_id":"sha256:865d4d1d83564a6c7a8f55cfd0fce096334bc34440fbcc2dabfb7dbdad4e63c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/bundle.json","state_url":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/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-08-07T09:57:56Z","links":{"resolver":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ","bundle":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/bundle.json","state":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Z725V4ZXCOMDPFWSDVGSTZEPPZ","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":"ed7cb8424797161dc6b2458be81e91e2dd69dfc3af265695376edb79215ff407","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-04-02T16:35:52Z","title_canon_sha256":"ce2a9cb5697afcfadcf788a1c685de754591ad33212b2297453ab7e849669602"},"schema_version":"1.0","source":{"id":"2404.02090","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02090","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02090v4","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02090","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"Z725V4ZXCOMD","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"pith_short_16","alias_value":"Z725V4ZXCOMDPFWS","created_at":"2026-07-05T08:44:13Z"},{"alias_kind":"pith_short_8","alias_value":"Z725V4ZX","created_at":"2026-07-05T08:44:13Z"}],"graph_snapshots":[{"event_id":"sha256:865d4d1d83564a6c7a8f55cfd0fce096334bc34440fbcc2dabfb7dbdad4e63c0","target":"graph","created_at":"2026-07-05T08:44:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.02090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Experience shows that typical evolutionary algorithms can cope well with stochastic disturbances such as noisy function evaluations.\n  In this first mathematical runtime analysis of the $(1+\\lambda)$ and $(1,\\lambda)$ evolutionary algorithms in the presence of prior bit-wise noise, we show that both algorithms can tolerate constant noise probabilities without increasing the asymptotic runtime on the OneMax benchmark. For this, a population size $\\lambda$ suffices that is at least logarithmic in the problem size $n$. The only previous result in this direction regarded the less realistic one-bit","authors_text":"Alexandra Ivanova, Benjamin Doerr, Denis Antipov","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-04-02T16:35:52Z","title":"Already Moderate Population Sizes Provably Yield Strong Robustness to Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02090","kind":"arxiv","version":4},"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:3783d36cc3290bcd8b4aba12f498c122daaeaf8078a3d4a429be569083d05ac6","target":"record","created_at":"2026-07-05T08:44:13Z","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":"ed7cb8424797161dc6b2458be81e91e2dd69dfc3af265695376edb79215ff407","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-04-02T16:35:52Z","title_canon_sha256":"ce2a9cb5697afcfadcf788a1c685de754591ad33212b2297453ab7e849669602"},"schema_version":"1.0","source":{"id":"2404.02090","kind":"arxiv","version":4}},"canonical_sha256":"cff5daf33713983796d21d4d29e48f7e6dbf131b9c1cd4a43cbb2aa12906d06e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cff5daf33713983796d21d4d29e48f7e6dbf131b9c1cd4a43cbb2aa12906d06e","first_computed_at":"2026-07-05T08:44:13.278965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:44:13.278965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ooB4W775hgQ7ofxpF/YL7JyjJPSPZpYLa+pu4uoFd2hxUsjfhrnXZ7ltv+0ryA+8f+zLVb5bFqRqLl0zh4Z/Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T08:44:13.279420Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.02090","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3783d36cc3290bcd8b4aba12f498c122daaeaf8078a3d4a429be569083d05ac6","sha256:865d4d1d83564a6c7a8f55cfd0fce096334bc34440fbcc2dabfb7dbdad4e63c0"],"state_sha256":"3c9ea3186789e874c244f8c930c5b9d719d9e2e196d7adaaf0ed5ad7173a825a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fr59u8OWkjXLBcuoVn5mzkhlrb6gKVRDwIVv/lfsbN+52ohPXUqtTbYp+CXzdmB2CnQMi8BReq0Mtch9PTweAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T09:57:56.193291Z","bundle_sha256":"ac3bf2b1f1b52cd29b6fc0624d20f7b1a82e8a256204a2087b7883a8487a4ff3"}}