{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M2AEN3ZQNZ7KL25NCUSRPNVBEK","short_pith_number":"pith:M2AEN3ZQ","schema_version":"1.0","canonical_sha256":"668046ef306e7ea5ebad152517b6a122a61dd18b9a85be1f1aa1d8101a638c3d","source":{"kind":"arxiv","id":"2403.02131","version":3},"attestation_state":"computed","paper":{"title":"Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Hongshu Guo, Jiacheng Chen, Jun Zhang, Xinglin Zhang, Yining Ma, Yue-Jiao Gong, Zeyuan Ma, Zhiguang Cao","submitted_at":"2024-03-04T15:40:28Z","abstract_excerpt":"Evolutionary algorithms, such as Differential Evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across different problem instances, necessitating considerable efforts in algorithm selection or configuration. This paper aims to address the limitation by leveraging the complementary strengths of a group of algorithms and dynamically scheduling them throughout the optimization progress for specific problems. We propose a deep reinforcement learning-based dynamic algorithm selection framework to accomplish this task. Our app"},"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":"2403.02131","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-03-04T15:40:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a16b0ccd722db209b0925adbefcef62687229e2b11c44edade63b574b1c24ec1","abstract_canon_sha256":"f3b0d1882c49a4b8964f5a0363de5e0d3ec27ed3560ca410613246cf8644cf4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:15.622813Z","signature_b64":"b97yk4CpJZvf8IoBxoKburHhgHyTvLZYS6rhrWFFPVuCHMekgr9RABqbugO9SwGyCz9SUz2knuTA/p9YAVw2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"668046ef306e7ea5ebad152517b6a122a61dd18b9a85be1f1aa1d8101a638c3d","last_reissued_at":"2026-07-05T07:53:15.622247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:15.622247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Hongshu Guo, Jiacheng Chen, Jun Zhang, Xinglin Zhang, Yining Ma, Yue-Jiao Gong, Zeyuan Ma, Zhiguang Cao","submitted_at":"2024-03-04T15:40:28Z","abstract_excerpt":"Evolutionary algorithms, such as Differential Evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across different problem instances, necessitating considerable efforts in algorithm selection or configuration. This paper aims to address the limitation by leveraging the complementary strengths of a group of algorithms and dynamically scheduling them throughout the optimization progress for specific problems. We propose a deep reinforcement learning-based dynamic algorithm selection framework to accomplish this task. Our app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02131","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/2403.02131/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":"2403.02131","created_at":"2026-07-05T07:53:15.622304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02131v3","created_at":"2026-07-05T07:53:15.622304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02131","created_at":"2026-07-05T07:53:15.622304+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2AEN3ZQNZ7K","created_at":"2026-07-05T07:53:15.622304+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2AEN3ZQNZ7KL25N","created_at":"2026-07-05T07:53:15.622304+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2AEN3ZQ","created_at":"2026-07-05T07:53:15.622304+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/M2AEN3ZQNZ7KL25NCUSRPNVBEK","json":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK.json","graph_json":"https://pith.science/api/pith-number/M2AEN3ZQNZ7KL25NCUSRPNVBEK/graph.json","events_json":"https://pith.science/api/pith-number/M2AEN3ZQNZ7KL25NCUSRPNVBEK/events.json","paper":"https://pith.science/paper/M2AEN3ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK","download_json":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK.json","view_paper":"https://pith.science/paper/M2AEN3ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02131&json=true","fetch_graph":"https://pith.science/api/pith-number/M2AEN3ZQNZ7KL25NCUSRPNVBEK/graph.json","fetch_events":"https://pith.science/api/pith-number/M2AEN3ZQNZ7KL25NCUSRPNVBEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK/action/storage_attestation","attest_author":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK/action/author_attestation","sign_citation":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK/action/citation_signature","submit_replication":"https://pith.science/pith/M2AEN3ZQNZ7KL25NCUSRPNVBEK/action/replication_record"}},"created_at":"2026-07-05T07:53:15.622304+00:00","updated_at":"2026-07-05T07:53:15.622304+00:00"}