- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Trajectory-Persistent Dynamic Graph Condensation (TP-DGC), a method for temporal graph condensation. TP-DGC addresses a limitation of many existing methods, which condense snapshots independently, by condensing complete node trajectories. The method enforces consistent node identities over time, so that dynamic graph neural networks can be trained on the condensed sequence while preserving temporal dependencies. It matches the synthetic trajectories to the distribution of real, uncondensed node trajectories, enabling effective training of different temporal graph architectures on the condensed data.
The authors empirically validate the method on node classification across four well-known datasets (DBLP, Reddit, Brain, arXiv), demonstrating state-of-the-art or competitive performance across different condensation ratios. In the experimental section, the authors also provide ablation studies, runtime experiments, and additional insights, strengthening their empirical analysis.
Critical strengths
- The proposed method enforces consistent node identities across snapshots during condensation, allowing dynamic graph neural networks to reuse the condensed sequence as input and achieve good performance. This is a well-motivated idea that targets a real limitation of snapshot-wise methods, which discard the cross-snapshot correspondence Dynamic Graph Neural Networks (DGNNs) rely on. It is also supported empirically by the controlled permutation experiments, where breaking identity continuity degrades performance.
- TP-DGC is considerably more efficient than the strongest baseline, DyGC, while remaining competitive on the evaluated datasets, and it supports cross-architecture generalization, so the condensed sequence can be used by different models without re-condensation. Efficiency and reusability are the main practical goals of graph condensation, so the method makes repeated DGNN training cheaper and more flexible.
Critical weaknesses
- The presentation of the paper could be improved. (i) In the methodological section, it is difficult to follow the overall thread and the motivation and justification of each introduced component/equation. (ii) In the experimental section, many details are unclear, such as the choice of the frozen teacher model and how it is trained, and how the permutation is computed to check the effect of node identities (paragraph (4)). The justification of node classification results mentions two variants of GECC, while reporting only one in Table 1. Finally, the paper lacks a deep discussion of the obtained results, which, for example, are not connected to the dataset statistics shown in Table 6.
- The authors limit their method evaluation to transductive node-level classification on very short sequences ( for DBLP and Reddit, 12 for Brain, and 6 for arXiv). To have a complete experimental evaluation of TP-DGC, the authors should consider (i) longer sequences, where the effect of trajectory-persistent condensation can be exposed to more complex spatio-temporal patterns, and (ii) more tasks beyond node-level classification, and at least justify this evident restriction in their experimental settings. For example, a regression problem can easily be turned into a classification problem [1], where their exact method can be re-used up to minor implementation details.
[1] Luís Torgo and João Gama. “Regression Using Classification Algorithms.” Intelligent Data Analysis, 1997.
Questions for authors
In addition, for each question below, please refer to the Weaknesses:
- Can you provide a more extended runtime analysis of your method, where you can simulate its scalability on longer sequences (varying T)?
- Can you report the performance on Tmall, following DyGC?
- How are the class budgets chosen, and how do the number of classes and the condensation ratio interact? It is unclear how sensitive the performance is to the budgets. Could you please report an ablation study regarding this point?
- Regarding the adaptation to other tasks, such as temporal graph-level classification [2] and temporal link prediction [3], can you please discuss the extension of the methodology to these further tasks?
- Could you strengthen the evidence for the benefit of persistent identities over existing methods? In particular, it would be nice if you could: (a) run the common/time-varying permutation controls of Table 4 on DyGC, to test whether the claimed identity drift (also shown in Figure 1) is what explains the gap; (b) compare against DyGC’s originally reported numbers, since DyGC seems to have been reproduced by the authors; (c) extend Table 2 to Brain and to more than one ratio per dataset, which would show invariance to the condensation ratio in addition to cross-architecture generalization.
[2] Kiarash Shamsi et al. “MiNT: Multi-network Transfer Benchmark for Temporal Graph Learning.” NeurIPS Datasets and Benchmarks, 2025.
[3] Alessio Gravina and Davide Bacciu. “Deep Learning for Dynamic Graphs: Models and Benchmarks.” IEEE Transactions on Neural Networks and Learning Systems, 2024.
10 comments
Response to Reviewer cEMD (Part 2/5)
Resp. to W1(ii)-d --- Relating the results to dataset statistics
We will discuss the results in relation to graph size and class counts in Table 6, separating computational cost from synthetic-node capacity.
Generating and optimizing synthetic edges incurs additional computation. For the current dense-adjacency implementation, the number of candidate edges per snapshot grows quadratically with the synthetic-node count. Increasing the budget therefore also increases structural optimization costs. TP-DGC avoids this component by retaining only self-loops; its computational benefits will be discussed using timing measurements, not inferred as classification gains.
The synthetic-node budget limits representation capacity. Datasets with different node and class counts can have different total and per-class budgets even at the same nominal rate. A very small number of slots may not cover within-class diversity. We will report actual node budgets alongside the classification results rather than comparing datasets solely by their nominal ratios.
Resp. to W2(i) / Q1 --- Performance on longer sequences
We added arXiv experiments with 11 and 21 snapshots, following the main experiment's construction rules, and compared full-graph training, DyGC, and TP-DGC. Full-graph references will be reported alongside the condensed-data results to help distinguish changes in task difficulty from performance gaps under each sequence setting.
| Snapshots | Full-graph reference | DyGC | TP-DGC |
|---|---|---|---|
| 6 | 70.1±0.1 / 48.3±0.1 | 65.3±0.6 / 39.9±0.4 | 66.7±0.4 / 40.2±0.4 |
| 11 | 69.7±0.2 / 47.4±0.0 | 61.3±0.8 / 36.0±0.7 | 62.3±0.5 / 36.2±0.1 |
| 21 | 69.7±0.1 / 46.9±0.5 | 57.6±1.9 / 32.3±0.4 | 60.0±1.0 / 34.3±0.2 |
As the sequence length increases, the mean F1 scores of both condensation methods decline, whereas the full-graph reference scores change comparatively little. TP-DGC maintains higher mean Micro-F1 and Macro-F1 scores than DyGC at all three tested sequence lengths. However, the increasing gap from full-graph training indicates that longer sequences remain challenging for condensation. We will state this limitation explicitly: our main evaluation covers short-to-moderate sequences, and the current results do not establish behavior on very long sequences.
Resp. to W2(ii) / Q4 --- Cross-task extension and study scope
We agree that cross-task evaluation would further assess applicability. However, extending graph condensation to another task generally requires changes to the synthetic-data format, supervision, and condensation objective, rather than merely replacing the downstream model.
TP-DGC's class budgets, class-conditional trajectory matching, and teacher supervision are designed for node classification. Temporal link prediction would require node-pair or evolving-link supervision and adaptation of the self-loop-only representation. Dynamic graph-level classification would require graph-level synthetic samples and matching objectives. Discretizing regression targets would also require a binning strategy and validation against the original regression objective.
Reliable cross-task evaluation thus requires substantive methodological adaptation and independent experiments. We have not completed these extensions within the revision period. We will add a scope paragraph in the manuscript that justifies the restriction to transductive node classification and outlines the methodological changes required for other tasks, rather than implying that the current method directly transfers.
Resp. to Q2 --- Supplementary Tmall experiment
These are the newly added results on the Tmall dataset.
| Method | 0.02% | 0.10% | 0.20% |
|---|---|---|---|
| Random | 43.8±2.8 / 33.7±1.7 | 50.7±1.2 / 42.1±1.8 | 52.8±2.4 / 46.8±1.0 |
| Herding | 45.0±0.6 / 35.2±0.3 | 53.4±0.9 / 45.8±0.8 | 55.0±0.8 / 47.7±0.9 |
| KCenter | 42.9±2.1 / 30.4±2.3 | 45.5±0.8 / 36.6±1.3 | 47.5±1.8 / 39.3±1.0 |
| SimGC | 43.0±6.9 / 39.2±4.3 | 41.9±3.5 / 39.2±2.4 | 42.8±1.7 / 38.4±1.1 |
| GECC-Snapshot | 27.2±2.4 / 17.7±1.5 | 30.6±3.8 / 17.1±2.5 | 31.5±4.1 / 15.8±3.4 |
| CGC-X | 52.8±1.5 / 49.5±1.1 | 55.2±0.8 / 49.6±1.1 | 53.9±0.6 / 48.8±1.8 |
| DeepCGC-X | 52.5±0.9 / 49.8±0.5 | 55.3±0.3 / 50.9±1.2 | 56.5±0.8 / 51.5±1.5 |
| DyGC | 48.6±2.1 / 42.5±1.7 | 56.9±1.6 / 51.5±1.9 | 57.6±0.3 / 52.2±1.8 |
| TP-DGC | 57.3±0.8 / 48.9±2.8 | 58.3±0.7 / 52.8±1.3 | 58.7±0.1 / 52.8±1.1 |
Response to Reviewer cEMD (Part 3/5)
Resp. to Q3 --- Class-budget allocation and sensitivity
On arXiv, we fixed the total budget at 248 synthetic nodes and varied only the class allocation, using three paired seeds. The canonical allocation produced Micro-F1 of and Macro-F1 of . Uniform allocation produced and , respectively. Uniform allocation increased Macro-F1 by 2.50 percentage points but reduced Micro-F1 by 3.58 points.
These results reveal a trade-off between class-budget allocation and the evaluation objective. The arXiv training classes are highly imbalanced. Uniform allocation transfers part of the synthetic capacity from majority to minority classes, consistent with the improvement in Macro-F1, which weights all classes equally. Frequency-based allocation retains more capacity for majority classes and achieves higher overall Micro-F1. We will report this sensitivity analysis and state that the default allocation targets Micro-F1, while Macro-F1-oriented users may prefer a more uniform allocation.
| Budget allocation | Micro-F1 | Macro-F1 |
|---|---|---|
| Original allocation based on training-class frequency | 65.53 ± 0.80 | 39.84 ± 0.53 |
| Uniform class allocation (6--7 nodes per class) | 61.94 ± 0.21 | 42.34 ± 0.14 |
| Change under uniform allocation | −3.58 | +2.50 |
Resp. to Q5(a) --- DyGC permutation controls and the design motivation
We agree that the existing evidence does not establish identity drift during ordinary DyGC optimization, and we will remove that claim.
In the supplementary controls, common within-class permutations had relatively small effects, whereas time-varying within-class permutations reduced classification performance across the four evaluated datasets. This supports the task relevance of cross-snapshot correspondence, not spontaneous mismatch in unperturbed DyGC.
The results motivate explicitly constructing such correspondence. TP-DGC initializes synthetic trajectories from source groups shared across snapshots and softly regularizes their subsequent optimization toward the initial prototypes. We will frame the contribution as trajectory construction and optimization with shared source groups, rather than a remedy for demonstrated identity drift in DyGC.
| Dataset (ratio) | Condition | Micro-F1 | Macro-F1 | Δ Micro-F1 | Δ Macro-F1 |
|---|---|---|---|---|---|
| DBLP (2.5%) | Original | 77.7±0.9 | 77.1±0.8 | --- | --- |
| Common permutation | 78.0±0.6 | 77.5±0.5 | +0.3 | +0.4 | |
| Time-varying permutation | 76.6±0.6 | 75.9±0.9 | −1.1 | −1.2 | |
| Reddit (2.5%) | Original | 41.9±1.0 | 41.6±1.2 | --- | --- |
| Common permutation | 42.3±0.9 | 41.7±1.1 | +0.4 | +0.1 | |
| Time-varying permutation | 38.7±1.1 | 37.2±1.5 | −3.2 | −4.4 | |
| Brain (2.5%) | Original | 80.8±0.9 | 81.1±0.9 | --- | --- |
| Common permutation | 79.1±0.2 | 79.2±0.7 | −1.7 | −1.9 | |
| Time-varying permutation | 51.2±10.3 | 45.9±15.0 | −29.6 | −35.2 | |
| Arxiv (0.25%) | Original | 64.8±1.5 | 39.7±0.5 | --- | --- |
| Common permutation | 64.9±0.9 | 39.5±0.3 | +0.1 | −0.2 | |
| Time-varying permutation | 62.8±1.4 | 36.2±0.4 | −2.0 | −3.5 |
Response to Reviewer cEMD (Part 1/5)
We thank the reviewer for the constructive comments. These comments prompted additional long-sequence experiments, a clarification of the teacher and permutation protocols, a class-budget sensitivity study, and a comparison with DyGC's originally reported numbers. We clarify the protocols and limitations below.
Resp. to W1(i) --- Method workflow and the motivation for each component
We will reorganize the method section around a single pipeline: (1) construct structure-aware temporal states from the real adjacency; (2) initialize synthetic trajectories from source groups shared across snapshots; (3) optimize these trajectories with distribution matching, semantic alignment, and prototype regularization; (4) train the student on the edge-free synthetic graph. The current manuscript presents the components largely equation by equation, which obscures this thread; we will add an overview paragraph and a figure-level roadmap, and state for each component which design choice it addresses.
Structure-aware state construction uses the real adjacency to form temporal node representations, providing structural reference information rather than compressing raw features alone. Shared trajectory initialization then uses the same training-node groups across snapshots, so each synthetic slot starts from a trajectory associated with a fixed source group rather than independently constructed snapshot prototypes.
Trajectory distribution matching reduces class-conditional discrepancies between complete temporal representations. Semantic alignment provides task-related supervision, while prototype regularization limits departure from the initial trajectory prototypes. Finally, the synthetic graph contains only self-loops, concentrating optimization on trajectory features without learning time-varying inter-node synthetic edges.
Resp. to W1(ii)-a/b --- Frozen teacher and permutation protocols
We will consolidate the teacher architecture, pretraining, freezing, permutation generation, and evaluation details in the appendix.
To align with the official DyGC protocol, DBLP, Reddit, and Brain use TGCN teachers with 2, 1, and 1 graph layers, respectively, and hidden dimension 128. arXiv uses TGCN_L with 3 graph layers and hidden dimension 256. The teacher is pretrained on the real sequence using training-node labels:
Lteacher(θ)=−∣Vtrain∣1∑v∈Vtrainlogpθ(yv∣G1).
Small-graph teachers use Adam with learning rate 0.005 for at most 1,000 epochs. Checkpoints are selected by validation Micro-F1, with early stopping after 150 epochs without improvement. Large-graph teachers follow the official sampled-batch training procedure and are also selected by validation Micro-F1. Test metrics are reported but do not select the teacher checkpoint.
Teacher parameters are not updated during condensation, but gradients through the teacher with respect to synthetic features are retained. Freezing parameters does not mean that every forward pass uses evaluation mode: the current small-graph implementation follows DyGC by using training mode for synthetic classification supervision, and evaluation mode for reference-target extraction and evaluation.
The permutation controls operate on saved synthetic sequences without re-condensation. For snapshot t, we transform features and both adjacency axes consistently:
X~t′=PtX~t,A~t′=PtA~tPt⊤.
Permutations are restricted to nodes of the same class, so Pty~=y~. This preserves each snapshot's node count, class composition, feature multiset, and graph structure. A common permutation uses Pt=P across time, whereas time-varying permutations can splice states from different nodes into the same slot. All conditions reuse the same synthetic graph and paired student seeds. These controls measure downstream sensitivity to cross-snapshot correspondence.
Resp. to W1(ii)-c --- GECC variants and their corresponding tables
Table 1 reports only GECC-Snapshot to maintain consistency with our offline dynamic-sequence condensation protocol. GECC-Evolving addresses incremental graph accumulation and updating, which differs from the main experimental setting. We therefore report it separately as a supplementary adaptation experiment in Appendix Table 7.
The original discussion mentioned both variants without sufficiently explaining the protocol difference and table correspondence. We will consistently use GECC-Snapshot when discussing Table 1 and explicitly refer to Appendix Table 7 when discussing GECC-Evolving, rather than treating it as a strictly protocol-matched baseline.