{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BERKPQLDQE2NKJZL2JHYXMUVJW","short_pith_number":"pith:BERKPQLD","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"},"canonical_sha256":"0922a7c1638134d5272bd24f8bb2954d81c80060db01ac749c795b99dc9c652a","source":{"kind":"arxiv","id":"1210.6465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6465","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6465v1","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6465","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"BERKPQLDQE2N","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BERKPQLDQE2NKJZL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BERKPQLD","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BERKPQLDQE2NKJZL2JHYXMUVJW","target":"record","payload":{"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"},"canonical_sha256":"0922a7c1638134d5272bd24f8bb2954d81c80060db01ac749c795b99dc9c652a","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"},"source_kind":"arxiv","source_id":"1210.6465","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-18T03:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cVT0rtZDl88AUCdEV290SLW+Z0/1j+RaiiVqCRcqE+r8AikpAzveeX5Aa+F4rUWH5sJBj76IKt3tCnl4ymqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:30:35.701790Z"},"content_sha256":"68b8768af19e32be09cb9d3476e82c606055e9fbbc8d39c31b78a6c4113c60fb","schema_version":"1.0","event_id":"sha256:68b8768af19e32be09cb9d3476e82c606055e9fbbc8d39c31b78a6c4113c60fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BERKPQLDQE2NKJZL2JHYXMUVJW","target":"graph","payload":{"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"},"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-18T03:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7bM7uO64DX7op+qNRyexIdwz6wsG/ltVKdv7bAPdHkIiSlaD6/tzgJcyzetSnsTwe8WUDtiNDzxwqpWrMtIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:30:35.702380Z"},"content_sha256":"b9e0b6a9c7c1d9ebed323d5b613c851d685181129a405c8f8bdcbb5be6f1ced8","schema_version":"1.0","event_id":"sha256:b9e0b6a9c7c1d9ebed323d5b613c851d685181129a405c8f8bdcbb5be6f1ced8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/bundle.json","state_url":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/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-09T10:30:35Z","links":{"resolver":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW","bundle":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/bundle.json","state":"https://pith.science/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BERKPQLDQE2NKJZL2JHYXMUVJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BERKPQLDQE2NKJZL2JHYXMUVJW","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":"f0d2d1fda9e08e56f58a50163db0b55b859afce5ec404771e50c5fb649cb41da","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-24T09:17:49Z","title_canon_sha256":"171528b061bfefc3e065d3a2030fa0e268b7d7aba2f228f314c20f79b2d45eda"},"schema_version":"1.0","source":{"id":"1210.6465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6465","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6465v1","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6465","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"BERKPQLDQE2N","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BERKPQLDQE2NKJZL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BERKPQLD","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:b9e0b6a9c7c1d9ebed323d5b613c851d685181129a405c8f8bdcbb5be6f1ced8","target":"graph","created_at":"2026-05-18T03:42:24Z","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 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","authors_text":"Benjamin Doerr, Carola Winzen","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-24T09:17:49Z","title":"Black-Box Complexity: Breaking the $O(n \\log n)$ Barrier of LeadingOnes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6465","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:68b8768af19e32be09cb9d3476e82c606055e9fbbc8d39c31b78a6c4113c60fb","target":"record","created_at":"2026-05-18T03:42:24Z","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":"f0d2d1fda9e08e56f58a50163db0b55b859afce5ec404771e50c5fb649cb41da","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-24T09:17:49Z","title_canon_sha256":"171528b061bfefc3e065d3a2030fa0e268b7d7aba2f228f314c20f79b2d45eda"},"schema_version":"1.0","source":{"id":"1210.6465","kind":"arxiv","version":1}},"canonical_sha256":"0922a7c1638134d5272bd24f8bb2954d81c80060db01ac749c795b99dc9c652a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0922a7c1638134d5272bd24f8bb2954d81c80060db01ac749c795b99dc9c652a","first_computed_at":"2026-05-18T03:42:24.754411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:24.754411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IN5KG2Nc0lDBCDM+YpT6EwdTe6DD+6HcglAFOaIqPfXqIOJ+8uqlHlE0pzKLbiBtD2aLwAXbo7SN03b9ydjeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:24.755167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68b8768af19e32be09cb9d3476e82c606055e9fbbc8d39c31b78a6c4113c60fb","sha256:b9e0b6a9c7c1d9ebed323d5b613c851d685181129a405c8f8bdcbb5be6f1ced8"],"state_sha256":"186ee6159015d567bac014ccc01873d93a125979a3d9d856bd1a1efeb718938d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MoGnrDEhIfgxrrtch6CEDo8tnHKhA4+/hh+vuZaG8w6nmjvuHi3jB5cRxtTtbe9TM7sjKbBf1hpFI7zLOwvuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:30:35.705941Z","bundle_sha256":"8acf9322b7f260ac31cf1843d5360ea9cb8c402df36d887b7121ca2783f01cb0"}}