{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DO3HOBUEHK42EKSROQFPKI2KWW","short_pith_number":"pith:DO3HOBUE","schema_version":"1.0","canonical_sha256":"1bb67706843ab9a22a51740af5234ab5b74eccb8d3e7576062406c61dacc64bf","source":{"kind":"arxiv","id":"1804.05443","version":2},"attestation_state":"computed","paper":{"title":"Better Fixed-Arity Unbiased Black-Box Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Maxim Buzdalov, Nina Bulanova","submitted_at":"2018-04-15T22:40:42Z","abstract_excerpt":"In their GECCO'12 paper, Doerr and Doerr proved that the $k$-ary unbiased black-box complexity of OneMax on $n$ bits is $O(n/k)$ for $2\\le k\\le O(\\log n)$. We propose an alternative strategy for achieving this unbiased black-box complexity when $3\\le k\\le\\log_2 n$. While it is based on the same idea of block-wise optimization, it uses $k$-ary unbiased operators in a different way.\n  For each block of size $2^{k-1}-1$ we set up, in $O(k)$ queries, a virtual coordinate system, which enables us to use an arbitrary unrestricted algorithm to optimize this block. This is possible because this coordi"},"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":"1804.05443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-15T22:40:42Z","cross_cats_sorted":[],"title_canon_sha256":"4265f52566a7c26317e4c8b548c693d3f4cd61c05f941e77d5139e1310ffd75b","abstract_canon_sha256":"686549edd76ecd2dd5bb969209ec24b7578fa82988c7742fa10e4b4466f1fb54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:05.394000Z","signature_b64":"LmUvvth+DQuGI1Mvcw9rz8Svn2XC+ezGCNAYJ0HBz9v/L4iv9ecy4sGCV+CYMMsjgJbabqegNBwVAP9JG5TVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb67706843ab9a22a51740af5234ab5b74eccb8d3e7576062406c61dacc64bf","last_reissued_at":"2026-05-18T00:11:05.393290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:05.393290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Fixed-Arity Unbiased Black-Box Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Maxim Buzdalov, Nina Bulanova","submitted_at":"2018-04-15T22:40:42Z","abstract_excerpt":"In their GECCO'12 paper, Doerr and Doerr proved that the $k$-ary unbiased black-box complexity of OneMax on $n$ bits is $O(n/k)$ for $2\\le k\\le O(\\log n)$. We propose an alternative strategy for achieving this unbiased black-box complexity when $3\\le k\\le\\log_2 n$. While it is based on the same idea of block-wise optimization, it uses $k$-ary unbiased operators in a different way.\n  For each block of size $2^{k-1}-1$ we set up, in $O(k)$ queries, a virtual coordinate system, which enables us to use an arbitrary unrestricted algorithm to optimize this block. This is possible because this coordi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05443","kind":"arxiv","version":2},"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":"1804.05443","created_at":"2026-05-18T00:11:05.393421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05443v2","created_at":"2026-05-18T00:11:05.393421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05443","created_at":"2026-05-18T00:11:05.393421+00:00"},{"alias_kind":"pith_short_12","alias_value":"DO3HOBUEHK42","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DO3HOBUEHK42EKSR","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DO3HOBUE","created_at":"2026-05-18T12:32:19.392346+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/DO3HOBUEHK42EKSROQFPKI2KWW","json":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW.json","graph_json":"https://pith.science/api/pith-number/DO3HOBUEHK42EKSROQFPKI2KWW/graph.json","events_json":"https://pith.science/api/pith-number/DO3HOBUEHK42EKSROQFPKI2KWW/events.json","paper":"https://pith.science/paper/DO3HOBUE"},"agent_actions":{"view_html":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW","download_json":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW.json","view_paper":"https://pith.science/paper/DO3HOBUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05443&json=true","fetch_graph":"https://pith.science/api/pith-number/DO3HOBUEHK42EKSROQFPKI2KWW/graph.json","fetch_events":"https://pith.science/api/pith-number/DO3HOBUEHK42EKSROQFPKI2KWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW/action/storage_attestation","attest_author":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW/action/author_attestation","sign_citation":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW/action/citation_signature","submit_replication":"https://pith.science/pith/DO3HOBUEHK42EKSROQFPKI2KWW/action/replication_record"}},"created_at":"2026-05-18T00:11:05.393421+00:00","updated_at":"2026-05-18T00:11:05.393421+00:00"}