{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UEYFIZHRIMBDKCXC33JN5GRG72","short_pith_number":"pith:UEYFIZHR","canonical_record":{"source":{"id":"1905.12941","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-30T10:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"437d988bae24c64c720858b090c4fba8eff6942d35b2065be590d44d1ee5dc1a","abstract_canon_sha256":"f1c21e1228b2d5cf69434ae6349353f637fb85dcd4eebf7fd647831d6573d777"},"schema_version":"1.0"},"canonical_sha256":"a1305464f14302350ae2ded2de9a26feb7ca0a8fca49f359375cb14d2c1bc0fd","source":{"kind":"arxiv","id":"1905.12941","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12941","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12941v2","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12941","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"UEYFIZHRIMBD","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"pith_short_16","alias_value":"UEYFIZHRIMBDKCXC","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"pith_short_8","alias_value":"UEYFIZHR","created_at":"2026-07-05T02:31:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UEYFIZHRIMBDKCXC33JN5GRG72","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12941","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-30T10:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"437d988bae24c64c720858b090c4fba8eff6942d35b2065be590d44d1ee5dc1a","abstract_canon_sha256":"f1c21e1228b2d5cf69434ae6349353f637fb85dcd4eebf7fd647831d6573d777"},"schema_version":"1.0"},"canonical_sha256":"a1305464f14302350ae2ded2de9a26feb7ca0a8fca49f359375cb14d2c1bc0fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:16.352735Z","signature_b64":"JVvBlbNpxbjf75p4K7CWb13kcGjPHinU3uRvHUbawn2UHBudWxgXfLf2pPoTcGg/Jb+Xttee9CxPvok9zEPHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1305464f14302350ae2ded2de9a26feb7ca0a8fca49f359375cb14d2c1bc0fd","last_reissued_at":"2026-07-05T02:31:16.352273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:16.352273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12941","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-07-05T02:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qg1hxFeUR8Gx/cW6VUi1HcIuOBdRX2QGEvcV09Ua60B/Ymyji1Gh2iOIh6Z7+d8S8Y9N31foAL27FC2R/IZKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:55:34.941109Z"},"content_sha256":"83ac0a8b55f3ea19cb66abe4198a24a8be1bcc84c84bd364b81e2e3af3e26f4e","schema_version":"1.0","event_id":"sha256:83ac0a8b55f3ea19cb66abe4198a24a8be1bcc84c84bd364b81e2e3af3e26f4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UEYFIZHRIMBDKCXC33JN5GRG72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Compositional Neural Programs with Recursive Tree Search and Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexandre Laterre, David Kas, Guillaume Ligner, Karim Beguir, Nando de Freitas, Nicolas Perrin, Olivier Sigaud, Scott Reed, Thomas Pierrot","submitted_at":"2019-05-30T10:08:00Z","abstract_excerpt":"We propose a novel reinforcement learning algorithm, AlphaNPI, that incorporates the strengths of Neural Programmer-Interpreters (NPI) and AlphaZero. NPI contributes structural biases in the form of modularity, hierarchy and recursion, which are helpful to reduce sample complexity, improve generalization and increase interpretability. AlphaZero contributes powerful neural network guided search algorithms, which we augment with recursion. AlphaNPI only assumes a hierarchical program specification with sparse rewards: 1 when the program execution satisfies the specification, and 0 otherwise. Usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12941","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.12941/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-05T02:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZ7OCDa+0RqAh6smXlipYMS9ikKIlCKO6q2v5d1tDmxXQpVXEAic5C4Jjlc5MJ7+GjI+KymguZpyARKxdzsUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:55:34.941600Z"},"content_sha256":"2014df7a1992b1dc8971927387253f66ec50a1beb27359b7e208eb0e1712254f","schema_version":"1.0","event_id":"sha256:2014df7a1992b1dc8971927387253f66ec50a1beb27359b7e208eb0e1712254f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEYFIZHRIMBDKCXC33JN5GRG72/bundle.json","state_url":"https://pith.science/pith/UEYFIZHRIMBDKCXC33JN5GRG72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEYFIZHRIMBDKCXC33JN5GRG72/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-23T22:55:34Z","links":{"resolver":"https://pith.science/pith/UEYFIZHRIMBDKCXC33JN5GRG72","bundle":"https://pith.science/pith/UEYFIZHRIMBDKCXC33JN5GRG72/bundle.json","state":"https://pith.science/pith/UEYFIZHRIMBDKCXC33JN5GRG72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEYFIZHRIMBDKCXC33JN5GRG72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UEYFIZHRIMBDKCXC33JN5GRG72","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":"f1c21e1228b2d5cf69434ae6349353f637fb85dcd4eebf7fd647831d6573d777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-30T10:08:00Z","title_canon_sha256":"437d988bae24c64c720858b090c4fba8eff6942d35b2065be590d44d1ee5dc1a"},"schema_version":"1.0","source":{"id":"1905.12941","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12941","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12941v2","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12941","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"UEYFIZHRIMBD","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"pith_short_16","alias_value":"UEYFIZHRIMBDKCXC","created_at":"2026-07-05T02:31:16Z"},{"alias_kind":"pith_short_8","alias_value":"UEYFIZHR","created_at":"2026-07-05T02:31:16Z"}],"graph_snapshots":[{"event_id":"sha256:2014df7a1992b1dc8971927387253f66ec50a1beb27359b7e208eb0e1712254f","target":"graph","created_at":"2026-07-05T02:31:16Z","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/1905.12941/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel reinforcement learning algorithm, AlphaNPI, that incorporates the strengths of Neural Programmer-Interpreters (NPI) and AlphaZero. NPI contributes structural biases in the form of modularity, hierarchy and recursion, which are helpful to reduce sample complexity, improve generalization and increase interpretability. AlphaZero contributes powerful neural network guided search algorithms, which we augment with recursion. AlphaNPI only assumes a hierarchical program specification with sparse rewards: 1 when the program execution satisfies the specification, and 0 otherwise. Usi","authors_text":"Alexandre Laterre, David Kas, Guillaume Ligner, Karim Beguir, Nando de Freitas, Nicolas Perrin, Olivier Sigaud, Scott Reed, Thomas Pierrot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-30T10:08:00Z","title":"Learning Compositional Neural Programs with Recursive Tree Search and Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12941","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:83ac0a8b55f3ea19cb66abe4198a24a8be1bcc84c84bd364b81e2e3af3e26f4e","target":"record","created_at":"2026-07-05T02:31:16Z","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":"f1c21e1228b2d5cf69434ae6349353f637fb85dcd4eebf7fd647831d6573d777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-30T10:08:00Z","title_canon_sha256":"437d988bae24c64c720858b090c4fba8eff6942d35b2065be590d44d1ee5dc1a"},"schema_version":"1.0","source":{"id":"1905.12941","kind":"arxiv","version":2}},"canonical_sha256":"a1305464f14302350ae2ded2de9a26feb7ca0a8fca49f359375cb14d2c1bc0fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1305464f14302350ae2ded2de9a26feb7ca0a8fca49f359375cb14d2c1bc0fd","first_computed_at":"2026-07-05T02:31:16.352273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:31:16.352273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JVvBlbNpxbjf75p4K7CWb13kcGjPHinU3uRvHUbawn2UHBudWxgXfLf2pPoTcGg/Jb+Xttee9CxPvok9zEPHDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:31:16.352735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12941","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83ac0a8b55f3ea19cb66abe4198a24a8be1bcc84c84bd364b81e2e3af3e26f4e","sha256:2014df7a1992b1dc8971927387253f66ec50a1beb27359b7e208eb0e1712254f"],"state_sha256":"8e66c6dfa474930b75062da44e7845c30319aeb3c4a824e866583dff6bf0f24e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBng/vpjJHFtt+ykK60Ybq58AjPRbaZ6ZR6j+uIfziG37ps9B4UzRQe+okRUAOOetQ5RUUhp1YRGqr4IZpOgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:55:34.945107Z","bundle_sha256":"b5c811815d22ba25dd048774457afc9a579127bfbf8cd7b7645d1b87921a17e9"}}