arXiv paper· machine learning (temporal graph learning)· benchmark

TTGBench: Benchmarking Topological Evolution and Semantic Drift in Text-attributed Temporal Graphs

Longfei Ma, Zemin Liu, Fei Wu

cs.AI

Quick verdict

First dual structural+semantic temporal-graph benchmark; broad 17-method study, credible divide, but baseline-tuning and label-proxy caveats remain.

Summary

The paper introduces TTGBench, a benchmark of six real-world, text-attributed temporal graph datasets (FOOD, IMDB, Librarything, Beeradvocate, Ratebeer, Amazon-Kindle) built from public review corpora, designed to jointly evaluate temporal link prediction (TLP) and temporal node classification (TNC). The datasets are selected for 'Dual Volatility': near-unit link novelty (0.99–1.0, unlike repetition-heavy benchmarks) and frequent node-label drift, with TNC supporting multi-class (beer style, product category) and multi-label (recipe categories, movie genres) settings — per the authors, the first such benchmark. Seventeen methods are compared: nine TGNNs plus EdgeBank, two LLM-as-Enhancer hybrids, and six LLM-Predictor variants (Qwen3-8B backbone) under ICL and SFT. Results (Tables 2–3; 40/10/50 chronological splits; AP/AUROC/MRR and Macro-F1/bACC) show memory-based TGNNs lead TLP (e.g., JODIE 92.62 AP on Ratebeer) while LLM-Predictors lead TNC (e.g., DST-v2 37.59 Macro-F1 on FOOD) — a 'capability divide' the authors attribute to TGNN semantic blindness, representation lock-in, and structural inertia, alongside prohibitive LLM costs (GraphGPT ≈600,000 seconds training). Limitations: no code/data release statement; no naive or text-only TNC baselines; unstable or under-tuned TGNN cells (TGN 45.40 AP on IMDB; ±11.63 std on Beeradvocate); and a label proxy that may cap TNC predictability.

Review complete

Assessment at a glance

machine learning (temporal graph learning)

5

risk flags identified

● high 0

● medium 3

● low 2

Reproducibility readinessmedium
Code & data availablenot stated
Review confidencehigh
AI text signal1/20 passages flagged
Deep research viable

5 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Six new text-rich temporal graph datasets exhibit Dual Volatility — link novelty 0.99–1.0 and frequent node-label drift — making repetition-based memorization useless (EdgeBank at chance).
  • TTGBench is, per the authors, the first benchmark supporting both multi-class and multi-label temporal node classification.
  • A capability divide exists: TGNN-Predictors excel at TLP but fail TNC, while LLM-Predictors show the reverse pattern.
  • TGNN failure at semantic tracking stems from three architectural bottlenecks: semantic blindness, representation lock-in, and structural inertia under fast drift.
  • LLM-Predictor training is deployment-prohibitive (GraphGPT ≈600,000 seconds and 13.5 teraFLOPs on Amazon-Kindle).

Strengths

  • Genuine benchmark gap filled

    Secs. 3–4 with Tables 1 and 4: six text-rich datasets with link novelty 0.99–1.0 (vs ≤0.673 across the 16 prior datasets tabulated in Table 4) and joint TLP plus multi-class/multi-label TNC, where DyGLib's TNC support is binary-only.

  • Challenge claim validated by a control experiment

    EdgeBank sits at chance (AP≈50, AUROC≈50) on all six datasets (Table 2), empirically demonstrating that repetition-driven memorization fails — the Dual Volatility thesis is shown, not merely asserted.

  • Unusually broad, multi-protocol evaluation

  • Diagnostics go beyond leaderboard numbers

  • Honest cost accounting

Weaknesses

  • No artifact release statement

  • TNC lacks calibration baselines

  • Baseline tuning concentrated on TLP

  • SFT baselines heavily simplified

  • Unremarked collapse under non-random negatives

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

TTGBench (arXiv 2609.08226, Zhejiang University) targets a real gap: temporal graph learning is evaluated mostly via temporal link prediction (TLP) on repetition-heavy datasets (DGB, DyGLib, TGB), while semantic evolution is reduced to binary TNC. The authors contribute six text-rich datasets (Table 1: FOOD 33,773 nodes/401,057 edges up to Amazon-Kindle 215,504 nodes/5.62M edges) with link novelty 0.99–1.0 (Table 4; prior datasets top out at 0.673) and frequent label drift (Fig. 2c: above 0.8 on FOOD/IMDB, ~0.3 on Amazon-Kindle), and claim the first benchmark with both multi-class and multi-label TNC. They benchmark 17 methods — nine TGNNs, two LLM-as-Enhancer hybrids (LKD4DyTAG, CROSS), six LLM-Predictors (TGTalker, DST-v1/v2, LLaGA-ND/HO, GraphGPT; Qwen3-8B) — and report a capability divide: memory-based TGNNs top TLP (JODIE 92.62 AP on Ratebeer) but collapse on TNC (mostly 6–16 Macro-F1), while LLM-Predictors reverse the pattern (DST-v2 37.59 Macro-F1 on FOOD) yet stay near chance on TLP.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 5 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What is TTGBench?

TTGBench is a benchmark of six text-rich temporal graph datasets (FOOD, IMDB, Librarything, Beeradvocate, Ratebeer, Amazon-Kindle) built from public review data, designed to evaluate both temporal link prediction (predicting future interactions) and temporal node classification (predicting users' evolving labels), including multi-class and multi-label variants that earlier benchmarks lacked.

What is the main finding of TTGBench?

A capability divide: TGNN-based models predict future links well but classify evolving node labels poorly, while LLM-based predictors do the opposite. Neither paradigm handles structural and semantic evolution simultaneously, and LLM training costs are orders of magnitude higher (GraphGPT needed roughly 600,000 seconds of training).

Is code or data available for TTGBench?

The reviewed version contains no code or dataset release statement. The datasets derive from public corpora (Food.com, IMDB, LibraryThing, BeerAdvocate, RateBeer, Amazon Reviews 2023), but the construction scripts and custom label taxonomies are not stated as released, so exact reproduction is currently not possible.

What does 'Dual Volatility' mean?

It combines structural volatility — nearly all edges are new (link novelty 0.99–1.0), so memorization methods like EdgeBank fail — with semantic volatility, where node labels change frequently over time (drift ratio above 0.8 on FOOD and IMDB), making the benchmark harder than repetition-heavy predecessors.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Plotted values in Figures 1–8 are not recoverable from the extracted text; figure-based statements in this review rely on the captions and surrounding prose only.
  • The metadata abstract supplied with the paper is cut mid-word ('provi…'), but the embedded full text contains the complete abstract and paper through page 24; nothing was treated as missing.

Go deeper on this paper

Reproduce ResultsNot feasible for this paper — the core results cannot be re-derived by sandboxed code simulation.

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
TTGBench: Benchmarking Topological Evolution and Semantic Drift in Text-attributed Temporal Graphs | Evolve.Pub