{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:63ZPVOXDVEC4FWZMQH47IHURIO","short_pith_number":"pith:63ZPVOXD","schema_version":"1.0","canonical_sha256":"f6f2fabae3a905c2db2c81f9f41e9143abc4aa1a1e2a65cba0a650cd29dc54eb","source":{"kind":"arxiv","id":"2306.03409","version":1},"attestation_state":"computed","paper":{"title":"Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NE"],"primary_cat":"cs.AI","authors_text":"Andrew M. Sutton, Aneta Neumann, Anh Viet Do, Frank Neumann","submitted_at":"2023-06-06T05:13:29Z","abstract_excerpt":"We study the multi-objective minimum weight base problem, an abstraction of classical NP-hard combinatorial problems such as the multi-objective minimum spanning tree problem. We prove some important properties of the convex hull of the non-dominated front, such as its approximation quality and an upper bound on the number of extreme points. Using these properties, we give the first run-time analysis of the MOEA/D algorithm for this problem, an evolutionary algorithm that effectively optimizes by decomposing the objectives into single-objective components. We show that the MOEA/D, given an app"},"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":"2306.03409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-06-06T05:13:29Z","cross_cats_sorted":["cs.DS","cs.NE"],"title_canon_sha256":"4730d824d20d0cff785c4dd186e068ce6db49a7f636dd9b22455605a78a06e32","abstract_canon_sha256":"dc2c6ca527a7be61121271eda899f68a9f4a82badc9f699b337ee022edf7d3e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:57.842026Z","signature_b64":"XP9SVWQUYkL0gz7ob/NIpYXWrudw+TYFvaDwcORP9xqSQnGNSddamPzmmqCDFvSz5l0uD9O7Asaubazfx4hXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6f2fabae3a905c2db2c81f9f41e9143abc4aa1a1e2a65cba0a650cd29dc54eb","last_reissued_at":"2026-07-05T06:17:57.841632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:57.841632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NE"],"primary_cat":"cs.AI","authors_text":"Andrew M. Sutton, Aneta Neumann, Anh Viet Do, Frank Neumann","submitted_at":"2023-06-06T05:13:29Z","abstract_excerpt":"We study the multi-objective minimum weight base problem, an abstraction of classical NP-hard combinatorial problems such as the multi-objective minimum spanning tree problem. We prove some important properties of the convex hull of the non-dominated front, such as its approximation quality and an upper bound on the number of extreme points. Using these properties, we give the first run-time analysis of the MOEA/D algorithm for this problem, an evolutionary algorithm that effectively optimizes by decomposing the objectives into single-objective components. We show that the MOEA/D, given an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.03409","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/2306.03409/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":"2306.03409","created_at":"2026-07-05T06:17:57.841696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.03409v1","created_at":"2026-07-05T06:17:57.841696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03409","created_at":"2026-07-05T06:17:57.841696+00:00"},{"alias_kind":"pith_short_12","alias_value":"63ZPVOXDVEC4","created_at":"2026-07-05T06:17:57.841696+00:00"},{"alias_kind":"pith_short_16","alias_value":"63ZPVOXDVEC4FWZM","created_at":"2026-07-05T06:17:57.841696+00:00"},{"alias_kind":"pith_short_8","alias_value":"63ZPVOXD","created_at":"2026-07-05T06:17:57.841696+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/63ZPVOXDVEC4FWZMQH47IHURIO","json":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO.json","graph_json":"https://pith.science/api/pith-number/63ZPVOXDVEC4FWZMQH47IHURIO/graph.json","events_json":"https://pith.science/api/pith-number/63ZPVOXDVEC4FWZMQH47IHURIO/events.json","paper":"https://pith.science/paper/63ZPVOXD"},"agent_actions":{"view_html":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO","download_json":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO.json","view_paper":"https://pith.science/paper/63ZPVOXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.03409&json=true","fetch_graph":"https://pith.science/api/pith-number/63ZPVOXDVEC4FWZMQH47IHURIO/graph.json","fetch_events":"https://pith.science/api/pith-number/63ZPVOXDVEC4FWZMQH47IHURIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO/action/storage_attestation","attest_author":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO/action/author_attestation","sign_citation":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO/action/citation_signature","submit_replication":"https://pith.science/pith/63ZPVOXDVEC4FWZMQH47IHURIO/action/replication_record"}},"created_at":"2026-07-05T06:17:57.841696+00:00","updated_at":"2026-07-05T06:17:57.841696+00:00"}