{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/tgn","slug":"tgn","name":"TGN","full_name":"Temporal Graph Network","full_name_withheld":false,"description_markdown":"**Temporal Graph Network**, or **TGN**, is a framework for deep learning on dynamic graphs represented as sequences of timed events. The memory (state) of the model at time $t$ consists of a vector $\\mathbf{s}_i(t)$ for each node $i$ the model has seen so far. The memory of a node is updated after an event (e.g. interaction with another node or node-wise change), and its purpose is to represent the node's history in a compressed format. Thanks to this specific module, TGNs have the capability to memorize long term dependencies for each node in the graph. When a new node is encountered, its memory is initialized as the zero vector, and it is then updated for each event involving the node, even after the model has finished training.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","paper":"/paper/temporal-graph-networks-for-deep-learning-on","first_author":"Emanuele Rossi","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/temporal-graph-networks-for-deep-learning-on"},"source":{"url":"https://arxiv.org/abs/2006.10637v3","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":16,"archive_num_papers":16,"papers_newest_first":[{"paper":null,"slug":"a-batch-insensitive-dynamic-gnn-approach-to","title":"A Batch-Insensitive Dynamic GNN Approach to Address Temporal Discontinuity in Graph Streams","date":"2025-06-24","arxiv_id":"2506.19282","n_code_links":0,"syntology":null},{"paper":"/paper/trajectory-encoding-temporal-graph-networks","slug":"trajectory-encoding-temporal-graph-networks","title":"Trajectory Encoding Temporal Graph Networks","date":"2025-04-15","arxiv_id":"2504.11386","n_code_links":1,"syntology":null},{"paper":"/paper/enhancing-the-expressivity-of-temporal-graph","slug":"enhancing-the-expressivity-of-temporal-graph","title":"Enhancing the Expressivity of Temporal Graph Networks through Source-Target Identification","date":"2024-11-06","arxiv_id":"2411.03596","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["batjandra/TGNv2-NeurReps"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/retrofitting-temporal-graph-neural-networks","slug":"retrofitting-temporal-graph-neural-networks","title":"Retrofitting Temporal Graph Neural Networks with Transformer","date":"2024-09-09","arxiv_id":"2409.05477","n_code_links":1,"syntology":null},{"paper":null,"slug":"utg-towards-a-unified-view-of-snapshot-and","title":"UTG: Towards a Unified View of Snapshot and Event Based Models for Temporal Graphs","date":"2024-07-17","arxiv_id":"2407.12269","n_code_links":0,"syntology":null},{"paper":"/paper/temporal-graph-rewiring-with-expander-graphs","slug":"temporal-graph-rewiring-with-expander-graphs","title":"Temporal Graph Rewiring with Expander Graphs","date":"2024-06-04","arxiv_id":"2406.02362","n_code_links":1,"syntology":null},{"paper":null,"slug":"temporal-graph-networks-for-graph-anomaly","title":"Temporal Graph Networks for Graph Anomaly Detection in Financial Networks","date":"2024-03-27","arxiv_id":"2404.00060","n_code_links":0,"syntology":null},{"paper":"/paper/a-temporal-graph-network-framework-for","slug":"a-temporal-graph-network-framework-for","title":"A Temporal Graph Network Framework for Dynamic Recommendation","date":"2024-03-24","arxiv_id":"2403.16066","n_code_links":1,"syntology":null},{"paper":null,"slug":"hot-higher-order-dynamic-graph-representation","title":"HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers","date":"2023-11-30","arxiv_id":"2311.18526","n_code_links":0,"syntology":null},{"paper":"/paper/towards-temporal-edge-regression-a-case-study","slug":"towards-temporal-edge-regression-a-case-study","title":"Towards Temporal Edge Regression: A Case Study on Agriculture Trade Between Nations","date":"2023-08-15","arxiv_id":"2308.07883","n_code_links":1,"syntology":null},{"paper":null,"slug":"analysis-of-different-temporal-graph-neural","title":"Analysis of different temporal graph neural network configurations on dynamic graphs","date":"2023-05-02","arxiv_id":"2305.01128","n_code_links":0,"syntology":null},{"paper":"/paper/dyg2vec-representation-learning-for-dynamic","slug":"dyg2vec-representation-learning-for-dynamic","title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","date":"2022-10-30","arxiv_id":"2210.16906","n_code_links":2,"syntology":null},{"paper":"/paper/rethinking-the-memory-staleness-problem-in","slug":"rethinking-the-memory-staleness-problem-in","title":"Rethinking The Memory Staleness Problem In Dynamics GNN","date":"2022-09-06","arxiv_id":"2209.02462","n_code_links":1,"syntology":null},{"paper":null,"slug":"adaptive-data-augmentation-on-temporal-graphs","title":"Adaptive Data Augmentation on Temporal Graphs","date":"2021-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-scale-temporal-graph-networks-for","title":"Multi Scale Temporal Graph Networks For Skeleton-based Action Recognition","date":"2020-12-05","arxiv_id":"2012.02970","n_code_links":0,"syntology":null},{"paper":"/paper/temporal-graph-networks-for-deep-learning-on","slug":"temporal-graph-networks-for-deep-learning-on","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","date":"2020-06-18","arxiv_id":"2006.10637","n_code_links":10,"syntology":{"ran":11,"of":19,"n_ran_checked":7,"n_instrument":4,"unverified":8,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","official":null}}],"papers_shown":16,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":16,"with_a_code_link":9,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/tgn/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/tgn/papers/ran/1","json":"/method/tgn/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/link-prediction","name":"Link Prediction","papers":6},{"task":"/task/node-classification","name":"Node Classification","papers":4},{"task":"/task/dynamic-link-prediction","name":"Dynamic Link Prediction","papers":2},{"task":"/task/dynamic-node-classification","name":"Dynamic Node Classification","papers":2},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":2},{"task":"/task/prediction","name":"Prediction","papers":2},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/action-recognition-in-videos","name":"Action Recognition","papers":1},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/fraud-detection","name":"Fraud Detection","papers":1},{"task":"/task/graph-anomaly-detection","name":"Graph Anomaly Detection","papers":1},{"task":"/task/graph-attention","name":"Graph Attention","papers":1},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":1},{"task":"/task/graph-learning","name":"Graph Learning","papers":1},{"task":"/task/graph-regression","name":"Graph Regression","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1},{"task":"/task/graph-sampling","name":"Graph Sampling","papers":1}],"tasks_shown":20,"n_tasks":27,"usage_by_year":[{"year":"2020","papers":2},{"year":"2021","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":3},{"year":"2024","papers":6},{"year":"2025","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/tgn"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=TGN","read_at":"2026-10-05T01:03:04+00:00","query":"TGN","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"Temporal Graph Networks (TGN)","origin_arxiv_id":"2510.21994"},"resolution":"alias","resolved_name_differs":true,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2006.10637","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2510.21994","citations":0},"leading_other_bearer":{"arxiv_id":"2605.20254","title":"Efficient Table QA via TableGrid Navigation and Progressive Inference Prompting Amritansh Maurya 1[0009-0001-8605-6990] , Navjot Singh 1[0000-0003-0409-8482] , Mohammed Javed 2[0000-0002-3019-7401] , and Omar Moured 3[0000-0003-4227-8417]","citations":0,"named_by":["acronym_expansion"],"bearer_name":"Table-Grid Navigation (TGN)","ask_with":"have('2605.20254')"},"n_other_bearers_listed":1,"note":"1 other thing(s) here are also called 'TGN', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2510.21994","page":null,"syntology_url":"https://syntology.ai/paper/2510.21994","in_graph_layer":false,"samples":0},"line":"code not checked for this name. The lookup matched a different name in Syntology's graph, 'Temporal Graph Networks (TGN)' (resolution: alias), and its answer is about that name only, so it does not say whether this method has code. About another paper: this answer is about arXiv:2510.21994, while the archive credits arXiv:2006.10637.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3c8bbb3f61c0cb428a7a78398665886439a231215fc69ea24f50c6f3ffd194b8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}