{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LC6B37OK5GZFIJR3NAQALFRZIK","short_pith_number":"pith:LC6B37OK","canonical_record":{"source":{"id":"2401.01070","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-01-02T07:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"399631cc430efcfb48fb3fc26b2a5ad00f1057b795afcea03de9202f146fda0a","abstract_canon_sha256":"98de2b922aea85dfc05a89ffca7f037b8335639f3cac8fc298d1af506976e0d0"},"schema_version":"1.0"},"canonical_sha256":"58bc1dfdcae9b254263b6820059639428de69fb06c07162c236ff2c789ffa03d","source":{"kind":"arxiv","id":"2401.01070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.01070","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"arxiv_version","alias_value":"2401.01070v1","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01070","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"pith_short_12","alias_value":"LC6B37OK5GZF","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"pith_short_16","alias_value":"LC6B37OK5GZFIJR3","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"pith_short_8","alias_value":"LC6B37OK","created_at":"2026-07-05T07:29:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LC6B37OK5GZFIJR3NAQALFRZIK","target":"record","payload":{"canonical_record":{"source":{"id":"2401.01070","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-01-02T07:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"399631cc430efcfb48fb3fc26b2a5ad00f1057b795afcea03de9202f146fda0a","abstract_canon_sha256":"98de2b922aea85dfc05a89ffca7f037b8335639f3cac8fc298d1af506976e0d0"},"schema_version":"1.0"},"canonical_sha256":"58bc1dfdcae9b254263b6820059639428de69fb06c07162c236ff2c789ffa03d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:33.668408Z","signature_b64":"3BeR4e/EiRUf5FEjOunBrryCl02L15F9m5QzWnFfiRrR/Ejkx8DF2/stqHf5jy+zC3xB1RX9RY+Is6OYBSmuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58bc1dfdcae9b254263b6820059639428de69fb06c07162c236ff2c789ffa03d","last_reissued_at":"2026-07-05T07:29:33.667945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:33.667945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.01070","source_version":1,"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-05T07:29:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gjwvb7fknCWON98PiSO02BHC6XpeIIRnyNaoPlTWLCYz2lkbOKxhoO26Le/hQrgVOA+V/qRdSxA71apQwOIpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:06:05.907199Z"},"content_sha256":"182b69c9c70d14403efee90255e1a9c1af82a5145c8055e0e1535ca8ccc3ec45","schema_version":"1.0","event_id":"sha256:182b69c9c70d14403efee90255e1a9c1af82a5145c8055e0e1535ca8ccc3ec45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LC6B37OK5GZFIJR3NAQALFRZIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Dual-Stage Evolutionary Algorithm for Finding Robust Solutions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Chen Liang, Wei Du, Wenxuan Fang, Yang Tang, Yaochu Jin","submitted_at":"2024-01-02T07:08:46Z","abstract_excerpt":"In robust optimization problems, the magnitude of perturbations is relatively small. Consequently, solutions within certain regions are less likely to represent the robust optima when perturbations are introduced. Hence, a more efficient search process would benefit from increased opportunities to explore promising regions where global optima or good local optima are situated. In this paper, we introduce a novel robust evolutionary algorithm named the dual-stage robust evolutionary algorithm (DREA) aimed at discovering robust solutions. DREA operates in two stages: the peak-detection stage and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01070","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/2401.01070/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-05T07:29:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gglkNlUbkZdlP4+UQOnnrnbw/ith8udWC3XHkeQFchxucNREk3FpK0TjWCdPObuT3SOsR0ZHXLzesdwoyLXuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:06:05.908019Z"},"content_sha256":"6e94243a4c1fe26a50b15a467be0eaaa3230ac8d498ef6ff9d8c7919548e12e2","schema_version":"1.0","event_id":"sha256:6e94243a4c1fe26a50b15a467be0eaaa3230ac8d498ef6ff9d8c7919548e12e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/bundle.json","state_url":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LC6B37OK5GZFIJR3NAQALFRZIK/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-08-03T17:06:05Z","links":{"resolver":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK","bundle":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/bundle.json","state":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LC6B37OK5GZFIJR3NAQALFRZIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LC6B37OK5GZFIJR3NAQALFRZIK","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":"98de2b922aea85dfc05a89ffca7f037b8335639f3cac8fc298d1af506976e0d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-01-02T07:08:46Z","title_canon_sha256":"399631cc430efcfb48fb3fc26b2a5ad00f1057b795afcea03de9202f146fda0a"},"schema_version":"1.0","source":{"id":"2401.01070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.01070","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"arxiv_version","alias_value":"2401.01070v1","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01070","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"pith_short_12","alias_value":"LC6B37OK5GZF","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"pith_short_16","alias_value":"LC6B37OK5GZFIJR3","created_at":"2026-07-05T07:29:33Z"},{"alias_kind":"pith_short_8","alias_value":"LC6B37OK","created_at":"2026-07-05T07:29:33Z"}],"graph_snapshots":[{"event_id":"sha256:6e94243a4c1fe26a50b15a467be0eaaa3230ac8d498ef6ff9d8c7919548e12e2","target":"graph","created_at":"2026-07-05T07:29:33Z","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/2401.01070/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In robust optimization problems, the magnitude of perturbations is relatively small. Consequently, solutions within certain regions are less likely to represent the robust optima when perturbations are introduced. Hence, a more efficient search process would benefit from increased opportunities to explore promising regions where global optima or good local optima are situated. In this paper, we introduce a novel robust evolutionary algorithm named the dual-stage robust evolutionary algorithm (DREA) aimed at discovering robust solutions. DREA operates in two stages: the peak-detection stage and","authors_text":"Chen Liang, Wei Du, Wenxuan Fang, Yang Tang, Yaochu Jin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-01-02T07:08:46Z","title":"A Novel Dual-Stage Evolutionary Algorithm for Finding Robust Solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01070","kind":"arxiv","version":1},"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:182b69c9c70d14403efee90255e1a9c1af82a5145c8055e0e1535ca8ccc3ec45","target":"record","created_at":"2026-07-05T07:29:33Z","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":"98de2b922aea85dfc05a89ffca7f037b8335639f3cac8fc298d1af506976e0d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-01-02T07:08:46Z","title_canon_sha256":"399631cc430efcfb48fb3fc26b2a5ad00f1057b795afcea03de9202f146fda0a"},"schema_version":"1.0","source":{"id":"2401.01070","kind":"arxiv","version":1}},"canonical_sha256":"58bc1dfdcae9b254263b6820059639428de69fb06c07162c236ff2c789ffa03d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58bc1dfdcae9b254263b6820059639428de69fb06c07162c236ff2c789ffa03d","first_computed_at":"2026-07-05T07:29:33.667945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:29:33.667945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BeR4e/EiRUf5FEjOunBrryCl02L15F9m5QzWnFfiRrR/Ejkx8DF2/stqHf5jy+zC3xB1RX9RY+Is6OYBSmuAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:29:33.668408Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.01070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:182b69c9c70d14403efee90255e1a9c1af82a5145c8055e0e1535ca8ccc3ec45","sha256:6e94243a4c1fe26a50b15a467be0eaaa3230ac8d498ef6ff9d8c7919548e12e2"],"state_sha256":"863acac0c847ab38cddafa535f90268054a93283eac148a7ae4654ba8f074e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJfarsIQ8E/D3/C6uLVAPRK97bTGVQUgMWP8yekMQRnjBXsf2UeDt/jpyErdfvOkJXbn2yhiTi6LKkbhaNibBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:06:05.913551Z","bundle_sha256":"a785cca612c5340e1c10292d6a47f91561bdd9a9f80e5461e60eedff707d740b"}}