{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BKW4QADQFDIGJIAXY3VBRPE2HA","short_pith_number":"pith:BKW4QADQ","schema_version":"1.0","canonical_sha256":"0aadc8007028d064a017c6ea18bc9a382fc574dfdbaf0b8c5c83838680c663c1","source":{"kind":"arxiv","id":"1804.06173","version":1},"attestation_state":"computed","paper":{"title":"Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt, Phan Trung Hai Nguyen","submitted_at":"2018-04-17T11:35:21Z","abstract_excerpt":"Memetic algorithms are popular hybrid search heuristics that integrate local search into the search process of an evolutionary algorithm in order to combine the advantages of rapid exploitation and global optimisation. However, these algorithms are not well understood and the field is lacking a solid theoretical foundation that explains when and why memetic algorithms are effective.\n  We provide a rigorous runtime analysis of a simple memetic algorithm, the $(1+1)$ MA, on the Hurdle problem class, a landscape class of tuneable difficulty that shows a \"big valley structure\", a characteristic fe"},"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":"1804.06173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-17T11:35:21Z","cross_cats_sorted":[],"title_canon_sha256":"f93a87d847c558c66baffcaab1085c9716c025cca2372e2a56ac6cc4320a493d","abstract_canon_sha256":"346c5aa3c514510b96375f024e06702bba51b4f15bdc70a8abd443edf9b5b470"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.505097Z","signature_b64":"1eCaug+EHOTak5WdRFKF0psmyNStxe983857QU1cX64tPgUMSulUw1iZVT0Xf6kRGWFnBjZrgC8EI8tuBo2rCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aadc8007028d064a017c6ea18bc9a382fc574dfdbaf0b8c5c83838680c663c1","last_reissued_at":"2026-05-18T00:18:21.504385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.504385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt, Phan Trung Hai Nguyen","submitted_at":"2018-04-17T11:35:21Z","abstract_excerpt":"Memetic algorithms are popular hybrid search heuristics that integrate local search into the search process of an evolutionary algorithm in order to combine the advantages of rapid exploitation and global optimisation. However, these algorithms are not well understood and the field is lacking a solid theoretical foundation that explains when and why memetic algorithms are effective.\n  We provide a rigorous runtime analysis of a simple memetic algorithm, the $(1+1)$ MA, on the Hurdle problem class, a landscape class of tuneable difficulty that shows a \"big valley structure\", a characteristic fe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06173","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":"1804.06173","created_at":"2026-05-18T00:18:21.504504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06173v1","created_at":"2026-05-18T00:18:21.504504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06173","created_at":"2026-05-18T00:18:21.504504+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKW4QADQFDIG","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKW4QADQFDIGJIAX","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKW4QADQ","created_at":"2026-05-18T12:32:16.446611+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/BKW4QADQFDIGJIAXY3VBRPE2HA","json":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA.json","graph_json":"https://pith.science/api/pith-number/BKW4QADQFDIGJIAXY3VBRPE2HA/graph.json","events_json":"https://pith.science/api/pith-number/BKW4QADQFDIGJIAXY3VBRPE2HA/events.json","paper":"https://pith.science/paper/BKW4QADQ"},"agent_actions":{"view_html":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA","download_json":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA.json","view_paper":"https://pith.science/paper/BKW4QADQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06173&json=true","fetch_graph":"https://pith.science/api/pith-number/BKW4QADQFDIGJIAXY3VBRPE2HA/graph.json","fetch_events":"https://pith.science/api/pith-number/BKW4QADQFDIGJIAXY3VBRPE2HA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA/action/storage_attestation","attest_author":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA/action/author_attestation","sign_citation":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA/action/citation_signature","submit_replication":"https://pith.science/pith/BKW4QADQFDIGJIAXY3VBRPE2HA/action/replication_record"}},"created_at":"2026-05-18T00:18:21.504504+00:00","updated_at":"2026-05-18T00:18:21.504504+00:00"}