{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TS6BO3LZCRNN4NEY5RWCNOUF6N","short_pith_number":"pith:TS6BO3LZ","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"},"canonical_sha256":"9cbc176d79145ade3498ec6c26ba85f37aab1694f3aa7db1ff9c275ec4469a10","source":{"kind":"arxiv","id":"2509.01739","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.01739","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2509.01739v2","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01739","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"TS6BO3LZCRNN","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"TS6BO3LZCRNN4NEY","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"TS6BO3LZ","created_at":"2026-06-03T01:05:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TS6BO3LZCRNN4NEY5RWCNOUF6N","target":"record","payload":{"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"},"canonical_sha256":"9cbc176d79145ade3498ec6c26ba85f37aab1694f3aa7db1ff9c275ec4469a10","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"},"source_kind":"arxiv","source_id":"2509.01739","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0pxaIYJG5PLjo2QPZPQecCtFiFf+pHLbfoG/jXJFLsp7STmIihD+1yGwmNEK3ehgoUXSmk56+1KAwQOVcHc1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:06:14.655987Z"},"content_sha256":"e8656d34fde05ca8d4fccfbe09d917d65cc42b96380f6f0eb2910b7efa672ef3","schema_version":"1.0","event_id":"sha256:e8656d34fde05ca8d4fccfbe09d917d65cc42b96380f6f0eb2910b7efa672ef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TS6BO3LZCRNN4NEY5RWCNOUF6N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"760fWRaFTK1j9rWthXQVSDWrOuhs28SDgIVJWA3buecHBU7TUH+HHGk8HQ2Fq864pyv7fdQhy0eZGjEJgqf/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:06:14.656378Z"},"content_sha256":"1dab387e8afc822851b6470077f93908e7651918c808e53f088ba65da7a3fc7e","schema_version":"1.0","event_id":"sha256:1dab387e8afc822851b6470077f93908e7651918c808e53f088ba65da7a3fc7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/bundle.json","state_url":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T10:06:14Z","links":{"resolver":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N","bundle":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/bundle.json","state":"https://pith.science/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TS6BO3LZCRNN4NEY5RWCNOUF6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TS6BO3LZCRNN4NEY5RWCNOUF6N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2a3f8404658c90b31bd1ea521eaddca84a7b42417324301ed1d90c4049257fb7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-01T19:45:17Z","title_canon_sha256":"9121d673e9f183eddc89b9ff59185dffebd48cae2f164f5d6f6566dab1022016"},"schema_version":"1.0","source":{"id":"2509.01739","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.01739","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2509.01739v2","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01739","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"TS6BO3LZCRNN","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"TS6BO3LZCRNN4NEY","created_at":"2026-06-03T01:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"TS6BO3LZ","created_at":"2026-06-03T01:05:44Z"}],"graph_snapshots":[{"event_id":"sha256:1dab387e8afc822851b6470077f93908e7651918c808e53f088ba65da7a3fc7e","target":"graph","created_at":"2026-06-03T01:05:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.01739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Benjamin Doerr, Martin S. Krejca, Simon Wietheger","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-01T19:45:17Z","title":"Speeding Up the NSGA-II via Dynamic Population Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01739","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e8656d34fde05ca8d4fccfbe09d917d65cc42b96380f6f0eb2910b7efa672ef3","target":"record","created_at":"2026-06-03T01:05:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2a3f8404658c90b31bd1ea521eaddca84a7b42417324301ed1d90c4049257fb7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-01T19:45:17Z","title_canon_sha256":"9121d673e9f183eddc89b9ff59185dffebd48cae2f164f5d6f6566dab1022016"},"schema_version":"1.0","source":{"id":"2509.01739","kind":"arxiv","version":2}},"canonical_sha256":"9cbc176d79145ade3498ec6c26ba85f37aab1694f3aa7db1ff9c275ec4469a10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cbc176d79145ade3498ec6c26ba85f37aab1694f3aa7db1ff9c275ec4469a10","first_computed_at":"2026-06-03T01:05:44.744560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:44.744560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i1FWl5VzlwVuU/sIm9yQDrvK+zAFq48aqY6ca9X3413m3ya1RyDI7Zx0W+GujXlX/pXvnWA43BUuc+qaa86VAw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:44.744997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.01739","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8656d34fde05ca8d4fccfbe09d917d65cc42b96380f6f0eb2910b7efa672ef3","sha256:1dab387e8afc822851b6470077f93908e7651918c808e53f088ba65da7a3fc7e"],"state_sha256":"84ac541e1a5de038ddcb082614ff84539ecd308d51cd3e90a4abae81a114a9bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B02+PvZp+hD6zxts5hCpY65Ug+5z9i+IlovJdbQdWVtT2j7tKRVHjSeDpZvcpdDFa4rZoyNtlYGv8F0zUECRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:06:14.658396Z","bundle_sha256":"40bb240a0ecae94541a9fff8cecef14d64cf55ae3d0f43896cfe7484f91946a8"}}