{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G6AZ4TAMYTR5PYTRZLNHMMCCBW","short_pith_number":"pith:G6AZ4TAM","schema_version":"1.0","canonical_sha256":"37819e4c0cc4e3d7e271cada7630420dbc03bcb7e07a0037a57387df66971893","source":{"kind":"arxiv","id":"2412.11931","version":2},"attestation_state":"computed","paper":{"title":"Speeding Up the NSGA-II With a Simple Tie-Breaking Rule","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Martin S. Krejca, Tudor Ivan","submitted_at":"2024-12-16T16:15:37Z","abstract_excerpt":"The non-dominated sorting genetic algorithm~II (NSGA-II) is the most popular multi-objective optimization heuristic. Recent mathematical runtime analyses have detected two shortcomings in discrete search spaces, namely, that the NSGA-II has difficulties with more than two objectives and that it is very sensitive to the choice of the population size. To overcome these difficulties, we analyze a simple tie-breaking rule in the selection of the next population. Similar rules have been proposed before, but have found only little acceptance. We prove the effectiveness of our tie-breaking rule via m"},"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":"2412.11931","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-12-16T16:15:37Z","cross_cats_sorted":[],"title_canon_sha256":"064589ac096ed106a13ac76c909e76db39e68b1b7fb7826b8e59768def1f9c65","abstract_canon_sha256":"e1abf0a659e2448a40a3a379b1a7bcf6899923ab6e3ac5355b9c0a250b8445f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:04.955259Z","signature_b64":"xbQNhUzh4eXtaQl536aGnq484UH9WMYfuOZdOlFaKyB39/GrcinIzahou9HlhknzfuyvNwklX5EFWDhEyH/8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37819e4c0cc4e3d7e271cada7630420dbc03bcb7e07a0037a57387df66971893","last_reissued_at":"2026-07-05T10:51:04.954720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:04.954720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding Up the NSGA-II With a Simple Tie-Breaking Rule","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Martin S. Krejca, Tudor Ivan","submitted_at":"2024-12-16T16:15:37Z","abstract_excerpt":"The non-dominated sorting genetic algorithm~II (NSGA-II) is the most popular multi-objective optimization heuristic. Recent mathematical runtime analyses have detected two shortcomings in discrete search spaces, namely, that the NSGA-II has difficulties with more than two objectives and that it is very sensitive to the choice of the population size. To overcome these difficulties, we analyze a simple tie-breaking rule in the selection of the next population. Similar rules have been proposed before, but have found only little acceptance. We prove the effectiveness of our tie-breaking rule via m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11931","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.11931/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":"2412.11931","created_at":"2026-07-05T10:51:04.954780+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11931v2","created_at":"2026-07-05T10:51:04.954780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11931","created_at":"2026-07-05T10:51:04.954780+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6AZ4TAMYTR5","created_at":"2026-07-05T10:51:04.954780+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6AZ4TAMYTR5PYTR","created_at":"2026-07-05T10:51:04.954780+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6AZ4TAM","created_at":"2026-07-05T10:51:04.954780+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/G6AZ4TAMYTR5PYTRZLNHMMCCBW","json":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW.json","graph_json":"https://pith.science/api/pith-number/G6AZ4TAMYTR5PYTRZLNHMMCCBW/graph.json","events_json":"https://pith.science/api/pith-number/G6AZ4TAMYTR5PYTRZLNHMMCCBW/events.json","paper":"https://pith.science/paper/G6AZ4TAM"},"agent_actions":{"view_html":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW","download_json":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW.json","view_paper":"https://pith.science/paper/G6AZ4TAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11931&json=true","fetch_graph":"https://pith.science/api/pith-number/G6AZ4TAMYTR5PYTRZLNHMMCCBW/graph.json","fetch_events":"https://pith.science/api/pith-number/G6AZ4TAMYTR5PYTRZLNHMMCCBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW/action/storage_attestation","attest_author":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW/action/author_attestation","sign_citation":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW/action/citation_signature","submit_replication":"https://pith.science/pith/G6AZ4TAMYTR5PYTRZLNHMMCCBW/action/replication_record"}},"created_at":"2026-07-05T10:51:04.954780+00:00","updated_at":"2026-07-05T10:51:04.954780+00:00"}