{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DE2BXGU3MA5PBTJ2OCY443MJ77","short_pith_number":"pith:DE2BXGU3","canonical_record":{"source":{"id":"1710.01813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-04T21:31:49Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"74d72d24ee629f553ddd4eb00bb094545d801e9c324398839c9ba796c7535fdf","abstract_canon_sha256":"b41e8a60a5fd3a0d0442ee0355115630c15adfb60a1b060161d84dadd415dae2"},"schema_version":"1.0"},"canonical_sha256":"19341b9a9b603af0cd3a70b1ce6d89ffd9299d109053ef232700b9a98c6c1e15","source":{"kind":"arxiv","id":"1710.01813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01813","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01813v2","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01813","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"DE2BXGU3MA5P","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DE2BXGU3MA5PBTJ2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DE2BXGU3","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DE2BXGU3MA5PBTJ2OCY443MJ77","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-04T21:31:49Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"74d72d24ee629f553ddd4eb00bb094545d801e9c324398839c9ba796c7535fdf","abstract_canon_sha256":"b41e8a60a5fd3a0d0442ee0355115630c15adfb60a1b060161d84dadd415dae2"},"schema_version":"1.0"},"canonical_sha256":"19341b9a9b603af0cd3a70b1ce6d89ffd9299d109053ef232700b9a98c6c1e15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:56.167107Z","signature_b64":"k0TTRzZSOfhDfNyEqmTJuVV+Ux+do2dMv8p4NCjvtOUij6A401wegfyJzYq/HSFIiM42rasx9YLFlby6/VblDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19341b9a9b603af0cd3a70b1ce6d89ffd9299d109053ef232700b9a98c6c1e15","last_reissued_at":"2026-05-18T00:20:56.166583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:56.166583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01813","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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBA2wWQ5zeVpILf/jVIisBtGL4PMD3M2dLgwwpADvqDenYiykebUTaGaUZZyhpSQMseW+ROXF8syXS7wPPEhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:22:12.390797Z"},"content_sha256":"c4876100c9438ef0f110ea6fe074825e560f5f87cd7ed3210a53206072c2806a","schema_version":"1.0","event_id":"sha256:c4876100c9438ef0f110ea6fe074825e560f5f87cd7ed3210a53206072c2806a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DE2BXGU3MA5PBTJ2OCY443MJ77","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Task Programming: Learning to Generalize Across Hierarchical Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.AI","authors_text":"Animesh Garg, Danfei Xu, Julian Gao, Li Fei-Fei, Silvio Savarese, Suraj Nair, Yuke Zhu","submitted_at":"2017-10-04T21:31:49Z","abstract_excerpt":"In this work, we propose a novel robot learning framework called Neural Task Programming (NTP), which bridges the idea of few-shot learning from demonstration and neural program induction. NTP takes as input a task specification (e.g., video demonstration of a task) and recursively decomposes it into finer sub-task specifications. These specifications are fed to a hierarchical neural program, where bottom-level programs are callable subroutines that interact with the environment. We validate our method in three robot manipulation tasks. NTP achieves strong generalization across sequential task"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01813","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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXnvUE33I6DE6VH8aYkfpjxo5j6FjZwPqRF6DY7pp8IGzxwhOLD/jWpThpAMWaeuN41lsfn4DzqFEOltfPjuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:22:12.391431Z"},"content_sha256":"029cacf62f7fbb4cc3f93e645231f0bf789b54cde18b26ca64ea3a0be6216086","schema_version":"1.0","event_id":"sha256:029cacf62f7fbb4cc3f93e645231f0bf789b54cde18b26ca64ea3a0be6216086"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DE2BXGU3MA5PBTJ2OCY443MJ77/bundle.json","state_url":"https://pith.science/pith/DE2BXGU3MA5PBTJ2OCY443MJ77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DE2BXGU3MA5PBTJ2OCY443MJ77/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-25T06:22:12Z","links":{"resolver":"https://pith.science/pith/DE2BXGU3MA5PBTJ2OCY443MJ77","bundle":"https://pith.science/pith/DE2BXGU3MA5PBTJ2OCY443MJ77/bundle.json","state":"https://pith.science/pith/DE2BXGU3MA5PBTJ2OCY443MJ77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DE2BXGU3MA5PBTJ2OCY443MJ77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DE2BXGU3MA5PBTJ2OCY443MJ77","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":"b41e8a60a5fd3a0d0442ee0355115630c15adfb60a1b060161d84dadd415dae2","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-04T21:31:49Z","title_canon_sha256":"74d72d24ee629f553ddd4eb00bb094545d801e9c324398839c9ba796c7535fdf"},"schema_version":"1.0","source":{"id":"1710.01813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01813","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01813v2","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01813","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"DE2BXGU3MA5P","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DE2BXGU3MA5PBTJ2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DE2BXGU3","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:029cacf62f7fbb4cc3f93e645231f0bf789b54cde18b26ca64ea3a0be6216086","target":"graph","created_at":"2026-05-18T00:20:56Z","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 work, we propose a novel robot learning framework called Neural Task Programming (NTP), which bridges the idea of few-shot learning from demonstration and neural program induction. NTP takes as input a task specification (e.g., video demonstration of a task) and recursively decomposes it into finer sub-task specifications. These specifications are fed to a hierarchical neural program, where bottom-level programs are callable subroutines that interact with the environment. We validate our method in three robot manipulation tasks. NTP achieves strong generalization across sequential task","authors_text":"Animesh Garg, Danfei Xu, Julian Gao, Li Fei-Fei, Silvio Savarese, Suraj Nair, Yuke Zhu","cross_cats":["cs.LG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-04T21:31:49Z","title":"Neural Task Programming: Learning to Generalize Across Hierarchical Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01813","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:c4876100c9438ef0f110ea6fe074825e560f5f87cd7ed3210a53206072c2806a","target":"record","created_at":"2026-05-18T00:20:56Z","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":"b41e8a60a5fd3a0d0442ee0355115630c15adfb60a1b060161d84dadd415dae2","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-04T21:31:49Z","title_canon_sha256":"74d72d24ee629f553ddd4eb00bb094545d801e9c324398839c9ba796c7535fdf"},"schema_version":"1.0","source":{"id":"1710.01813","kind":"arxiv","version":2}},"canonical_sha256":"19341b9a9b603af0cd3a70b1ce6d89ffd9299d109053ef232700b9a98c6c1e15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19341b9a9b603af0cd3a70b1ce6d89ffd9299d109053ef232700b9a98c6c1e15","first_computed_at":"2026-05-18T00:20:56.166583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:56.166583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k0TTRzZSOfhDfNyEqmTJuVV+Ux+do2dMv8p4NCjvtOUij6A401wegfyJzYq/HSFIiM42rasx9YLFlby6/VblDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:56.167107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4876100c9438ef0f110ea6fe074825e560f5f87cd7ed3210a53206072c2806a","sha256:029cacf62f7fbb4cc3f93e645231f0bf789b54cde18b26ca64ea3a0be6216086"],"state_sha256":"9fd4c90e5a291a907eaeab664618808f77393df4ce86016be66bcfe55add7c3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqMhfPrNsh7vJsccvFILQI5/CpX0Y8TkmMu3yzumPdEt/TYU3HEv7+i7zsm/dZqwZMtZv9eDYi3VjKOfUfo9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T06:22:12.394758Z","bundle_sha256":"5583d02f53901f184eafa7cc92c8d4d4b81cd81a9004f261e260c5893f07dca2"}}