{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4LVLGCCRKJST6W3BPSB4ULV7B7","short_pith_number":"pith:4LVLGCCR","schema_version":"1.0","canonical_sha256":"e2eab3085152653f5b617c83ca2ebf0fc3edbd2108113aed9ea6bd496dba9aae","source":{"kind":"arxiv","id":"1012.0952","version":1},"attestation_state":"computed","paper":{"title":"Faster Black-Box Algorithms Through Higher Arity Operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Winzen, Daniel Johannsen, Markus Wagner, Per Kristian Lehre, Timo K\\\"otzing","submitted_at":"2010-12-04T22:11:48Z","abstract_excerpt":"We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of \\leadingones drops from $\\Theta(n^2)$ for unary operators to $O(n \\log n)$. For \\onemax, the $\\Omega(n \\log n)$ unary black-box complexity drops to O(n) in the binary case. For $k$-ary operators, $k \\leq n$, the \\onemax-complexity further decreases to $O(n/\\log k)$."},"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":"1012.0952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-12-04T22:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"443c44e6aa79f8def9db6ed162dc9c5d76f6f8b56feaf9f2ee404792cf3d9499","abstract_canon_sha256":"76dd5c4a67c993ef8631945bf404f2addbc6ce2830d30d8eff4b246d179802ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:02.043221Z","signature_b64":"7nLxhoBSmRRubdKk1akzSts1iLaBWja7Y4CWjZNqM0Pa1o+FEE73ZAbDIFDziRTiJ94zSZ+7MigTzBPRjYeFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2eab3085152653f5b617c83ca2ebf0fc3edbd2108113aed9ea6bd496dba9aae","last_reissued_at":"2026-05-18T04:34:02.042622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:02.042622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Black-Box Algorithms Through Higher Arity Operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Winzen, Daniel Johannsen, Markus Wagner, Per Kristian Lehre, Timo K\\\"otzing","submitted_at":"2010-12-04T22:11:48Z","abstract_excerpt":"We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of \\leadingones drops from $\\Theta(n^2)$ for unary operators to $O(n \\log n)$. For \\onemax, the $\\Omega(n \\log n)$ unary black-box complexity drops to O(n) in the binary case. For $k$-ary operators, $k \\leq n$, the \\onemax-complexity further decreases to $O(n/\\log k)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0952","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":"1012.0952","created_at":"2026-05-18T04:34:02.042711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0952v1","created_at":"2026-05-18T04:34:02.042711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0952","created_at":"2026-05-18T04:34:02.042711+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LVLGCCRKJST","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LVLGCCRKJST6W3B","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LVLGCCR","created_at":"2026-05-18T12:26:03.138858+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/4LVLGCCRKJST6W3BPSB4ULV7B7","json":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7.json","graph_json":"https://pith.science/api/pith-number/4LVLGCCRKJST6W3BPSB4ULV7B7/graph.json","events_json":"https://pith.science/api/pith-number/4LVLGCCRKJST6W3BPSB4ULV7B7/events.json","paper":"https://pith.science/paper/4LVLGCCR"},"agent_actions":{"view_html":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7","download_json":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7.json","view_paper":"https://pith.science/paper/4LVLGCCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0952&json=true","fetch_graph":"https://pith.science/api/pith-number/4LVLGCCRKJST6W3BPSB4ULV7B7/graph.json","fetch_events":"https://pith.science/api/pith-number/4LVLGCCRKJST6W3BPSB4ULV7B7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/action/storage_attestation","attest_author":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/action/author_attestation","sign_citation":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/action/citation_signature","submit_replication":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/action/replication_record"}},"created_at":"2026-05-18T04:34:02.042711+00:00","updated_at":"2026-05-18T04:34:02.042711+00:00"}