{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QZOBE7J7HSFUWTF6UFRRY3YFVK","short_pith_number":"pith:QZOBE7J7","canonical_record":{"source":{"id":"1301.3966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-17T02:15:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9fb3d59465ae94a6e0a0172d9e383f42b9bbc48b723e65f0b811592efd1aa34d","abstract_canon_sha256":"a4230f976b81cbfdb9e59afcbfcaf417e0c97e4e551cc7bb7632d381f31d5a71"},"schema_version":"1.0"},"canonical_sha256":"865c127d3f3c8b4b4cbea1631c6f05aab2074562070307caa0a1e6cee0719cb6","source":{"kind":"arxiv","id":"1301.3966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3966","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3966v1","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3966","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"QZOBE7J7HSFU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QZOBE7J7HSFUWTF6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QZOBE7J7","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QZOBE7J7HSFUWTF6UFRRY3YFVK","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-17T02:15:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9fb3d59465ae94a6e0a0172d9e383f42b9bbc48b723e65f0b811592efd1aa34d","abstract_canon_sha256":"a4230f976b81cbfdb9e59afcbfcaf417e0c97e4e551cc7bb7632d381f31d5a71"},"schema_version":"1.0"},"canonical_sha256":"865c127d3f3c8b4b4cbea1631c6f05aab2074562070307caa0a1e6cee0719cb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:14.754494Z","signature_b64":"JDv+oj8M5o8xpc2lD1qzwW/k4SJBtpHL826aqIZhzYxwxdCy5eYuafoSb84G/+wfmJJfeE4BSKOBtELL/0QaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865c127d3f3c8b4b4cbea1631c6f05aab2074562070307caa0a1e6cee0719cb6","last_reissued_at":"2026-05-18T03:36:14.753849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:14.753849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3966","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-18T03:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuNtNpweIOihZL8J4kgTqZ2WzFRrTRBIChQ/SPfLTwaMT8bYOfJnuVQtEqDPiukO2wCg/FJ/JkcY3CHgmZz1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:18:20.220471Z"},"content_sha256":"3cc46f99f61677a6fb0023337111a059468f8e284a575a86045e631d5c87f791","schema_version":"1.0","event_id":"sha256:3cc46f99f61677a6fb0023337111a059468f8e284a575a86045e631d5c87f791"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QZOBE7J7HSFUWTF6UFRRY3YFVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Sample Reuse in Policy Gradients with Parameter-based Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hirotaka Hachiya, Jun Morimoto, Masashi Sugiyama, Tingting Zhao, Voot Tangkaratt","submitted_at":"2013-01-17T02:15:49Z","abstract_excerpt":"The policy gradient approach is a flexible and powerful reinforcement learning method particularly for problems with continuous actions such as robot control. A common challenge in this scenario is how to reduce the variance of policy gradient estimates for reliable policy updates. In this paper, we combine the following three ideas and give a highly effective policy gradient method: (a) the policy gradients with parameter based exploration, which is a recently proposed policy search method with low variance of gradient estimates, (b) an importance sampling technique, which allows us to reuse "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3966","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-18T03:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"49JnXXsSTBSRt6Wu+DEr0dLBwTUOkZi31Oo343H9A5kWLVmtVS+T52czaf9p4I1wlLRqStl5I7YDd7Cu6Ua5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:18:20.220813Z"},"content_sha256":"ec2ba41f06d771052e1761b967c5dee59cfb72ff229e5ce88453fb2753a01d55","schema_version":"1.0","event_id":"sha256:ec2ba41f06d771052e1761b967c5dee59cfb72ff229e5ce88453fb2753a01d55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZOBE7J7HSFUWTF6UFRRY3YFVK/bundle.json","state_url":"https://pith.science/pith/QZOBE7J7HSFUWTF6UFRRY3YFVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZOBE7J7HSFUWTF6UFRRY3YFVK/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-06-28T07:18:20Z","links":{"resolver":"https://pith.science/pith/QZOBE7J7HSFUWTF6UFRRY3YFVK","bundle":"https://pith.science/pith/QZOBE7J7HSFUWTF6UFRRY3YFVK/bundle.json","state":"https://pith.science/pith/QZOBE7J7HSFUWTF6UFRRY3YFVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZOBE7J7HSFUWTF6UFRRY3YFVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QZOBE7J7HSFUWTF6UFRRY3YFVK","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":"a4230f976b81cbfdb9e59afcbfcaf417e0c97e4e551cc7bb7632d381f31d5a71","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-17T02:15:49Z","title_canon_sha256":"9fb3d59465ae94a6e0a0172d9e383f42b9bbc48b723e65f0b811592efd1aa34d"},"schema_version":"1.0","source":{"id":"1301.3966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3966","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3966v1","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3966","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"QZOBE7J7HSFU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QZOBE7J7HSFUWTF6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QZOBE7J7","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:ec2ba41f06d771052e1761b967c5dee59cfb72ff229e5ce88453fb2753a01d55","target":"graph","created_at":"2026-05-18T03:36:14Z","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":"The policy gradient approach is a flexible and powerful reinforcement learning method particularly for problems with continuous actions such as robot control. A common challenge in this scenario is how to reduce the variance of policy gradient estimates for reliable policy updates. In this paper, we combine the following three ideas and give a highly effective policy gradient method: (a) the policy gradients with parameter based exploration, which is a recently proposed policy search method with low variance of gradient estimates, (b) an importance sampling technique, which allows us to reuse ","authors_text":"Hirotaka Hachiya, Jun Morimoto, Masashi Sugiyama, Tingting Zhao, Voot Tangkaratt","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-17T02:15:49Z","title":"Efficient Sample Reuse in Policy Gradients with Parameter-based Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3966","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:3cc46f99f61677a6fb0023337111a059468f8e284a575a86045e631d5c87f791","target":"record","created_at":"2026-05-18T03:36:14Z","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":"a4230f976b81cbfdb9e59afcbfcaf417e0c97e4e551cc7bb7632d381f31d5a71","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-17T02:15:49Z","title_canon_sha256":"9fb3d59465ae94a6e0a0172d9e383f42b9bbc48b723e65f0b811592efd1aa34d"},"schema_version":"1.0","source":{"id":"1301.3966","kind":"arxiv","version":1}},"canonical_sha256":"865c127d3f3c8b4b4cbea1631c6f05aab2074562070307caa0a1e6cee0719cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"865c127d3f3c8b4b4cbea1631c6f05aab2074562070307caa0a1e6cee0719cb6","first_computed_at":"2026-05-18T03:36:14.753849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:14.753849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JDv+oj8M5o8xpc2lD1qzwW/k4SJBtpHL826aqIZhzYxwxdCy5eYuafoSb84G/+wfmJJfeE4BSKOBtELL/0QaAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:14.754494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cc46f99f61677a6fb0023337111a059468f8e284a575a86045e631d5c87f791","sha256:ec2ba41f06d771052e1761b967c5dee59cfb72ff229e5ce88453fb2753a01d55"],"state_sha256":"84b1167c01541816c453583cf247fdca69798750ffb6fde037284f7d26f72186"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgNovFBkN52njw2rqT3iOfMPP6AiMnM6rnsgU2gfSO+3SQ0zwy2615uvGswcaUwalfMme4Psy+sOfLSdGhTrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:18:20.222684Z","bundle_sha256":"de0137332c204e835dd75cd13ccf43653a3dfe02f4b700ae155372915517e383"}}