{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:R7YCFWKQU2JWOQNFO5PQLB4OBE","short_pith_number":"pith:R7YCFWKQ","schema_version":"1.0","canonical_sha256":"8ff022d950a6936741a5775f05878e093221c2b36b14a6ae8b0eecda3cd3991f","source":{"kind":"arxiv","id":"1010.1429","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Monotone Functions Can Be Difficult","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Winzen, Christine Zarges, Dirk Sudholt, Thomas Jansen","submitted_at":"2010-10-07T13:21:28Z","abstract_excerpt":"Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these functions are easy to optimize. The choice of the constant $c$ in the mutation probability $p(n) = c/n$ can make a decisive difference.\n  We show that if $c < 1$, then the (1+1) evolutionary algorithm finds the optimum of every such function in $\\Theta(n \\log n)$ iterations. For $c=1$, we can still prove an upper bound of $O(n^{3/2})$. However, for $c > 33$"},"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":"1010.1429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-10-07T13:21:28Z","cross_cats_sorted":[],"title_canon_sha256":"7620a961395915a5ef86da4bcd52ddc33f8a0f75c86e8cdfadafa925e9fcf1a9","abstract_canon_sha256":"bea339feae1898f61d9558ed568f10aedfc7d8997834c6f2c3584e6da47061bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:46.358411Z","signature_b64":"bRs8zDIywAI8fq+UdxXnMoHPSl9adCnNIOVLyZwFyJjD8gLoq8c7sYy+ThQqi126NFa+CmK5AKuYAgFFyUK6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff022d950a6936741a5775f05878e093221c2b36b14a6ae8b0eecda3cd3991f","last_reissued_at":"2026-05-18T02:23:46.357726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:46.357726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Monotone Functions Can Be Difficult","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Winzen, Christine Zarges, Dirk Sudholt, Thomas Jansen","submitted_at":"2010-10-07T13:21:28Z","abstract_excerpt":"Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these functions are easy to optimize. The choice of the constant $c$ in the mutation probability $p(n) = c/n$ can make a decisive difference.\n  We show that if $c < 1$, then the (1+1) evolutionary algorithm finds the optimum of every such function in $\\Theta(n \\log n)$ iterations. For $c=1$, we can still prove an upper bound of $O(n^{3/2})$. However, for $c > 33$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1429","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":"1010.1429","created_at":"2026-05-18T02:23:46.357834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1429v2","created_at":"2026-05-18T02:23:46.357834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1429","created_at":"2026-05-18T02:23:46.357834+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7YCFWKQU2JW","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7YCFWKQU2JWOQNF","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7YCFWKQ","created_at":"2026-05-18T12:26:13.927090+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/R7YCFWKQU2JWOQNFO5PQLB4OBE","json":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE.json","graph_json":"https://pith.science/api/pith-number/R7YCFWKQU2JWOQNFO5PQLB4OBE/graph.json","events_json":"https://pith.science/api/pith-number/R7YCFWKQU2JWOQNFO5PQLB4OBE/events.json","paper":"https://pith.science/paper/R7YCFWKQ"},"agent_actions":{"view_html":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE","download_json":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE.json","view_paper":"https://pith.science/paper/R7YCFWKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1429&json=true","fetch_graph":"https://pith.science/api/pith-number/R7YCFWKQU2JWOQNFO5PQLB4OBE/graph.json","fetch_events":"https://pith.science/api/pith-number/R7YCFWKQU2JWOQNFO5PQLB4OBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/action/storage_attestation","attest_author":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/action/author_attestation","sign_citation":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/action/citation_signature","submit_replication":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/action/replication_record"}},"created_at":"2026-05-18T02:23:46.357834+00:00","updated_at":"2026-05-18T02:23:46.357834+00:00"}