{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HGTYPRACWFP5DHDPJLWMQC6P3L","short_pith_number":"pith:HGTYPRAC","schema_version":"1.0","canonical_sha256":"39a787c402b15fd19c6f4aecc80bcfdacfd92dd0cdd3bdec18cec6b3167a4b97","source":{"kind":"arxiv","id":"1904.09239","version":1},"attestation_state":"computed","paper":{"title":"Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Per Kristian Lehre, Phan Trung Hai Nguyen","submitted_at":"2019-04-19T15:49:27Z","abstract_excerpt":"We perform a rigorous runtime analysis for the Univariate Marginal Distribution Algorithm on the LeadingOnes function, a well-known benchmark function in the theory community of evolutionary computation with a high correlation between decision variables. For a problem instance of size $n$, the currently best known upper bound on the expected runtime is $\\mathcal{O}(n\\lambda\\log\\lambda+n^2)$ (Dang and Lehre, GECCO 2015), while a lower bound necessary to understand how the algorithm copes with variable dependencies is still missing. Motivated by this, we show that the algorithm requires a $e^{\\O"},"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":"1904.09239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-19T15:49:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0640f3875ada9955d2e3624eeed1787afff05d342923ba15f84506a2b451ad8a","abstract_canon_sha256":"6a8dbcf0d0cc3b7decbc5e6c892183b1d4c62105fd2490cd6f0057a1b414afc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:07.904267Z","signature_b64":"bKYnOrThzLC8FcbNwbxMr438G02XgfPTzRZm5WwJ6ZfxcqNCmOM1zywpEULHfth+czXT5scZQuNJSbW514lrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39a787c402b15fd19c6f4aecc80bcfdacfd92dd0cdd3bdec18cec6b3167a4b97","last_reissued_at":"2026-05-17T23:48:07.903811Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:07.903811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Per Kristian Lehre, Phan Trung Hai Nguyen","submitted_at":"2019-04-19T15:49:27Z","abstract_excerpt":"We perform a rigorous runtime analysis for the Univariate Marginal Distribution Algorithm on the LeadingOnes function, a well-known benchmark function in the theory community of evolutionary computation with a high correlation between decision variables. For a problem instance of size $n$, the currently best known upper bound on the expected runtime is $\\mathcal{O}(n\\lambda\\log\\lambda+n^2)$ (Dang and Lehre, GECCO 2015), while a lower bound necessary to understand how the algorithm copes with variable dependencies is still missing. Motivated by this, we show that the algorithm requires a $e^{\\O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09239","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":"1904.09239","created_at":"2026-05-17T23:48:07.903887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09239v1","created_at":"2026-05-17T23:48:07.903887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09239","created_at":"2026-05-17T23:48:07.903887+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGTYPRACWFP5","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGTYPRACWFP5DHDP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGTYPRAC","created_at":"2026-05-18T12:33:18.533446+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/HGTYPRACWFP5DHDPJLWMQC6P3L","json":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L.json","graph_json":"https://pith.science/api/pith-number/HGTYPRACWFP5DHDPJLWMQC6P3L/graph.json","events_json":"https://pith.science/api/pith-number/HGTYPRACWFP5DHDPJLWMQC6P3L/events.json","paper":"https://pith.science/paper/HGTYPRAC"},"agent_actions":{"view_html":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L","download_json":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L.json","view_paper":"https://pith.science/paper/HGTYPRAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09239&json=true","fetch_graph":"https://pith.science/api/pith-number/HGTYPRACWFP5DHDPJLWMQC6P3L/graph.json","fetch_events":"https://pith.science/api/pith-number/HGTYPRACWFP5DHDPJLWMQC6P3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L/action/storage_attestation","attest_author":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L/action/author_attestation","sign_citation":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L/action/citation_signature","submit_replication":"https://pith.science/pith/HGTYPRACWFP5DHDPJLWMQC6P3L/action/replication_record"}},"created_at":"2026-05-17T23:48:07.903887+00:00","updated_at":"2026-05-17T23:48:07.903887+00:00"}