{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FJ5UL4N33KK4AWUL6Y6FRWG2WE","short_pith_number":"pith:FJ5UL4N3","schema_version":"1.0","canonical_sha256":"2a7b45f1bbda95c05a8bf63c58d8dab10e951830b61436c87b6e1a4517453724","source":{"kind":"arxiv","id":"1703.07326","version":3},"attestation_state":"computed","paper":{"title":"One-Shot Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","cs.RO"],"primary_cat":"cs.AI","authors_text":"Bradly C. Stadie, Ilya Sutskever, Jonas Schneider, Jonathan Ho, Marcin Andrychowicz, Pieter Abbeel, Wojciech Zaremba, Yan Duan","submitted_at":"2017-03-21T17:22:29Z","abstract_excerpt":"Imitation learning has been commonly applied to solve different tasks in isolation. This usually requires either careful feature engineering, or a significant number of samples. This is far from what we desire: ideally, robots should be able to learn from very few demonstrations of any given task, and instantly generalize to new situations of the same task, without requiring task-specific engineering. In this paper, we propose a meta-learning framework for achieving such capability, which we call one-shot imitation learning.\n  Specifically, we consider the setting where there is a very large s"},"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":"1703.07326","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-21T17:22:29Z","cross_cats_sorted":["cs.LG","cs.NE","cs.RO"],"title_canon_sha256":"8d25935a0f80329d326982660863a3151a905fd6b34d1b31dcc6343b58b4e4ac","abstract_canon_sha256":"51a8136eea5287ab748f888675d6f03e4d423ba90d8acdbe37b7c487d30c777b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:56.197094Z","signature_b64":"AryDrdttsw+btDMKwjWKMx2S4Z4h26tRCa6KKIWx8qwryVdWtqHj9z7HnsUGgz6qVYnY2FLf2p2zcXcmu2tYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a7b45f1bbda95c05a8bf63c58d8dab10e951830b61436c87b6e1a4517453724","last_reissued_at":"2026-05-18T00:28:56.196552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:56.196552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-Shot Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","cs.RO"],"primary_cat":"cs.AI","authors_text":"Bradly C. Stadie, Ilya Sutskever, Jonas Schneider, Jonathan Ho, Marcin Andrychowicz, Pieter Abbeel, Wojciech Zaremba, Yan Duan","submitted_at":"2017-03-21T17:22:29Z","abstract_excerpt":"Imitation learning has been commonly applied to solve different tasks in isolation. This usually requires either careful feature engineering, or a significant number of samples. This is far from what we desire: ideally, robots should be able to learn from very few demonstrations of any given task, and instantly generalize to new situations of the same task, without requiring task-specific engineering. In this paper, we propose a meta-learning framework for achieving such capability, which we call one-shot imitation learning.\n  Specifically, we consider the setting where there is a very large s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07326","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.07326","created_at":"2026-05-18T00:28:56.196652+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07326v3","created_at":"2026-05-18T00:28:56.196652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07326","created_at":"2026-05-18T00:28:56.196652+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJ5UL4N33KK4","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJ5UL4N33KK4AWUL","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJ5UL4N3","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2401.02117","citing_title":"Mobile ALOHA: Learning Bimanual Mobile Manipulation with Low-Cost Whole-Body Teleoperation","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13428","citing_title":"SID: Sliding into Distribution for Robust Few-Demonstration Manipulation","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2109.13396","citing_title":"Bridge Data: Boosting Generalization of Robotic Skills with Cross-Domain Datasets","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2304.13705","citing_title":"Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"1710.10903","citing_title":"Graph Attention Networks","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE","json":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE.json","graph_json":"https://pith.science/api/pith-number/FJ5UL4N33KK4AWUL6Y6FRWG2WE/graph.json","events_json":"https://pith.science/api/pith-number/FJ5UL4N33KK4AWUL6Y6FRWG2WE/events.json","paper":"https://pith.science/paper/FJ5UL4N3"},"agent_actions":{"view_html":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE","download_json":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE.json","view_paper":"https://pith.science/paper/FJ5UL4N3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07326&json=true","fetch_graph":"https://pith.science/api/pith-number/FJ5UL4N33KK4AWUL6Y6FRWG2WE/graph.json","fetch_events":"https://pith.science/api/pith-number/FJ5UL4N33KK4AWUL6Y6FRWG2WE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE/action/storage_attestation","attest_author":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE/action/author_attestation","sign_citation":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE/action/citation_signature","submit_replication":"https://pith.science/pith/FJ5UL4N33KK4AWUL6Y6FRWG2WE/action/replication_record"}},"created_at":"2026-05-18T00:28:56.196652+00:00","updated_at":"2026-05-18T00:28:56.196652+00:00"}