{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZMIPH4TJAMQS2X5BSKLTLBS6B5","short_pith_number":"pith:ZMIPH4TJ","canonical_record":{"source":{"id":"1709.06917","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:03:47Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"ff52ba3a7274684804499b5519cbbb9c3674f916da7f77ee83455c47d71ea595","abstract_canon_sha256":"d5a6153a177f99ae6b127ddb7f61b59dbf6acab2498889afefc6998762ffba5b"},"schema_version":"1.0"},"canonical_sha256":"cb10f3f26903212d5fa1929735865e0f5fd255a83d513465f081cdbe2ce9a14f","source":{"kind":"arxiv","id":"1709.06917","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06917","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06917v2","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06917","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZMIPH4TJAMQS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMIPH4TJAMQS2X5B","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMIPH4TJ","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZMIPH4TJAMQS2X5BSKLTLBS6B5","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06917","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:03:47Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"ff52ba3a7274684804499b5519cbbb9c3674f916da7f77ee83455c47d71ea595","abstract_canon_sha256":"d5a6153a177f99ae6b127ddb7f61b59dbf6acab2498889afefc6998762ffba5b"},"schema_version":"1.0"},"canonical_sha256":"cb10f3f26903212d5fa1929735865e0f5fd255a83d513465f081cdbe2ce9a14f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:25.189730Z","signature_b64":"cAL9mg5GRwmFAXD81/t5gchltkKDTAYX3QfZP8Q6YrikMA2W69BwD4oVYDLpC+udnfBuuZD3KMp0QPd4J3KeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb10f3f26903212d5fa1929735865e0f5fd255a83d513465f081cdbe2ce9a14f","last_reissued_at":"2026-05-18T00:21:25.189006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:25.189006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06917","source_version":2,"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:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAK/JRqKZIGbNerhy1uNvtSpgjQhmhiPM0Md8/1O43RCn+h4201qTNFzYpojm+mgrbN61AK6JIkzxK1lVbUkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:36:21.773932Z"},"content_sha256":"6f6efbc8afff270adb975792774c72ef97392ead2e6a1c7ca30816c11ccb5454","schema_version":"1.0","event_id":"sha256:6f6efbc8afff270adb975792774c72ef97392ead2e6a1c7ca30816c11ccb5454"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZMIPH4TJAMQS2X5BSKLTLBS6B5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Parameterized Black-Box Priors to Scale Up Model-Based Policy Search for Robotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE","stat.ML"],"primary_cat":"cs.RO","authors_text":"Jean-Baptiste Mouret, Konstantinos Chatzilygeroudis","submitted_at":"2017-09-20T15:03:47Z","abstract_excerpt":"The most data-efficient algorithms for reinforcement learning in robotics are model-based policy search algorithms, which alternate between learning a dynamical model of the robot and optimizing a policy to maximize the expected return given the model and its uncertainties. Among the few proposed approaches, the recently introduced Black-DROPS algorithm exploits a black-box optimization algorithm to achieve both high data-efficiency and good computation times when several cores are used; nevertheless, like all model-based policy search approaches, Black-DROPS does not scale to high dimensional"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06917","kind":"arxiv","version":2},"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:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dP+U3+5xQTy2gLowUo0FEQuX+scJul3DzFsVMXMI+7j41whoMMP4aca9mYXvvUFo0zdUgmZhaHilORzy7asCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:36:21.774725Z"},"content_sha256":"072924567dfdaaab408f11ba89e6597401c14b35b55760622891a75e20a4a003","schema_version":"1.0","event_id":"sha256:072924567dfdaaab408f11ba89e6597401c14b35b55760622891a75e20a4a003"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMIPH4TJAMQS2X5BSKLTLBS6B5/bundle.json","state_url":"https://pith.science/pith/ZMIPH4TJAMQS2X5BSKLTLBS6B5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMIPH4TJAMQS2X5BSKLTLBS6B5/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-05-30T23:36:21Z","links":{"resolver":"https://pith.science/pith/ZMIPH4TJAMQS2X5BSKLTLBS6B5","bundle":"https://pith.science/pith/ZMIPH4TJAMQS2X5BSKLTLBS6B5/bundle.json","state":"https://pith.science/pith/ZMIPH4TJAMQS2X5BSKLTLBS6B5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMIPH4TJAMQS2X5BSKLTLBS6B5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZMIPH4TJAMQS2X5BSKLTLBS6B5","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":"d5a6153a177f99ae6b127ddb7f61b59dbf6acab2498889afefc6998762ffba5b","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:03:47Z","title_canon_sha256":"ff52ba3a7274684804499b5519cbbb9c3674f916da7f77ee83455c47d71ea595"},"schema_version":"1.0","source":{"id":"1709.06917","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06917","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06917v2","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06917","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZMIPH4TJAMQS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMIPH4TJAMQS2X5B","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMIPH4TJ","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:072924567dfdaaab408f11ba89e6597401c14b35b55760622891a75e20a4a003","target":"graph","created_at":"2026-05-18T00:21:25Z","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 most data-efficient algorithms for reinforcement learning in robotics are model-based policy search algorithms, which alternate between learning a dynamical model of the robot and optimizing a policy to maximize the expected return given the model and its uncertainties. Among the few proposed approaches, the recently introduced Black-DROPS algorithm exploits a black-box optimization algorithm to achieve both high data-efficiency and good computation times when several cores are used; nevertheless, like all model-based policy search approaches, Black-DROPS does not scale to high dimensional","authors_text":"Jean-Baptiste Mouret, Konstantinos Chatzilygeroudis","cross_cats":["cs.AI","cs.LG","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:03:47Z","title":"Using Parameterized Black-Box Priors to Scale Up Model-Based Policy Search for Robotics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06917","kind":"arxiv","version":2},"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:6f6efbc8afff270adb975792774c72ef97392ead2e6a1c7ca30816c11ccb5454","target":"record","created_at":"2026-05-18T00:21:25Z","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":"d5a6153a177f99ae6b127ddb7f61b59dbf6acab2498889afefc6998762ffba5b","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:03:47Z","title_canon_sha256":"ff52ba3a7274684804499b5519cbbb9c3674f916da7f77ee83455c47d71ea595"},"schema_version":"1.0","source":{"id":"1709.06917","kind":"arxiv","version":2}},"canonical_sha256":"cb10f3f26903212d5fa1929735865e0f5fd255a83d513465f081cdbe2ce9a14f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb10f3f26903212d5fa1929735865e0f5fd255a83d513465f081cdbe2ce9a14f","first_computed_at":"2026-05-18T00:21:25.189006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:25.189006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAL9mg5GRwmFAXD81/t5gchltkKDTAYX3QfZP8Q6YrikMA2W69BwD4oVYDLpC+udnfBuuZD3KMp0QPd4J3KeAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:25.189730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06917","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f6efbc8afff270adb975792774c72ef97392ead2e6a1c7ca30816c11ccb5454","sha256:072924567dfdaaab408f11ba89e6597401c14b35b55760622891a75e20a4a003"],"state_sha256":"f375398b37cfe00e4c8cb1548a8f0b2320b4c903d16298142e0b82f1b10c04ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FFS44aYPDpABCJcNWeQcVnC62JW7N5mmSBu07NnQVOG9rXu4U2spBwHVYokXlwQMxb0H1jz3MtyTOkEIaPwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:36:21.778922Z","bundle_sha256":"84f5779930d33ff5bd9c81e90725f734513d69e057b76e13ec75ab5608514c8b"}}