{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2BAFIPVOXUM5XZDSATQUS73FEE","short_pith_number":"pith:2BAFIPVO","canonical_record":{"source":{"id":"1903.04886","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-12T13:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"78b6f170e920178ac7ade18248fb33beeb2f5dc05736fb869d80ddeabfeb8a29","abstract_canon_sha256":"ee158bb196d1436cb7d6972c5e2f5ef43f6d5fd6bffccf238163aebea69e9509"},"schema_version":"1.0"},"canonical_sha256":"d040543eaebd19dbe47204e1497f652106829f96364371bd90d66c4d43bc59f4","source":{"kind":"arxiv","id":"1903.04886","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04886","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04886v3","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04886","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"2BAFIPVOXUM5","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"pith_short_16","alias_value":"2BAFIPVOXUM5XZDS","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"pith_short_8","alias_value":"2BAFIPVO","created_at":"2026-07-05T00:49:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2BAFIPVOXUM5XZDSATQUS73FEE","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04886","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-12T13:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"78b6f170e920178ac7ade18248fb33beeb2f5dc05736fb869d80ddeabfeb8a29","abstract_canon_sha256":"ee158bb196d1436cb7d6972c5e2f5ef43f6d5fd6bffccf238163aebea69e9509"},"schema_version":"1.0"},"canonical_sha256":"d040543eaebd19dbe47204e1497f652106829f96364371bd90d66c4d43bc59f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:35.729208Z","signature_b64":"4GZI6Hskd3UKAyVAw5BCUpCi/Tw+HEb9obko87hgJfVk4rUCJSChOOu6VYDnbOeqvpJ0Kml//YzXL7L+zIzHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d040543eaebd19dbe47204e1497f652106829f96364371bd90d66c4d43bc59f4","last_reissued_at":"2026-07-05T00:49:35.728814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:35.728814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04886","source_version":3,"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-07-05T00:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQyHiT0kwpm95lqYMOgiQrdOfVGcylkanbI1vf8zVeT6f4vnf0DyLG7+YcAkGA3ZVc4OgrRdQ/awuBROOjNPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:40:07.611401Z"},"content_sha256":"a57dde8de1151e3fded9c0771a7b26e40822f068733fc123950c718a0abea09e","schema_version":"1.0","event_id":"sha256:a57dde8de1151e3fded9c0771a7b26e40822f068733fc123950c718a0abea09e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2BAFIPVOXUM5XZDSATQUS73FEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Helper and Equivalent Objectives: An Efficient Approach to Constrained Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Changjing Shang, Jun He, Tao Xu","submitted_at":"2019-03-12T13:17:00Z","abstract_excerpt":"Numerous multi-objective evolutionary algorithms have been designed for constrained optimisation over past two decades. The idea behind these algorithms is to transform constrained optimisation problems into multi-objective optimisation problems without any constraint, and then solve them. In this paper, we propose a new multi-objective method for constrained optimisation, which works by converting a constrained optimisation problem into a problem with helper and equivalent objectives. An equivalent objective means that its optimal solution set is the same as that to the constrained problem bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04886","kind":"arxiv","version":3},"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/1903.04886/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"},"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-07-05T00:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQcvY9UNmT4Ei2u1yPjbUoIbDxEF3nWTvMhNv4c/iniSACWJ+t75Zc65q305+ARq0ofupH8Pg6s0X47FvMEXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:40:07.611777Z"},"content_sha256":"a3340646adcdb1482867b71e21d2668e1b2c663c0f70cdaa5fbaeee8ce856c80","schema_version":"1.0","event_id":"sha256:a3340646adcdb1482867b71e21d2668e1b2c663c0f70cdaa5fbaeee8ce856c80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BAFIPVOXUM5XZDSATQUS73FEE/bundle.json","state_url":"https://pith.science/pith/2BAFIPVOXUM5XZDSATQUS73FEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BAFIPVOXUM5XZDSATQUS73FEE/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-07-06T17:40:07Z","links":{"resolver":"https://pith.science/pith/2BAFIPVOXUM5XZDSATQUS73FEE","bundle":"https://pith.science/pith/2BAFIPVOXUM5XZDSATQUS73FEE/bundle.json","state":"https://pith.science/pith/2BAFIPVOXUM5XZDSATQUS73FEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BAFIPVOXUM5XZDSATQUS73FEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2BAFIPVOXUM5XZDSATQUS73FEE","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":"ee158bb196d1436cb7d6972c5e2f5ef43f6d5fd6bffccf238163aebea69e9509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-12T13:17:00Z","title_canon_sha256":"78b6f170e920178ac7ade18248fb33beeb2f5dc05736fb869d80ddeabfeb8a29"},"schema_version":"1.0","source":{"id":"1903.04886","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04886","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04886v3","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04886","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"2BAFIPVOXUM5","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"pith_short_16","alias_value":"2BAFIPVOXUM5XZDS","created_at":"2026-07-05T00:49:35Z"},{"alias_kind":"pith_short_8","alias_value":"2BAFIPVO","created_at":"2026-07-05T00:49:35Z"}],"graph_snapshots":[{"event_id":"sha256:a3340646adcdb1482867b71e21d2668e1b2c663c0f70cdaa5fbaeee8ce856c80","target":"graph","created_at":"2026-07-05T00:49:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.04886/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Numerous multi-objective evolutionary algorithms have been designed for constrained optimisation over past two decades. The idea behind these algorithms is to transform constrained optimisation problems into multi-objective optimisation problems without any constraint, and then solve them. In this paper, we propose a new multi-objective method for constrained optimisation, which works by converting a constrained optimisation problem into a problem with helper and equivalent objectives. An equivalent objective means that its optimal solution set is the same as that to the constrained problem bu","authors_text":"Changjing Shang, Jun He, Tao Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-12T13:17:00Z","title":"Helper and Equivalent Objectives: An Efficient Approach to Constrained Optimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04886","kind":"arxiv","version":3},"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:a57dde8de1151e3fded9c0771a7b26e40822f068733fc123950c718a0abea09e","target":"record","created_at":"2026-07-05T00:49:35Z","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":"ee158bb196d1436cb7d6972c5e2f5ef43f6d5fd6bffccf238163aebea69e9509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-12T13:17:00Z","title_canon_sha256":"78b6f170e920178ac7ade18248fb33beeb2f5dc05736fb869d80ddeabfeb8a29"},"schema_version":"1.0","source":{"id":"1903.04886","kind":"arxiv","version":3}},"canonical_sha256":"d040543eaebd19dbe47204e1497f652106829f96364371bd90d66c4d43bc59f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d040543eaebd19dbe47204e1497f652106829f96364371bd90d66c4d43bc59f4","first_computed_at":"2026-07-05T00:49:35.728814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:35.728814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4GZI6Hskd3UKAyVAw5BCUpCi/Tw+HEb9obko87hgJfVk4rUCJSChOOu6VYDnbOeqvpJ0Kml//YzXL7L+zIzHBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:35.729208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04886","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a57dde8de1151e3fded9c0771a7b26e40822f068733fc123950c718a0abea09e","sha256:a3340646adcdb1482867b71e21d2668e1b2c663c0f70cdaa5fbaeee8ce856c80"],"state_sha256":"9476c607b238096e20af6b4c404e93503456682767e0d6efd7244b936d2bb086"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BxY0xHyt3dr9E487u1+rqVDTH5dQP1ml8WTwl0dWb6D+tPw3zTb38lQHuYzjcWwBp8DX4BfjQGKLrg7FqSMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:40:07.613765Z","bundle_sha256":"8df81c11040300067863285c234d8d0eb1737fd48e8c30dee12a833a963dda29"}}