- Lines 80 to 81 and 214 to 215 state that exposing cross-task neighbors generally degrades performance, but the main tables show the opposite: unmodified PUMA reaches 81.930 AvgAcc on ogbn-products with history (Table 1) and 73.985 without it (Table 5), and Joint-train is higher with history on all four datasets. ISD-GC's margin over PUMA is also larger under the isolated protocol on ogbn-arxiv and ogbn-products, where Stage I has nothing to filter. CGLB (Zhang et al., 2022a), which defines the same protocol, likewise finds the net effect of inter-task edges dataset-dependent. How is the premise reconciled with these results?
- In this protocol, which nodes are historical is given by arrival order (Appendix D.2.2), yet Stage I learns a detector for them and its accuracy is never reported. Per Algorithm 1, the typed masks only build the condensation views and the predictor is retrained on self-loop prototypes, so where does the "selective message passing" of the abstract (lines 32 to 33) happen? What are the precision and recall of the historical-candidate mask and of the beneficial/harmful typing?
- All Stage II views are derived from the same step-t graph (Section 3.2.1), so a cue that is stable within the task window is present in every view. How can cross-view consistency separate time-local cues from cues that transfer across tasks?
- If u_{c,i} were unconstrained, the gate g_{c,i} in Eq. 3 would not change the minimizer: for each dimension, the optimum is the λ-weighted mean of the view targets, whatever g is. The gate acts only through the unit-norm and encoder-range constraints, so unstable dimensions are still fitted to their cross-view mean rather than suppressed, contrary to lines 342 to 344. What does a no-gate ablation show?
- Table 2 reports only aggregate accuracy, and the trap still costs ISD-GC about as much as PUMA (78.984 to 63.008 for ISD-GC, 74.939 to 56.010 for PUMA, under ORI). On ogbn-products ORI, the trap even raises PUMA (70.932 to 73.781) but lowers ISD-GC (80.784 to 76.955, Table 6). What are Diag_focus, m_focus→ctrl, c2i, and i2c (Figure 1) for ISD-GC?
- Lines 17 to 18 claim that fidelity-focused condensation leads to Temporally Illusory Invariance, but Section 2.2 compares only PUMA with a full-history oracle, and the oracle "shows the same qualitative transition signature" (line 172). How does a sampling-based memory such as ER-GNN behave under the same budget?
- In Tables 3 and 8, the variant without either stage already outperforms PUMA on all four datasets (for example 75.725 vs 74.779 on ogbn-arxiv), and adding both stages moves ogbn-arxiv only to 75.846. What is this variant, how is "Stage I only" run when Stage I only produces Stage II's views, and where does its gain over PUMA come from?
- Appendix B defines the induced and conflict sets with CoraFull class IDs (conflict classes 48 to 60), which do not exist in ogbn-arxiv and Reddit (40 classes) or ogbn-products (46 classes, Table 4), yet Table 6 reports trap results on them. How were these settings built? The released trap generator also does not implement Appendix B: it returns the original graph before any injection, its triangle-closing edges are commented out, and it attaches leaves only to nodes of selected tasks.
- The paper describes no test-time procedure for the history-aware graph. The released implementation reports ISD-GC accuracy after zeroing the features of every non-training node whose first prediction falls outside the classes of the task being evaluated, which uses that task's ground-truth index; the replay baselines use a variant with extra edge pruning, and the regularization baselines use a plain forward pass. Were Tables 1 and 5 produced this way, and what are the results when every method uses the same plain forward pass?
- The released Stage II also differs from Eq. 3 and Appendix F.2: it adds a target built from historical-memory embeddings and a variance-of-risk penalty across views, uses 100 randomly re-initialized teacher encoders instead of the frozen f_ref (line 322), and condenses pseudo-labeled test nodes. Which version produced the reported tables, and what does each addition contribute?
- The newest compared methods are CaT and PUMA, both first released in 2023, and Tables 2 and 6 compare only with PUMA. Published methods for this setting are missing: DeLoMe [1], TACO [2], TEM [3], Peng et al. (2025), SSRM [4], which targets the structural shift caused by inter-task edges, TPP [5], GSIP [6], DSLR [7], and OpenGC [8], which condenses evolving graphs for temporal invariance. How does ISD-GC compare with them under the same budget?
[1] Chaoxi Niu, Guansong Pang, and Ling Chen. Graph continual learning with debiased lossless memory replay. In ECAI, 2024.
[2] Xiaoxue Han, Zhuo Feng, and Yue Ning. A topology-aware graph coarsening framework for continual graph learning. In NeurIPS, 2024.
[3] Xikun Zhang, Dongjin Song, Yixin Chen, and Dacheng Tao. Topology-aware embedding memory for continual learning on expanding networks. In KDD, 2024.
[4] Junwei Su, Difan Zou, Zijun Zhang, and Chuan Wu. Towards robust graph incremental learning on evolving graphs. In ICML, 2023.
[5] Chaoxi Niu, Guansong Pang, Ling Chen, and Bing Liu. Replay-and-forget-free graph class-incremental learning: A task profiling and prompting approach. In NeurIPS, 2024.
[6] Jialu Li, Yu Wang, Pengfei Zhu, Wanyu Lin, and Qinghua Hu. What matters in graph class incremental learning? An information preservation perspective. In NeurIPS, 2024.
[7] Seungyoon Choi, Wonjoong Kim, Sungwon Kim, Yeonjun In, Sein Kim, and Chanyoung Park. DSLR: Diversity enhancement and structure learning for rehearsal-based graph continual learning. In WWW, 2024.
[8] Xinyi Gao, Tong Chen, Wentao Zhang, Yayong Li, Xiangguo Sun, and Hongzhi Yin. Graph condensation for open-world graph learning. In KDD, 2024.
Response to Reviewer bqLT
A1: To improve the readability of the manuscript, we have added an overall framework figure that provides a visual overview of ISD-GC as shown in figure D3 in the revised manuscript.
A2: To provide more direct empirical evidence, we have extended the original Figure 1 (Figure 2 in the revised manuscript) by incorporating four diagnostic metrics for ISD-GC: Diagfocus,mfocus→ctrl, c2i, and i2c.
The results show that ISD-GC generally exhibits intermediate diagnostic behavior between PUMA and the full-history Oracle. Compared with PUMA under the same memory budget, ISD-GC maintains higher within-focus correctness, lower leakage to control classes, and less pronounced induced–conflict error transitions. These observations provide empirical evidence that ISD-GC mitigates shortcut-induced prediction drift under structural changes, although such effects are not completely eliminated.
Importantly, we interpret structural invariance in an operational sense, as robustness to structural variations rather than a guarantee of strictly invariant representations. The additional visualization supports this interpretation by demonstrating more stable classification behavior under the controlled Motif Trap setting.
A3: We observe that the contributions of the two stages vary across datasets. As shown in Tables 3 and 8, the full model improves AvgAcc over the variant with both stages disabled by 2.312 percentage points on CoraFull and 1.017 points on ogbn-products, while the gains are more modest on ogbn-arxiv and Reddit. In particular, the variant without either stage already achieves 97.972% AvgAcc on Reddit, leaving limited room for further improvement. Nevertheless, the full model improves LastAcc from 98.042% to 99.059%, demonstrating better final-stage performance despite the nearly saturated AvgAcc. Importantly, Stage I and Stage II address complementary aspects of graph continual learning: Stage I mitigates interference from historical context, while Stage II improves the transferability of condensed memory. Their relative contributions depend on the characteristics of the underlying graph streams.
We have therefore revised the statement "both stages are indispensable" to "two complementary stages" and refined the corresponding discussion to reflect their dataset-dependent contributions.
A4: The novelty of ISD-GC stems from its problem-driven methodological design for addressing two interconnected challenges in evolving graph continual learning: cross-task interference arising from observable historical neighbors and the consolidation of task-local structural shortcuts into condensed memory. To address these challenges, we develop memory-grounded context identification and structure-invariant prototype condensation.
Importantly, the two stages interact through a memory-mediated feedback mechanism. Stage I leverages previously condensed prototypes to identify and type historical context, guiding the construction of structural views for Stage II. Stage II then incorporates these views and historical-memory-based temporal evidence to construct transferable condensed prototypes, which in turn provide historical references for subsequent tasks.
We have strengthened the presentation of these problem-driven contributions in the revised manuscript to more clearly articulate the novelty of ISD-GC and its distinction from existing condensation- and distillation-based methods.