{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z725V4ZXCOMDPFWSDVGSTZEPPZ","short_pith_number":"pith:Z725V4ZX","schema_version":"1.0","canonical_sha256":"cff5daf33713983796d21d4d29e48f7e6dbf131b9c1cd4a43cbb2aa12906d06e","source":{"kind":"arxiv","id":"2404.02090","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.02090","created_at":"2026-07-05T08:44:13.279019+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.02090v4","created_at":"2026-07-05T08:44:13.279019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02090","created_at":"2026-07-05T08:44:13.279019+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z725V4ZXCOMD","created_at":"2026-07-05T08:44:13.279019+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z725V4ZXCOMDPFWS","created_at":"2026-07-05T08:44:13.279019+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z725V4ZX","created_at":"2026-07-05T08:44:13.279019+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/Z725V4ZXCOMDPFWSDVGSTZEPPZ","json":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ.json","graph_json":"https://pith.science/api/pith-number/Z725V4ZXCOMDPFWSDVGSTZEPPZ/graph.json","events_json":"https://pith.science/api/pith-number/Z725V4ZXCOMDPFWSDVGSTZEPPZ/events.json","paper":"https://pith.science/paper/Z725V4ZX"},"agent_actions":{"view_html":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ","download_json":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ.json","view_paper":"https://pith.science/paper/Z725V4ZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.02090&json=true","fetch_graph":"https://pith.science/api/pith-number/Z725V4ZXCOMDPFWSDVGSTZEPPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z725V4ZXCOMDPFWSDVGSTZEPPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/action/storage_attestation","attest_author":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/action/author_attestation","sign_citation":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/action/citation_signature","submit_replication":"https://pith.science/pith/Z725V4ZXCOMDPFWSDVGSTZEPPZ/action/replication_record"}},"created_at":"2026-07-05T08:44:13.279019+00:00","updated_at":"2026-07-05T08:44:13.279019+00:00"}