{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IEML64KYRFBTRXR5PBIN3V745F","short_pith_number":"pith:IEML64KY","canonical_record":{"source":{"id":"1607.05241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-18T19:01:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"abeac5a87fdabdfe8a5cb8c091135f65c6b2c9f7a6b5d3017af23a143fcb08ff","abstract_canon_sha256":"238b4e0ae4434ff983f0fcf2bf1e9cc560897458eeda70c309be5b4bf5987d86"},"schema_version":"1.0"},"canonical_sha256":"4118bf7158894338de3d7850ddd7fce94abb31e12d7afef66b7f1a96050d4381","source":{"kind":"arxiv","id":"1607.05241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05241","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05241v1","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05241","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"IEML64KYRFBT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IEML64KYRFBTRXR5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IEML64KY","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IEML64KYRFBTRXR5PBIN3V745F","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-18T19:01:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"abeac5a87fdabdfe8a5cb8c091135f65c6b2c9f7a6b5d3017af23a143fcb08ff","abstract_canon_sha256":"238b4e0ae4434ff983f0fcf2bf1e9cc560897458eeda70c309be5b4bf5987d86"},"schema_version":"1.0"},"canonical_sha256":"4118bf7158894338de3d7850ddd7fce94abb31e12d7afef66b7f1a96050d4381","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:55.618307Z","signature_b64":"WjLQor4Ul9CpzlHI6Tlaw5NUcobUlgNSoIRb952nM1WIZJeQiexpk85Rlqz4EtVzl9NQ1Wfi8OneDVM6saV0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4118bf7158894338de3d7850ddd7fce94abb31e12d7afef66b7f1a96050d4381","last_reissued_at":"2026-05-18T01:10:55.617794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:55.617794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05241","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-18T01:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFnHAsU3rwi4ZVvb+bI1sHzoSzLQHQBmYPKWHxLeRDvFbrAYeWxOmJduDeo4sVMwNtXO8w1hRKy4VU+Q/oCaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:04:53.464597Z"},"content_sha256":"8099749b35356bac20f4f8f6ad4329c385aec83dc7776b7c9f44dae2eb6fab25","schema_version":"1.0","event_id":"sha256:8099749b35356bac20f4f8f6ad4329c385aec83dc7776b7c9f44dae2eb6fab25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IEML64KYRFBTRXR5PBIN3V745F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Imitation Learning with Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Khanh Nguyen","submitted_at":"2016-07-18T19:01:00Z","abstract_excerpt":"We present a novel view that unifies two frameworks that aim to solve sequential prediction problems: learning to search (L2S) and recurrent neural networks (RNN). We point out equivalences between elements of the two frameworks. By complementing what is missing from one framework comparing to the other, we introduce a more advanced imitation learning framework that, on one hand, augments L2S s notion of search space and, on the other hand, enhances RNNs training procedure to be more robust to compounding errors arising from training on highly correlated examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05241","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-18T01:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fW846L0a6/dejAcOtw8LggtYjWz04NyydZQri3EUhrwFNnPjMd/o2BcizuL2Lppn5G7AWu9gYnHEAowyNiNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:04:53.464953Z"},"content_sha256":"e05f04f3d731d1899c32794a1223302f916d2bda947faf3253c46b19b39cfe20","schema_version":"1.0","event_id":"sha256:e05f04f3d731d1899c32794a1223302f916d2bda947faf3253c46b19b39cfe20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEML64KYRFBTRXR5PBIN3V745F/bundle.json","state_url":"https://pith.science/pith/IEML64KYRFBTRXR5PBIN3V745F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEML64KYRFBTRXR5PBIN3V745F/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-28T03:04:53Z","links":{"resolver":"https://pith.science/pith/IEML64KYRFBTRXR5PBIN3V745F","bundle":"https://pith.science/pith/IEML64KYRFBTRXR5PBIN3V745F/bundle.json","state":"https://pith.science/pith/IEML64KYRFBTRXR5PBIN3V745F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEML64KYRFBTRXR5PBIN3V745F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IEML64KYRFBTRXR5PBIN3V745F","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":"238b4e0ae4434ff983f0fcf2bf1e9cc560897458eeda70c309be5b4bf5987d86","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-18T19:01:00Z","title_canon_sha256":"abeac5a87fdabdfe8a5cb8c091135f65c6b2c9f7a6b5d3017af23a143fcb08ff"},"schema_version":"1.0","source":{"id":"1607.05241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05241","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05241v1","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05241","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"IEML64KYRFBT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IEML64KYRFBTRXR5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IEML64KY","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:e05f04f3d731d1899c32794a1223302f916d2bda947faf3253c46b19b39cfe20","target":"graph","created_at":"2026-05-18T01:10:55Z","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 present a novel view that unifies two frameworks that aim to solve sequential prediction problems: learning to search (L2S) and recurrent neural networks (RNN). We point out equivalences between elements of the two frameworks. By complementing what is missing from one framework comparing to the other, we introduce a more advanced imitation learning framework that, on one hand, augments L2S s notion of search space and, on the other hand, enhances RNNs training procedure to be more robust to compounding errors arising from training on highly correlated examples.","authors_text":"Khanh Nguyen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-18T19:01:00Z","title":"Imitation Learning with Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05241","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:8099749b35356bac20f4f8f6ad4329c385aec83dc7776b7c9f44dae2eb6fab25","target":"record","created_at":"2026-05-18T01:10:55Z","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":"238b4e0ae4434ff983f0fcf2bf1e9cc560897458eeda70c309be5b4bf5987d86","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-18T19:01:00Z","title_canon_sha256":"abeac5a87fdabdfe8a5cb8c091135f65c6b2c9f7a6b5d3017af23a143fcb08ff"},"schema_version":"1.0","source":{"id":"1607.05241","kind":"arxiv","version":1}},"canonical_sha256":"4118bf7158894338de3d7850ddd7fce94abb31e12d7afef66b7f1a96050d4381","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4118bf7158894338de3d7850ddd7fce94abb31e12d7afef66b7f1a96050d4381","first_computed_at":"2026-05-18T01:10:55.617794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:55.617794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WjLQor4Ul9CpzlHI6Tlaw5NUcobUlgNSoIRb952nM1WIZJeQiexpk85Rlqz4EtVzl9NQ1Wfi8OneDVM6saV0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:55.618307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8099749b35356bac20f4f8f6ad4329c385aec83dc7776b7c9f44dae2eb6fab25","sha256:e05f04f3d731d1899c32794a1223302f916d2bda947faf3253c46b19b39cfe20"],"state_sha256":"2d39f2e0f6f663b54709ff120bbff8dbac3dc22c482ba99b7f1f1d675644432d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pX0caGyMkPPIU1e3c7TZfd7r6HaWdYFE4GmWqNIPKnBeWDyCWaYxTiTLuMG8J1VFioobkp2ykVPkLozmvNtCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:04:53.466979Z","bundle_sha256":"e49b44574734532c92c449c055547549f1e385ce4364a930456f31a983f85cb6"}}