{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WKNQ4TL5T7RDPJKNIQUWBJMYCD","short_pith_number":"pith:WKNQ4TL5","schema_version":"1.0","canonical_sha256":"b29b0e4d7d9fe237a54d442960a59810ea5c2c08bde21b5d6b9845f2329939f1","source":{"kind":"arxiv","id":"2605.15729","version":1},"attestation_state":"computed","paper":{"title":"General-Purpose Co-Evolutionary Construction of Parallel Algorithm Portfolios for Multi-Objective Binary Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A co-evolutionary method builds parallel algorithm portfolios that apply directly to multiple multi-objective binary optimization problems without custom generators.","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ke Tang, Shaofeng Zhang, Shengcai Liu, Zhiyuan Wang","submitted_at":"2026-05-15T08:32:47Z","abstract_excerpt":"Despite recent progress in constructing generalizable parallel algorithm portfolios (PAPs), no general-purpose approach is yet available for multi-objective binary optimization problems (MOBOPs). To fill this gap, this paper proposes domain-agnostic co-evolution of parameterized search for multi-objective binary optimization~(DACMO), which features two technical innovations. First, we propose a neural instance representation architecture that decouples domain-invariant and instance-specific features, enabling class-consistent instance generation across varying dimensions without problem-specif"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-05-15T08:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"f5093b3e09e9086eb704e439dd905997406587f05d1776eeefb6898b682595f8","abstract_canon_sha256":"1a822f6163c9b9da6b79cd0e601a6ee16e30195f3ee7b7133350bba69e5d3172"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:15.215076Z","signature_b64":"ANACK5vI4kaHup08nKfNDMBWDa/rFYEAqGr/n596tFERgCTYImAz2PUzJqftbaA74o9YdprSe7AHfzKCg+5nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b29b0e4d7d9fe237a54d442960a59810ea5c2c08bde21b5d6b9845f2329939f1","last_reissued_at":"2026-05-20T00:01:15.214099Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:15.214099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General-Purpose Co-Evolutionary Construction of Parallel Algorithm Portfolios for Multi-Objective Binary Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A co-evolutionary method builds parallel algorithm portfolios that apply directly to multiple multi-objective binary optimization problems without custom generators.","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ke Tang, Shaofeng Zhang, Shengcai Liu, Zhiyuan Wang","submitted_at":"2026-05-15T08:32:47Z","abstract_excerpt":"Despite recent progress in constructing generalizable parallel algorithm portfolios (PAPs), no general-purpose approach is yet available for multi-objective binary optimization problems (MOBOPs). To fill this gap, this paper proposes domain-agnostic co-evolution of parameterized search for multi-objective binary optimization~(DACMO), which features two technical innovations. First, we propose a neural instance representation architecture that decouples domain-invariant and instance-specific features, enabling class-consistent instance generation across varying dimensions without problem-specif"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"DACMO can be directly applied to all four problem classes without modification, outperforms PAPs built from classic MOEA templates, and achieves performance comparable to a privileged state-of-the-art baseline that relies on manually designed problem-specific instance generators, while outperforming it on two of the four evaluated problem classes.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The proposed neural instance representation architecture successfully decouples domain-invariant and instance-specific features, enabling class-consistent instance generation across varying dimensions without requiring problem-specific instance generators.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DACMO constructs general-purpose parallel algorithm portfolios for multi-objective binary optimization via co-evolution of neural instance representations and LLM-generated operators, performing competitively on four problem classes without problem-specific generators.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A co-evolutionary method builds parallel algorithm portfolios that apply directly to multiple multi-objective binary optimization problems without custom generators.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ec5d41dc9e6e02bce52006c4220e59f8e8a26bc17d830f66ad7723b9b113e0c1"},"source":{"id":"2605.15729","kind":"arxiv","version":1},"verdict":{"id":"b39d7456-882b-41ee-8d21-209458cca8ed","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:37:49.406018Z","strongest_claim":"DACMO can be directly applied to all four problem classes without modification, outperforms PAPs built from classic MOEA templates, and achieves performance comparable to a privileged state-of-the-art baseline that relies on manually designed problem-specific instance generators, while outperforming it on two of the four evaluated problem classes.","one_line_summary":"DACMO constructs general-purpose parallel algorithm portfolios for multi-objective binary optimization via co-evolution of neural instance representations and LLM-generated operators, performing competitively on four problem classes without problem-specific generators.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The proposed neural instance representation architecture successfully decouples domain-invariant and instance-specific features, enabling class-consistent instance generation across varying dimensions without requiring problem-specific instance generators.","pith_extraction_headline":"A co-evolutionary method builds parallel algorithm portfolios that apply directly to multiple multi-objective binary optimization problems without custom generators."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15729/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.206905Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:51:29.045724Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:25.148061Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.995338Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7f4e3d200c2f521c2218411e9735ce6442737b9e7f09a3c811819d79493af7aa"},"references":{"count":50,"sample":[{"doi":"","year":2007,"title":"C. A. C. Coello, G. B. Lamont, and D. A. van Veldhuizen,Evolutionary algorithms for solving multi-objective problems, Second Edition, ser. Genetic and evolutionary computation series. Springer, 2007","work_id":"9e047c60-2fb5-4ef0-bf1a-ba47ea34b546","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Multi- objective optimization for resource allocation in vehicular cloud com- puting networks,","work_id":"b62c6394-c6d9-4e0b-8a74-f2312e6354fb","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"A greedy cooperative co-evolutionary algorithm with problem-specific knowledge for multiobjective flowshop group scheduling problems,","work_id":"807b5899-4694-4aa7-8139-ada0edbc5c77","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"An improved NSGAII for integrated container scheduling problems with two transshipment routes,","work_id":"003b5e0d-b05d-4b32-b4d5-4387c42b48ea","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Efficient minimum cost seed selection with theoretical guarantees for competitive influence maximization,","work_id":"5119ffbf-9095-4a7e-9e97-86948b48d309","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":50,"snapshot_sha256":"a0d27377ec68daa589fb525127a108bdec4bbd42042a74c8a882a2dae8d3cabb","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e3e76f33f51c267967174592624b7b5ea4ce4c77f15454ade8a8236e0ecbfb45"},"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":"2605.15729","created_at":"2026-05-20T00:01:15.214233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15729v1","created_at":"2026-05-20T00:01:15.214233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15729","created_at":"2026-05-20T00:01:15.214233+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKNQ4TL5T7RD","created_at":"2026-05-20T00:01:15.214233+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKNQ4TL5T7RDPJKN","created_at":"2026-05-20T00:01:15.214233+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKNQ4TL5","created_at":"2026-05-20T00:01:15.214233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD","json":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD.json","graph_json":"https://pith.science/api/pith-number/WKNQ4TL5T7RDPJKNIQUWBJMYCD/graph.json","events_json":"https://pith.science/api/pith-number/WKNQ4TL5T7RDPJKNIQUWBJMYCD/events.json","paper":"https://pith.science/paper/WKNQ4TL5"},"agent_actions":{"view_html":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD","download_json":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD.json","view_paper":"https://pith.science/paper/WKNQ4TL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15729&json=true","fetch_graph":"https://pith.science/api/pith-number/WKNQ4TL5T7RDPJKNIQUWBJMYCD/graph.json","fetch_events":"https://pith.science/api/pith-number/WKNQ4TL5T7RDPJKNIQUWBJMYCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD/action/storage_attestation","attest_author":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD/action/author_attestation","sign_citation":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD/action/citation_signature","submit_replication":"https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD/action/replication_record"}},"created_at":"2026-05-20T00:01:15.214233+00:00","updated_at":"2026-05-20T00:01:15.214233+00:00"}