{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5DX5AVUGNWOMGPI55SSVSIBTVV","short_pith_number":"pith:5DX5AVUG","schema_version":"1.0","canonical_sha256":"e8efd056866d9cc33d1deca5592033ad5a8dbb6095599a12a7e0ef12fbb2f64a","source":{"kind":"arxiv","id":"1803.09227","version":2},"attestation_state":"computed","paper":{"title":"A General Dichotomy of Evolutionary Algorithms on Monotone Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Johannes Lengler","submitted_at":"2018-03-25T10:33:25Z","abstract_excerpt":"It is known that the evolutionary algorithm $(1+1)$-EA with mutation rate $c/n$ optimises every monotone function efficiently if $c<1$, and needs exponential time on some monotone functions (HotTopic functions) if $c\\geq 2.2$. We study the same question for a large variety of algorithms, particularly for $(1+\\lambda)$-EA, $(\\mu+1)$-EA, $(\\mu+1)$-GA, their fast counterparts like fast $(1+1)$-EA, and for $(1+(\\lambda,\\lambda))$-GA. We find that all considered mutation-based algorithms show a similar dichotomy for HotTopic functions, or even for all monotone functions. For the $(1+(\\lambda,\\lambd"},"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":"1803.09227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-25T10:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"be64c6db1d7682be378b62c844af3c6979fd1b36743a50038c40682ba8bfca6d","abstract_canon_sha256":"7a9b56a7201fa45d13c1073a255394fb4c86929c7017d85023e4c2e88d36d6d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:56.152219Z","signature_b64":"/LFGCApNwwfUoQ9GZsK5nQNHfs7Y8/YINDLkEYVclOYHWpJ0PB8/juxB7tTPVqE2nYZ/hncW1GiNVKB6WoIUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8efd056866d9cc33d1deca5592033ad5a8dbb6095599a12a7e0ef12fbb2f64a","last_reissued_at":"2026-05-18T00:19:56.151507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:56.151507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Dichotomy of Evolutionary Algorithms on Monotone Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Johannes Lengler","submitted_at":"2018-03-25T10:33:25Z","abstract_excerpt":"It is known that the evolutionary algorithm $(1+1)$-EA with mutation rate $c/n$ optimises every monotone function efficiently if $c<1$, and needs exponential time on some monotone functions (HotTopic functions) if $c\\geq 2.2$. We study the same question for a large variety of algorithms, particularly for $(1+\\lambda)$-EA, $(\\mu+1)$-EA, $(\\mu+1)$-GA, their fast counterparts like fast $(1+1)$-EA, and for $(1+(\\lambda,\\lambda))$-GA. We find that all considered mutation-based algorithms show a similar dichotomy for HotTopic functions, or even for all monotone functions. For the $(1+(\\lambda,\\lambd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09227","kind":"arxiv","version":2},"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":"1803.09227","created_at":"2026-05-18T00:19:56.151620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09227v2","created_at":"2026-05-18T00:19:56.151620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09227","created_at":"2026-05-18T00:19:56.151620+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DX5AVUGNWOM","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DX5AVUGNWOMGPI5","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DX5AVUG","created_at":"2026-05-18T12:32:08.215937+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/5DX5AVUGNWOMGPI55SSVSIBTVV","json":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV.json","graph_json":"https://pith.science/api/pith-number/5DX5AVUGNWOMGPI55SSVSIBTVV/graph.json","events_json":"https://pith.science/api/pith-number/5DX5AVUGNWOMGPI55SSVSIBTVV/events.json","paper":"https://pith.science/paper/5DX5AVUG"},"agent_actions":{"view_html":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV","download_json":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV.json","view_paper":"https://pith.science/paper/5DX5AVUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09227&json=true","fetch_graph":"https://pith.science/api/pith-number/5DX5AVUGNWOMGPI55SSVSIBTVV/graph.json","fetch_events":"https://pith.science/api/pith-number/5DX5AVUGNWOMGPI55SSVSIBTVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV/action/storage_attestation","attest_author":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV/action/author_attestation","sign_citation":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV/action/citation_signature","submit_replication":"https://pith.science/pith/5DX5AVUGNWOMGPI55SSVSIBTVV/action/replication_record"}},"created_at":"2026-05-18T00:19:56.151620+00:00","updated_at":"2026-05-18T00:19:56.151620+00:00"}