{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WNNTSC4FBNK5P7YMXTRXMUPGG5","short_pith_number":"pith:WNNTSC4F","schema_version":"1.0","canonical_sha256":"b35b390b850b55d7ff0cbce37651e6377f4b2b739f9a32a8a42a452294e1b459","source":{"kind":"arxiv","id":"1504.02644","version":2},"attestation_state":"computed","paper":{"title":"OneMax in Black-Box Models with Several Restrictions","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-04-10T11:56:17Z","abstract_excerpt":"Black-box complexity studies lower bounds for the efficiency of general-purpose black-box optimization algorithms such as evolutionary algorithms and other search heuristics. Different models exist, each one being designed to analyze a different aspect of typical heuristics such as the memory size or the variation operators in use. While most of the previous works focus on one particular such aspect, we consider in this work how the combination of several algorithmic restrictions influence the black-box complexity. Our testbed are so-called OneMax functions, a classical set of test functions t"},"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":"1504.02644","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-04-10T11:56:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"78189a57b89e9e73d87a69dfc180c9d29e36cf34a5c8d7c8ca10a9922fe6817d","abstract_canon_sha256":"5c4c52b53db88934287445007629fb4a2a88ed969e7df5509804525315100b48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.193414Z","signature_b64":"n5dgFMTJBHslfvzhuOIW/yQUqlbzpwdBgncoZJ2xM/Z5l7JAH5cRElEmYhqVslV3jSAC6bAtmNwhwbap5Zs3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b35b390b850b55d7ff0cbce37651e6377f4b2b739f9a32a8a42a452294e1b459","last_reissued_at":"2026-05-18T01:33:32.192732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.192732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OneMax in Black-Box Models with Several Restrictions","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-04-10T11:56:17Z","abstract_excerpt":"Black-box complexity studies lower bounds for the efficiency of general-purpose black-box optimization algorithms such as evolutionary algorithms and other search heuristics. Different models exist, each one being designed to analyze a different aspect of typical heuristics such as the memory size or the variation operators in use. While most of the previous works focus on one particular such aspect, we consider in this work how the combination of several algorithmic restrictions influence the black-box complexity. Our testbed are so-called OneMax functions, a classical set of test functions t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02644","kind":"arxiv","version":2},"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":"1504.02644","created_at":"2026-05-18T01:33:32.192844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02644v2","created_at":"2026-05-18T01:33:32.192844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02644","created_at":"2026-05-18T01:33:32.192844+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNNTSC4FBNK5","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNNTSC4FBNK5P7YM","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNNTSC4F","created_at":"2026-05-18T12:29:47.479230+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/WNNTSC4FBNK5P7YMXTRXMUPGG5","json":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5.json","graph_json":"https://pith.science/api/pith-number/WNNTSC4FBNK5P7YMXTRXMUPGG5/graph.json","events_json":"https://pith.science/api/pith-number/WNNTSC4FBNK5P7YMXTRXMUPGG5/events.json","paper":"https://pith.science/paper/WNNTSC4F"},"agent_actions":{"view_html":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5","download_json":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5.json","view_paper":"https://pith.science/paper/WNNTSC4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02644&json=true","fetch_graph":"https://pith.science/api/pith-number/WNNTSC4FBNK5P7YMXTRXMUPGG5/graph.json","fetch_events":"https://pith.science/api/pith-number/WNNTSC4FBNK5P7YMXTRXMUPGG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5/action/storage_attestation","attest_author":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5/action/author_attestation","sign_citation":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5/action/citation_signature","submit_replication":"https://pith.science/pith/WNNTSC4FBNK5P7YMXTRXMUPGG5/action/replication_record"}},"created_at":"2026-05-18T01:33:32.192844+00:00","updated_at":"2026-05-18T01:33:32.192844+00:00"}