{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LC6B37OK5GZFIJR3NAQALFRZIK","short_pith_number":"pith:LC6B37OK","schema_version":"1.0","canonical_sha256":"58bc1dfdcae9b254263b6820059639428de69fb06c07162c236ff2c789ffa03d","source":{"kind":"arxiv","id":"2401.01070","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.01070","created_at":"2026-07-05T07:29:33.667994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.01070v1","created_at":"2026-07-05T07:29:33.667994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01070","created_at":"2026-07-05T07:29:33.667994+00:00"},{"alias_kind":"pith_short_12","alias_value":"LC6B37OK5GZF","created_at":"2026-07-05T07:29:33.667994+00:00"},{"alias_kind":"pith_short_16","alias_value":"LC6B37OK5GZFIJR3","created_at":"2026-07-05T07:29:33.667994+00:00"},{"alias_kind":"pith_short_8","alias_value":"LC6B37OK","created_at":"2026-07-05T07:29:33.667994+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/LC6B37OK5GZFIJR3NAQALFRZIK","json":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK.json","graph_json":"https://pith.science/api/pith-number/LC6B37OK5GZFIJR3NAQALFRZIK/graph.json","events_json":"https://pith.science/api/pith-number/LC6B37OK5GZFIJR3NAQALFRZIK/events.json","paper":"https://pith.science/paper/LC6B37OK"},"agent_actions":{"view_html":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK","download_json":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK.json","view_paper":"https://pith.science/paper/LC6B37OK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.01070&json=true","fetch_graph":"https://pith.science/api/pith-number/LC6B37OK5GZFIJR3NAQALFRZIK/graph.json","fetch_events":"https://pith.science/api/pith-number/LC6B37OK5GZFIJR3NAQALFRZIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/action/storage_attestation","attest_author":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/action/author_attestation","sign_citation":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/action/citation_signature","submit_replication":"https://pith.science/pith/LC6B37OK5GZFIJR3NAQALFRZIK/action/replication_record"}},"created_at":"2026-07-05T07:29:33.667994+00:00","updated_at":"2026-07-05T07:29:33.667994+00:00"}