{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2CI3ANCAAIPFBN2SPA5345XFLD","short_pith_number":"pith:2CI3ANCA","schema_version":"1.0","canonical_sha256":"d091b03440021e50b752783bbe76e558c104cfbced86fd6b975b26d8ffd54dec","source":{"kind":"arxiv","id":"1403.6600","version":2},"attestation_state":"computed","paper":{"title":"How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt","submitted_at":"2014-03-26T09:28:56Z","abstract_excerpt":"We re-investigate a fundamental question: how effective is crossover in Genetic Algorithms in combining building blocks of good solutions? Although this has been discussed controversially for decades, we are still lacking a rigorous and intuitive answer. We provide such answers for royal road functions and OneMax, where every bit is a building block. For the latter we show that using crossover makes every ($\\mu$+$\\lambda$) Genetic Algorithm at least twice as fast as the fastest evolutionary algorithm using only standard bit mutation, up to small-order terms and for moderate $\\mu$ and $\\lambda$"},"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":"1403.6600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-03-26T09:28:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"90a46fad60a79c97004b4a6f05cd82dccc6e67fac64aa61185308c959d4a3658","abstract_canon_sha256":"0b68281dade5587267a665e640fe6403d81b42cf48e2bcf2f48664b1d8ec9cfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:46.195288Z","signature_b64":"TY9l8cqe1Lqtb1YUjw90WLahETmQ0tViUZgoEFC2rxnQPqMfQ1nE/I7gmEBVkNz+pSMColtPxr1MpGqUFYanAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d091b03440021e50b752783bbe76e558c104cfbced86fd6b975b26d8ffd54dec","last_reissued_at":"2026-05-18T02:32:46.194798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:46.194798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt","submitted_at":"2014-03-26T09:28:56Z","abstract_excerpt":"We re-investigate a fundamental question: how effective is crossover in Genetic Algorithms in combining building blocks of good solutions? Although this has been discussed controversially for decades, we are still lacking a rigorous and intuitive answer. We provide such answers for royal road functions and OneMax, where every bit is a building block. For the latter we show that using crossover makes every ($\\mu$+$\\lambda$) Genetic Algorithm at least twice as fast as the fastest evolutionary algorithm using only standard bit mutation, up to small-order terms and for moderate $\\mu$ and $\\lambda$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6600","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":"1403.6600","created_at":"2026-05-18T02:32:46.194871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6600v2","created_at":"2026-05-18T02:32:46.194871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6600","created_at":"2026-05-18T02:32:46.194871+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CI3ANCAAIPF","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CI3ANCAAIPFBN2S","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CI3ANCA","created_at":"2026-05-18T12:28:09.283467+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/2CI3ANCAAIPFBN2SPA5345XFLD","json":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD.json","graph_json":"https://pith.science/api/pith-number/2CI3ANCAAIPFBN2SPA5345XFLD/graph.json","events_json":"https://pith.science/api/pith-number/2CI3ANCAAIPFBN2SPA5345XFLD/events.json","paper":"https://pith.science/paper/2CI3ANCA"},"agent_actions":{"view_html":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD","download_json":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD.json","view_paper":"https://pith.science/paper/2CI3ANCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6600&json=true","fetch_graph":"https://pith.science/api/pith-number/2CI3ANCAAIPFBN2SPA5345XFLD/graph.json","fetch_events":"https://pith.science/api/pith-number/2CI3ANCAAIPFBN2SPA5345XFLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/action/storage_attestation","attest_author":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/action/author_attestation","sign_citation":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/action/citation_signature","submit_replication":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/action/replication_record"}},"created_at":"2026-05-18T02:32:46.194871+00:00","updated_at":"2026-05-18T02:32:46.194871+00:00"}