{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NHGQ6R3OJF6BBSGUOBKJKTQK5F","short_pith_number":"pith:NHGQ6R3O","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"},"canonical_sha256":"69cd0f476e497c10c8d47054954e0ae94cf88d4032b8789c6af1e0ef73f3fb52","source":{"kind":"arxiv","id":"1203.4111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4111","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4111v1","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4111","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"NHGQ6R3OJF6B","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NHGQ6R3OJF6BBSGU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NHGQ6R3O","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NHGQ6R3OJF6BBSGUOBKJKTQK5F","target":"record","payload":{"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"},"canonical_sha256":"69cd0f476e497c10c8d47054954e0ae94cf88d4032b8789c6af1e0ef73f3fb52","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"},"source_kind":"arxiv","source_id":"1203.4111","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-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hz2v1iVJTzyp4oryrieiToTz1ANERFZ1BSfBdzjCwpfEYL0w382vhbjv+ND4AWxaLgFsaeNB3idjleqAtbNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:05:57.386347Z"},"content_sha256":"c493788146f5e66255e7ace52a1a8ddbbe16c8bb2c4270096cfb580564f0d4be","schema_version":"1.0","event_id":"sha256:c493788146f5e66255e7ace52a1a8ddbbe16c8bb2c4270096cfb580564f0d4be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NHGQ6R3OJF6BBSGUOBKJKTQK5F","target":"graph","payload":{"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"},"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-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mn8p961CJG2+ym0xob/MabCobP4lF4IYftQ6zSommQhsSjtsmD5e/eMkEqGqa7DJgEVGg16NEW4lJZ2lbHD9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:05:57.386969Z"},"content_sha256":"26dc43b8802ad99f7880d9be40474d1c78d1d6fece2eaec5c2f54592e63db427","schema_version":"1.0","event_id":"sha256:26dc43b8802ad99f7880d9be40474d1c78d1d6fece2eaec5c2f54592e63db427"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/bundle.json","state_url":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/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-09T05:05:57Z","links":{"resolver":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F","bundle":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/bundle.json","state":"https://pith.science/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHGQ6R3OJF6BBSGUOBKJKTQK5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NHGQ6R3OJF6BBSGUOBKJKTQK5F","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":"5ede963f39b70541587b80b8f4390ea904b6eda76f833c3c82aec76fef1b8ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-03-19T14:12:52Z","title_canon_sha256":"1c3a9c1268029bec657984ac783577f9157adeb90870870bfe690f26b8680766"},"schema_version":"1.0","source":{"id":"1203.4111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4111","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4111v1","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4111","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"NHGQ6R3OJF6B","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NHGQ6R3OJF6BBSGU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NHGQ6R3O","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:26dc43b8802ad99f7880d9be40474d1c78d1d6fece2eaec5c2f54592e63db427","target":"graph","created_at":"2026-05-18T02:21:16Z","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 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","authors_text":"Benjamin Doerr, Carola Winzen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-03-19T14:12:52Z","title":"Reducing the Arity in Unbiased Black-Box Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4111","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:c493788146f5e66255e7ace52a1a8ddbbe16c8bb2c4270096cfb580564f0d4be","target":"record","created_at":"2026-05-18T02:21:16Z","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":"5ede963f39b70541587b80b8f4390ea904b6eda76f833c3c82aec76fef1b8ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-03-19T14:12:52Z","title_canon_sha256":"1c3a9c1268029bec657984ac783577f9157adeb90870870bfe690f26b8680766"},"schema_version":"1.0","source":{"id":"1203.4111","kind":"arxiv","version":1}},"canonical_sha256":"69cd0f476e497c10c8d47054954e0ae94cf88d4032b8789c6af1e0ef73f3fb52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69cd0f476e497c10c8d47054954e0ae94cf88d4032b8789c6af1e0ef73f3fb52","first_computed_at":"2026-05-18T02:21:16.975420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:16.975420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DrMfAvjclloUyq2uzza3OAewp+kzo0Uu5g2hTroyK1CL8OhQBpznr6uxA34pWI29+MBh11I/MLI4YPJBWGWWDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:16.976281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c493788146f5e66255e7ace52a1a8ddbbe16c8bb2c4270096cfb580564f0d4be","sha256:26dc43b8802ad99f7880d9be40474d1c78d1d6fece2eaec5c2f54592e63db427"],"state_sha256":"ab05e7d97ef177e011b1fe78ea624b1db4898727f3a1818fc3a4d300ce3bc56e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2V1xqAhhkGDBO/+smgcvaxr8Tbb6OS8phIkTXV8TR2zCZ1DbMZNYMMuQKfRBUwHe+NASQtT7VdgWwaMEj2kBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:05:57.390829Z","bundle_sha256":"cace7917d4a3fcce829b46da126c1ef8b3db35bfff8fc38e77384304b3cc82fe"}}