{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:65VMTCWD6VQ6Y2NU7OIURASKRW","short_pith_number":"pith:65VMTCWD","canonical_record":{"source":{"id":"1802.05803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T23:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"8b2e53bc69eb15736c4b6ca6120994694c646e907e0cd4a4c9c58e336a51d7af","abstract_canon_sha256":"25ea5741cf32196dca10108800f964d7a71e5cc0d96147bb683c73b63f29ca78"},"schema_version":"1.0"},"canonical_sha256":"f76ac98ac3f561ec69b4fb9148824a8dbf7736624bac00e1cec7fa26d8bde68c","source":{"kind":"arxiv","id":"1802.05803","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05803","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05803v2","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05803","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"pith_short_12","alias_value":"65VMTCWD6VQ6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65VMTCWD6VQ6Y2NU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65VMTCWD","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:65VMTCWD6VQ6Y2NU7OIURASKRW","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T23:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"8b2e53bc69eb15736c4b6ca6120994694c646e907e0cd4a4c9c58e336a51d7af","abstract_canon_sha256":"25ea5741cf32196dca10108800f964d7a71e5cc0d96147bb683c73b63f29ca78"},"schema_version":"1.0"},"canonical_sha256":"f76ac98ac3f561ec69b4fb9148824a8dbf7736624bac00e1cec7fa26d8bde68c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:04.242612Z","signature_b64":"hefYG1KMBu3VXGCCw2UxxvfjXjV017nKWUuzli6UMQyiIucrq2W7lKYNzKCqZpU093ozg7h1aNUHQa/BeMmNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f76ac98ac3f561ec69b4fb9148824a8dbf7736624bac00e1cec7fa26d8bde68c","last_reissued_at":"2026-05-18T00:21:04.242204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:04.242204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05803","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:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ux5SXHKlZZa3ThiMupYEPT4Af6bmz5wideKErzOqEOypkYxDJyivAijNLrorCyziBxRWd9Z3r06hbF8zzwy0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:01:26.690148Z"},"content_sha256":"52ed03a97cb2c77c1c28cbe6af3ba1ea1c0004c6d22d1a0765861b2195cf8006","schema_version":"1.0","event_id":"sha256:52ed03a97cb2c77c1c28cbe6af3ba1ea1c0004c6d22d1a0765861b2195cf8006"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:65VMTCWD6VQ6Y2NU7OIURASKRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MPC-Inspired Neural Network Policies for Sequential Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David D. Fan, Evangelos Theodorou, Gabriel Nakajima An, Marcus Pereira","submitted_at":"2018-02-15T23:44:55Z","abstract_excerpt":"In this paper we investigate the use of MPC-inspired neural network policies for sequential decision making. We introduce an extension to the DAgger algorithm for training such policies and show how they have improved training performance and generalization capabilities. We take advantage of this extension to show scalable and efficient training of complex planning policy architectures in continuous state and action spaces. We provide an extensive comparison of neural network policies by considering feed forward policies, recurrent policies, and recurrent policies with planning structure inspi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05803","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:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nEDvW79GMtns03Snx5Pzi4mezIszTlgzt+y7fbg906zlV57/36U1oaYu48t8pBofgE06etI8vEUldxtdtreLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:01:26.690503Z"},"content_sha256":"054ed01616d250a5b33409a9a4245fd4b6be2efa4362010d547a01dcb360bdf5","schema_version":"1.0","event_id":"sha256:054ed01616d250a5b33409a9a4245fd4b6be2efa4362010d547a01dcb360bdf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65VMTCWD6VQ6Y2NU7OIURASKRW/bundle.json","state_url":"https://pith.science/pith/65VMTCWD6VQ6Y2NU7OIURASKRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65VMTCWD6VQ6Y2NU7OIURASKRW/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-07-07T10:01:26Z","links":{"resolver":"https://pith.science/pith/65VMTCWD6VQ6Y2NU7OIURASKRW","bundle":"https://pith.science/pith/65VMTCWD6VQ6Y2NU7OIURASKRW/bundle.json","state":"https://pith.science/pith/65VMTCWD6VQ6Y2NU7OIURASKRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65VMTCWD6VQ6Y2NU7OIURASKRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:65VMTCWD6VQ6Y2NU7OIURASKRW","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":"25ea5741cf32196dca10108800f964d7a71e5cc0d96147bb683c73b63f29ca78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T23:44:55Z","title_canon_sha256":"8b2e53bc69eb15736c4b6ca6120994694c646e907e0cd4a4c9c58e336a51d7af"},"schema_version":"1.0","source":{"id":"1802.05803","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05803","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05803v2","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05803","created_at":"2026-05-18T00:21:04Z"},{"alias_kind":"pith_short_12","alias_value":"65VMTCWD6VQ6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65VMTCWD6VQ6Y2NU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65VMTCWD","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:054ed01616d250a5b33409a9a4245fd4b6be2efa4362010d547a01dcb360bdf5","target":"graph","created_at":"2026-05-18T00:21:04Z","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":"In this paper we investigate the use of MPC-inspired neural network policies for sequential decision making. We introduce an extension to the DAgger algorithm for training such policies and show how they have improved training performance and generalization capabilities. We take advantage of this extension to show scalable and efficient training of complex planning policy architectures in continuous state and action spaces. We provide an extensive comparison of neural network policies by considering feed forward policies, recurrent policies, and recurrent policies with planning structure inspi","authors_text":"David D. Fan, Evangelos Theodorou, Gabriel Nakajima An, Marcus Pereira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T23:44:55Z","title":"MPC-Inspired Neural Network Policies for Sequential Decision Making"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05803","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:52ed03a97cb2c77c1c28cbe6af3ba1ea1c0004c6d22d1a0765861b2195cf8006","target":"record","created_at":"2026-05-18T00:21:04Z","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":"25ea5741cf32196dca10108800f964d7a71e5cc0d96147bb683c73b63f29ca78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T23:44:55Z","title_canon_sha256":"8b2e53bc69eb15736c4b6ca6120994694c646e907e0cd4a4c9c58e336a51d7af"},"schema_version":"1.0","source":{"id":"1802.05803","kind":"arxiv","version":2}},"canonical_sha256":"f76ac98ac3f561ec69b4fb9148824a8dbf7736624bac00e1cec7fa26d8bde68c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f76ac98ac3f561ec69b4fb9148824a8dbf7736624bac00e1cec7fa26d8bde68c","first_computed_at":"2026-05-18T00:21:04.242204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:04.242204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hefYG1KMBu3VXGCCw2UxxvfjXjV017nKWUuzli6UMQyiIucrq2W7lKYNzKCqZpU093ozg7h1aNUHQa/BeMmNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:04.242612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05803","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52ed03a97cb2c77c1c28cbe6af3ba1ea1c0004c6d22d1a0765861b2195cf8006","sha256:054ed01616d250a5b33409a9a4245fd4b6be2efa4362010d547a01dcb360bdf5"],"state_sha256":"6bafb20f471d80924945c6e96e04368703a08706ca03ee9b095a4f9c796d022e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nCCTgXpJKnhkJwiXyIloLiC71cKivvjGmJUSc7A5M3yZVTshJRZWNtawT5vJwf9RPzzhA9GZ2OCWx74Uh+bLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:01:26.692494Z","bundle_sha256":"83b1d53aecfcb19f833a17703c5f2c5ca3821957922706483fb3d91cac430eaf"}}