pith. sign in
Pith Number

pith:WKNQ4TL5

pith:2026:WKNQ4TL5T7RDPJKNIQUWBJMYCD
not attested not anchored not stored refs resolved

General-Purpose Co-Evolutionary Construction of Parallel Algorithm Portfolios for Multi-Objective Binary Optimization

Ke Tang, Shaofeng Zhang, Shengcai Liu, Zhiyuan Wang

A co-evolutionary method builds parallel algorithm portfolios that apply directly to multiple multi-objective binary optimization problems without custom generators.

arxiv:2605.15729 v1 · 2026-05-15 · cs.NE

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{WKNQ4TL5T7RDPJKNIQUWBJMYCD}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

50 extracted · 50 resolved · 0 Pith anchors

[1] 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 2007
[2] Multi- objective optimization for resource allocation in vehicular cloud com- puting networks, 2022
[3] A greedy cooperative co-evolutionary algorithm with problem-specific knowledge for multiobjective flowshop group scheduling problems, 2023
[4] An improved NSGAII for integrated container scheduling problems with two transshipment routes, 2024
[5] Efficient minimum cost seed selection with theoretical guarantees for competitive influence maximization, 2021

Formal links

2 machine-checked theorem links

Receipt and verification
First computed 2026-05-20T00:01:15.214099Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

b29b0e4d7d9fe237a54d442960a59810ea5c2c08bde21b5d6b9845f2329939f1

Aliases

arxiv: 2605.15729 · arxiv_version: 2605.15729v1 · doi: 10.48550/arxiv.2605.15729 · pith_short_12: WKNQ4TL5T7RD · pith_short_16: WKNQ4TL5T7RDPJKN · pith_short_8: WKNQ4TL5
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/WKNQ4TL5T7RDPJKNIQUWBJMYCD \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: b29b0e4d7d9fe237a54d442960a59810ea5c2c08bde21b5d6b9845f2329939f1
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "1a822f6163c9b9da6b79cd0e601a6ee16e30195f3ee7b7133350bba69e5d3172",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.NE",
    "submitted_at": "2026-05-15T08:32:47Z",
    "title_canon_sha256": "f5093b3e09e9086eb704e439dd905997406587f05d1776eeefb6898b682595f8"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15729",
    "kind": "arxiv",
    "version": 1
  }
}