{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:R7YCFWKQU2JWOQNFO5PQLB4OBE","short_pith_number":"pith:R7YCFWKQ","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"},"canonical_sha256":"8ff022d950a6936741a5775f05878e093221c2b36b14a6ae8b0eecda3cd3991f","source":{"kind":"arxiv","id":"1010.1429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1429","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1429v2","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1429","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"R7YCFWKQU2JW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R7YCFWKQU2JWOQNF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R7YCFWKQ","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:R7YCFWKQU2JWOQNFO5PQLB4OBE","target":"record","payload":{"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"},"canonical_sha256":"8ff022d950a6936741a5775f05878e093221c2b36b14a6ae8b0eecda3cd3991f","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"},"source_kind":"arxiv","source_id":"1010.1429","source_version":2,"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-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7grk+qYq06LKgf3BBcxWnM5Dh4dfeWUWxfYOczzzh9jk08UjLEuqyehvdgR+eZRYZ49j4u/J20rXXMh7kbRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:26:08.281613Z"},"content_sha256":"d374a3e8eb7eb8963ab6b61787aec409e1375f9ddff8fc7012d6f901d2c2b597","schema_version":"1.0","event_id":"sha256:d374a3e8eb7eb8963ab6b61787aec409e1375f9ddff8fc7012d6f901d2c2b597"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:R7YCFWKQU2JWOQNFO5PQLB4OBE","target":"graph","payload":{"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"},"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-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wuxfpsm/l4ustMv/w+fwowvCghDX/88C3tuYr+pWXtan22OF0X0ocxxBs/t5mz8jXPLeuS/tfi3/ldTecrdUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:26:08.282008Z"},"content_sha256":"b5f49f5ccbce4255414595193032d464f4086e9a186e350992b52cf689e46386","schema_version":"1.0","event_id":"sha256:b5f49f5ccbce4255414595193032d464f4086e9a186e350992b52cf689e46386"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/bundle.json","state_url":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/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-27T09:26:08Z","links":{"resolver":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE","bundle":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/bundle.json","state":"https://pith.science/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7YCFWKQU2JWOQNFO5PQLB4OBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R7YCFWKQU2JWOQNFO5PQLB4OBE","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":"bea339feae1898f61d9558ed568f10aedfc7d8997834c6f2c3584e6da47061bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-10-07T13:21:28Z","title_canon_sha256":"7620a961395915a5ef86da4bcd52ddc33f8a0f75c86e8cdfadafa925e9fcf1a9"},"schema_version":"1.0","source":{"id":"1010.1429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1429","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1429v2","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1429","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"R7YCFWKQU2JW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R7YCFWKQU2JWOQNF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R7YCFWKQ","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:b5f49f5ccbce4255414595193032d464f4086e9a186e350992b52cf689e46386","target":"graph","created_at":"2026-05-18T02:23:46Z","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":"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$","authors_text":"Benjamin Doerr, Carola Winzen, Christine Zarges, Dirk Sudholt, Thomas Jansen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-10-07T13:21:28Z","title":"Optimizing Monotone Functions Can Be Difficult"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1429","kind":"arxiv","version":2},"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:d374a3e8eb7eb8963ab6b61787aec409e1375f9ddff8fc7012d6f901d2c2b597","target":"record","created_at":"2026-05-18T02:23:46Z","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":"bea339feae1898f61d9558ed568f10aedfc7d8997834c6f2c3584e6da47061bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-10-07T13:21:28Z","title_canon_sha256":"7620a961395915a5ef86da4bcd52ddc33f8a0f75c86e8cdfadafa925e9fcf1a9"},"schema_version":"1.0","source":{"id":"1010.1429","kind":"arxiv","version":2}},"canonical_sha256":"8ff022d950a6936741a5775f05878e093221c2b36b14a6ae8b0eecda3cd3991f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ff022d950a6936741a5775f05878e093221c2b36b14a6ae8b0eecda3cd3991f","first_computed_at":"2026-05-18T02:23:46.357726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:46.357726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bRs8zDIywAI8fq+UdxXnMoHPSl9adCnNIOVLyZwFyJjD8gLoq8c7sYy+ThQqi126NFa+CmK5AKuYAgFFyUK6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:46.358411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d374a3e8eb7eb8963ab6b61787aec409e1375f9ddff8fc7012d6f901d2c2b597","sha256:b5f49f5ccbce4255414595193032d464f4086e9a186e350992b52cf689e46386"],"state_sha256":"7c1bdd570b363d7f04feb661448db6ee17a538cc9d1804530a2514ae362525b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2CXSgNcphUO4Dt9+IRwGSZv85aeHjuTDEhi2Krm5ZSLwUgILfi3+jyjkcUAHBPD7SswDI0kZbqYxSUnBdXfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:26:08.284362Z","bundle_sha256":"ba80ab7e179acac961c0237b8f2418f39d915f10dd210fe13162f7a3f468de6b"}}