{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SQ5FF52JBCICBPFJCNMK6D3IMV","short_pith_number":"pith:SQ5FF52J","schema_version":"1.0","canonical_sha256":"943a52f749089020bca91358af0f68655c6c550f05282b6daf4d111e00205f4e","source":{"kind":"arxiv","id":"2412.06140","version":1},"attestation_state":"computed","paper":{"title":"Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jiaxiang Huang, Licheng Jiao","submitted_at":"2024-12-09T01:46:58Z","abstract_excerpt":"Recent advances in learnable evolutionary algorithms have demonstrated the importance of leveraging population distribution information and historical evolutionary trajectories. While significant progress has been made in continuous optimization domains, combinatorial optimization problems remain challenging due to their discrete nature and complex solution spaces. To address this gap, we propose SeqMO, a novel learnable multi-objective combinatorial optimization method that integrates sequence-to-sequence models with evolutionary algorithms. Our approach divides approximate Pareto solution se"},"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":"2412.06140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-12-09T01:46:58Z","cross_cats_sorted":[],"title_canon_sha256":"c87ba9b3db92f06123c99d2b90aa1f389e9829370d75bb62fd245e9e440138b0","abstract_canon_sha256":"e9b384c9bd90fe4ce4e109d80a2a553beea0c106887d0f62e59cb439e381503d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:16.056753Z","signature_b64":"yuqjjTpmKzl+L8hP6xoImINZAXw4BjoNGGy+ECKa+tpa7i8FtcUDMtwbT1Y9CjVdr1RbciiQ9t08FK+apbDVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"943a52f749089020bca91358af0f68655c6c550f05282b6daf4d111e00205f4e","last_reissued_at":"2026-07-05T09:46:16.056339Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:16.056339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jiaxiang Huang, Licheng Jiao","submitted_at":"2024-12-09T01:46:58Z","abstract_excerpt":"Recent advances in learnable evolutionary algorithms have demonstrated the importance of leveraging population distribution information and historical evolutionary trajectories. While significant progress has been made in continuous optimization domains, combinatorial optimization problems remain challenging due to their discrete nature and complex solution spaces. To address this gap, we propose SeqMO, a novel learnable multi-objective combinatorial optimization method that integrates sequence-to-sequence models with evolutionary algorithms. Our approach divides approximate Pareto solution se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06140","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/2412.06140/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":"2412.06140","created_at":"2026-07-05T09:46:16.056396+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06140v1","created_at":"2026-07-05T09:46:16.056396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06140","created_at":"2026-07-05T09:46:16.056396+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQ5FF52JBCIC","created_at":"2026-07-05T09:46:16.056396+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQ5FF52JBCICBPFJ","created_at":"2026-07-05T09:46:16.056396+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQ5FF52J","created_at":"2026-07-05T09:46:16.056396+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/SQ5FF52JBCICBPFJCNMK6D3IMV","json":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV.json","graph_json":"https://pith.science/api/pith-number/SQ5FF52JBCICBPFJCNMK6D3IMV/graph.json","events_json":"https://pith.science/api/pith-number/SQ5FF52JBCICBPFJCNMK6D3IMV/events.json","paper":"https://pith.science/paper/SQ5FF52J"},"agent_actions":{"view_html":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV","download_json":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV.json","view_paper":"https://pith.science/paper/SQ5FF52J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06140&json=true","fetch_graph":"https://pith.science/api/pith-number/SQ5FF52JBCICBPFJCNMK6D3IMV/graph.json","fetch_events":"https://pith.science/api/pith-number/SQ5FF52JBCICBPFJCNMK6D3IMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV/action/storage_attestation","attest_author":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV/action/author_attestation","sign_citation":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV/action/citation_signature","submit_replication":"https://pith.science/pith/SQ5FF52JBCICBPFJCNMK6D3IMV/action/replication_record"}},"created_at":"2026-07-05T09:46:16.056396+00:00","updated_at":"2026-07-05T09:46:16.056396+00:00"}