{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GJWGI3LWFL45APOAHQZDTNWW6Q","short_pith_number":"pith:GJWGI3LW","schema_version":"1.0","canonical_sha256":"326c646d762af9d03dc03c3239b6d6f40e3127644c40d9c53129760b168de700","source":{"kind":"arxiv","id":"2606.13344","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.13344","created_at":"2026-06-12T01:09:53.533571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13344v1","created_at":"2026-06-12T01:09:53.533571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13344","created_at":"2026-06-12T01:09:53.533571+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJWGI3LWFL45","created_at":"2026-06-12T01:09:53.533571+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJWGI3LWFL45APOA","created_at":"2026-06-12T01:09:53.533571+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJWGI3LW","created_at":"2026-06-12T01:09:53.533571+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/GJWGI3LWFL45APOAHQZDTNWW6Q","json":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q.json","graph_json":"https://pith.science/api/pith-number/GJWGI3LWFL45APOAHQZDTNWW6Q/graph.json","events_json":"https://pith.science/api/pith-number/GJWGI3LWFL45APOAHQZDTNWW6Q/events.json","paper":"https://pith.science/paper/GJWGI3LW"},"agent_actions":{"view_html":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q","download_json":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q.json","view_paper":"https://pith.science/paper/GJWGI3LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13344&json=true","fetch_graph":"https://pith.science/api/pith-number/GJWGI3LWFL45APOAHQZDTNWW6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/GJWGI3LWFL45APOAHQZDTNWW6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/action/storage_attestation","attest_author":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/action/author_attestation","sign_citation":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/action/citation_signature","submit_replication":"https://pith.science/pith/GJWGI3LWFL45APOAHQZDTNWW6Q/action/replication_record"}},"created_at":"2026-06-12T01:09:53.533571+00:00","updated_at":"2026-06-12T01:09:53.533571+00:00"}