{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RLQFNJW6CPG6RBQJHABP7X6BIY","short_pith_number":"pith:RLQFNJW6","schema_version":"1.0","canonical_sha256":"8ae056a6de13cde886093802ffdfc1461ab33ff4cb66e9e44d6f1cfcc06ba3d7","source":{"kind":"arxiv","id":"1711.07907","version":1},"attestation_state":"computed","paper":{"title":"Two-Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Guangtao Fu, Ke Li, Renzhi Chen, Xin Yao","submitted_at":"2017-11-21T16:55:01Z","abstract_excerpt":"When solving constrained multi-objective optimization problems, an important issue is how to balance convergence, diversity and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, two-archive evolutionary algorithm, for constrained multi-objective optimization. It maintains two co-evolving populations simultaneously: one, denoted as convergence archive, is the driving force to push the population toward the Pareto front; the other one, denoted as diversity archive, mainly tends to maintain the population diversity. In particula"},"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":"1711.07907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-21T16:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"0eda1e5a431a304b9b092332d63df89225c7b0b1048140a9071773e0f67e1cf5","abstract_canon_sha256":"58f7c10f22962485c1ec6734780883d745660a9c65381cdd9969f0a64e94ce3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.196192Z","signature_b64":"ppshPmjzp8+DFISWsx5mlUOiEvYae0f8Aay6Ji39TVRSfS7pPGbnlihtgOVLhcH3x5es2dfHiQ6pai95u9pBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae056a6de13cde886093802ffdfc1461ab33ff4cb66e9e44d6f1cfcc06ba3d7","last_reissued_at":"2026-05-18T00:29:56.195717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.195717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Guangtao Fu, Ke Li, Renzhi Chen, Xin Yao","submitted_at":"2017-11-21T16:55:01Z","abstract_excerpt":"When solving constrained multi-objective optimization problems, an important issue is how to balance convergence, diversity and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, two-archive evolutionary algorithm, for constrained multi-objective optimization. It maintains two co-evolving populations simultaneously: one, denoted as convergence archive, is the driving force to push the population toward the Pareto front; the other one, denoted as diversity archive, mainly tends to maintain the population diversity. In particula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07907","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":""},"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":"1711.07907","created_at":"2026-05-18T00:29:56.195789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07907v1","created_at":"2026-05-18T00:29:56.195789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07907","created_at":"2026-05-18T00:29:56.195789+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLQFNJW6CPG6","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLQFNJW6CPG6RBQJ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLQFNJW6","created_at":"2026-05-18T12:31:39.905425+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/RLQFNJW6CPG6RBQJHABP7X6BIY","json":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY.json","graph_json":"https://pith.science/api/pith-number/RLQFNJW6CPG6RBQJHABP7X6BIY/graph.json","events_json":"https://pith.science/api/pith-number/RLQFNJW6CPG6RBQJHABP7X6BIY/events.json","paper":"https://pith.science/paper/RLQFNJW6"},"agent_actions":{"view_html":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY","download_json":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY.json","view_paper":"https://pith.science/paper/RLQFNJW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07907&json=true","fetch_graph":"https://pith.science/api/pith-number/RLQFNJW6CPG6RBQJHABP7X6BIY/graph.json","fetch_events":"https://pith.science/api/pith-number/RLQFNJW6CPG6RBQJHABP7X6BIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY/action/storage_attestation","attest_author":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY/action/author_attestation","sign_citation":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY/action/citation_signature","submit_replication":"https://pith.science/pith/RLQFNJW6CPG6RBQJHABP7X6BIY/action/replication_record"}},"created_at":"2026-05-18T00:29:56.195789+00:00","updated_at":"2026-05-18T00:29:56.195789+00:00"}