{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZLAGA2UW4PJN3DKGGZNYDVPSWV","short_pith_number":"pith:ZLAGA2UW","schema_version":"1.0","canonical_sha256":"cac0606a96e3d2dd8d46365b81d5f2b569f4f84c33f78204c474cbc36dc257a3","source":{"kind":"arxiv","id":"2411.10017","version":1},"attestation_state":"computed","paper":{"title":"Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Dimitri Korkotashvili, Martin S. Krejca","submitted_at":"2024-11-15T07:50:40Z","abstract_excerpt":"The NSGA-II is the most prominent multi-objective evolutionary algorithm (cited more than 50,000 times). Very recently, a mathematical runtime analysis has proven that this algorithm can have enormous difficulties when the number of objectives is larger than two (Zheng, Doerr. IEEE Transactions on Evolutionary Computation (2024)). However, this result was shown only for the OneMinMax benchmark problem, which has the particularity that all solutions are on the Pareto front, a fact heavily exploited in the proof of this result.\n  In this work, we show a comparable result for the LeadingOnesTrail"},"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":"2411.10017","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-11-15T07:50:40Z","cross_cats_sorted":[],"title_canon_sha256":"55d73b29cdb878248284ce00a5b7f7fc9a5ef860e39ed9e4797993e4023c209b","abstract_canon_sha256":"41f57691a2f83cca1ad1f90a80481ec86eeeb858dc9969f178ff4c97a83dca11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:57.266647Z","signature_b64":"thSJhJjqNpOq47E+Zpw5Oju8LHYZXs38QRfJ5vfibfg8G5JeHoGbrab3RWRIgJtPGJbs/aByMFrDOb9GEjggCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac0606a96e3d2dd8d46365b81d5f2b569f4f84c33f78204c474cbc36dc257a3","last_reissued_at":"2026-07-05T09:35:57.266143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:57.266143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Dimitri Korkotashvili, Martin S. Krejca","submitted_at":"2024-11-15T07:50:40Z","abstract_excerpt":"The NSGA-II is the most prominent multi-objective evolutionary algorithm (cited more than 50,000 times). Very recently, a mathematical runtime analysis has proven that this algorithm can have enormous difficulties when the number of objectives is larger than two (Zheng, Doerr. IEEE Transactions on Evolutionary Computation (2024)). However, this result was shown only for the OneMinMax benchmark problem, which has the particularity that all solutions are on the Pareto front, a fact heavily exploited in the proof of this result.\n  In this work, we show a comparable result for the LeadingOnesTrail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10017","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.10017/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.10017","created_at":"2026-07-05T09:35:57.266202+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10017v1","created_at":"2026-07-05T09:35:57.266202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10017","created_at":"2026-07-05T09:35:57.266202+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLAGA2UW4PJN","created_at":"2026-07-05T09:35:57.266202+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLAGA2UW4PJN3DKG","created_at":"2026-07-05T09:35:57.266202+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLAGA2UW","created_at":"2026-07-05T09:35:57.266202+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11931","citing_title":"Speeding Up the NSGA-II With a Simple Tie-Breaking Rule","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV","json":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV.json","graph_json":"https://pith.science/api/pith-number/ZLAGA2UW4PJN3DKGGZNYDVPSWV/graph.json","events_json":"https://pith.science/api/pith-number/ZLAGA2UW4PJN3DKGGZNYDVPSWV/events.json","paper":"https://pith.science/paper/ZLAGA2UW"},"agent_actions":{"view_html":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV","download_json":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV.json","view_paper":"https://pith.science/paper/ZLAGA2UW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10017&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLAGA2UW4PJN3DKGGZNYDVPSWV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLAGA2UW4PJN3DKGGZNYDVPSWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV/action/storage_attestation","attest_author":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV/action/author_attestation","sign_citation":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV/action/citation_signature","submit_replication":"https://pith.science/pith/ZLAGA2UW4PJN3DKGGZNYDVPSWV/action/replication_record"}},"created_at":"2026-07-05T09:35:57.266202+00:00","updated_at":"2026-07-05T09:35:57.266202+00:00"}