{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YND5HJNRBAZ3GJ23GOO7GL6LWM","short_pith_number":"pith:YND5HJNR","schema_version":"1.0","canonical_sha256":"c347d3a5b10833b3275b339df32fcbb30f131268b3c8bfdd29b5f55d31688e2b","source":{"kind":"arxiv","id":"1508.06802","version":1},"attestation_state":"computed","paper":{"title":"Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Johannes Lengler","submitted_at":"2015-08-27T11:17:34Z","abstract_excerpt":"Black-box complexity theory provides lower bounds for the runtime of black-box optimizers like evolutionary algorithms and serves as an inspiration for the design of new genetic algorithms. Several black-box models covering different classes of algorithms exist, each highlighting a different aspect of the algorithms under considerations. In this work we add to the existing black-box notions a new \\emph{elitist black-box model}, in which algorithms are required to base all decisions solely on (a fixed number of) the best search points sampled so far. Our model combines features of the ranking-b"},"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":"1508.06802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-08-27T11:17:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2b2e90fd6f12e541f66225da4df3605865f7959872801f71c80e4f67667dbd16","abstract_canon_sha256":"585a9773ca4e9b3139f4b255d1067c3b2ee9b22d585125e13f2bcc465f1c1c27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:41.002646Z","signature_b64":"0OuD5ZFAhjW99OyEwnQUjQG7K812Sdt6ZwMq2zBUnIj8J9lDDJMJLSGY/JPJKL9NbfxRO9xvz6ryB7qafvjoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c347d3a5b10833b3275b339df32fcbb30f131268b3c8bfdd29b5f55d31688e2b","last_reissued_at":"2026-05-18T01:34:41.002135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:41.002135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Johannes Lengler","submitted_at":"2015-08-27T11:17:34Z","abstract_excerpt":"Black-box complexity theory provides lower bounds for the runtime of black-box optimizers like evolutionary algorithms and serves as an inspiration for the design of new genetic algorithms. Several black-box models covering different classes of algorithms exist, each highlighting a different aspect of the algorithms under considerations. In this work we add to the existing black-box notions a new \\emph{elitist black-box model}, in which algorithms are required to base all decisions solely on (a fixed number of) the best search points sampled so far. Our model combines features of the ranking-b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06802","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":"1508.06802","created_at":"2026-05-18T01:34:41.002215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06802v1","created_at":"2026-05-18T01:34:41.002215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06802","created_at":"2026-05-18T01:34:41.002215+00:00"},{"alias_kind":"pith_short_12","alias_value":"YND5HJNRBAZ3","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YND5HJNRBAZ3GJ23","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YND5HJNR","created_at":"2026-05-18T12:29:50.041715+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/YND5HJNRBAZ3GJ23GOO7GL6LWM","json":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM.json","graph_json":"https://pith.science/api/pith-number/YND5HJNRBAZ3GJ23GOO7GL6LWM/graph.json","events_json":"https://pith.science/api/pith-number/YND5HJNRBAZ3GJ23GOO7GL6LWM/events.json","paper":"https://pith.science/paper/YND5HJNR"},"agent_actions":{"view_html":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM","download_json":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM.json","view_paper":"https://pith.science/paper/YND5HJNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06802&json=true","fetch_graph":"https://pith.science/api/pith-number/YND5HJNRBAZ3GJ23GOO7GL6LWM/graph.json","fetch_events":"https://pith.science/api/pith-number/YND5HJNRBAZ3GJ23GOO7GL6LWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM/action/storage_attestation","attest_author":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM/action/author_attestation","sign_citation":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM/action/citation_signature","submit_replication":"https://pith.science/pith/YND5HJNRBAZ3GJ23GOO7GL6LWM/action/replication_record"}},"created_at":"2026-05-18T01:34:41.002215+00:00","updated_at":"2026-05-18T01:34:41.002215+00:00"}