{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2VCBCDXKKTNLRTJAM3IM6UIDKA","short_pith_number":"pith:2VCBCDXK","schema_version":"1.0","canonical_sha256":"d544110eea54dab8cd2066d0cf510350136a4f5d18a2be44182df36687603bd6","source":{"kind":"arxiv","id":"2310.06171","version":2},"attestation_state":"computed","paper":{"title":"Memory-Consistent Neural Networks for Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Dinesh Jayaraman, Insup Lee, James Weimer, Kaustubh Sridhar, Souradeep Dutta","submitted_at":"2023-10-09T21:49:48Z","abstract_excerpt":"Imitation learning considerably simplifies policy synthesis compared to alternative approaches by exploiting access to expert demonstrations. For such imitation policies, errors away from the training samples are particularly critical. Even rare slip-ups in the policy action outputs can compound quickly over time, since they lead to unfamiliar future states where the policy is still more likely to err, eventually causing task failures. We revisit simple supervised ``behavior cloning'' for conveniently training the policy from nothing more than pre-recorded demonstrations, but carefully design "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.06171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-09T21:49:48Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"375b57d7a64c0811b26870d0c32c55156e317e846f614ac3cecbf4fc6773ee7c","abstract_canon_sha256":"dc7c69fc0e5df836c870125e69f12ce688af8a71ec05ce914f41afb7e7080a82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:53.720638Z","signature_b64":"XPc3HhGQJexmWWs7QwOH6xayAeTwohkiUDyIsixXjnuJg5ZjV87AAcmApHio/CxvB/VXFWuX+m1rhjIvOKN/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d544110eea54dab8cd2066d0cf510350136a4f5d18a2be44182df36687603bd6","last_reissued_at":"2026-07-05T07:56:53.720129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:53.720129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-Consistent Neural Networks for Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Dinesh Jayaraman, Insup Lee, James Weimer, Kaustubh Sridhar, Souradeep Dutta","submitted_at":"2023-10-09T21:49:48Z","abstract_excerpt":"Imitation learning considerably simplifies policy synthesis compared to alternative approaches by exploiting access to expert demonstrations. For such imitation policies, errors away from the training samples are particularly critical. Even rare slip-ups in the policy action outputs can compound quickly over time, since they lead to unfamiliar future states where the policy is still more likely to err, eventually causing task failures. We revisit simple supervised ``behavior cloning'' for conveniently training the policy from nothing more than pre-recorded demonstrations, but carefully design "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06171","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/2310.06171/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.06171","created_at":"2026-07-05T07:56:53.720195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.06171v2","created_at":"2026-07-05T07:56:53.720195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06171","created_at":"2026-07-05T07:56:53.720195+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VCBCDXKKTNL","created_at":"2026-07-05T07:56:53.720195+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VCBCDXKKTNLRTJA","created_at":"2026-07-05T07:56:53.720195+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VCBCDXK","created_at":"2026-07-05T07:56:53.720195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14769","citing_title":"CDP: Towards Robust Autoregressive Visuomotor Policy Learning via Causal Diffusion","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA","json":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA.json","graph_json":"https://pith.science/api/pith-number/2VCBCDXKKTNLRTJAM3IM6UIDKA/graph.json","events_json":"https://pith.science/api/pith-number/2VCBCDXKKTNLRTJAM3IM6UIDKA/events.json","paper":"https://pith.science/paper/2VCBCDXK"},"agent_actions":{"view_html":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA","download_json":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA.json","view_paper":"https://pith.science/paper/2VCBCDXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.06171&json=true","fetch_graph":"https://pith.science/api/pith-number/2VCBCDXKKTNLRTJAM3IM6UIDKA/graph.json","fetch_events":"https://pith.science/api/pith-number/2VCBCDXKKTNLRTJAM3IM6UIDKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA/action/storage_attestation","attest_author":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA/action/author_attestation","sign_citation":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA/action/citation_signature","submit_replication":"https://pith.science/pith/2VCBCDXKKTNLRTJAM3IM6UIDKA/action/replication_record"}},"created_at":"2026-07-05T07:56:53.720195+00:00","updated_at":"2026-07-05T07:56:53.720195+00:00"}