-
The questions raised at lines 56 and 60 concern source-model reliability and reliable pseudo-label supervision. These are common concerns in source-free and multi-source domain adaptation. COME does use graph edges and neighborhood information, but the paper does not clearly explain what new insight its structural and temporal signals provide into graph-specific problems such as conditional structure shift, changes in homophily, or the resulting errors in neighborhood aggregation. Appendix C.2 discusses the relation to GraphATA, but the additional contribution appears to be mainly a combination of manually designed reliability scores, temporal weighting, and expert routing. The structural module probes frozen source models using perturbed graphs. This measures sensitivity to the chosen perturbations; it does not itself make the source models more stable or establish that their predictions are more accurate. A source model can remain confidently wrong across all views. The paper needs stronger motivation and evidence that the score in Eq. (1) identifies reliable source predictions better than confidence or entropy alone. Likewise, low disagreement with memory-based pseudo-labels can reflect persistent errors. The module-removal ablations do not fully resolve this issue: removing SMEP changes both probing and source aggregation, while removing TMAC also removes state-conditioned supervision. These comparisons do not isolate the value of structural probing or temporal smoothing. Theorems 3.1 and 3.2 do not close this gap. Theorem 3.1 establishes a Lipschitz perturbation bound and a sufficient margin condition for preserving the predicted class. Preserving a prediction does not establish its correctness, and the result does not justify the full reliability score. Theorem 3.2 gives the variance reduction of an exponential moving average under constant conditional moments and zero temporal covariance. These assumptions are not validated for a learning process with an evolving model and memory bank. Neither result analyzes the benefit of multiple sources, the restrictions imposed by unavailable source data, or improvement in target prediction error. The results describe component properties, but provide limited theoretical support for the proposed adaptation mechanism.
-
The related-work discussion misses several relevant lines of GDA research. Directly relevant source-free examples include Rank and Align [2] and Robust Cross Supervision with Target Mining [9]. Relevant work on graph structure and distribution shift includes Structural Re-weighting [1], Sparse Causal Discovery with Generative Intervention [4], Disentangled Graph Spectral Domain Adaptation [5], and the more recent DiffGDA [10] and ADAlign [11]. Hierarchical graph contrastive domain adaptation [6] is also relevant to the multi-source setting. These omissions weaken the positioning of the structural challenges introduced in the second paragraph and make the claimed novelty difficult to assess. The discussion should explain which ideas remain applicable under source-free constraints, with empirical comparisons using compatible protocols. Pair-Align and A2GNN are already cited, but their relevance to the structural argument is not developed and they are absent from the reported comparisons. For the graph-specific motivation, homophily-agnostic structure reconstruction [12] and homophily discrepancy analysis [7] are relevant to structural shift, while attribute-driven GDA [8] shows why node-attribute discrepancy also matters. The discussion should explain how COME's reliability signals relate to these forms of shift. Since these methods use source graphs during adaptation, their relevance is primarily conceptual unless they are adapted and evaluated under the same source-free constraints. The claim of “Comprehensive Validation” is also stronger than the evidence supports. Evaluation covers three benchmark families and six transfers. Broader coverage could include the larger MAG benchmark and the structurally different Airport benchmark discussed in GDABench [3], as well as an appropriate ogbn-arxiv temporal-transfer setting. The Citationv1 graph used here is derived from MAG, but is distinct from the MAG benchmark in GDABench. Blog is another relevant benchmark, although its two-domain setup would require an explicit explanation of how it is used to evaluate a multi-source method. The concern is whether the findings generalize across graph sizes and types of structural shift, rather than the absence of any one mandatory dataset. Finally, the paper provides no computational complexity analysis or runtime and memory comparison. COME requires source-model evaluation across multiple graph views, a target-adaptive model, memory-based neighbor retrieval, and expert allocation. The cost of structural probing should be separated from adaptation and prediction costs, with scaling in the number of sources, perturbation views, nodes, and edges. This matters because improvements over GraphATA on the five real-world transfers range from 0.32 to 1.53 percentage points, so the accuracy–efficiency trade-off remains unclear.
[1] Liu et al. Structural Re-weighting Improves Graph Domain Adaptation. ICML, 2023.
[2] Luo et al. Rank and Align: Towards Effective Source-free Graph Domain Adaptation. IJCAI, 2024.
[3] Liu et al. Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation. NeurIPS, 2024.
[4] Luo et al. Sparse Causal Discovery with Generative Intervention for Unsupervised Graph Domain Adaptation. ICML, 2025.
[5] Yang et al. Disentangled Graph Spectral Domain Adaptation. ICML, 2025.
[6] Lin, Zhou, and Shen. Hierarchical graph contrastive domain adaptation for multi-source cross-network node classification. Expert Systems with Applications, 2025.
[7] Fang et al. Homophily Enhanced Graph Domain Adaptation. ICML, 2025.
[8] Fang et al. On the Benefits of Attribute-Driven Graph Domain Adaptation. ICLR, 2025.
[9] Luo et al. Robust Cross Supervision With Target Mining for Source-Free Graph Domain Adaptation. IEEE Transactions on Knowledge and Data Engineering, 2026.
[10] Chen et al. Learning Structure-Semantic Evolution Trajectories for Graph Domain Adaptation. ICLR, 2026.
[11] Chen et al. Learning Adaptive Distribution Alignment with Neural Characteristic Function for Graph Domain Adaptation. ICLR, 2026.
[12] Fang et al. Graph Domain Adaptation via Homophily-Agnostic Reconstructing Structure. AAAI, 2026.
Response to Reviewer EA6q
We thank the reviewer for the careful review, constructive suggestions, and valuable questions about component contributions, parameter sensitivity, and generalizability. We have strengthened the corresponding experiments and explanations as detailed below.
W1 Differences in ablation gains and parameter sensitivity
Thank you for this valuable question. We further investigated the task-dependent contribution of RETP by comparing target predictions before and after expert routing, measuring corrected and introduced errors and the resulting accuracy changes. Routing corrects errors on 6.37% of CSBM-G4 nodes while introducing only 0.88% new errors, improving accuracy from 87.77% to 93.50%. Across all six transfers, routing increases average accuracy from 75.13% to 76.21%. CSBM shows greater sensitivity because changes in within-class and between-class connections directly affect neighborhood aggregation and source-model reliability, while stronger stable-state supervision can amplify incorrect pseudo-labels. Further analysis is provided in Section 4.2 and Appendix D.1, with additional results in Appendices D.5 and D.6.
W2 Limited SMEP gains on Twitch and Citation
Thank you for raising this valuable concern. We further evaluated SMEP across six transfer settings by collecting all target-node–source-model prediction pairs and using AUROC to measure how well source reliability distinguishes correct from incorrect predictions. The results show AUROCs of 67.51% on CSBM and 64.91%–66.30% on Citation, compared with 52.30%–54.23% on Twitch. SMEP also improves average accuracy from 73.88% to 76.21%, with gains of 8.21% on CSBM and 1.57% and 3.04% on DBLPv7 and ACMv9. Further results and analysis are provided in Table 3, Obs. 4, and Obs. 10 of Section 4.2.
W3 Performance degradation beyond two graph layers
Thank you for this helpful comment. We have expanded the explanations in the main text and appendix to clarify the performance degradation with deeper GCNs. As the number of layers increases, repeated neighborhood aggregation mixes information from increasingly distant nodes, including nodes from different classes. This leads to oversmoothing and weakens class discrimination. In contrast, two layers balance neighborhood information and class discrimination, achieving the highest accuracy across all six transfer settings. Further discussion is provided in Section 4.2 and Appendix D.1.
W4 Generalizability of the heuristic scores
We further evaluated the proposed scoring strategies across six transfer settings through controlled comparisons. With view-averaged source predictions fixed, reliability weighting improves average accuracy from 73.07% with equal weighting to 76.21%. Similarly, keeping source and target predictions unchanged, dynamic expert allocation improves average accuracy from 74.07% with fixed fusion to 76.21%. The largest gains occur on DE, where accuracy increases from 61.15% to 68.24%, and CSBM-G4, where it rises from 91.15% to 93.50%. Both strategies improve accuracy across all six transfers, demonstrating their effectiveness across different graph domains. Further results are provided in Section 4.2 and Appendix D.4.