{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OTNL4ILOXXQR2RAJFNJLEJ4CZI","short_pith_number":"pith:OTNL4ILO","canonical_record":{"source":{"id":"1509.09060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-09-30T08:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"0c9b1e2152b589c9430d3d9ffb72ba6ba53e777ba6e99cca1cfc2f1152357de1","abstract_canon_sha256":"7c882d21eef2be642b1c1f503efed2f3823f9e568b6a278c7d5c8bcdf05ce846"},"schema_version":"1.0"},"canonical_sha256":"74dabe216ebde11d44092b52b22782ca2625c8b5d513708b8f24904c33a5c478","source":{"kind":"arxiv","id":"1509.09060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09060","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09060v2","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09060","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"OTNL4ILOXXQR","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OTNL4ILOXXQR2RAJ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OTNL4ILO","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OTNL4ILOXXQR2RAJFNJLEJ4CZI","target":"record","payload":{"canonical_record":{"source":{"id":"1509.09060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-09-30T08:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"0c9b1e2152b589c9430d3d9ffb72ba6ba53e777ba6e99cca1cfc2f1152357de1","abstract_canon_sha256":"7c882d21eef2be642b1c1f503efed2f3823f9e568b6a278c7d5c8bcdf05ce846"},"schema_version":"1.0"},"canonical_sha256":"74dabe216ebde11d44092b52b22782ca2625c8b5d513708b8f24904c33a5c478","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:20.948078Z","signature_b64":"2/fk2DDnabLipx+fADb3+L+bmyDXtk7sivJvg/WbLKGk1b097NbNE7Y8KzQ69j9GHSEAtel06iSAXqVXStuqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74dabe216ebde11d44092b52b22782ca2625c8b5d513708b8f24904c33a5c478","last_reissued_at":"2026-05-18T01:31:20.947556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:20.947556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.09060","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OfCjflB6e15ZXgjmxIS5K3c5rzSEqA41aKSBQ9mOBW36F9Qn+9fUZ8WjZVabYY6LXMPIv9ltsMqXuybaj0lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:02:18.322390Z"},"content_sha256":"b0d2f8e418c7a5ae343a6c8e6e698be5f49c8237831b36d280928f475d05f669","schema_version":"1.0","event_id":"sha256:b0d2f8e418c7a5ae343a6c8e6e698be5f49c8237831b36d280928f475d05f669"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OTNL4ILOXXQR2RAJFNJLEJ4CZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-objective Differential Evolution with Helper Functions for Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jun He, Tao Xu","submitted_at":"2015-09-30T08:19:04Z","abstract_excerpt":"Solving constrained optimization problems by multi-objective evolutionary algorithms has scored tremendous achievements in the last decade. Standard multi-objective schemes usually aim at minimizing the objective function and also the degree of constraint violation simultaneously. This paper proposes a new multi-objective method for solving constrained optimization problems. The new method keeps two standard objectives: the original objective function and the sum of degrees of constraint violation. But besides them, four more objectives are added. One is based on the feasible rule. The other t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09060","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxwpRqcIOK9YOqrvJWYncSwhJPgmCdkyVtRa4X8nUDZtGdm706OpKk026ifGbfBsun7SAW3DLGnMyLgXKvWQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:02:18.323039Z"},"content_sha256":"4c9a8d5432cef680781f735d4666ae6b481fe2537dde9719074c1b2936a11a9a","schema_version":"1.0","event_id":"sha256:4c9a8d5432cef680781f735d4666ae6b481fe2537dde9719074c1b2936a11a9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTNL4ILOXXQR2RAJFNJLEJ4CZI/bundle.json","state_url":"https://pith.science/pith/OTNL4ILOXXQR2RAJFNJLEJ4CZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTNL4ILOXXQR2RAJFNJLEJ4CZI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T04:02:18Z","links":{"resolver":"https://pith.science/pith/OTNL4ILOXXQR2RAJFNJLEJ4CZI","bundle":"https://pith.science/pith/OTNL4ILOXXQR2RAJFNJLEJ4CZI/bundle.json","state":"https://pith.science/pith/OTNL4ILOXXQR2RAJFNJLEJ4CZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTNL4ILOXXQR2RAJFNJLEJ4CZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OTNL4ILOXXQR2RAJFNJLEJ4CZI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7c882d21eef2be642b1c1f503efed2f3823f9e568b6a278c7d5c8bcdf05ce846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-09-30T08:19:04Z","title_canon_sha256":"0c9b1e2152b589c9430d3d9ffb72ba6ba53e777ba6e99cca1cfc2f1152357de1"},"schema_version":"1.0","source":{"id":"1509.09060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09060","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09060v2","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09060","created_at":"2026-05-18T01:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"OTNL4ILOXXQR","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OTNL4ILOXXQR2RAJ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OTNL4ILO","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:4c9a8d5432cef680781f735d4666ae6b481fe2537dde9719074c1b2936a11a9a","target":"graph","created_at":"2026-05-18T01:31:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Solving constrained optimization problems by multi-objective evolutionary algorithms has scored tremendous achievements in the last decade. Standard multi-objective schemes usually aim at minimizing the objective function and also the degree of constraint violation simultaneously. This paper proposes a new multi-objective method for solving constrained optimization problems. The new method keeps two standard objectives: the original objective function and the sum of degrees of constraint violation. But besides them, four more objectives are added. One is based on the feasible rule. The other t","authors_text":"Jun He, Tao Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-09-30T08:19:04Z","title":"Multi-objective Differential Evolution with Helper Functions for Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09060","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0d2f8e418c7a5ae343a6c8e6e698be5f49c8237831b36d280928f475d05f669","target":"record","created_at":"2026-05-18T01:31:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7c882d21eef2be642b1c1f503efed2f3823f9e568b6a278c7d5c8bcdf05ce846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-09-30T08:19:04Z","title_canon_sha256":"0c9b1e2152b589c9430d3d9ffb72ba6ba53e777ba6e99cca1cfc2f1152357de1"},"schema_version":"1.0","source":{"id":"1509.09060","kind":"arxiv","version":2}},"canonical_sha256":"74dabe216ebde11d44092b52b22782ca2625c8b5d513708b8f24904c33a5c478","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74dabe216ebde11d44092b52b22782ca2625c8b5d513708b8f24904c33a5c478","first_computed_at":"2026-05-18T01:31:20.947556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:20.947556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2/fk2DDnabLipx+fADb3+L+bmyDXtk7sivJvg/WbLKGk1b097NbNE7Y8KzQ69j9GHSEAtel06iSAXqVXStuqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:20.948078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d2f8e418c7a5ae343a6c8e6e698be5f49c8237831b36d280928f475d05f669","sha256:4c9a8d5432cef680781f735d4666ae6b481fe2537dde9719074c1b2936a11a9a"],"state_sha256":"1dbc3a2e03bd49297e6e4758c8e32f8665c699143eb8efa7df1c9f8911b4993f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWgJS6dphjyuCPMV+ZSlFkTmm2dnFrWbp9P+E6uHEDyRHCQv3NeYsVnPQkRVdWhIgCWHguAb6UpkwaEyP5e1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:02:18.326441Z","bundle_sha256":"1c728e991243dc70862f28c829df27fcbca876d5132c6cb248d3c7e6c8abe16c"}}