- Rating
- 4
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper addresses temporal graph learning. It proposes WorldGraph, a method inspired by world models that model temporal graph learning as heterogeneous graph-transition prediction: the goal is to predict the evolution of the temporal graph as a whole, including node-, edge-, and graph-level transitions. The approach has two main parts: a state model and a transition model. The state model uses a graph transformer backbone that encodes graph topology and prior evolution into a latent world state. Conditioned on that latent state, the transition model predicts the next graph transition via reinforcement learning.
Critical strengths
-
WorldGraph’s effectiveness is supported by both theoretical analysis and experiments on eight datasets. The empirical results demonstrate clear gains over baselines on node-, edge-, and graph-level tasks.
-
The paper proposes a novel world-model paradigm for temporal graph learning.
-
Whereas most existing temporal graph methods target a single task type (link prediction only, node classification only, or graph-level prediction only), WorldGraph addresses all three and outperforms the baselines on each.
Critical weaknesses
-
Several design choices, such as the node importance score and the pooling function, appear cherry-picked without sufficient justification. See the questions below.
-
The main text and the appendix feel disconnected. For example, Section 4.2 (experimental setup) does not describe task formulation; readers must use the table of contents and infer which appendix section has that detail. Explicit pointers from the main text to the relevant appendix sections would help connect the two.
Questions for authors
-
Could the authors report the frequency distribution of predicted transitions? Is there a dominant transition among all available transition types?
-
At timestamp , can WorldGraph predict interactions involving new nodes (nodes that have not appeared before ), links among new nodes and links between new and existing nodes?
-
In Stage 1 (multi-granularity graph encoder), how effective are hop-based message passing and random-walk sampling for structural representations that support different graph transitions? Could the authors add an ablation on each component’s contribution to performance across transition types?
-
In Stage 1, WorldGraph uses mean pooling for multi-granularity attention fusion. Could the authors justify this choice versus median, sum, or attention pooling?
-
Lines 250–253: group assignment at time is biased toward rare historical transitions. How much does this affect performance on high-frequency transitions? In settings where ground truth is dominated by frequent transition types, is overall performance harmed by this bias?
-
Will be fixed or adaptive? How would adapt when the number of transitions per timestamp grows or shrinks over time (common in real networks, e.g., more activity as a network becomes more popular)? A fixed might lead to over- or under-prediction of transitions.
-
In structure-aware reward design, node importance uses node degree. Could the authors justify this choice? Degree does not always reflect importance; other measures (e.g., centrality) might also be relevant.
-
Could the authors report transition-type frequencies for each evaluation dataset? Do these datasets share similar dominant transitions by frequency?
4 comments
Response to Question 1 and Question 8 (Transition-Type Frequency Distributions Across Datasets):
Response to Question 1 and Question 8 (Transition-Type Frequency Distributions Across Datasets):
Thank you for your advice. We reported the ground-truth transition-type frequencies alongside predictions from WorldGraph and the top three baselines in the papers (GraphGPS, TGN, and TIDFormer) for each evaluation dataset.
Node-Level Tasks / TGBN-Trade
| Method | Add Node | Remove Node | Modify Property |
|---|---|---|---|
| Ground Truth | 0.1436 | 0.0585 | 0.7979 |
| GraphGPS | 0.1330 | 0.0125 | 0.8545 |
| TGN | 0.0861 | 0.0107 | 0.9032 |
| TIDFormer | 0.0953 | 0.0558 | 0.8489 |
| WorldGraph | 0.1287 | 0.0567 | 0.8145 |
Node-Level Tasks / TGBN-Genre
| Method | Add Node | Remove Node | Modify Property |
|---|---|---|---|
| Ground Truth | 0.3634 | 0.3684 | 0.2683 |
| GraphGPS | 0.2457 | 0.3676 | 0.3866 |
| TGN | 0.2385 | 0.3781 | 0.3834 |
| TIDFormer | 0.2415 | 0.3604 | 0.3982 |
| WorldGraph | 0.2513 | 0.3930 | 0.3557 |
Node-Level Tasks / TGBN-Reddit
| Method | Add Node | Remove Node | Modify Property |
|---|---|---|---|
| Ground Truth | 0.3439 | 0.3472 | 0.3089 |
| GraphGPS | 0.3097 | 0.2893 | 0.4010 |
| TGN | 0.3104 | 0.2919 | 0.3977 |
| TIDFormer | 0.3080 | 0.2838 | 0.4082 |
| WorldGraph | 0.3117 | 0.2940 | 0.3942 |
Edge-Level Tasks / TGBN-Trade
| Method | Add Edge | Remove Edge |
|---|---|---|
| Ground Truth | 0.5207 | 0.4793 |
| GraphGPS | 0.4991 | 0.5009 |
| TGN | 0.5153 | 0.4847 |
| TIDFormer | 0.5514 | 0.4486 |
| WorldGraph | 0.5168 | 0.4832 |
Edge-Level Tasks / UN Vote
| Method | Add Edge | Remove Edge |
|---|---|---|
| Ground Truth | 0.5253 | 0.4747 |
| GraphGPS | 0.4336 | 0.5664 |
| TGN | 0.3990 | 0.6010 |
| TIDFormer | 0.6310 | 0.3690 |
| WorldGraph | 0.5457 | 0.4543 |
Edge-Level Tasks / Contact
| Method | Add Edge | Remove Edge |
|---|---|---|
| Ground Truth | 0.4610 | 0.5390 |
| GraphGPS | 0.7457 | 0.2543 |
| TGN | 0.5096 | 0.4904 |
| TIDFormer | 0.5063 | 0.4937 |
| WorldGraph | 0.4410 | 0.5590 |
Edge-Level Tasks / SocialEvo
| Method | Add Edge | Remove Edge |
|---|---|---|
| Ground Truth | 0.4821 | 0.5179 |
| GraphGPS | 0.6723 | 0.3277 |
| TGN | 0.6126 | 0.3874 |
| TIDFormer | 0.6084 | 0.3916 |
| WorldGraph | 0.5041 | 0.4959 |
Graph-Level Tasks / Flights
| Method | Add Node | Remove Node | Add Edge | Remove Edge |
|---|---|---|---|---|
| Ground Truth | 0.0878 | 0.0881 | 0.4122 | 0.4119 |
| GraphGPS | 0.0947 | 0.1631 | 0.3338 | 0.4084 |
| TGN | 0.1311 | 0.1254 | 0.3655 | 0.3780 |
| TIDFormer | 0.0853 | 0.0934 | 0.3602 | 0.4611 |
| WorldGraph | 0.0783 | 0.1131 | 0.3568 | 0.4518 |
Graph-Level Tasks / Contact
| Method | Add Node | Remove Node | Add Edge | Remove Edge |
|---|---|---|---|---|
| Ground Truth | 0.0401 | 0.0474 | 0.3978 | 0.5147 |
| GraphGPS | 0.0734 | 0.0711 | 0.3706 | 0.4849 |
| TGN | 0.0397 | 0.0227 | 0.4033 | 0.5343 |
| TIDFormer | 0.0383 | 0.0640 | 0.3290 | 0.5687 |
| WorldGraph | 0.0372 | 0.0488 | 0.3460 | 0.5680 |
Graph-Level Tasks / Enron
| Method | Add Node | Remove Node | Add Edge | Remove Edge |
|---|---|---|---|---|
| Ground Truth | 0.1335 | 0.1939 | 0.3482 | 0.3244 |
| GraphGPS | 0.1287 | 0.0166 | 0.5698 | 0.2850 |
| TGN | 0.1436 | 0.0167 | 0.5760 | 0.2637 |
| TIDFormer | 0.1631 | 0.0119 | 0.6289 | 0.1961 |
| WorldGraph | 0.1358 | 0.0571 | 0.4857 | 0.3214 |
The ground-truth distributions vary across datasets.
In Node-Level Tasks / TGBN-Trade, Modify Property events clearly dominate, accounting for approximately 79.79% of transitions.
In Graph-Level Tasks / Flights and Graph-Level Tasks / Contact, Add Edge and Remove Edge events jointly account for approximately 82.41% and 91.25%, respectively.
The remaining datasets exhibit comparatively more balanced distributions across their available transition types.
To quantify the agreement between predicted and ground-truth distributions, the following table reports KL(Ground Truth∥Prediction) as mean ± sample standard deviation across runs. Lower values indicate closer alignment with the ground-truth distribution of transition types.
| Method | Node-Level Tasks / TGBN-Trade | Node-Level Tasks / TGBN-Genre | Node-Level Tasks / TGBN-Reddit | Edge-Level Tasks / TGBN-Trade | Edge-Level Tasks / UN Vote | Edge-Level Tasks / Contact | Edge-Level Tasks / SocialEvo | Graph-Level Tasks / Flights | Graph-Level Tasks / Contact | Graph-Level Tasks / Enron |
|---|---|---|---|---|---|---|---|---|---|---|
| GraphGPS | 0.0504 ± 0.0068 | 0.0449 ± 0.0014 | 0.0188 ± 0.0004 | 0.0010 ± 0.0008 | 0.0171 ± 0.0050 | 0.2767 ± 0.3248 | 0.0878 ± 0.0758 | 0.0298 ± 0.0085 | 0.0257 ± 0.0138 | 0.3576 ± 0.0587 |
| TGN | 0.0988 ± 0.0075 | 0.0476 ± 0.0006 | 0.0174 ± 0.0016 | 0.0012 ± 0.0007 | 0.0336 ± 0.0164 | 0.0228 ± 0.0263 | 0.0352 ± 0.0090 | 0.0189 ± 0.0045 | 0.0208 ± 0.0029 | 0.3639 ± 0.0090 |
| TIDFormer | 0.0181 ± 0.0040 | 0.0511 ± 0.0012 | 0.0222 ± 0.0084 | 0.0020 ± 0.0011 | 0.0249 ± 0.0169 | 0.0047 ± 0.0044 | 0.0326 ± 0.0003 | 0.0214 ± 0.0030 | 0.0161 ± 0.0015 | 0.5253 ± 0.2548 |
| WorldGraph | 0.0013 ± 0.0002 | 0.0346 ± 0.0001 | 0.0161 ± 0.0010 | 0.0001 ± 0.0001 | 0.0011 ± 0.0012 | 0.0011 ± 0.0015 | 0.0011 ± 0.0009 | 0.0105 ± 0.0048 | 0.0066 ± 0.0022 | 0.1297 ± 0.0506 |
We have added these experiments in Appendix H.13 (lines 2340-2477) of the revised manuscript.
Response to Question 2 (Interaction Prediction for Previously Unseen Nodes) and Question 3 (Component Ablations of the Multi-Granularity Graph Encoder)
Response to Question 2 (Interaction Prediction for Previously Unseen Nodes):
Thank you for your insightful advice. Since relatively few nodes first appear in the test split of the original dataset, we conducted an additional experiment using a node-holdout protocol to simulate previously unseen nodes. Specifically, we mask the historical information of a subset of nodes and their incident edges. Under this protocol, we compare WorldGraph with the strongest baseline, TGN, and report prediction performance separately for new–new and new–existing links.
Edge-Level Tasks / UN Vote
| Method | New–New F1 ↑ | New–Existing F1 ↑ | Combined F1 ↑ |
|---|---|---|---|
| TGN | 0.0888 ± 0.0196 | 0.0919 ± 0.0083 | 0.0920 ± 0.0075 |
| WorldGraph | 0.1033 ± 0.0002 | 0.1445 ± 0.0018 | 0.1421 ± 0.0017 |
These results suggest that WorldGraph can effectively predict interactions involving previously unseen nodes, including both new–new and new–existing links.
We have added these experiments in Appendix H.14 (lines 2478-2494) of the revised manuscript.
Response to Question 3 (Component Ablations of the Multi-Granularity Graph Encoder):
Thank you. We have conducted separate ablations of hop-based message passing and random-walk sampling on three datasets covering node-, edge-, and graph-level tasks. As shown below, removing either component results in lower mean performance across all reported metrics, suggesting that both components contribute useful structural information for modeling different graph transitions.
Node-Level Tasks / TGBN-Trade
| Method | Add. F1 ↑ | Rem. F1 ↑ | Sem. F1 ↑ | NDCG@10 ↑ |
|---|---|---|---|---|
| w/o Hop-based Message Passing | 0.8520 ± 0.0499 | 0.5727 ± 0.0686 | 0.7271 ± 0.0075 | 0.6416 ± 0.0050 |
| w/o Random-walk Sampling | 0.8648 ± 0.0132 | 0.5847 ± 0.0343 | 0.7346 ± 0.0045 | 0.6420 ± 0.0045 |
| WorldGraph | 0.9696 ± 0.0105 | 0.6606 ± 0.0136 | 0.7354 ± 0.0075 | 0.6469 ± 0.0023 |
Edge-Level Tasks / UN Vote
| Method | Add. F1 ↑ | Rem. F1 ↑ | Macro-F1 ↑ |
|---|---|---|---|
| w/o Hop-based Message Passing | 0.3924 ± 0.0146 | 0.5071 ± 0.0437 | 0.4497 ± 0.0236 |
| w/o Random-walk Sampling | 0.3905 ± 0.0191 | 0.4982 ± 0.0766 | 0.4444 ± 0.0335 |
| WorldGraph | 0.4165 ± 0.0095 | 0.5996 ± 0.0219 | 0.5080 ± 0.0071 |
Graph-Level Tasks / Contact
| Method | MAE ↓ | RMSE ↓ | Macro-F1 ↑ |
|---|---|---|---|
| w/o Hop-based Message Passing | 0.5620 ± 0.0066 | 0.8907 ± 0.0040 | 0.5289 ± 0.0073 |
| w/o Random-walk Sampling | 0.5584 ± 0.0115 | 0.8879 ± 0.0094 | 0.5364 ± 0.0063 |
| WorldGraph | 0.5540 ± 0.0029 | 0.8865 ± 0.0042 | 0.5547 ± 0.0090 |
We have added these experiments in Appendix H.15 (lines 2496-2526) of the revised manuscript.
Response to Question 5 (Impact of Rare-Transition Prioritization on Frequent Transitions) and Question 6 (Fixed versus Adaptive Rollout Budgets)
Response to Question 5 (Impact of Rare-Transition Prioritization on Frequent Transitions):
Thank you. We separately evaluated high- and low-frequency transition types on three datasets with imbalanced transition distributions, comparing WorldGraph with its variant without Transition-Aware Dynamic Group Sampling and TGN.
Node-Level Tasks / TGBN-Trade
According to the distribution in Q1: high-frequency type: Modify property (semantic change); low-frequency types: Add node and Remove node.
| Method | High-frequency F1 ↑ | Low-frequency F1 ↑ |
|---|---|---|
| TGN | 0.6666 ± 0.0085 | 0.4525 ± 0.0337 |
| WorldGraph w/o Transition-Aware Dynamic Group Sampling | 0.7063 ± 0.0103 | 0.7061 ± 0.0239 |
| WorldGraph | 0.7117 ± 0.0152 | 0.7838 ± 0.0130 |
Graph-Level Tasks / Flights
According to the distribution as shown in the response to Q1: high-frequency types: Add edge and Remove edge; low-frequency types: Add node and Remove node.
| Method | High-frequency F1 ↑ | Low-frequency F1 ↑ |
|---|---|---|
| TGN | 0.2966 ± 0.0002 | 0.5195 ± 0.0037 |
| WorldGraph w/o Transition-Aware Dynamic Group Sampling | 0.3643 ± 0.0202 | 0.5246 ± 0.0152 |
| WorldGraph | 0.3713 ± 0.0305 | 0.5425 ± 0.0144 |
Graph-Level Tasks / Contact
According to the distribution in Q1: high-frequency types: Add edge and Remove edge; low-frequency types: Add node and Remove node.
| Method | High-frequency F1 ↑ | Low-frequency F1 ↑ |
|---|---|---|
| TGN | 0.2690 ± 0.0145 | 0.4967 ± 0.0199 |
| WorldGraph w/o Transition-Aware Dynamic Group Sampling | 0.3120 ± 0.0372 | 0.5270 ± 0.0234 |
| WorldGraph | 0.3192 ± 0.0116 | 0.5729 ± 0.0032 |
As shown in the results, prioritizing rare transitions does not compromise predictive performance on high-frequency types, while substantially improving performance on low-frequency types. Furthermore, WorldGraph consistently outperforms the strongest baseline (TGN) across both high- and low-frequency categories, regardless of whether Transition-Aware Dynamic Group Sampling is enabled.
We have added these experiments in Appendix H.16 (lines 2529-2580) of the revised manuscript.
Response to Question 6 (Fixed versus Adaptive Rollout Budgets):
Thank you for your insightful advice.
In our default setting, we keep the total rollout budget fixed and dynamically allocate rollouts across transition types. This setting achieved state-of-the-art overall performance in our main experiments.
Our design naturally supports dynamic budget allocation. We use a lightweight MLP that adjusts the total rollout budget using current graph features and historical transition statistics. As shown below, the budget generally increases during periods with more transition events and decreases during less active periods, enabling adaptation to changing network activity. This extension aims to further improve predictive performance by matching the sampling effort to the anticipated transition volume.
| Timestamp t | Number of Transition Events | Actual Rollout Count |
|---|---|---|
| 1987 | 71.00 | 12.00 |
| 1989 | 71.40 | 13.00 |
| 1991 | 86.00 | 13.60 |
| 1993 | 92.00 | 15.00 |
| 1995 | 87.00 | 12.40 |
| 1997 | 96.00 | 13.17 |
| 1999 | 94.00 | 12.00 |
| 2001 | 77.00 | 11.00 |
| 2003 | 68.00 | 10.00 |
| 2005 | 59.00 | 9.00 |
| 2007 | 64.00 | 8.00 |
Node-Level Tasks / TGBN-Trade
| Method | Add. F1 ↑ | Rem. F1 ↑ | Sem. F1 ↑ | NDCG@10 ↑ |
|---|---|---|---|---|
| WorldGraph (Adaptive Budget) | 0.9712 ± 0.0183 | 0.6715 ± 0.0214 | 0.7372 ± 0.0030 | 0.6466 ± 0.0052 |
| WorldGraph (Fixed Budget) | 0.9696 ± 0.0105 | 0.6606 ± 0.0136 | 0.7354 ± 0.0075 | 0.6469 ± 0.0023 |
We have included this discussion in Appendix H.17 (lines 2582-2620) of the revised manuscript.
Response to Weakness 1, Weakness 2, Question 4, and Question 7
Response to Weakness 1 and Question 4 (Pooling Function):
Thank you for your suggestions.
We compared mean pooling with median, sum, and attention pooling in terms of both predictive performance and computational efficiency to justify this design choice.
Node-Level Tasks / TGBN-Trade
Edge-Level Tasks / UN Vote
Graph-Level Tasks / Contact
Runtime analysis: We keep the real input features fixed for each dataset, repeat the combined forward and backward passes 100 times for each of the four pooling methods, and report the GPU execution time per call as mean ± sample standard deviation in milliseconds (ms).
Overall, Mean Pooling achieves the strongest predictive performance while maintaining low computational overhead, offering a good balance between performance and efficiency. Sum Pooling is slightly faster but yields lower predictive performance, while Attention Pooling achieves competitive performance but is slower.
We have added these experiments in Appendix H.11 (lines 2247-2294) of the revised manuscript.
Response to Weakness 1 and Question 7 (Node Importance):
Thank you for your advice.
We compared node degree with PageRank centrality in terms of both predictive performance and computational efficiency to justify our choice of node importance measure.
Node-Level Tasks / TGBN-Trade
Edge-Level Tasks / UN Vote
Graph-Level Tasks / Contact
Runtime analysis: We compute importance weights using node degree and PageRank on the same current graph, repeat each computation 100 times, and synchronize the GPU before and after each timed computation. The table below reports the mean runtime per computation in milliseconds (ms).
Overall, the two methods achieve similar predictive performance, but PageRank incurs higher computational overhead, with per-computation runtime up to approximately 2.08 times that of node degree.
We have added these experiments in Appendix H.12 (lines 2295-2338) of the revised manuscript.
Response to Weakness 2 (Explicit References to the Appendix):
Thank you for your advice. We have added explicit pointers from the main text in the revised manuscript.