{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2CI3ANCAAIPFBN2SPA5345XFLD","short_pith_number":"pith:2CI3ANCA","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"},"canonical_sha256":"d091b03440021e50b752783bbe76e558c104cfbced86fd6b975b26d8ffd54dec","source":{"kind":"arxiv","id":"1403.6600","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6600","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6600v2","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6600","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"2CI3ANCAAIPF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2CI3ANCAAIPFBN2S","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2CI3ANCA","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2CI3ANCAAIPFBN2SPA5345XFLD","target":"record","payload":{"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"},"canonical_sha256":"d091b03440021e50b752783bbe76e558c104cfbced86fd6b975b26d8ffd54dec","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"},"source_kind":"arxiv","source_id":"1403.6600","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MdWpI1m1YTnY7U7UEFn3yvWoK2VuXNWO4QbSH1FeGy5rbqPzFcNhnVlhR6mfE/bOFxaOET1oDqeVYT9PQRWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:39:24.253016Z"},"content_sha256":"3eb2873c963e0b7395fae599ad27939a43c7fea4601f3bdcf892e7770bf0b775","schema_version":"1.0","event_id":"sha256:3eb2873c963e0b7395fae599ad27939a43c7fea4601f3bdcf892e7770bf0b775"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2CI3ANCAAIPFBN2SPA5345XFLD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QA2OQVFTivoAwRUKgz06u2WwS5jGqbt/EKD5/wbBifaF0dj3r9hy//AyPmhazbi3MftETgSZ+nLXk75G/l0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:39:24.253382Z"},"content_sha256":"7399592410d6fcf799b9cfa517710134dd95ea2bfe281a808c98d6f8db53b176","schema_version":"1.0","event_id":"sha256:7399592410d6fcf799b9cfa517710134dd95ea2bfe281a808c98d6f8db53b176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/bundle.json","state_url":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CI3ANCAAIPFBN2SPA5345XFLD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T23:39:24Z","links":{"resolver":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD","bundle":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/bundle.json","state":"https://pith.science/pith/2CI3ANCAAIPFBN2SPA5345XFLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CI3ANCAAIPFBN2SPA5345XFLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2CI3ANCAAIPFBN2SPA5345XFLD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0b68281dade5587267a665e640fe6403d81b42cf48e2bcf2f48664b1d8ec9cfe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-03-26T09:28:56Z","title_canon_sha256":"90a46fad60a79c97004b4a6f05cd82dccc6e67fac64aa61185308c959d4a3658"},"schema_version":"1.0","source":{"id":"1403.6600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6600","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6600v2","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6600","created_at":"2026-05-18T02:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"2CI3ANCAAIPF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2CI3ANCAAIPFBN2S","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2CI3ANCA","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:7399592410d6fcf799b9cfa517710134dd95ea2bfe281a808c98d6f8db53b176","target":"graph","created_at":"2026-05-18T02:32:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$","authors_text":"Dirk Sudholt","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-03-26T09:28:56Z","title":"How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6600","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3eb2873c963e0b7395fae599ad27939a43c7fea4601f3bdcf892e7770bf0b775","target":"record","created_at":"2026-05-18T02:32:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0b68281dade5587267a665e640fe6403d81b42cf48e2bcf2f48664b1d8ec9cfe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-03-26T09:28:56Z","title_canon_sha256":"90a46fad60a79c97004b4a6f05cd82dccc6e67fac64aa61185308c959d4a3658"},"schema_version":"1.0","source":{"id":"1403.6600","kind":"arxiv","version":2}},"canonical_sha256":"d091b03440021e50b752783bbe76e558c104cfbced86fd6b975b26d8ffd54dec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d091b03440021e50b752783bbe76e558c104cfbced86fd6b975b26d8ffd54dec","first_computed_at":"2026-05-18T02:32:46.194798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:46.194798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TY9l8cqe1Lqtb1YUjw90WLahETmQ0tViUZgoEFC2rxnQPqMfQ1nE/I7gmEBVkNz+pSMColtPxr1MpGqUFYanAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:46.195288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eb2873c963e0b7395fae599ad27939a43c7fea4601f3bdcf892e7770bf0b775","sha256:7399592410d6fcf799b9cfa517710134dd95ea2bfe281a808c98d6f8db53b176"],"state_sha256":"2b29dba7c200161f240b9f10dff7ad78314fcbe088f28c7e8ce59eae92c7bcb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RhfGdGkGjXDUvt3wq1svQf06L0VHAg+etNc5enwD87lWrxl5vsBvU++F3UPItAjYCrJlVWiQC5LQiUP4j5cWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:39:24.255296Z","bundle_sha256":"6014bcb1218ee1f350b33d64414c453b8c282ed7debbca11549b272bcf33118b"}}