{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y76UHIE7YLVFYL4M6AR3RBIEUH","short_pith_number":"pith:Y76UHIE7","canonical_record":{"source":{"id":"1808.05566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-16T16:15:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b2cef07187e45475789169ba2518932df3f5ce2ea16a1db266216de19c804578","abstract_canon_sha256":"7ff973c7684a709c0a220b8b126ae51c89ec53446959155db2dbb2734795dbbb"},"schema_version":"1.0"},"canonical_sha256":"c7fd43a09fc2ea5c2f8cf023b88504a1d053148695dd8b80520e60cfff40f091","source":{"kind":"arxiv","id":"1808.05566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05566","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05566v1","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05566","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"Y76UHIE7YLVF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y76UHIE7YLVFYL4M","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y76UHIE7","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y76UHIE7YLVFYL4M6AR3RBIEUH","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-16T16:15:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b2cef07187e45475789169ba2518932df3f5ce2ea16a1db266216de19c804578","abstract_canon_sha256":"7ff973c7684a709c0a220b8b126ae51c89ec53446959155db2dbb2734795dbbb"},"schema_version":"1.0"},"canonical_sha256":"c7fd43a09fc2ea5c2f8cf023b88504a1d053148695dd8b80520e60cfff40f091","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:56.622204Z","signature_b64":"O1wSwQzKKeh5zayt6TkdhtPS2cPOfsUYRqTZm/Bor96vN631azVUQc7+QFi8SEVjDkznIOs5UBy0IpQGyZxpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7fd43a09fc2ea5c2f8cf023b88504a1d053148695dd8b80520e60cfff40f091","last_reissued_at":"2026-05-18T00:07:56.621557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:56.621557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05566","source_version":1,"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-18T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCuBl/O5GiWvoAPj08xq4Ee0N20KaTT6KUfWYf+dK2P9W3OPZhMpvRZOOKpi++BvGFR32bd0moNV0odbJ4GaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:08:25.226120Z"},"content_sha256":"f64f2e930591902b71133ae56606be041a9e250f2f994f02e16914b49f29c50b","schema_version":"1.0","event_id":"sha256:f64f2e930591902b71133ae56606be041a9e250f2f994f02e16914b49f29c50b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y76UHIE7YLVFYL4M6AR3RBIEUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Angelika Steger, Asier Mujika, Felix Weissenberger, Florian Meier, Hafsteinn Einarsson, Johannes Lengler, Marcelo Matheus Gauy","submitted_at":"2018-08-16T16:15:13Z","abstract_excerpt":"We study unbiased $(1+1)$ evolutionary algorithms on linear functions with an unknown number $n$ of bits with non-zero weight. Static algorithms achieve an optimal runtime of $O(n (\\ln n)^{2+\\epsilon})$, however, it remained unclear whether more dynamic parameter policies could yield better runtime guarantees. We consider two setups: one where the mutation rate follows a fixed schedule, and one where it may be adapted depending on the history of the run. For the first setup, we give a schedule that achieves a runtime of $(1\\pm o(1))\\beta n \\ln n$, where $\\beta \\approx 3.552$, which is an asymp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05566","kind":"arxiv","version":1},"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-18T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vq72Gxk1DAjR+pGsA3igiZ9XR1aE5KFiX0FvumtqdXKSEP2c1RhHW0oZjzYo+vkjQHlHElDMXe+ytVvFaWJjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:08:25.226839Z"},"content_sha256":"6f37ced42464c0b678b75ef8335eb5b32bb93617c4c12259f0e9a3292cad5070","schema_version":"1.0","event_id":"sha256:6f37ced42464c0b678b75ef8335eb5b32bb93617c4c12259f0e9a3292cad5070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y76UHIE7YLVFYL4M6AR3RBIEUH/bundle.json","state_url":"https://pith.science/pith/Y76UHIE7YLVFYL4M6AR3RBIEUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y76UHIE7YLVFYL4M6AR3RBIEUH/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-08T20:08:25Z","links":{"resolver":"https://pith.science/pith/Y76UHIE7YLVFYL4M6AR3RBIEUH","bundle":"https://pith.science/pith/Y76UHIE7YLVFYL4M6AR3RBIEUH/bundle.json","state":"https://pith.science/pith/Y76UHIE7YLVFYL4M6AR3RBIEUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y76UHIE7YLVFYL4M6AR3RBIEUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y76UHIE7YLVFYL4M6AR3RBIEUH","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":"7ff973c7684a709c0a220b8b126ae51c89ec53446959155db2dbb2734795dbbb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-16T16:15:13Z","title_canon_sha256":"b2cef07187e45475789169ba2518932df3f5ce2ea16a1db266216de19c804578"},"schema_version":"1.0","source":{"id":"1808.05566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05566","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05566v1","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05566","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"Y76UHIE7YLVF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y76UHIE7YLVFYL4M","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y76UHIE7","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:6f37ced42464c0b678b75ef8335eb5b32bb93617c4c12259f0e9a3292cad5070","target":"graph","created_at":"2026-05-18T00:07:56Z","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":"We study unbiased $(1+1)$ evolutionary algorithms on linear functions with an unknown number $n$ of bits with non-zero weight. Static algorithms achieve an optimal runtime of $O(n (\\ln n)^{2+\\epsilon})$, however, it remained unclear whether more dynamic parameter policies could yield better runtime guarantees. We consider two setups: one where the mutation rate follows a fixed schedule, and one where it may be adapted depending on the history of the run. For the first setup, we give a schedule that achieves a runtime of $(1\\pm o(1))\\beta n \\ln n$, where $\\beta \\approx 3.552$, which is an asymp","authors_text":"Angelika Steger, Asier Mujika, Felix Weissenberger, Florian Meier, Hafsteinn Einarsson, Johannes Lengler, Marcelo Matheus Gauy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-16T16:15:13Z","title":"The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05566","kind":"arxiv","version":1},"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:f64f2e930591902b71133ae56606be041a9e250f2f994f02e16914b49f29c50b","target":"record","created_at":"2026-05-18T00:07:56Z","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":"7ff973c7684a709c0a220b8b126ae51c89ec53446959155db2dbb2734795dbbb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-16T16:15:13Z","title_canon_sha256":"b2cef07187e45475789169ba2518932df3f5ce2ea16a1db266216de19c804578"},"schema_version":"1.0","source":{"id":"1808.05566","kind":"arxiv","version":1}},"canonical_sha256":"c7fd43a09fc2ea5c2f8cf023b88504a1d053148695dd8b80520e60cfff40f091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7fd43a09fc2ea5c2f8cf023b88504a1d053148695dd8b80520e60cfff40f091","first_computed_at":"2026-05-18T00:07:56.621557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:56.621557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1wSwQzKKeh5zayt6TkdhtPS2cPOfsUYRqTZm/Bor96vN631azVUQc7+QFi8SEVjDkznIOs5UBy0IpQGyZxpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:56.622204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f64f2e930591902b71133ae56606be041a9e250f2f994f02e16914b49f29c50b","sha256:6f37ced42464c0b678b75ef8335eb5b32bb93617c4c12259f0e9a3292cad5070"],"state_sha256":"32cb49f2d98c360278d70da062d4d6f0e8afe33d5980e5cd7be0c0cdf68cdcbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfiBUCwTxUWIfnkmU5QGbHiU5+SCf2XD1c8kIVkT1WgaIE9dcz9gMl+5UFhfwoNMGjc0L+LXGoyav69/dXGaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:08:25.230928Z","bundle_sha256":"2d17b83c406730e6960b7c366c66204da040c805425bff1c3948827a0c6908a7"}}