{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HVXLTLQ2Z2W3AOIXPGDI452MLM","short_pith_number":"pith:HVXLTLQ2","canonical_record":{"source":{"id":"1703.04706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-12T21:13:28Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"e9b6d2cadde72987aac530271577dc40d8d4840c5523de7abb31e9a939469ec5","abstract_canon_sha256":"fc4871b0ae506eb800df19574a325b3a6be6703943bd7fdfe33c04e5de056442"},"schema_version":"1.0"},"canonical_sha256":"3d6eb9ae1aceadb0391779868e774c5b01d0683dabfd7956d9be1970a1044a55","source":{"kind":"arxiv","id":"1703.04706","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04706","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04706v2","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04706","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"HVXLTLQ2Z2W3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HVXLTLQ2Z2W3AOIX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HVXLTLQ2","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HVXLTLQ2Z2W3AOIXPGDI452MLM","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-12T21:13:28Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"e9b6d2cadde72987aac530271577dc40d8d4840c5523de7abb31e9a939469ec5","abstract_canon_sha256":"fc4871b0ae506eb800df19574a325b3a6be6703943bd7fdfe33c04e5de056442"},"schema_version":"1.0"},"canonical_sha256":"3d6eb9ae1aceadb0391779868e774c5b01d0683dabfd7956d9be1970a1044a55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:37.821353Z","signature_b64":"vf2coCPIJS4j7fGtMTLerw1TyYeZ/TlBznUJCT5N58hW2BatXDmtQd+vY9Xzp0+ujb+EriCKKJHoa8Usaxs7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d6eb9ae1aceadb0391779868e774c5b01d0683dabfd7956d9be1970a1044a55","last_reissued_at":"2026-05-18T00:15:37.820796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:37.820796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04706","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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LXkj60bLerqSX+Mm7rC4mrI3bnhYp5cLpbuXDP4AO/0vm8xZFBuhYjFatuplWP8se/1FykGX8QnftBcOE1kAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:54.701785Z"},"content_sha256":"3285090951aa00618005cb228a044b5d47789a7e49acefcb14634584c20d55b6","schema_version":"1.0","event_id":"sha256:3285090951aa00618005cb228a044b5d47789a7e49acefcb14634584c20d55b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HVXLTLQ2Z2W3AOIXPGDI452MLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree Memory Networks for Modelling Long-term Temporal Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Aaron McFadyen, Clinton Fookes, Simon Denman, Sridha Sridharan, Tharindu Fernando","submitted_at":"2017-03-12T21:13:28Z","abstract_excerpt":"In the domain of sequence modelling, Recurrent Neural Networks (RNN) have been capable of achieving impressive results in a variety of application areas including visual question answering, part-of-speech tagging and machine translation. However this success in modelling short term dependencies has not successfully transitioned to application areas such as trajectory prediction, which require capturing both short term and long term relationships. In this paper, we propose a Tree Memory Network (TMN) for modelling long term and short term relationships in sequence-to-sequence mapping problems. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04706","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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1Fd6EzyWFRrHypZDWw8EklD6CuccXlru4LvO81z/SOrCBC6zdhN+wUQ/Ol6g+1x3toicgxtiNykwZQIZ027Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:54.702436Z"},"content_sha256":"af56a36e6a20885902e9a5c9f3cf44ce8cb1d1a254502f1ddd1300b1ce2a2069","schema_version":"1.0","event_id":"sha256:af56a36e6a20885902e9a5c9f3cf44ce8cb1d1a254502f1ddd1300b1ce2a2069"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVXLTLQ2Z2W3AOIXPGDI452MLM/bundle.json","state_url":"https://pith.science/pith/HVXLTLQ2Z2W3AOIXPGDI452MLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVXLTLQ2Z2W3AOIXPGDI452MLM/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-26T03:33:54Z","links":{"resolver":"https://pith.science/pith/HVXLTLQ2Z2W3AOIXPGDI452MLM","bundle":"https://pith.science/pith/HVXLTLQ2Z2W3AOIXPGDI452MLM/bundle.json","state":"https://pith.science/pith/HVXLTLQ2Z2W3AOIXPGDI452MLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVXLTLQ2Z2W3AOIXPGDI452MLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HVXLTLQ2Z2W3AOIXPGDI452MLM","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":"fc4871b0ae506eb800df19574a325b3a6be6703943bd7fdfe33c04e5de056442","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-12T21:13:28Z","title_canon_sha256":"e9b6d2cadde72987aac530271577dc40d8d4840c5523de7abb31e9a939469ec5"},"schema_version":"1.0","source":{"id":"1703.04706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04706","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04706v2","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04706","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"HVXLTLQ2Z2W3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HVXLTLQ2Z2W3AOIX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HVXLTLQ2","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:af56a36e6a20885902e9a5c9f3cf44ce8cb1d1a254502f1ddd1300b1ce2a2069","target":"graph","created_at":"2026-05-18T00:15:37Z","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 the domain of sequence modelling, Recurrent Neural Networks (RNN) have been capable of achieving impressive results in a variety of application areas including visual question answering, part-of-speech tagging and machine translation. However this success in modelling short term dependencies has not successfully transitioned to application areas such as trajectory prediction, which require capturing both short term and long term relationships. In this paper, we propose a Tree Memory Network (TMN) for modelling long term and short term relationships in sequence-to-sequence mapping problems. ","authors_text":"Aaron McFadyen, Clinton Fookes, Simon Denman, Sridha Sridharan, Tharindu Fernando","cross_cats":["cs.CV","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-12T21:13:28Z","title":"Tree Memory Networks for Modelling Long-term Temporal Dependencies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04706","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:3285090951aa00618005cb228a044b5d47789a7e49acefcb14634584c20d55b6","target":"record","created_at":"2026-05-18T00:15:37Z","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":"fc4871b0ae506eb800df19574a325b3a6be6703943bd7fdfe33c04e5de056442","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-12T21:13:28Z","title_canon_sha256":"e9b6d2cadde72987aac530271577dc40d8d4840c5523de7abb31e9a939469ec5"},"schema_version":"1.0","source":{"id":"1703.04706","kind":"arxiv","version":2}},"canonical_sha256":"3d6eb9ae1aceadb0391779868e774c5b01d0683dabfd7956d9be1970a1044a55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d6eb9ae1aceadb0391779868e774c5b01d0683dabfd7956d9be1970a1044a55","first_computed_at":"2026-05-18T00:15:37.820796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:37.820796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vf2coCPIJS4j7fGtMTLerw1TyYeZ/TlBznUJCT5N58hW2BatXDmtQd+vY9Xzp0+ujb+EriCKKJHoa8Usaxs7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:37.821353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3285090951aa00618005cb228a044b5d47789a7e49acefcb14634584c20d55b6","sha256:af56a36e6a20885902e9a5c9f3cf44ce8cb1d1a254502f1ddd1300b1ce2a2069"],"state_sha256":"a64a55a190b59eb0bab69753c8820092729ec937f5a2d04e5099801c6e3e1e9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6JNAwMdhpvMGLRDvQxlZVLKB5jVM70rwcrz0LZkqTQsGjz+DqpTZxOY1QErVsIshye1MxQT2FqdDj7jhFZ9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:33:54.705941Z","bundle_sha256":"9ffd1d4729b297be602118c8a5333016da5ab5b4b14301a6ed0b6a53820d910f"}}