{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MIZKZGLP2SPPDMMU63DJLPUYWP","short_pith_number":"pith:MIZKZGLP","canonical_record":{"source":{"id":"2009.03603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-09-08T09:28:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9b17eae724eaaabf3c6d7c94888c933e9cc6e7e0b69db2d6579d7913f59bd537","abstract_canon_sha256":"f3c46f092749891902033cf30289be33fbbf5aedb288b01ef36d20d1dd1fa51e"},"schema_version":"1.0"},"canonical_sha256":"6232ac996fd49ef1b194f6c695be98b3f0c44bafdfe69a741de7c6b3cefb10a5","source":{"kind":"arxiv","id":"2009.03603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.03603","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"2009.03603v1","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03603","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"MIZKZGLP2SPP","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"pith_short_16","alias_value":"MIZKZGLP2SPPDMMU","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"pith_short_8","alias_value":"MIZKZGLP","created_at":"2026-07-05T06:53:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MIZKZGLP2SPPDMMU63DJLPUYWP","target":"record","payload":{"canonical_record":{"source":{"id":"2009.03603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-09-08T09:28:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9b17eae724eaaabf3c6d7c94888c933e9cc6e7e0b69db2d6579d7913f59bd537","abstract_canon_sha256":"f3c46f092749891902033cf30289be33fbbf5aedb288b01ef36d20d1dd1fa51e"},"schema_version":"1.0"},"canonical_sha256":"6232ac996fd49ef1b194f6c695be98b3f0c44bafdfe69a741de7c6b3cefb10a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:27.791115Z","signature_b64":"9fZJzaAO3+QkUm5Xg5LMgnohkWTsaFjTIsGEYPktz/Ln+Yge3FfVz7whRiHP0DEG7vYWvJBwuId77hiwRT+FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6232ac996fd49ef1b194f6c695be98b3f0c44bafdfe69a741de7c6b3cefb10a5","last_reissued_at":"2026-07-05T06:53:27.790639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:27.790639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.03603","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-05T06:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbOhnAmDWBZmUfvZOQ127ChbMnEHPeDYbKbUSSjrnC/POsQIYYxw4RiK2LeC14tEDIh/QxxMV/CZFUX5aQ+fCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T13:08:28.927236Z"},"content_sha256":"7995fdf37c76d6668d7747f42d04573395aebc0de768792101baa1c8c27ff5eb","schema_version":"1.0","event_id":"sha256:7995fdf37c76d6668d7747f42d04573395aebc0de768792101baa1c8c27ff5eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MIZKZGLP2SPPDMMU63DJLPUYWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolutionary Reinforcement Learning via Cooperative Coevolutionary Negatively Correlated Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Hu Zhang, Ke Tang, Mingjia Li, Peng Yang, Yanglong Yu","submitted_at":"2020-09-08T09:28:30Z","abstract_excerpt":"Evolutionary algorithms (EAs) have been successfully applied to optimize the policies for Reinforcement Learning (RL) tasks due to their exploration ability. The recently proposed Negatively Correlated Search (NCS) provides a distinct parallel exploration search behavior and is expected to facilitate RL more effectively. Considering that the commonly adopted neural policies usually involves millions of parameters to be optimized, the direct application of NCS to RL may face a great challenge of the large-scale search space. To address this issue, this paper presents an NCS-friendly Cooperative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03603","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/2009.03603/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-05T06:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0L7tQUie/fFB3QYHQP4ZltmvCxSfX3bRA+m4waiwOJ5oL5CKZ8LKxSU8YWiVLVoVf5Y95A75cXJDb/vw3wKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T13:08:28.927625Z"},"content_sha256":"55b79a02d715bccec1c6d911f241fcbea7e6ee9d27a75305a60925cb20997215","schema_version":"1.0","event_id":"sha256:55b79a02d715bccec1c6d911f241fcbea7e6ee9d27a75305a60925cb20997215"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIZKZGLP2SPPDMMU63DJLPUYWP/bundle.json","state_url":"https://pith.science/pith/MIZKZGLP2SPPDMMU63DJLPUYWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIZKZGLP2SPPDMMU63DJLPUYWP/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-10T13:08:28Z","links":{"resolver":"https://pith.science/pith/MIZKZGLP2SPPDMMU63DJLPUYWP","bundle":"https://pith.science/pith/MIZKZGLP2SPPDMMU63DJLPUYWP/bundle.json","state":"https://pith.science/pith/MIZKZGLP2SPPDMMU63DJLPUYWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIZKZGLP2SPPDMMU63DJLPUYWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MIZKZGLP2SPPDMMU63DJLPUYWP","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":"f3c46f092749891902033cf30289be33fbbf5aedb288b01ef36d20d1dd1fa51e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-09-08T09:28:30Z","title_canon_sha256":"9b17eae724eaaabf3c6d7c94888c933e9cc6e7e0b69db2d6579d7913f59bd537"},"schema_version":"1.0","source":{"id":"2009.03603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.03603","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"2009.03603v1","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03603","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"MIZKZGLP2SPP","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"pith_short_16","alias_value":"MIZKZGLP2SPPDMMU","created_at":"2026-07-05T06:53:27Z"},{"alias_kind":"pith_short_8","alias_value":"MIZKZGLP","created_at":"2026-07-05T06:53:27Z"}],"graph_snapshots":[{"event_id":"sha256:55b79a02d715bccec1c6d911f241fcbea7e6ee9d27a75305a60925cb20997215","target":"graph","created_at":"2026-07-05T06:53:27Z","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/2009.03603/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Evolutionary algorithms (EAs) have been successfully applied to optimize the policies for Reinforcement Learning (RL) tasks due to their exploration ability. The recently proposed Negatively Correlated Search (NCS) provides a distinct parallel exploration search behavior and is expected to facilitate RL more effectively. Considering that the commonly adopted neural policies usually involves millions of parameters to be optimized, the direct application of NCS to RL may face a great challenge of the large-scale search space. To address this issue, this paper presents an NCS-friendly Cooperative","authors_text":"Hu Zhang, Ke Tang, Mingjia Li, Peng Yang, Yanglong Yu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-09-08T09:28:30Z","title":"Evolutionary Reinforcement Learning via Cooperative Coevolutionary Negatively Correlated Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03603","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:7995fdf37c76d6668d7747f42d04573395aebc0de768792101baa1c8c27ff5eb","target":"record","created_at":"2026-07-05T06:53:27Z","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":"f3c46f092749891902033cf30289be33fbbf5aedb288b01ef36d20d1dd1fa51e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-09-08T09:28:30Z","title_canon_sha256":"9b17eae724eaaabf3c6d7c94888c933e9cc6e7e0b69db2d6579d7913f59bd537"},"schema_version":"1.0","source":{"id":"2009.03603","kind":"arxiv","version":1}},"canonical_sha256":"6232ac996fd49ef1b194f6c695be98b3f0c44bafdfe69a741de7c6b3cefb10a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6232ac996fd49ef1b194f6c695be98b3f0c44bafdfe69a741de7c6b3cefb10a5","first_computed_at":"2026-07-05T06:53:27.790639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:53:27.790639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9fZJzaAO3+QkUm5Xg5LMgnohkWTsaFjTIsGEYPktz/Ln+Yge3FfVz7whRiHP0DEG7vYWvJBwuId77hiwRT+FDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:53:27.791115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.03603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7995fdf37c76d6668d7747f42d04573395aebc0de768792101baa1c8c27ff5eb","sha256:55b79a02d715bccec1c6d911f241fcbea7e6ee9d27a75305a60925cb20997215"],"state_sha256":"10423a6ced35b9d144263dd9cf80ff669a25c95566a5a5ae2ad0d8a680242428"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCdoCasV20xRtT48JVEjashox6cBmRvO9T5se6221PyE30F0+9b9qJ77Jt+V0HfmW+4zawavOqOFPD3wo88xDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T13:08:28.929697Z","bundle_sha256":"ce43c85ea090f49f3548df4d4c8e3feabd377a3449d206b92028504bb96cd83e"}}