{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NHGQ6R3OJF6BBSGUOBKJKTQK5F","short_pith_number":"pith:NHGQ6R3O","schema_version":"1.0","canonical_sha256":"69cd0f476e497c10c8d47054954e0ae94cf88d4032b8789c6af1e0ef73f3fb52","source":{"kind":"arxiv","id":"1203.4111","version":1},"attestation_state":"computed","paper":{"title":"Reducing the Arity in Unbiased Black-Box Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Winzen","submitted_at":"2012-03-19T14:12:52Z","abstract_excerpt":"We show that for all $1<k \\leq \\log n$ the $k$-ary unbiased black-box complexity of the $n$-dimensional $\\onemax$ function class is $O(n/k)$. This indicates that the power of higher arity operators is much stronger than what the previous $O(n/\\log k)$ bound by Doerr et al. (Faster black-box algorithms through higher arity operators, Proc. of FOGA 2011, pp. 163--172, ACM, 2011) suggests.\n  The key to this result is an encoding strategy, which might be of independent interest. We show that, using $k$-ary unbiased variation operators only, we may simulate an unrestricted memory of size $O(2^k)$ b"},"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":"1203.4111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-03-19T14:12:52Z","cross_cats_sorted":[],"title_canon_sha256":"1c3a9c1268029bec657984ac783577f9157adeb90870870bfe690f26b8680766","abstract_canon_sha256":"5ede963f39b70541587b80b8f4390ea904b6eda76f833c3c82aec76fef1b8ca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.976281Z","signature_b64":"DrMfAvjclloUyq2uzza3OAewp+kzo0Uu5g2hTroyK1CL8OhQBpznr6uxA34pWI29+MBh11I/MLI4YPJBWGWWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69cd0f476e497c10c8d47054954e0ae94cf88d4032b8789c6af1e0ef73f3fb52","last_reissued_at":"2026-05-18T02:21:16.975420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.975420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the Arity in Unbiased Black-Box Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Winzen","submitted_at":"2012-03-19T14:12:52Z","abstract_excerpt":"We show that for all $1<k \\leq \\log n$ the $k$-ary unbiased black-box complexity of the $n$-dimensional $\\onemax$ function class is $O(n/k)$. This indicates that the power of higher arity operators is much stronger than what the previous $O(n/\\log k)$ bound by Doerr et al. (Faster black-box algorithms through higher arity operators, Proc. of FOGA 2011, pp. 163--172, ACM, 2011) suggests.\n  The key to this result is an encoding strategy, which might be of independent interest. We show that, using $k$-ary unbiased variation operators only, we may simulate an unrestricted memory of size $O(2^k)$ b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4111","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":"1203.4111","created_at":"2026-05-18T02:21:16.975576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4111v1","created_at":"2026-05-18T02:21:16.975576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4111","created_at":"2026-05-18T02:21:16.975576+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHGQ6R3OJF6B","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHGQ6R3OJF6BBSGU","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHGQ6R3O","created_at":"2026-05-18T12:27:16.716162+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/NHGQ6R3OJF6BBSGUOBKJKTQK5F","json":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F.json","graph_json":"https://pith.science/api/pith-number/NHGQ6R3OJF6BBSGUOBKJKTQK5F/graph.json","events_json":"https://pith.science/api/pith-number/NHGQ6R3OJF6BBSGUOBKJKTQK5F/events.json","paper":"https://pith.science/paper/NHGQ6R3O"},"agent_actions":{"view_html":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F","download_json":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F.json","view_paper":"https://pith.science/paper/NHGQ6R3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4111&json=true","fetch_graph":"https://pith.science/api/pith-number/NHGQ6R3OJF6BBSGUOBKJKTQK5F/graph.json","fetch_events":"https://pith.science/api/pith-number/NHGQ6R3OJF6BBSGUOBKJKTQK5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/action/storage_attestation","attest_author":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/action/author_attestation","sign_citation":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/action/citation_signature","submit_replication":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/action/replication_record"}},"created_at":"2026-05-18T02:21:16.975576+00:00","updated_at":"2026-05-18T02:21:16.975576+00:00"}