Papers › Temporal Graph Benchmark for Machine Learning on Temporal Graphs

Temporal Graph Benchmark for Machine Learning on Temporal Graphs

3 Jul 2023NeurIPS 2023 11arXiv:2307.01026archive 2025-07-28

Shenyang Huang, Farimah Poursafaei, Jacob Danovitch, Matthias Fey, Weihua Hu, Emanuele Rossi, Jure Leskovec, Michael Bronstein, Guillaume Rabusseau, Reihaneh Rabbany

We present the Temporal Graph Benchmark (TGB), a collection of challenging and diverse benchmark datasets for realistic, reproducible, and robust evaluation of machine learning models on temporal graphs. TGB datasets are of large scale, spanning years in duration, incorporate both node and edge-level prediction tasks and cover a diverse set of domains including social, trade, transaction, and transportation networks. For both tasks, we design evaluation protocols based on realistic use-cases. We extensively benchmark each dataset and find that the performance of common models can vary drastically across datasets. In addition, on dynamic node property prediction tasks, we show that simple methods often achieve superior performance compared to existing temporal graph models. We believe that these findings open up opportunities for future research on temporal graphs. Finally, TGB provides an automated machine learning pipeline for reproducible and accessible temporal graph research, including data loading, experiment setup and performance evaluation. TGB will be maintained and updated on a regular basis and welcomes community feedback. TGB datasets, data loaders, example codes, evaluation setup, and leaderboards are publicly available at https://tgb.complexdatalab.com/.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2307.01026")

Code

Syntology Ran 5 of 7 code samples harvested from 3 repositories linked to this paper; 2 have no recorded run. Of those that ran: 1 ran · fixture could not drive it; 4 ran with no contract checked.

By repository: official repository: 2 samples from 1 repository, 1 ran; community (archive-listed): 5 samples from 2 repositories, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

shenyanghuang/tgb officialmentioned in papermentioned on GitHubpytorchMIT report
fpour/tgb_baselines officialmentioned in paperpytorch report
juliagast/tgb2 mentioned on GitHubpytorchMIT report
laixinn/tgb mentioned on GitHubpytorch report
timpostuvan/CTDG-link-anomaly-detection mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 5 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · fixture could not drive it
4ran
2unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

query_pred_edge_batch fpour/tgb_baselines/evaluation/tgb_evaluate_LPP.py official repository ran · fixture could not drive it MIT (permissive) · cd2a79c0b37aca42 · report
get_link_prediction_args fpour/tgb_baselines/utils/load_configs.py official repository unverified MIT (permissive) · b4d6c154d75cb68b · report
compute_src_dst_node_time_shifts timpostuvan/CTDG-link-anomaly-detection/models/MemoryModel.py community (archive-listed) ran MIT (permissive) · 727d90514a9a5475 · report
edge_bank_time_window_memory timpostuvan/CTDG-link-anomaly-detection/models/EdgeBank.py community (archive-listed) ran MIT (permissive) · 1de6e005e59cdf96 · report
edge_bank_unlimited_memory timpostuvan/CTDG-link-anomaly-detection/models/EdgeBank.py community (archive-listed) ran MIT (permissive) · 0f56e3ae8a152b2b · report
predict_link_probabilities timpostuvan/CTDG-link-anomaly-detection/models/EdgeBank.py community (archive-listed) ran MIT (permissive) · 8bcef3dc22f0489a · report
query_pred_edge_batch timpostuvan/tgb-link-anomaly-detection-baselines/evaluation/tgb_evaluate_linkanomdet.py community (archive-listed) unverified MIT (permissive) · 8a0919d4b2ca1705 · report

Tasks

Node Property PredictionProperty Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections