{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TS6BO3LZCRNN4NEY5RWCNOUF6N","short_pith_number":"pith:TS6BO3LZ","schema_version":"1.0","canonical_sha256":"9cbc176d79145ade3498ec6c26ba85f37aab1694f3aa7db1ff9c275ec4469a10","source":{"kind":"arxiv","id":"2509.01739","version":2},"attestation_state":"computed","paper":{"title":"Speeding Up the NSGA-II via Dynamic Population Sizes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Martin S. Krejca, Simon Wietheger","submitted_at":"2025-09-01T19:45:17Z","abstract_excerpt":"Multi-objective evolutionary algorithms (MOEAs) are among the most widely and successfully applied optimizers for multi-objective problems. However, to store many optimal trade-offs (the Pareto optima) simultaneously, MOEAs are typically run with a large population of solution candidates. This slows down the algorithm and renders the choice of the population size a crucial design decision. In this work, we aim to overcome these difficulties by proposing the dynamic NSGA-II, a variant of the well-known NSGA-II that starts with a small initial population and doubles it after a user-specified num"},"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":"2509.01739","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-01T19:45:17Z","cross_cats_sorted":[],"title_canon_sha256":"9121d673e9f183eddc89b9ff59185dffebd48cae2f164f5d6f6566dab1022016","abstract_canon_sha256":"2a3f8404658c90b31bd1ea521eaddca84a7b42417324301ed1d90c4049257fb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:44.744997Z","signature_b64":"i1FWl5VzlwVuU/sIm9yQDrvK+zAFq48aqY6ca9X3413m3ya1RyDI7Zx0W+GujXlX/pXvnWA43BUuc+qaa86VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cbc176d79145ade3498ec6c26ba85f37aab1694f3aa7db1ff9c275ec4469a10","last_reissued_at":"2026-06-03T01:05:44.744560Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:44.744560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding Up the NSGA-II via Dynamic Population Sizes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Martin S. Krejca, Simon Wietheger","submitted_at":"2025-09-01T19:45:17Z","abstract_excerpt":"Multi-objective evolutionary algorithms (MOEAs) are among the most widely and successfully applied optimizers for multi-objective problems. However, to store many optimal trade-offs (the Pareto optima) simultaneously, MOEAs are typically run with a large population of solution candidates. This slows down the algorithm and renders the choice of the population size a crucial design decision. In this work, we aim to overcome these difficulties by proposing the dynamic NSGA-II, a variant of the well-known NSGA-II that starts with a small initial population and doubles it after a user-specified num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01739","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/2509.01739/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":"2509.01739","created_at":"2026-06-03T01:05:44.744619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.01739v2","created_at":"2026-06-03T01:05:44.744619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01739","created_at":"2026-06-03T01:05:44.744619+00:00"},{"alias_kind":"pith_short_12","alias_value":"TS6BO3LZCRNN","created_at":"2026-06-03T01:05:44.744619+00:00"},{"alias_kind":"pith_short_16","alias_value":"TS6BO3LZCRNN4NEY","created_at":"2026-06-03T01:05:44.744619+00:00"},{"alias_kind":"pith_short_8","alias_value":"TS6BO3LZ","created_at":"2026-06-03T01:05:44.744619+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/TS6BO3LZCRNN4NEY5RWCNOUF6N","json":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N.json","graph_json":"https://pith.science/api/pith-number/TS6BO3LZCRNN4NEY5RWCNOUF6N/graph.json","events_json":"https://pith.science/api/pith-number/TS6BO3LZCRNN4NEY5RWCNOUF6N/events.json","paper":"https://pith.science/paper/TS6BO3LZ"},"agent_actions":{"view_html":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N","download_json":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N.json","view_paper":"https://pith.science/paper/TS6BO3LZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.01739&json=true","fetch_graph":"https://pith.science/api/pith-number/TS6BO3LZCRNN4NEY5RWCNOUF6N/graph.json","fetch_events":"https://pith.science/api/pith-number/TS6BO3LZCRNN4NEY5RWCNOUF6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/action/storage_attestation","attest_author":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/action/author_attestation","sign_citation":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/action/citation_signature","submit_replication":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/action/replication_record"}},"created_at":"2026-06-03T01:05:44.744619+00:00","updated_at":"2026-06-03T01:05:44.744619+00:00"}