{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SYAGVP256565ZAA5JKC2NZPSBS","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":"ccc3ca89030db7ddb96155fb99247bb4fa2eaa1429ebe17a159d7866ac6e6ed0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-08-08T04:09:52Z","title_canon_sha256":"6f09a03b38baaa519dfbce7ce9fc2e281d0f72fc6647b96a54d20b9ad197b0e0"},"schema_version":"1.0","source":{"id":"2408.04207","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.04207","created_at":"2026-06-09T02:07:00Z"},{"alias_kind":"arxiv_version","alias_value":"2408.04207v3","created_at":"2026-06-09T02:07:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04207","created_at":"2026-06-09T02:07:00Z"},{"alias_kind":"pith_short_12","alias_value":"SYAGVP256565","created_at":"2026-06-09T02:07:00Z"},{"alias_kind":"pith_short_16","alias_value":"SYAGVP256565ZAA5","created_at":"2026-06-09T02:07:00Z"},{"alias_kind":"pith_short_8","alias_value":"SYAGVP25","created_at":"2026-06-09T02:07:00Z"}],"graph_snapshots":[{"event_id":"sha256:1977809a08c465dd255b4755426de30fab4f9468e8de624d64a55d29469eb06c","target":"graph","created_at":"2026-06-09T02:07:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove the same expected runtime of O(max{k,1}n ln n) for the (G)SEMO, MOEA/D, NSGA-II, and SMS-EMOA on OneMaxMin_k."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis assumes that the specific definition of OneMaxMin_k (with its per-bit conflict structure for each k) accurately captures the intended degrees of conflict and that the standard selection and variation operators of the listed MOEAs behave as modeled in the runtime proofs (Section 3 and 4)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MOEAs achieve O(max{k,1}n ln n) expected runtime on OneMaxMin_k for all k while scalarization fails full coverage for k>2 and epsilon-constraint requires tuned parameters."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MOEAs achieve expected runtime O(max{k,1}n ln n) on OneMaxMin_k for any conflict degree k, while scalarization fails to cover the Pareto front for k>2"}],"snapshot_sha256":"be15ae744e7feb4703edf2f286a9a79c3305fa0aed8097696cdecd275cc4fcbf"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"d0d0deae94054dd32b9da910cc764a02c39bc2adbe75021ae16357bdd1657510"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.04207/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The field of multiobjective evolutionary algorithms (MOEAs) often emphasizes its popularity for optimization problems with conflicting objectives. However, it is still theoretically unknown how MOEAs perform compared with typical approaches outside this field.\n  This paper conducts such a systematic theoretical comparison on problem classes with different degrees of conflict. With OneMaxMin$_k$ depicting $k\\in[0..n]$ degrees of conflict, we show the difficulties of two typical non-MOEA approaches, the scalarization (weighted-sum) and {the} $\\epsilon-$constraint approach. We prove that for any ","authors_text":"Weijie Zheng","cross_cats":[],"headline":"MOEAs achieve expected runtime O(max{k,1}n ln n) on OneMaxMin_k for any conflict degree k, while scalarization fails to cover the Pareto front for k>2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-08-08T04:09:52Z","title":"Proven Advantage of Multiobjective Evolutionary Algorithms for Problems with Different Degrees of Conflict"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04207","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-23T22:05:06.308642Z","id":"f965e9d8-7dc2-41e5-94e7-7a6113ad13a8","model_set":{"reader":"grok-4.3"},"one_line_summary":"MOEAs achieve O(max{k,1}n ln n) expected runtime on OneMaxMin_k for all k while scalarization fails full coverage for k>2 and epsilon-constraint requires tuned parameters.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"MOEAs achieve expected runtime O(max{k,1}n ln n) on OneMaxMin_k for any conflict degree k, while scalarization fails to cover the Pareto front for k>2","strongest_claim":"We prove the same expected runtime of O(max{k,1}n ln n) for the (G)SEMO, MOEA/D, NSGA-II, and SMS-EMOA on OneMaxMin_k.","weakest_assumption":"The analysis assumes that the specific definition of OneMaxMin_k (with its per-bit conflict structure for each k) accurately captures the intended degrees of conflict and that the standard selection and variation operators of the listed MOEAs behave as modeled in the runtime proofs (Section 3 and 4)."}},"verdict_id":"f965e9d8-7dc2-41e5-94e7-7a6113ad13a8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:84767f0c4e564c281a12d6b41f62735ce893417b1eb1b1214b1d271182adac06","target":"record","created_at":"2026-06-09T02:07:00Z","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":"ccc3ca89030db7ddb96155fb99247bb4fa2eaa1429ebe17a159d7866ac6e6ed0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-08-08T04:09:52Z","title_canon_sha256":"6f09a03b38baaa519dfbce7ce9fc2e281d0f72fc6647b96a54d20b9ad197b0e0"},"schema_version":"1.0","source":{"id":"2408.04207","kind":"arxiv","version":3}},"canonical_sha256":"96006abf5df77ddc801d4a85a6e5f20cb769f9d73c37e03778af5fd0b3cb2000","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96006abf5df77ddc801d4a85a6e5f20cb769f9d73c37e03778af5fd0b3cb2000","first_computed_at":"2026-06-09T02:07:00.046711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:07:00.046711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yhH5mpLyakxmtw66LeTMxobq3RFLmSezrYw25unLXXPoKByTMHyuO4Iu/NsKCq/ZqDhayS83m95KlKmDqljcCw==","signature_status":"signed_v1","signed_at":"2026-06-09T02:07:00.047525Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.04207","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84767f0c4e564c281a12d6b41f62735ce893417b1eb1b1214b1d271182adac06","sha256:1977809a08c465dd255b4755426de30fab4f9468e8de624d64a55d29469eb06c"],"state_sha256":"c26f9ada25fe7f773a406ec5e67672b4e397650cf443852984a9ee0387c5df35"}