{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HI7KKANNFIUAF6RPXSVXFQF63W","short_pith_number":"pith:HI7KKANN","canonical_record":{"source":{"id":"1807.03480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T04:55:45Z","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"title_canon_sha256":"09149c86782ceb46b9b3171fdf1e6900f0ec09d7ceab79bc78dd389ccd57e111","abstract_canon_sha256":"3e152c5eb3aad59d1e9a4d86bc1dad01601889b36790e3d057c8543c33ff7240"},"schema_version":"1.0"},"canonical_sha256":"3a3ea501ad2a2802fa2fbcab72c0bedd9e422069fdac2a2695fd1644e3b070d3","source":{"kind":"arxiv","id":"1807.03480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03480","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03480v2","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03480","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"HI7KKANNFIUA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HI7KKANNFIUAF6RP","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HI7KKANN","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HI7KKANNFIUAF6RPXSVXFQF63W","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T04:55:45Z","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"title_canon_sha256":"09149c86782ceb46b9b3171fdf1e6900f0ec09d7ceab79bc78dd389ccd57e111","abstract_canon_sha256":"3e152c5eb3aad59d1e9a4d86bc1dad01601889b36790e3d057c8543c33ff7240"},"schema_version":"1.0"},"canonical_sha256":"3a3ea501ad2a2802fa2fbcab72c0bedd9e422069fdac2a2695fd1644e3b070d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:54.433407Z","signature_b64":"KDENXyw04h/GVGqPqXBdaBZ1h73wHTBr/QCt59Noo6s0YXwPl/fhvE3N+jtXmm4VV3yDDwNuUzkoD5A4L/mDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3ea501ad2a2802fa2fbcab72c0bedd9e422069fdac2a2695fd1644e3b070d3","last_reissued_at":"2026-05-17T23:51:54.432781Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:54.432781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03480","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-17T23:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhFIstaW5oO1EJgrAXxACZ1F8apn1qNzuxvYPK5WNWeiVA+t7Lb0LtaZRINVg2GNlxppJa3aZCwR/Hq5S4+/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:24:54.381284Z"},"content_sha256":"622d1e8c47d5727010c5dbb5fd31123eacff7beb7de39ce9f1b9e320b16f2458","schema_version":"1.0","event_id":"sha256:622d1e8c47d5727010c5dbb5fd31123eacff7beb7de39ce9f1b9e320b16f2458"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HI7KKANNFIUAF6RPXSVXFQF63W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Task Graphs: Generalizing to Unseen Tasks from a Single Video Demonstration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.RO"],"primary_cat":"cs.CV","authors_text":"Animesh Garg, Danfei Xu, De-An Huang, Juan Carlos Niebles, Li Fei-Fei, Silvio Savarese, Suraj Nair, Yuke Zhu","submitted_at":"2018-07-10T04:55:45Z","abstract_excerpt":"Our goal is to generate a policy to complete an unseen task given just a single video demonstration of the task in a given domain. We hypothesize that to successfully generalize to unseen complex tasks from a single video demonstration, it is necessary to explicitly incorporate the compositional structure of the tasks into the model. To this end, we propose Neural Task Graph (NTG) Networks, which use conjugate task graph as the intermediate representation to modularize both the video demonstration and the derived policy. We empirically show NTG achieves inter-task generalization on two complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03480","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-17T23:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gi16HvFjhW0JYN6tjVNZzJzq/No2APQiWWHksI/xvFYzMzkjpRMLLVGKfjU0Gc98e0U/1OZOLes3NPxqOCZUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:24:54.381664Z"},"content_sha256":"d098574235a05ee55d0ae8b0410e454c92bd094d22e76262d1a051fb36c38622","schema_version":"1.0","event_id":"sha256:d098574235a05ee55d0ae8b0410e454c92bd094d22e76262d1a051fb36c38622"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HI7KKANNFIUAF6RPXSVXFQF63W/bundle.json","state_url":"https://pith.science/pith/HI7KKANNFIUAF6RPXSVXFQF63W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HI7KKANNFIUAF6RPXSVXFQF63W/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-06-08T21:24:54Z","links":{"resolver":"https://pith.science/pith/HI7KKANNFIUAF6RPXSVXFQF63W","bundle":"https://pith.science/pith/HI7KKANNFIUAF6RPXSVXFQF63W/bundle.json","state":"https://pith.science/pith/HI7KKANNFIUAF6RPXSVXFQF63W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HI7KKANNFIUAF6RPXSVXFQF63W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HI7KKANNFIUAF6RPXSVXFQF63W","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":"3e152c5eb3aad59d1e9a4d86bc1dad01601889b36790e3d057c8543c33ff7240","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T04:55:45Z","title_canon_sha256":"09149c86782ceb46b9b3171fdf1e6900f0ec09d7ceab79bc78dd389ccd57e111"},"schema_version":"1.0","source":{"id":"1807.03480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03480","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03480v2","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03480","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"HI7KKANNFIUA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HI7KKANNFIUAF6RP","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HI7KKANN","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:d098574235a05ee55d0ae8b0410e454c92bd094d22e76262d1a051fb36c38622","target":"graph","created_at":"2026-05-17T23:51:54Z","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":"Our goal is to generate a policy to complete an unseen task given just a single video demonstration of the task in a given domain. We hypothesize that to successfully generalize to unseen complex tasks from a single video demonstration, it is necessary to explicitly incorporate the compositional structure of the tasks into the model. To this end, we propose Neural Task Graph (NTG) Networks, which use conjugate task graph as the intermediate representation to modularize both the video demonstration and the derived policy. We empirically show NTG achieves inter-task generalization on two complex","authors_text":"Animesh Garg, Danfei Xu, De-An Huang, Juan Carlos Niebles, Li Fei-Fei, Silvio Savarese, Suraj Nair, Yuke Zhu","cross_cats":["cs.AI","cs.LG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T04:55:45Z","title":"Neural Task Graphs: Generalizing to Unseen Tasks from a Single Video Demonstration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03480","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:622d1e8c47d5727010c5dbb5fd31123eacff7beb7de39ce9f1b9e320b16f2458","target":"record","created_at":"2026-05-17T23:51:54Z","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":"3e152c5eb3aad59d1e9a4d86bc1dad01601889b36790e3d057c8543c33ff7240","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T04:55:45Z","title_canon_sha256":"09149c86782ceb46b9b3171fdf1e6900f0ec09d7ceab79bc78dd389ccd57e111"},"schema_version":"1.0","source":{"id":"1807.03480","kind":"arxiv","version":2}},"canonical_sha256":"3a3ea501ad2a2802fa2fbcab72c0bedd9e422069fdac2a2695fd1644e3b070d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a3ea501ad2a2802fa2fbcab72c0bedd9e422069fdac2a2695fd1644e3b070d3","first_computed_at":"2026-05-17T23:51:54.432781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:54.432781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KDENXyw04h/GVGqPqXBdaBZ1h73wHTBr/QCt59Noo6s0YXwPl/fhvE3N+jtXmm4VV3yDDwNuUzkoD5A4L/mDAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:54.433407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:622d1e8c47d5727010c5dbb5fd31123eacff7beb7de39ce9f1b9e320b16f2458","sha256:d098574235a05ee55d0ae8b0410e454c92bd094d22e76262d1a051fb36c38622"],"state_sha256":"b5d7285eae99b35911db80acde89b3024ad601658da75b97aea4542275bbdbbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXz6uREjs0ANOkv296Och6hX6AYihBzdWxUn33veMqQT+X4HFArOumxK6THjDWSjxR3H+1lTS9zWABToR7MUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:24:54.384030Z","bundle_sha256":"15887faa1619b8584092762e27042c7129478283b7a774a10a5f40c8fbb33f9a"}}