{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WAT563UXTEJV7IISMD6A6BBEYA","short_pith_number":"pith:WAT563UX","canonical_record":{"source":{"id":"1108.4386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-22T17:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"6e844246a22e9af232bfa8c9a931e74656e95bb652aa7e909bd919fb7ea8af89","abstract_canon_sha256":"1b7748a50004efa2cbd6c3c816a6cde690c553ddc3f513fe33d008f1f57d83c6"},"schema_version":"1.0"},"canonical_sha256":"b027df6e9799135fa11260fc0f0424c00cd5d16dd60f24f82e0a03e8827f0673","source":{"kind":"arxiv","id":"1108.4386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4386","created_at":"2026-05-18T04:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4386v2","created_at":"2026-05-18T04:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4386","created_at":"2026-05-18T04:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"WAT563UXTEJV","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WAT563UXTEJV7IIS","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WAT563UX","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WAT563UXTEJV7IISMD6A6BBEYA","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-22T17:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"6e844246a22e9af232bfa8c9a931e74656e95bb652aa7e909bd919fb7ea8af89","abstract_canon_sha256":"1b7748a50004efa2cbd6c3c816a6cde690c553ddc3f513fe33d008f1f57d83c6"},"schema_version":"1.0"},"canonical_sha256":"b027df6e9799135fa11260fc0f0424c00cd5d16dd60f24f82e0a03e8827f0673","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:18.943959Z","signature_b64":"qm2eljsiMyiGjQYhbqYw2hAx6wC8YWv95onrq3uuU1iWeHFSzFwZRuUg1FWMMhpTONpBZ41zplIks11IgqoiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b027df6e9799135fa11260fc0f0424c00cd5d16dd60f24f82e0a03e8827f0673","last_reissued_at":"2026-05-18T04:06:18.943308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:18.943308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4386","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-18T04:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEKYnD85YMtreUaF/WdcvKJXLLKSiZmRA0QqB+0KbyofJAFstlVnEiXCn0Xx/9HqyTSbp6VBmqvfwmunedVhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:13:44.119237Z"},"content_sha256":"6ae14ff7071a1d34ac152af761f32870b80bdfa97dd16ac051483d9fe9bae6fe","schema_version":"1.0","event_id":"sha256:6ae14ff7071a1d34ac152af761f32870b80bdfa97dd16ac051483d9fe9bae6fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WAT563UXTEJV7IISMD6A6BBEYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carsten Witt (DTU Informatics, Technical University of Denmark)","submitted_at":"2011-08-22T17:43:35Z","abstract_excerpt":"The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1+1) EA on the class of linear functions. We improve the best known bound in this setting from $(1.39+o(1))en\\ln n$ to $en\\ln n+O(n)$ in expectation and with high probability, which is tight up to lower-order terms. Moreover, upper and lower bounds for arbitrary mutations probabilities $p$ are derived, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4386","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-18T04:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqATmE0uT8du7xsvEsmy9BT4JtUJe1DBaGRvuxlFYQL3UIW7kzbnFd9TGpM4vDGT60RwlTiI0Q3ZCU+rYs6MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:13:44.119611Z"},"content_sha256":"e273dbcad2d06b2a2191785fe56189ed9056186e3f11b87e13479a2c9a1ad626","schema_version":"1.0","event_id":"sha256:e273dbcad2d06b2a2191785fe56189ed9056186e3f11b87e13479a2c9a1ad626"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAT563UXTEJV7IISMD6A6BBEYA/bundle.json","state_url":"https://pith.science/pith/WAT563UXTEJV7IISMD6A6BBEYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAT563UXTEJV7IISMD6A6BBEYA/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-06-20T09:13:44Z","links":{"resolver":"https://pith.science/pith/WAT563UXTEJV7IISMD6A6BBEYA","bundle":"https://pith.science/pith/WAT563UXTEJV7IISMD6A6BBEYA/bundle.json","state":"https://pith.science/pith/WAT563UXTEJV7IISMD6A6BBEYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAT563UXTEJV7IISMD6A6BBEYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WAT563UXTEJV7IISMD6A6BBEYA","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":"1b7748a50004efa2cbd6c3c816a6cde690c553ddc3f513fe33d008f1f57d83c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-22T17:43:35Z","title_canon_sha256":"6e844246a22e9af232bfa8c9a931e74656e95bb652aa7e909bd919fb7ea8af89"},"schema_version":"1.0","source":{"id":"1108.4386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4386","created_at":"2026-05-18T04:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4386v2","created_at":"2026-05-18T04:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4386","created_at":"2026-05-18T04:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"WAT563UXTEJV","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WAT563UXTEJV7IIS","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WAT563UX","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:e273dbcad2d06b2a2191785fe56189ed9056186e3f11b87e13479a2c9a1ad626","target":"graph","created_at":"2026-05-18T04:06:18Z","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":"The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1+1) EA on the class of linear functions. We improve the best known bound in this setting from $(1.39+o(1))en\\ln n$ to $en\\ln n+O(n)$ in expectation and with high probability, which is tight up to lower-order terms. Moreover, upper and lower bounds for arbitrary mutations probabilities $p$ are derived, w","authors_text":"Carsten Witt (DTU Informatics, Technical University of Denmark)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-22T17:43:35Z","title":"Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4386","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:6ae14ff7071a1d34ac152af761f32870b80bdfa97dd16ac051483d9fe9bae6fe","target":"record","created_at":"2026-05-18T04:06:18Z","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":"1b7748a50004efa2cbd6c3c816a6cde690c553ddc3f513fe33d008f1f57d83c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-22T17:43:35Z","title_canon_sha256":"6e844246a22e9af232bfa8c9a931e74656e95bb652aa7e909bd919fb7ea8af89"},"schema_version":"1.0","source":{"id":"1108.4386","kind":"arxiv","version":2}},"canonical_sha256":"b027df6e9799135fa11260fc0f0424c00cd5d16dd60f24f82e0a03e8827f0673","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b027df6e9799135fa11260fc0f0424c00cd5d16dd60f24f82e0a03e8827f0673","first_computed_at":"2026-05-18T04:06:18.943308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:18.943308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qm2eljsiMyiGjQYhbqYw2hAx6wC8YWv95onrq3uuU1iWeHFSzFwZRuUg1FWMMhpTONpBZ41zplIks11IgqoiAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:18.943959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ae14ff7071a1d34ac152af761f32870b80bdfa97dd16ac051483d9fe9bae6fe","sha256:e273dbcad2d06b2a2191785fe56189ed9056186e3f11b87e13479a2c9a1ad626"],"state_sha256":"172dc78236a50cb3fb35ae1ae6e5c2972e29bfe7c2e8d123032b90595599f803"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMJAf6vn4T6PI4Ucxncb6e8tesHqeVzjwXetbi3gIEPwdsMaRLTatmEq6lg+2VczMnAcav0sb/eGaM4XIawTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:13:44.121553Z","bundle_sha256":"ef43d596f540529f077cc38cf0f27d9ba1d346e0c46ff81780de26f7f9ac9ec0"}}