{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X6KIVZJBXYU6LSZ7LO7VWPHJM6","short_pith_number":"pith:X6KIVZJB","schema_version":"1.0","canonical_sha256":"bf948ae521be29e5cb3f5bbf5b3ce967a8b944532fdca944d7caf778ecf8388d","source":{"kind":"arxiv","id":"1712.06568","version":3},"attestation_state":"computed","paper":{"title":"ES Is More Than Just a Traditional Finite-Difference Approximator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Jay Chen, Jeff Clune, Joel Lehman, Kenneth O. Stanley","submitted_at":"2017-12-18T18:25:35Z","abstract_excerpt":"An evolution strategy (ES) variant based on a simplification of a natural evolution strategy recently attracted attention because it performs surprisingly well in challenging deep reinforcement learning domains. It searches for neural network parameters by generating perturbations to the current set of parameters, checking their performance, and moving in the aggregate direction of higher reward. Because it resembles a traditional finite-difference approximation of the reward gradient, it can naturally be confused with one. However, this ES optimizes for a different gradient than just reward: "},"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":"1712.06568","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-12-18T18:25:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b214ef181a21a648fb05694d13187ea4415ff2a0ad7463da72a8a7b8a1251d25","abstract_canon_sha256":"ff84934848efca6cc685ce10c9a781aa552dc66f37796342272726e949eea001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:01.429031Z","signature_b64":"on5B0/CWu777jilJP1tHXTE69NRazRKv/K0Ia8gxh8Q9Ikmm34+4rQowctbo/toq6HuYLYkjVUXUUOJQQ2ZmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf948ae521be29e5cb3f5bbf5b3ce967a8b944532fdca944d7caf778ecf8388d","last_reissued_at":"2026-05-18T00:17:01.428119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:01.428119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ES Is More Than Just a Traditional Finite-Difference Approximator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Jay Chen, Jeff Clune, Joel Lehman, Kenneth O. Stanley","submitted_at":"2017-12-18T18:25:35Z","abstract_excerpt":"An evolution strategy (ES) variant based on a simplification of a natural evolution strategy recently attracted attention because it performs surprisingly well in challenging deep reinforcement learning domains. It searches for neural network parameters by generating perturbations to the current set of parameters, checking their performance, and moving in the aggregate direction of higher reward. Because it resembles a traditional finite-difference approximation of the reward gradient, it can naturally be confused with one. However, this ES optimizes for a different gradient than just reward: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06568","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":""},"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":"1712.06568","created_at":"2026-05-18T00:17:01.428219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06568v3","created_at":"2026-05-18T00:17:01.428219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06568","created_at":"2026-05-18T00:17:01.428219+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6KIVZJBXYU6","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6KIVZJBXYU6LSZ7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6KIVZJB","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04882","citing_title":"Acoustic Model Optimization Based On Evolutionary Stochastic Gradient Descent with Anchors for Automatic Speech Recognition","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6","json":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6.json","graph_json":"https://pith.science/api/pith-number/X6KIVZJBXYU6LSZ7LO7VWPHJM6/graph.json","events_json":"https://pith.science/api/pith-number/X6KIVZJBXYU6LSZ7LO7VWPHJM6/events.json","paper":"https://pith.science/paper/X6KIVZJB"},"agent_actions":{"view_html":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6","download_json":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6.json","view_paper":"https://pith.science/paper/X6KIVZJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06568&json=true","fetch_graph":"https://pith.science/api/pith-number/X6KIVZJBXYU6LSZ7LO7VWPHJM6/graph.json","fetch_events":"https://pith.science/api/pith-number/X6KIVZJBXYU6LSZ7LO7VWPHJM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6/action/storage_attestation","attest_author":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6/action/author_attestation","sign_citation":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6/action/citation_signature","submit_replication":"https://pith.science/pith/X6KIVZJBXYU6LSZ7LO7VWPHJM6/action/replication_record"}},"created_at":"2026-05-18T00:17:01.428219+00:00","updated_at":"2026-05-18T00:17:01.428219+00:00"}