acceptodds
Withdrawn from ICLR 2027

One Identity, One Trajectory: Trajectory-Persistent Dynamic Graph Condensation for Efficient Temporal Graph Learning

Withdrawn from ICLR 2027, so left out of the paper lists and the map.

Abstract

Dynamic graphs are ubiquitous in real-world systems, yet their temporal evolution makes repeated training of dynamic graph neural networks (DGNNs) prohibitively expensive. Dynamic graph condensation aims to compress large-scale graph sequences into smaller yet informative synthetic sequences while preserving downstream utility. However, existing snapshot-wise methods condense each snapshot in isolation, discarding the cross-snapshot node identities that DGNNs fundamentally rely on to model temporal dependencies. Accordingly, we propose Trajectory-Persistent Dynamic Graph Condensation (TP-DGC), which shifts the condensation unit from isolated snapshots to node trajectories observed across the entire temporal window. Specifically, TP-DGC compresses structure-aware trajectory states from the real graph into a compact set of persistent synthetic identities. A time-shared assignment enforces index-consistent identities across all snapshots, making persistence intrinsic to the condensed representation rather than a post-hoc alignment. These identities are refined through trajectory-level distribution matching and task-specific semantic alignment. The resulting condensed trajectories are edge-free yet encode structural information through these persistent identities, enabling direct transfer across different DGNN architectures without re-condensation. Experiments on DBLP, Reddit, Brain, and ogbn-arxiv show that TP-DGC outperforms state-of-the-art baselines on node-classification across various condensation budgets, while achieving 7.1×–56.9× speedup over the strongest baseline in total condensation time.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
1. Dynamic Graph Condensation 2. Dynamic Graph Neural Networks 3. Node Classification 4. Temporal Graphs 5. Trajectory Learning

Reviews

Among:
Shape:
1234this paper, Bottom 27%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.00 over 3 reviews, above 27% of the others.
Reviewer_cEMDOpenReview ↗
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 (T=10T=10 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 McM_c 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
AuthorsOpenReview ↗

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(θ)=−1∣Vtrain∣∑v∈Vtrainlog⁡pθ(yv∣G1).\mathcal{L}_{teacher}(\theta) = - \frac{1}{|\mathcal{V}_{train}|}\sum_{v \in \mathcal{V}_{train}}^{}\log p_{\theta}(y_{v} \mid G_{1}).

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 tt, we transform features and both adjacency axes consistently:

X~t′=PtX~t,A~t′=PtA~tPt⊤.{\tilde{X}}_{t}' = P_{t}{\tilde{X}}_{t},\quad\quad{\tilde{A}}_{t}' = P_{t}{\tilde{A}}_{t}P_{t}^{\top}.

Permutations are restricted to nodes of the same class, so Pty~=y~P_{t}\tilde{y} = \tilde{y}. This preserves each snapshot's node count, class composition, feature multiset, and graph structure. A common permutation uses Pt=PP_{t} = 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.

AuthorsOpenReview ↗

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.

SnapshotsFull-graph referenceDyGCTP-DGC
670.1±0.1 / 48.3±0.165.3±0.6 / 39.9±0.466.7±0.4 / 40.2±0.4
1169.7±0.2 / 47.4±0.061.3±0.8 / 36.0±0.762.3±0.5 / 36.2±0.1
2169.7±0.1 / 46.9±0.557.6±1.9 / 32.3±0.460.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.

Method0.02%0.10%0.20%
Random43.8±2.8 / 33.7±1.750.7±1.2 / 42.1±1.852.8±2.4 / 46.8±1.0
Herding45.0±0.6 / 35.2±0.353.4±0.9 / 45.8±0.855.0±0.8 / 47.7±0.9
KCenter42.9±2.1 / 30.4±2.345.5±0.8 / 36.6±1.347.5±1.8 / 39.3±1.0
SimGC43.0±6.9 / 39.2±4.341.9±3.5 / 39.2±2.442.8±1.7 / 38.4±1.1
GECC-Snapshot27.2±2.4 / 17.7±1.530.6±3.8 / 17.1±2.531.5±4.1 / 15.8±3.4
CGC-X52.8±1.5 / 49.5±1.155.2±0.8 / 49.6±1.153.9±0.6 / 48.8±1.8
DeepCGC-X52.5±0.9 / 49.8±0.555.3±0.3 / 50.9±1.256.5±0.8 / 51.5±1.5
DyGC48.6±2.1 / 42.5±1.756.9±1.6 / 51.5±1.957.6±0.3 / 52.2±1.8
TP-DGC57.3±0.8 / 48.9±2.858.3±0.7 / 52.8±1.358.7±0.1 / 52.8±1.1
AuthorsOpenReview ↗

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 65.53±0.8065.53 \pm 0.80\\% and Macro-F1 of 39.84±0.5339.84 \pm 0.53\\%. Uniform allocation produced 61.94±0.2161.94 \pm 0.21\\% and 42.34±0.1442.34 \pm 0.14\\%, 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 allocationMicro-F1Macro-F1
Original allocation based on training-class frequency65.53 ± 0.8039.84 ± 0.53
Uniform class allocation (6--7 nodes per class)61.94 ± 0.2142.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)ConditionMicro-F1Macro-F1Δ Micro-F1Δ Macro-F1
DBLP (2.5%)Original77.7±0.977.1±0.8------
Common permutation78.0±0.677.5±0.5+0.3+0.4
Time-varying permutation76.6±0.675.9±0.9−1.1−1.2
Reddit (2.5%)Original41.9±1.041.6±1.2------
Common permutation42.3±0.941.7±1.1+0.4+0.1
Time-varying permutation38.7±1.137.2±1.5−3.2−4.4
Brain (2.5%)Original80.8±0.981.1±0.9------
Common permutation79.1±0.279.2±0.7−1.7−1.9
Time-varying permutation51.2±10.345.9±15.0−29.6−35.2
Arxiv (0.25%)Original64.8±1.539.7±0.5------
Common permutation64.9±0.939.5±0.3+0.1−0.2
Time-varying permutation62.8±1.436.2±0.4−2.0−3.5
Reviewer_dMz4OpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper studies dynamic graph condensation, focusing specifically on the problem that snapshot-wise methods lose node identities across snapshots. To tackle this, the authors propose TP-DGC, which maintains persistent synthetic identities via time-shared assignments, trajectory-level distribution matching, and semantic alignment. Experiments on four datasets show that TP-DGC achieves better node-classification performance and faster condensation than existing baselines.

Critical strengths
  1. The paper is clearly written and easy to follow.

  2. Moving the unit of condensation from per-snapshot nodes to entire node trajectories is reasonable and well-motivated.

  3. The figures in this paper are clear, and the method achieves a good balance between performance and efficiency under medium- to high-condensation budgets.

Critical weaknesses
  1. The ablation study cannot fully support the main sources of performance gains. Is this from the shared assignment, the full-trajectory MMD, teacher supervision, initialization quality, or the edge-free design? This makes it hard to check the core contribution of this paper.

  2. The definition and experimental computation are somehow inconsistent. Could you please clarify how the condensation ratio is defined and computed in the appendix?

  3. For Proposition 1, it assumes purely snapshot-wise set matching, yet DyGC introduces temporal coupling through its state evolution field. Could you analyze DyGC’s actual objective to show that it is in fact permutation-insensitive or suffers from identity drift?

  4. The claims of “trajectory-level equivalence” and of propagation “in the same way” (Introduction, lines 85–101; Eqs. 16–18) are unclear. Trajectory MMD aligns class-conditional trajectory distributions, but this alone does not guarantee equivalent propagation, gradients, or learning outcomes across different parameters or architectures. Could you provide more explanation for this?

Questions for authors

Please check the Weaknesses part

5 comments
AuthorsOpenReview ↗

Response to Reviewer dMz4 (Part 1/2)

We thank the reviewer for the constructive comments. These comments prompted a shared-assignment ablation and a clarification of the nominal condensation ratio versus the actual synthetic-node budget, which sharpen the scope of our claims and evidence. We address these concerns as follows:

Resp. to W1 --- Attribution of performance gains to individual components

To better distinguish these factors, we added a shared-assignment ablation that replaces the assignment shared across time with snapshot-wise assignments while retaining the remaining optimization and evaluation settings. The clearest benefit of shared assignment was observed on Reddit.

VariantDBLP (r = 2.5%)Reddit (r = 2.5%)Brain (r = 2.5%)Arxiv (r = 0.25%)
w/o trajectory prototype init.74.1±1.4 / 73.4±1.039.4±0.8 / 36.8±2.180.4±1.4 / 80.3±1.963.6±1.7 / 36.2±0.7
w/o trajectory-distribution matching76.8±0.6 / 76.0±0.737.2±1.5 / 35.5±3.476.5±3.6 / 77.3±3.563.1±0.7 / 34.7±0.8
w/o task-specific semantic alignment75.1±0.9 / 74.1±1.241.0±0.8 / 40.7±0.875.2±1.3 / 75.9±1.157.3±0.6 / 33.7±0.5
w/o shared trajectory assignment76.5±0.4 / 75.9±0.438.0±1.4 / 36.2±4.581.1±1.2 / 81.2±1.265.7±0.6 / 38.8±0.3
Full77.7±0.5 / 77.2±0.543.2±1.3 / 42.8±1.483.1±1.5 / 83.6±1.666.7±0.4 / 40.2±0.4

We emphasize that this ablation provides component-level evidence rather than a complete additive attribution: each variant removes one component while retaining the others, so interactions among initialization, distribution matching, semantic alignment, and shared assignment cannot be fully separated. The results show that each component contributes on at least some datasets, with shared assignment having the clearest effect on Reddit. The teacher-supervision term and the edge-free design are not separately isolated in this table; we will clarify their roles in the manuscript and report the existing evidence without implying a full decomposition of their contributions. We will present the ablation in this scope and will not claim that it alone identifies the sole source of the gains.

Resp. to W2 --- Definition and implementation of the condensation ratio

We will distinguish the nominal condensation ratio reported in the paper, the implementation's budget parameter, and the resulting number of synthetic nodes.

For DBLP, Reddit, and Brain, the nominal ratio is applied to the full-graph node count and then allocated across classes. For arXiv, class budgets are computed from the per-class training-node count and the implementation's rate parameter, with a ceiling applied separately to each class; consequently, the actual total is not simply the nominal ratio times the total node count. The actual synthetic-node budgets are provided below.

DatasetLowest settingMiddle settingHighest setting
DBLP0.5%: 332.5%: 1655.0%: 330
Reddit0.5%: 412.5%: 2075.0%: 415
Brain1.0%: 502.5%: 1255.0%: 250
arXiv0.05%: 690.25%: 2480.5%: 477
AuthorsOpenReview ↗

Response to Reviewer dMz4 (Part 2/2)

Resp. to W3 --- Proposition 1 and DyGC's actual objective

We agree with this concern. The permutation-invariance statement in Proposition 1 applies to objectives that depend only on the unordered node set of each snapshot. It cannot be directly extended to DyGC's complete objective, which incorporates temporal coupling.

DyGC's state-evolution field couples states across time through shared node indices. Even if a distribution-matching loss is permutation-invariant with respect to an already constructed state set, this does not imply that the complete objective remains invariant when different permutations are applied before temporal state construction. These are distinct properties. Whether DyGC's complete objective is permutation-insensitive remains an open question that we do not claim to resolve.

Likewise, the absence of an explicit real-node source constraint does not establish that identity drift necessarily occurs during optimization. The permutation controls show that artificially disrupting correspondence can affect downstream classification; they do not directly measure identity changes during ordinary DyGC optimization.

We will therefore specify the assumptions of Proposition 1, refrain from using it to characterize the permutation invariance of DyGC's full objective, and remove claims that the existing experiments establish identity drift in DyGC. TP-DGC's distinction will instead be framed in terms of trajectory initialization with shared source groups and soft prototype anchoring.

Resp. to W4 --- Trajectory-level equivalence and propagation "in the same way"

We agree that class-conditional trajectory MMD matching does not guarantee identical propagation, gradients, or learning outcomes between the real and synthetic graphs, particularly across model parameters and architectures.

Trajectory MMD reduces class-conditional distribution discrepancies in the selected representation and kernel space. A small empirical MMD does not establish node-wise correspondence, structural equivalence, or equivalent downstream optimization. Even distributional equality under appropriate assumptions would require additional conditions to imply relationships between predictions or gradients.

We will replace "trajectory-level equivalence" with "trajectory-level distribution matching" and remove the guarantee that propagation proceeds "in the same way."

AuthorsOpenReview ↗

Changes in the Revised Manuscript

We thank the reviewer for the constructive comments. We have made the corresponding revisions to the manuscript, as summarized below.

Resp. to W1

We have added a shared-assignment ablation in Section 4.3 (Figure 4) and Appendix E.2 (Table 9).

Resp. to W2

We have clarified the condensation ratio and synthetic-node budget definitions in Section 4.1 and Appendix D.1 (Table 7).

Resp. to W3

We have clarified the assumptions and scope of Proposition 1 in Appendix B.1.

Resp. to W4

We have revised the terminology and clarified the scope of trajectory distribution matching in the Abstract, Section 1 (Introduction), Section 3.3, and Conclusion.

Reviewer_trbBOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposes TP-DGC for dynamic graph condensation. It uses a shared trajectory assignment to initialize persistent synthetic nodes, then refines their features through distribution matching, teacher supervision, and prototype regularization. The condensed sequence contains only self-loops. Experiments on four datasets show competitive classification performance and substantially lower construction costs than DyGC.

Critical strengths
  1. The paper addresses a relevant problem: preserving temporal correspondence while reducing the cost of dynamic graph condensation. The permutation experiments support the importance of cross-snapshot correspondence.

  2. The method is reasonably simple. Shared trajectory initialization and feature-only optimization produce condensed sequences that can be reused across different DGNN architectures.

  3. The efficiency gains are substantial. On Reddit, TP-DGC achieves 7.1×–56.9× faster construction than DyGC, including teacher pretraining, while maintaining competitive accuracy.

Critical weaknesses
  1. The novelty relative to DyGC needs clarification. DyGC already matches node states across time, so the claimed shift from snapshot-level to trajectory-level condensation seems overstated. The paper should focus on its shared assignment, prototype constraint, and edge-free design.

  2. The evidence for identity drift in DyGC is incomplete. Figure 1(c) needs a clearer retrieval protocol. The permutation study shows that correspondence matters, but does not directly establish that DyGC suffers from identity drift.

  3. An edge-free DyGC baseline is missing. This makes it difficult to separate the benefit of the trajectory mechanism from that of removing synthetic edge generation.

Questions for authors
  1. Could the authors clarify the retrieval protocol in Figure 1(c), including how a correct identity match is defined? Adding the shared trajectory initialization and prototype regularization to DyGC, while keeping its other components unchanged, would help establish whether the proposed mechanism improves both identity consistency and classification performance.

  2. Could the authors evaluate DyGC with its synthetic adjacency fixed to the identity matrix? Comparing this baseline with DyGC and TP-DGC in both accuracy and construction time would clarify the contribution beyond removing edge generation.

Results on one or two representative datasets would be sufficient for these targeted comparisons; a full rerun of all benchmarks is unnecessary.

4 comments
AuthorsOpenReview ↗

Response to Reviewer trbB (Part 1/2)

We thank the reviewer for the constructive comments. The reviewer's questions prompted a clarification of the retrieval protocol and an identity-fixed DyGC baseline, which has sharpened the scope of our claims and the experimental evidence. We address these concerns as follows:

Resp. to W1 --- Distinction between TP-DGC and DyGC

The original manuscript distinguishes snapshot-wise static condensation baselines from DyGC, which jointly condenses the full sequence. Nevertheless, we agree that "extending from snapshot-level to trajectory-level" does not accurately characterize our distinction from DyGC. DyGC already couples node states across time through its state-evolution field.

TP-DGC differs in how synthetic trajectories are constructed and optimized. At initialization, each synthetic slot aggregates the same group of training nodes across all snapshots. During optimization, prototype regularization encourages the synthetic trajectory to remain close to its initial prototype. The synthetic adjacency contains only self-loops; inter-node synthetic edges are not learned. We will clarify these distinctions in the Introduction and contribution summary, and we will precisely define how the shared node group is determined across snapshots.

Resp. to W2 / Q1a --- Retrieval protocol and the definition of a hit in the original Figure 1(c)

We agree that the Introduction's statement that existing dynamic graph condensation methods generally suffer from identity drift exceeds the available evidence. Our current experimental design also does not permit a direct verification of identity drift, and we therefore do not claim to prove or disprove it. We will remove the stronger claim and will avoid describing the retrieval metric as a measure of identity drift or identity consistency. The original permutation experiment tests the role of cross-snapshot correspondence in downstream classification; it does not determine whether DyGC undergoes identity drift during unperturbed optimization.

For each synthetic node in Figure 1(c), we concatenate its features over the odd-indexed snapshots and retrieve the same-class real node with the highest cosine similarity as a reference. We then rank the same candidates using the even-indexed snapshots. A Recall@KK hit occurs if the reference node is among the top KK candidates. We repeat the procedure with the two temporal subsets exchanged. The reference is selected by feature similarity and is not independently verified as the synthetic node's true source. The metric therefore measures cross-temporal retrieval consistency, not identity drift. We will rename the metric accordingly and revise the caption and surrounding text. We will also report the K values, candidate-pool construction, and the handling of newly appearing or missing nodes in the appendix.

We additionally applied within-class permutation controls to DyGC's synthetic sequences. A common permutation across snapshots produced mixed and generally smaller changes, whereas time-varying permutations reduced classification performance on the evaluated datasets. These results indicate that cross-snapshot correspondence carries task-relevant information even for DyGC, which already incorporates temporal coupling. They motivate explicitly constructing cross-snapshot correspondence in TP-DGC, but they do not establish, and we do not claim, that DyGC naturally undergoes identity drift..

Dataset (ratio)ConditionMicro-F1Macro-F1Δ Micro-F1Δ Macro-F1
DBLP (2.5%)Original77.7±0.977.1±0.8------
DBLP (2.5%)Common permutation78.0±0.677.5±0.5+0.3+0.4
DBLP (2.5%)Time-varying permutation76.6±0.675.9±0.9−1.1−1.2
Reddit (2.5%)Original41.9±1.041.6±1.2------
Reddit (2.5%)Common permutation42.3±0.941.7±1.1+0.4+0.1
Reddit (2.5%)Time-varying permutation38.7±1.137.2±1.5−3.2−4.4
Brain (2.5%)Original80.8±0.981.1±0.9------
Brain (2.5%)Common permutation79.1±0.279.2±0.7−1.7−1.9
Brain (2.5%)Time-varying permutation51.2±10.345.9±15.0−29.6−35.2
Arxiv (0.25%)Original64.8±1.539.7±0.5------
Arxiv (0.25%)Common permutation64.9±0.939.5±0.3+0.1−0.2
Arxiv (0.25%)Time-varying permutation62.8±1.436.2±0.4−2.0−3.5
AuthorsOpenReview ↗

Response to Reviewer trbB (Part 2/2)

Resp. to Q1b --- Transferring shared trajectory initialization and prototype regularization to DyGC

The transferred components improved cross-time retrieval metrics. On Reddit at 5%, adding shared trajectory initialization and state-prototype regularization increased MRR from 0.31% to 1.49% and Recall@200 from 11.08% to 12.77%. Under the similarity-based protocol of Figure 1(c), the combination therefore improved retrieval consistency across temporal subsets.

This improvement did not translate into gains in both classification metrics: Micro-F1 increased slightly from 43.85% to 44.13%, whereas Macro-F1 decreased from 43.78% to 42.75%. We therefore do not claim that this transfer improves both retrieval consistency and classification performance. We will report this result explicitly and temper the corresponding claim in the manuscript.

Two implementation properties may help explain this outcome. First, because DyGC generates edges from synthetic features, changing feature initialization also changes the initial structure and subsequent joint optimization path. Second, the transferred state-prototype regularizer constrains the effects of structural changes:

Lproto=∥Φ(X~,A~)−Φ(X~0,A~0)∥2.\mathcal{L}_{proto} = \parallel \Phi(\tilde{X},\tilde{A}) - \Phi(\tilde{X}_{0},\tilde{A}_{0}) \parallel^{2}.

The anchor includes the initially generated adjacency A~0{\tilde{A}}_{0}. Even if subsequent structural updates benefit classification, they are still penalized whenever the propagated states deviate from the anchor. This differs from the constraint setting in TP-DGC, which retains only self-loops.

Resp. to W3 / Q2 --- DyGC with synthetic adjacency fixed to the identity

We fixed DyGC's synthetic adjacency to the identity during both condensation and student training. The results are shown below.

MethodReddit (r = 2.5%): Micro-F1Macro-F1Total time (s)Arxiv (r = 0.25%): Micro-F1Macro-F1Total time (s)
DyGC42.3±0.841.9±1.0605.465.3±0.639.9±0.41159.6
Edge-free DyGC42.5±1.741.2±2.1358.865.0±0.539.5±0.31076.3
TP-DGC43.2±1.342.8±1.423.966.7±0.440.2±0.4507.8

These results suggest that removing learned synthetic edges reduces construction time, but does not by itself account for the performance and efficiency of the full TP-DGC method. To make the timing comparison transparent, we will report the timing protocol (hardware, stopping criterion, and whether hyperparameter search is included) and provide a breakdown of condensation and student-training time. In particular, the large Reddit gap is not solely due to removing edge generation; TP-DGC also avoids DyGC's joint edge-generation optimization. We will make this explicit in the revised manuscript.

AuthorsOpenReview ↗

Changes in the Revised Manuscript

We thank the reviewer for the constructive comments. We have made the corresponding revisions to the manuscript, as summarized below.

Resp. to W1

We have clarified the distinction between TP-DGC and DyGC in Section 1 (Introduction), the contribution summary, Sections 3.1 and 3.3, and Appendix C.1.

Resp. to W2 / Q1a

We have clarified the cross-temporal retrieval protocol and permutation controls in Figure 1(c), Appendix B.2 (Table 4), and Appendix B.4.

Resp. to Q1b

We have added the component-transplantation results for DyGC in Appendix E.7 (Table 16).

Resp. to W3 / Q2

We have added the edge-free DyGC comparison in Appendix E.7 (Table 15) and provided additional experimental and timing details in Appendices D.2–D.3 and E.4 (Table 11).

Dear Reviewer,

Thank you again for taking the time to review our paper. As the discussion deadline approaches, we wanted to follow up on our rebuttal. We would appreciate hearing whether our response and the additional results addressed your concerns. If any questions remain, we would be happy to clarify them during the remaining discussion period.

If our response has addressed your concerns, we would be grateful if you would reconsider your rating in light of the clarifications and additional results.

Thank you for your time and consideration.

Best regards,
The Authors

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Discussion (0)

Sign in to comment.