{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4DH2VWG4V3XRCE6ONOFQ37C34C","short_pith_number":"pith:4DH2VWG4","schema_version":"1.0","canonical_sha256":"e0cfaad8dcaeef1113ce6b8b0dfc5be0bd990e7d2ccbdcc06ae66ca99d1e4510","source":{"kind":"arxiv","id":"1604.02355","version":1},"attestation_state":"computed","paper":{"title":"The (1+1) Elitist Black-Box Complexity of LeadingOnes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Johannes Lengler","submitted_at":"2016-04-08T13:36:52Z","abstract_excerpt":"One important goal of black-box complexity theory is the development of complexity models allowing to derive meaningful lower bounds for whole classes of randomized search heuristics. Complementing classical runtime analysis, black-box models help us understand how algorithmic choices such as the population size, the variation operators, or the selection rules influence the optimization time. One example for such a result is the $\\Omega(n \\log n)$ lower bound for unary unbiased algorithms on functions with a unique global optimum [Lehre/Witt, GECCO 2010], which tells us that higher arity opera"},"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":"1604.02355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-08T13:36:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6d13135a2dcdbef6ef23ab5f50e647f99797d022d4311bce93bd24774f3928ed","abstract_canon_sha256":"331cfb99a9d39e0dc3db36308d7f00af8b6c26b9af190ab25ca78e4c550a95c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:26.780223Z","signature_b64":"8k4Y8dhc8eYaB/gkQ9xTwmipAvO7l6l6202vG1IaYMUeWy+gLqupA9pQ3RCbUNzPxVZn5AbNJL+CT6qy8t01Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0cfaad8dcaeef1113ce6b8b0dfc5be0bd990e7d2ccbdcc06ae66ca99d1e4510","last_reissued_at":"2026-05-18T01:17:26.779679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:26.779679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The (1+1) Elitist Black-Box Complexity of LeadingOnes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Johannes Lengler","submitted_at":"2016-04-08T13:36:52Z","abstract_excerpt":"One important goal of black-box complexity theory is the development of complexity models allowing to derive meaningful lower bounds for whole classes of randomized search heuristics. Complementing classical runtime analysis, black-box models help us understand how algorithmic choices such as the population size, the variation operators, or the selection rules influence the optimization time. One example for such a result is the $\\Omega(n \\log n)$ lower bound for unary unbiased algorithms on functions with a unique global optimum [Lehre/Witt, GECCO 2010], which tells us that higher arity opera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02355","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":"1604.02355","created_at":"2026-05-18T01:17:26.779751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02355v1","created_at":"2026-05-18T01:17:26.779751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02355","created_at":"2026-05-18T01:17:26.779751+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DH2VWG4V3XR","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DH2VWG4V3XRCE6O","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DH2VWG4","created_at":"2026-05-18T12:29:58.707656+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/4DH2VWG4V3XRCE6ONOFQ37C34C","json":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C.json","graph_json":"https://pith.science/api/pith-number/4DH2VWG4V3XRCE6ONOFQ37C34C/graph.json","events_json":"https://pith.science/api/pith-number/4DH2VWG4V3XRCE6ONOFQ37C34C/events.json","paper":"https://pith.science/paper/4DH2VWG4"},"agent_actions":{"view_html":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C","download_json":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C.json","view_paper":"https://pith.science/paper/4DH2VWG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02355&json=true","fetch_graph":"https://pith.science/api/pith-number/4DH2VWG4V3XRCE6ONOFQ37C34C/graph.json","fetch_events":"https://pith.science/api/pith-number/4DH2VWG4V3XRCE6ONOFQ37C34C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C/action/storage_attestation","attest_author":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C/action/author_attestation","sign_citation":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C/action/citation_signature","submit_replication":"https://pith.science/pith/4DH2VWG4V3XRCE6ONOFQ37C34C/action/replication_record"}},"created_at":"2026-05-18T01:17:26.779751+00:00","updated_at":"2026-05-18T01:17:26.779751+00:00"}