{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NKR7TSAD5QFSPF5NRZ2S6DQKK5","short_pith_number":"pith:NKR7TSAD","schema_version":"1.0","canonical_sha256":"6aa3f9c803ec0b2797ad8e752f0e0a574125668bead945cb3c8ce8984d5bd76a","source":{"kind":"arxiv","id":"1902.00107","version":1},"attestation_state":"computed","paper":{"title":"Parallel Black-Box Complexity with Tail Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt, Per Kristian Lehre","submitted_at":"2019-01-31T22:30:10Z","abstract_excerpt":"We propose a new black-box complexity model for search algorithms evaluating $\\lambda$ search points in parallel. The parallel unary unbiased black-box complexity gives lower bounds on the number of function evaluations every parallel unary unbiased black-box algorithm needs to optimise a given problem. It captures the inertia caused by offspring populations in evolutionary algorithms and the total computational effort in parallel metaheuristics.\n  We present complexity results for LeadingOnes and OneMax. Our main result is a general performance limit: we prove that on every function every $\\l"},"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":"1902.00107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-31T22:30:10Z","cross_cats_sorted":[],"title_canon_sha256":"4b8806d3ac46d98ea1d5837b340ac91e7ec55e787947dcfcf9405cd3c7fccab4","abstract_canon_sha256":"9c195311e1dfcbc130239c530d29bc1f2f92b937d65be216d1a86701df2c9743"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.241198Z","signature_b64":"YvOJCw3ymyel1kL/vS0sGyUhGvKJ7uOO3k8dXerEKXxMVoKlNtUKCovuhVWQ5GVArx5pvvLSj62iUP0Lj+EcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aa3f9c803ec0b2797ad8e752f0e0a574125668bead945cb3c8ce8984d5bd76a","last_reissued_at":"2026-05-17T23:54:58.240626Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.240626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Black-Box Complexity with Tail Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt, Per Kristian Lehre","submitted_at":"2019-01-31T22:30:10Z","abstract_excerpt":"We propose a new black-box complexity model for search algorithms evaluating $\\lambda$ search points in parallel. The parallel unary unbiased black-box complexity gives lower bounds on the number of function evaluations every parallel unary unbiased black-box algorithm needs to optimise a given problem. It captures the inertia caused by offspring populations in evolutionary algorithms and the total computational effort in parallel metaheuristics.\n  We present complexity results for LeadingOnes and OneMax. Our main result is a general performance limit: we prove that on every function every $\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00107","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":"1902.00107","created_at":"2026-05-17T23:54:58.240721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00107v1","created_at":"2026-05-17T23:54:58.240721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00107","created_at":"2026-05-17T23:54:58.240721+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKR7TSAD5QFS","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKR7TSAD5QFSPF5N","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKR7TSAD","created_at":"2026-05-18T12:33:24.271573+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/NKR7TSAD5QFSPF5NRZ2S6DQKK5","json":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5.json","graph_json":"https://pith.science/api/pith-number/NKR7TSAD5QFSPF5NRZ2S6DQKK5/graph.json","events_json":"https://pith.science/api/pith-number/NKR7TSAD5QFSPF5NRZ2S6DQKK5/events.json","paper":"https://pith.science/paper/NKR7TSAD"},"agent_actions":{"view_html":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5","download_json":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5.json","view_paper":"https://pith.science/paper/NKR7TSAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00107&json=true","fetch_graph":"https://pith.science/api/pith-number/NKR7TSAD5QFSPF5NRZ2S6DQKK5/graph.json","fetch_events":"https://pith.science/api/pith-number/NKR7TSAD5QFSPF5NRZ2S6DQKK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5/action/storage_attestation","attest_author":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5/action/author_attestation","sign_citation":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5/action/citation_signature","submit_replication":"https://pith.science/pith/NKR7TSAD5QFSPF5NRZ2S6DQKK5/action/replication_record"}},"created_at":"2026-05-17T23:54:58.240721+00:00","updated_at":"2026-05-17T23:54:58.240721+00:00"}