{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4LVLGCCRKJST6W3BPSB4ULV7B7","short_pith_number":"pith:4LVLGCCR","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"},"canonical_sha256":"e2eab3085152653f5b617c83ca2ebf0fc3edbd2108113aed9ea6bd496dba9aae","source":{"kind":"arxiv","id":"1012.0952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0952","created_at":"2026-05-18T04:34:02Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0952v1","created_at":"2026-05-18T04:34:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0952","created_at":"2026-05-18T04:34:02Z"},{"alias_kind":"pith_short_12","alias_value":"4LVLGCCRKJST","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4LVLGCCRKJST6W3B","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4LVLGCCR","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4LVLGCCRKJST6W3BPSB4ULV7B7","target":"record","payload":{"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"},"canonical_sha256":"e2eab3085152653f5b617c83ca2ebf0fc3edbd2108113aed9ea6bd496dba9aae","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"},"source_kind":"arxiv","source_id":"1012.0952","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-18T04:34:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZiDDzcIHxZcBjaqqIyAAbiUaG0GmZWVJcoCnm93oc51e3Vpvw4MwJJkGfZQHi9zOSe/KhGfpyOhgJbGCRI9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:01:40.198546Z"},"content_sha256":"115b3876ec14e9602fe091b6523efaa919cd43ee3c87b3039f6535590119a1b7","schema_version":"1.0","event_id":"sha256:115b3876ec14e9602fe091b6523efaa919cd43ee3c87b3039f6535590119a1b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4LVLGCCRKJST6W3BPSB4ULV7B7","target":"graph","payload":{"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"},"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-18T04:34:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+EZxX1mDIvUNgw1zm0hIdouwJzS/XxpOm/RwQzLqKgtCtHHQ/z7XszecHaP5AODjXxRq0XRhgXJTBCkgUDHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:01:40.199181Z"},"content_sha256":"fb87aa06d4d45734d3d831a26d5c4a46da98a91b3caed85c61e5069a384bdd3c","schema_version":"1.0","event_id":"sha256:fb87aa06d4d45734d3d831a26d5c4a46da98a91b3caed85c61e5069a384bdd3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/bundle.json","state_url":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/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-05-27T19:01:40Z","links":{"resolver":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7","bundle":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/bundle.json","state":"https://pith.science/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LVLGCCRKJST6W3BPSB4ULV7B7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4LVLGCCRKJST6W3BPSB4ULV7B7","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":"76dd5c4a67c993ef8631945bf404f2addbc6ce2830d30d8eff4b246d179802ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-12-04T22:11:48Z","title_canon_sha256":"443c44e6aa79f8def9db6ed162dc9c5d76f6f8b56feaf9f2ee404792cf3d9499"},"schema_version":"1.0","source":{"id":"1012.0952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0952","created_at":"2026-05-18T04:34:02Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0952v1","created_at":"2026-05-18T04:34:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0952","created_at":"2026-05-18T04:34:02Z"},{"alias_kind":"pith_short_12","alias_value":"4LVLGCCRKJST","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4LVLGCCRKJST6W3B","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4LVLGCCR","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:fb87aa06d4d45734d3d831a26d5c4a46da98a91b3caed85c61e5069a384bdd3c","target":"graph","created_at":"2026-05-18T04:34:02Z","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 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)$.","authors_text":"Benjamin Doerr, Carola Winzen, Daniel Johannsen, Markus Wagner, Per Kristian Lehre, Timo K\\\"otzing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-12-04T22:11:48Z","title":"Faster Black-Box Algorithms Through Higher Arity Operators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0952","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:115b3876ec14e9602fe091b6523efaa919cd43ee3c87b3039f6535590119a1b7","target":"record","created_at":"2026-05-18T04:34:02Z","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":"76dd5c4a67c993ef8631945bf404f2addbc6ce2830d30d8eff4b246d179802ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-12-04T22:11:48Z","title_canon_sha256":"443c44e6aa79f8def9db6ed162dc9c5d76f6f8b56feaf9f2ee404792cf3d9499"},"schema_version":"1.0","source":{"id":"1012.0952","kind":"arxiv","version":1}},"canonical_sha256":"e2eab3085152653f5b617c83ca2ebf0fc3edbd2108113aed9ea6bd496dba9aae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2eab3085152653f5b617c83ca2ebf0fc3edbd2108113aed9ea6bd496dba9aae","first_computed_at":"2026-05-18T04:34:02.042622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:02.042622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7nLxhoBSmRRubdKk1akzSts1iLaBWja7Y4CWjZNqM0Pa1o+FEE73ZAbDIFDziRTiJ94zSZ+7MigTzBPRjYeFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:02.043221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:115b3876ec14e9602fe091b6523efaa919cd43ee3c87b3039f6535590119a1b7","sha256:fb87aa06d4d45734d3d831a26d5c4a46da98a91b3caed85c61e5069a384bdd3c"],"state_sha256":"cad78ff2bf6fb04bf4dc71d998c37ec82aa5c369002fe3eff9b4c805e536dbf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SB9GHZxbNOyWltuEGzszcKT+WC9pJ//N7ZZZf+nN6Dqyn6oxvmf4FHsHP9VohCJbZC1Ked6jXGf2FdMq0jnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:01:40.202817Z","bundle_sha256":"811b12d2cd7861350638e95ce9f1a6fe09f80efe45e6b3db937cfe7c57c8e928"}}