{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PYFFR3MZKP6TF4MPVQ2BRRTWTO","short_pith_number":"pith:PYFFR3MZ","schema_version":"1.0","canonical_sha256":"7e0a58ed9953fd32f18fac3418c6769ba952e97a95b9041813e114542e6bfde0","source":{"kind":"arxiv","id":"1704.04366","version":1},"attestation_state":"computed","paper":{"title":"Runtime Analysis of the $(1+(\\lambda,\\lambda))$ Genetic Algorithm on Random Satisfiable 3-CNF Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Maxim Buzdalov","submitted_at":"2017-04-14T06:54:08Z","abstract_excerpt":"The $(1+(\\lambda,\\lambda))$ genetic algorithm, first proposed at GECCO 2013, showed a surprisingly good performance on so me optimization problems. The theoretical analysis so far was restricted to the OneMax test function, where this GA profited from the perfect fitness-distance correlation. In this work, we conduct a rigorous runtime analysis of this GA on random 3-SAT instances in the planted solution model having at least logarithmic average degree, which are known to have a weaker fitness distance correlation.\n  We prove that this GA with fixed not too large population size again obtains "},"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":"1704.04366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-04-14T06:54:08Z","cross_cats_sorted":[],"title_canon_sha256":"35a988c3c1cbcbdb50b39efe7bbcaabd7035d84aaaaf6245a93507fd74e62503","abstract_canon_sha256":"830e7a7a8dc2f3197eed50b5568dbceb70df3f37656d843844562b3939cf715a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:21.828332Z","signature_b64":"80OhzL+86bCJzG0VdM7hPT6sWnHBcXMUtxG/HXg+cxM5Sli2Z03VrgAcB8SG61Wf2nyRzFJzr478eWVUud0iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e0a58ed9953fd32f18fac3418c6769ba952e97a95b9041813e114542e6bfde0","last_reissued_at":"2026-05-18T00:46:21.827901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:21.827901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Runtime Analysis of the $(1+(\\lambda,\\lambda))$ Genetic Algorithm on Random Satisfiable 3-CNF Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Maxim Buzdalov","submitted_at":"2017-04-14T06:54:08Z","abstract_excerpt":"The $(1+(\\lambda,\\lambda))$ genetic algorithm, first proposed at GECCO 2013, showed a surprisingly good performance on so me optimization problems. The theoretical analysis so far was restricted to the OneMax test function, where this GA profited from the perfect fitness-distance correlation. In this work, we conduct a rigorous runtime analysis of this GA on random 3-SAT instances in the planted solution model having at least logarithmic average degree, which are known to have a weaker fitness distance correlation.\n  We prove that this GA with fixed not too large population size again obtains "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04366","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":"1704.04366","created_at":"2026-05-18T00:46:21.827968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04366v1","created_at":"2026-05-18T00:46:21.827968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04366","created_at":"2026-05-18T00:46:21.827968+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYFFR3MZKP6T","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYFFR3MZKP6TF4MP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYFFR3MZ","created_at":"2026-05-18T12:31:37.085036+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/PYFFR3MZKP6TF4MPVQ2BRRTWTO","json":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO.json","graph_json":"https://pith.science/api/pith-number/PYFFR3MZKP6TF4MPVQ2BRRTWTO/graph.json","events_json":"https://pith.science/api/pith-number/PYFFR3MZKP6TF4MPVQ2BRRTWTO/events.json","paper":"https://pith.science/paper/PYFFR3MZ"},"agent_actions":{"view_html":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO","download_json":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO.json","view_paper":"https://pith.science/paper/PYFFR3MZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04366&json=true","fetch_graph":"https://pith.science/api/pith-number/PYFFR3MZKP6TF4MPVQ2BRRTWTO/graph.json","fetch_events":"https://pith.science/api/pith-number/PYFFR3MZKP6TF4MPVQ2BRRTWTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO/action/storage_attestation","attest_author":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO/action/author_attestation","sign_citation":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO/action/citation_signature","submit_replication":"https://pith.science/pith/PYFFR3MZKP6TF4MPVQ2BRRTWTO/action/replication_record"}},"created_at":"2026-05-18T00:46:21.827968+00:00","updated_at":"2026-05-18T00:46:21.827968+00:00"}