{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ARSV4NVLK5UZNJOB6NS7Q4FOJU","short_pith_number":"pith:ARSV4NVL","canonical_record":{"source":{"id":"1612.08967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-28T19:53:08Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"b9467bdafce9342ccae50b86d40babe1762435011450adb3856d250f6a8e9ce8","abstract_canon_sha256":"7a58d48183046dbb3ced11a56e7aa07d1d6aa6599d76a5eecc418ab89895ef30"},"schema_version":"1.0"},"canonical_sha256":"04655e36ab576996a5c1f365f870ae4d33aa364d964f93c041a5bdf0b028849e","source":{"kind":"arxiv","id":"1612.08967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08967","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08967v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08967","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"ARSV4NVLK5UZ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ARSV4NVLK5UZNJOB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ARSV4NVL","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ARSV4NVLK5UZNJOB6NS7Q4FOJU","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-28T19:53:08Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"b9467bdafce9342ccae50b86d40babe1762435011450adb3856d250f6a8e9ce8","abstract_canon_sha256":"7a58d48183046dbb3ced11a56e7aa07d1d6aa6599d76a5eecc418ab89895ef30"},"schema_version":"1.0"},"canonical_sha256":"04655e36ab576996a5c1f365f870ae4d33aa364d964f93c041a5bdf0b028849e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:46.757816Z","signature_b64":"l9n4SRYylktyzWm/Y39lTFNwtPB8QLNHXzGr6yBVXtQI2k4rp3kXlGRiOGxEEv2lW7o/WAYWkJxf7HDewY/iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04655e36ab576996a5c1f365f870ae4d33aa364d964f93c041a5bdf0b028849e","last_reissued_at":"2026-05-18T00:53:46.757454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:46.757454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08967","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-05-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KS+dAMB5pBtvTh6G2bzYMFOeEbCSsuld12KyFRO3E8o1aMhwyVzr2c/lsutYZ9BuDZQUMiKMpLees7jPpF6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:35:20.003898Z"},"content_sha256":"e7b6ebd21e1190bf4cbd32f16b772923a17f027ff1e661a38bac0942130aa272","schema_version":"1.0","event_id":"sha256:e7b6ebd21e1190bf4cbd32f16b772923a17f027ff1e661a38bac0942130aa272"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ARSV4NVLK5UZNJOB6NS7Q4FOJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient iterative policy optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.AI","authors_text":"Nicolas Le Roux","submitted_at":"2016-12-28T19:53:08Z","abstract_excerpt":"We tackle the issue of finding a good policy when the number of policy updates is limited. This is done by approximating the expected policy reward as a sequence of concave lower bounds which can be efficiently maximized, drastically reducing the number of policy updates required to achieve good performance. We also extend existing methods to negative rewards, enabling the use of control variates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08967","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":""},"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-05-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hv9C0h/f8vi9Epbb2niA7oNww4MJ8WnHSgDNVXbMXrVRxDK53kCFfUUQ5W7PhhJM4eTxpCtuJYnXcw4/EWPLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:35:20.004429Z"},"content_sha256":"62628cfebc85117975c8ab85eb13a48a4e9351adb0396ff51fffc58ec3115037","schema_version":"1.0","event_id":"sha256:62628cfebc85117975c8ab85eb13a48a4e9351adb0396ff51fffc58ec3115037"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARSV4NVLK5UZNJOB6NS7Q4FOJU/bundle.json","state_url":"https://pith.science/pith/ARSV4NVLK5UZNJOB6NS7Q4FOJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARSV4NVLK5UZNJOB6NS7Q4FOJU/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-10T07:35:20Z","links":{"resolver":"https://pith.science/pith/ARSV4NVLK5UZNJOB6NS7Q4FOJU","bundle":"https://pith.science/pith/ARSV4NVLK5UZNJOB6NS7Q4FOJU/bundle.json","state":"https://pith.science/pith/ARSV4NVLK5UZNJOB6NS7Q4FOJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARSV4NVLK5UZNJOB6NS7Q4FOJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ARSV4NVLK5UZNJOB6NS7Q4FOJU","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":"7a58d48183046dbb3ced11a56e7aa07d1d6aa6599d76a5eecc418ab89895ef30","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-28T19:53:08Z","title_canon_sha256":"b9467bdafce9342ccae50b86d40babe1762435011450adb3856d250f6a8e9ce8"},"schema_version":"1.0","source":{"id":"1612.08967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08967","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08967v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08967","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"ARSV4NVLK5UZ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ARSV4NVLK5UZNJOB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ARSV4NVL","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:62628cfebc85117975c8ab85eb13a48a4e9351adb0396ff51fffc58ec3115037","target":"graph","created_at":"2026-05-18T00:53:46Z","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"},"paper":{"abstract_excerpt":"We tackle the issue of finding a good policy when the number of policy updates is limited. This is done by approximating the expected policy reward as a sequence of concave lower bounds which can be efficiently maximized, drastically reducing the number of policy updates required to achieve good performance. We also extend existing methods to negative rewards, enabling the use of control variates.","authors_text":"Nicolas Le Roux","cross_cats":["cs.LG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-28T19:53:08Z","title":"Efficient iterative policy optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08967","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:e7b6ebd21e1190bf4cbd32f16b772923a17f027ff1e661a38bac0942130aa272","target":"record","created_at":"2026-05-18T00:53:46Z","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":"7a58d48183046dbb3ced11a56e7aa07d1d6aa6599d76a5eecc418ab89895ef30","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-28T19:53:08Z","title_canon_sha256":"b9467bdafce9342ccae50b86d40babe1762435011450adb3856d250f6a8e9ce8"},"schema_version":"1.0","source":{"id":"1612.08967","kind":"arxiv","version":1}},"canonical_sha256":"04655e36ab576996a5c1f365f870ae4d33aa364d964f93c041a5bdf0b028849e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04655e36ab576996a5c1f365f870ae4d33aa364d964f93c041a5bdf0b028849e","first_computed_at":"2026-05-18T00:53:46.757454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:46.757454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l9n4SRYylktyzWm/Y39lTFNwtPB8QLNHXzGr6yBVXtQI2k4rp3kXlGRiOGxEEv2lW7o/WAYWkJxf7HDewY/iDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:46.757816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7b6ebd21e1190bf4cbd32f16b772923a17f027ff1e661a38bac0942130aa272","sha256:62628cfebc85117975c8ab85eb13a48a4e9351adb0396ff51fffc58ec3115037"],"state_sha256":"5aa065a698fb9675b30a8ffc09d94a06bbd79c672588f4e5029d32c11449fece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzBqOSY8skmzZ0k9lmuQSuUR0WTqsNiN0ntIyZpgJuA0B6E9SMs4MSS/tXSMcmFcRtQE3VM7j+hRntWsX+NKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T07:35:20.015614Z","bundle_sha256":"bf38eb55791a01a51e6ad981df9a31f65741f7822238390d1cb602b70f5abe21"}}