{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BERKPQLDQE2NKJZL2JHYXMUVJW","short_pith_number":"pith:BERKPQLD","schema_version":"1.0","canonical_sha256":"0922a7c1638134d5272bd24f8bb2954d81c80060db01ac749c795b99dc9c652a","source":{"kind":"arxiv","id":"1210.6465","version":1},"attestation_state":"computed","paper":{"title":"Black-Box Complexity: Breaking the $O(n \\log n)$ Barrier of LeadingOnes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Winzen","submitted_at":"2012-10-24T09:17:49Z","abstract_excerpt":"We show that the unrestricted black-box complexity of the $n$-dimensional XOR- and permutation-invariant LeadingOnes function class is $O(n \\log (n) / \\log \\log n)$. This shows that the recent natural looking $O(n\\log n)$ bound is not tight.\n  The black-box optimization algorithm leading to this bound can be implemented in a way that only 3-ary unbiased variation operators are used. Hence our bound is also valid for the unbiased black-box complexity recently introduced by Lehre and Witt (GECCO 2010). The bound also remains valid if we impose the additional restriction that the black-box algori"},"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":"1210.6465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-24T09:17:49Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"171528b061bfefc3e065d3a2030fa0e268b7d7aba2f228f314c20f79b2d45eda","abstract_canon_sha256":"f0d2d1fda9e08e56f58a50163db0b55b859afce5ec404771e50c5fb649cb41da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:24.755167Z","signature_b64":"IN5KG2Nc0lDBCDM+YpT6EwdTe6DD+6HcglAFOaIqPfXqIOJ+8uqlHlE0pzKLbiBtD2aLwAXbo7SN03b9ydjeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0922a7c1638134d5272bd24f8bb2954d81c80060db01ac749c795b99dc9c652a","last_reissued_at":"2026-05-18T03:42:24.754411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:24.754411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Black-Box Complexity: Breaking the $O(n \\log n)$ Barrier of LeadingOnes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Winzen","submitted_at":"2012-10-24T09:17:49Z","abstract_excerpt":"We show that the unrestricted black-box complexity of the $n$-dimensional XOR- and permutation-invariant LeadingOnes function class is $O(n \\log (n) / \\log \\log n)$. This shows that the recent natural looking $O(n\\log n)$ bound is not tight.\n  The black-box optimization algorithm leading to this bound can be implemented in a way that only 3-ary unbiased variation operators are used. Hence our bound is also valid for the unbiased black-box complexity recently introduced by Lehre and Witt (GECCO 2010). The bound also remains valid if we impose the additional restriction that the black-box algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6465","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.6465","created_at":"2026-05-18T03:42:24.754520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6465v1","created_at":"2026-05-18T03:42:24.754520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6465","created_at":"2026-05-18T03:42:24.754520+00:00"},{"alias_kind":"pith_short_12","alias_value":"BERKPQLDQE2N","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BERKPQLDQE2NKJZL","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BERKPQLD","created_at":"2026-05-18T12:26:58.693483+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/BERKPQLDQE2NKJZL2JHYXMUVJW","json":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW.json","graph_json":"https://pith.science/api/pith-number/BERKPQLDQE2NKJZL2JHYXMUVJW/graph.json","events_json":"https://pith.science/api/pith-number/BERKPQLDQE2NKJZL2JHYXMUVJW/events.json","paper":"https://pith.science/paper/BERKPQLD"},"agent_actions":{"view_html":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW","download_json":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW.json","view_paper":"https://pith.science/paper/BERKPQLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6465&json=true","fetch_graph":"https://pith.science/api/pith-number/BERKPQLDQE2NKJZL2JHYXMUVJW/graph.json","fetch_events":"https://pith.science/api/pith-number/BERKPQLDQE2NKJZL2JHYXMUVJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/action/storage_attestation","attest_author":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/action/author_attestation","sign_citation":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/action/citation_signature","submit_replication":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/action/replication_record"}},"created_at":"2026-05-18T03:42:24.754520+00:00","updated_at":"2026-05-18T03:42:24.754520+00:00"}