{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GJWGI3LWFL45APOAHQZDTNWW6Q","short_pith_number":"pith:GJWGI3LW","canonical_record":{"source":{"id":"2606.13344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-06-11T13:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"459b4b3a4ec76469866627b1a059e1beb15bdb063173bcc7155bfcfd695bb21b","abstract_canon_sha256":"1fb0a3c00538731fefde71cb77efb5ec4b736eda6a015e4a411195de17999547"},"schema_version":"1.0"},"canonical_sha256":"326c646d762af9d03dc03c3239b6d6f40e3127644c40d9c53129760b168de700","source":{"kind":"arxiv","id":"2606.13344","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13344","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13344v1","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13344","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"GJWGI3LWFL45","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"pith_short_16","alias_value":"GJWGI3LWFL45APOA","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"pith_short_8","alias_value":"GJWGI3LW","created_at":"2026-06-12T01:09:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GJWGI3LWFL45APOAHQZDTNWW6Q","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-06-11T13:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"459b4b3a4ec76469866627b1a059e1beb15bdb063173bcc7155bfcfd695bb21b","abstract_canon_sha256":"1fb0a3c00538731fefde71cb77efb5ec4b736eda6a015e4a411195de17999547"},"schema_version":"1.0"},"canonical_sha256":"326c646d762af9d03dc03c3239b6d6f40e3127644c40d9c53129760b168de700","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:53.534286Z","signature_b64":"+sFZ0FzaW8D04T6syZyObiiKB/nsaiiHXSnIotxYHzBZQTBPcrE9Ju+Db2iV8CQLVShfoMZPm57DTLAjNvVGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"326c646d762af9d03dc03c3239b6d6f40e3127644c40d9c53129760b168de700","last_reissued_at":"2026-06-12T01:09:53.533407Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:53.533407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13344","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-06-12T01:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3VvB5d0d9Pa79SDEnPULsA8HAThRU01ofeG0wqlAYa/SvMwZ0PUsVV0urXlePdQvkF97Z46Ihri6WxqkqZtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:14:55.385695Z"},"content_sha256":"9e443dd0cb7785ef3d8ee8dda5803c547d3ab53cbf9be6f3c92d20e410f0efab","schema_version":"1.0","event_id":"sha256:9e443dd0cb7785ef3d8ee8dda5803c547d3ab53cbf9be6f3c92d20e410f0efab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GJWGI3LWFL45APOAHQZDTNWW6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Runtime Bound for the $(\\mu + 1)$ EA on BinVal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Johannes Lengler, Joris Belder, Raghu Raman Ravi","submitted_at":"2026-06-11T13:34:03Z","abstract_excerpt":"We study the $(\\mu+1)$ EA on the Binary Value function BinVal. We show that it needs at most $O(\\mu \\log \\mu \\cdot n \\log n)$ function evaluations to find the optimum when $\\mu = o(n/\\log n)$. This substantially improves upon the recent upper bound of $O(\\mu^5 n \\log(n/\\mu^4))$ by Krejca, Neumann and Witt. Our results hold for several mutation operators including standard bit mutation. In particular, our bound implies that the $(\\mu+1)$ EA is at most a factor $O(\\log \\mu \\cdot \\log n)$ slower on BinVal than on OneMax."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13344","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.13344/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-12T01:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"237z64bFN3k4mLUlgb6kZ8y5Es1m6ZQqlGqbE6CAtwozulb41/Dx3tAgia6lPKGwWk9K+UUAPHclzh/2wlQeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:14:55.386067Z"},"content_sha256":"bca10f464c8ab57ae427aaac8e57ee0ceb0e1ba45bdf8333784000fbe50149d0","schema_version":"1.0","event_id":"sha256:bca10f464c8ab57ae427aaac8e57ee0ceb0e1ba45bdf8333784000fbe50149d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/bundle.json","state_url":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/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-27T12:14:55Z","links":{"resolver":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q","bundle":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/bundle.json","state":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GJWGI3LWFL45APOAHQZDTNWW6Q","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":"1fb0a3c00538731fefde71cb77efb5ec4b736eda6a015e4a411195de17999547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-06-11T13:34:03Z","title_canon_sha256":"459b4b3a4ec76469866627b1a059e1beb15bdb063173bcc7155bfcfd695bb21b"},"schema_version":"1.0","source":{"id":"2606.13344","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13344","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13344v1","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13344","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"GJWGI3LWFL45","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"pith_short_16","alias_value":"GJWGI3LWFL45APOA","created_at":"2026-06-12T01:09:53Z"},{"alias_kind":"pith_short_8","alias_value":"GJWGI3LW","created_at":"2026-06-12T01:09:53Z"}],"graph_snapshots":[{"event_id":"sha256:bca10f464c8ab57ae427aaac8e57ee0ceb0e1ba45bdf8333784000fbe50149d0","target":"graph","created_at":"2026-06-12T01:09:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.13344/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the $(\\mu+1)$ EA on the Binary Value function BinVal. We show that it needs at most $O(\\mu \\log \\mu \\cdot n \\log n)$ function evaluations to find the optimum when $\\mu = o(n/\\log n)$. This substantially improves upon the recent upper bound of $O(\\mu^5 n \\log(n/\\mu^4))$ by Krejca, Neumann and Witt. Our results hold for several mutation operators including standard bit mutation. In particular, our bound implies that the $(\\mu+1)$ EA is at most a factor $O(\\log \\mu \\cdot \\log n)$ slower on BinVal than on OneMax.","authors_text":"Johannes Lengler, Joris Belder, Raghu Raman Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-06-11T13:34:03Z","title":"Improved Runtime Bound for the $(\\mu + 1)$ EA on BinVal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13344","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:9e443dd0cb7785ef3d8ee8dda5803c547d3ab53cbf9be6f3c92d20e410f0efab","target":"record","created_at":"2026-06-12T01:09:53Z","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":"1fb0a3c00538731fefde71cb77efb5ec4b736eda6a015e4a411195de17999547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-06-11T13:34:03Z","title_canon_sha256":"459b4b3a4ec76469866627b1a059e1beb15bdb063173bcc7155bfcfd695bb21b"},"schema_version":"1.0","source":{"id":"2606.13344","kind":"arxiv","version":1}},"canonical_sha256":"326c646d762af9d03dc03c3239b6d6f40e3127644c40d9c53129760b168de700","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"326c646d762af9d03dc03c3239b6d6f40e3127644c40d9c53129760b168de700","first_computed_at":"2026-06-12T01:09:53.533407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:53.533407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+sFZ0FzaW8D04T6syZyObiiKB/nsaiiHXSnIotxYHzBZQTBPcrE9Ju+Db2iV8CQLVShfoMZPm57DTLAjNvVGCA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:53.534286Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13344","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e443dd0cb7785ef3d8ee8dda5803c547d3ab53cbf9be6f3c92d20e410f0efab","sha256:bca10f464c8ab57ae427aaac8e57ee0ceb0e1ba45bdf8333784000fbe50149d0"],"state_sha256":"788be00934ae5df68ef02732957c199ab707014c3f25ccfb0f53b1601fa98b1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdLpy1EjqTJ80bfGxSPzTCP5wwbIobNwph+JLAaTiKmGiwc2UZuWQRQfMqBydFH26IhhL77GMTIPEk3JqA7DBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:14:55.387983Z","bundle_sha256":"a4f0a42dbea90567ac6588985b601c8bbfd6d68ab624d01bf37c8b61f307161b"}}