- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies whether decision boundaries can provide reliable signatures for GNN ownership verification. CITED selects signature nodes using prediction uncertainty, embedding distances, prediction distributions, and neighborhood label disagreement. Verification then compares either the embedding distributions through Wasserstein distance or the predicted labels through label agreement. The experiments cover 7 datasets and 5 GNN architectures, with further studies in the appendix. My main concerns are the selection formulas and the theoretical analysis. Some experimental choices also make the reported gains difficult to interpret.
Critical strengths
The paper addresses a relevant problem, and it is useful to study embedding-level and label-level verification within the same framework.
The verification procedure is straightforward and does not require a separate verification classifier. Figure 2 reports lower inference time than GrOVe in the evaluated embedding-level setting.
The experimental coverage is broad. In addition to the main comparisons, the appendix examines larger graphs, signature removal, adaptive filtering, and signature size. Reporting variation across random seeds is also helpful.
Critical weaknesses
1. Some terms in the selection formulas do not have the stated effect.
In Equation (1), let denote the logit matrix and a node. The paper defines and as the indices of the largest and second-largest logits for node , respectively. The two logit values therefore satisfy , so
As written, the boundary score reduces to its negative-entropy term and does not include the claimed contribution from the logit gap.
In Equation (5), the heterogeneity term takes a maximum over a set. For a fixed maximization set, the maximum is the same for every candidate node. Subtracting a common value cannot change the candidate ranking or the resulting quantile-based selection. The ablation in Table 3 does not resolve the ambiguity: it lacks a margin-plus-thickness control that would isolate the added effect of heterogeneity.
Both issues could be notation errors, but they affect the definition of the signature set. Please provide the implemented expressions and clarify whether the experiments and ablations used the formulas printed in the paper.
2. The current proofs do not establish the claimed bounds.
The proof of Theorem 4.1 in Appendix A.2 relies on an incorrect event implication. Let denote the linear term in the embedding change caused by parameter perturbations, the higher-order remainder, the deterministic bound on the embedding change, and the embedding-distance threshold. Using Euclidean norms, the proof treats
\qquad \|R\|_2\leq\Delta_G-\lambda$$ as sufficient for the total embedding change to satisfy $\|S+R\|_2<\lambda$. The implication fails even with zero remainder, $R=0$. For example, setting the threshold to $\lambda=\Delta_G/4$ and the linear-term norm to $\|S\|_2=\Delta_G/2$ satisfies both premises, but the total embedding change exceeds the threshold. The triangle inequality instead gives the sufficient condition $\|S\|_2+\|R\|_2<\lambda$. The probability bound needs a corrected proof. The proof of Theorem 4.2 in Appendix A.3 has a separate gap. Let $C$ denote the number of classes. The proof first obtains a union bound with coefficient $C$, then drops the negative-tail event for the originally predicted class to obtain $C-1$. A decrease in the originally predicted class's logit can change the prediction even when no competing logit crosses its positive-tail threshold, so the omitted event still matters. A coefficient of $C-1$, corresponding to the competing classes, may be recoverable by bounding pairwise logit differences. However, the argument in the paper does not establish that bound. The same proof assumes that the nonlinear remainder is negligible relative to the classification margin without giving a quantitative condition that relates the two. Small parameter perturbations alone do not justify ignoring the remainder when the margin can be arbitrarily small. The missing condition is especially relevant for a method that selects nodes near the decision boundary. There is also a question of scope. Small perturbations of corresponding parameters do not directly describe independently trained or cross-architecture surrogates. The experiments do compare extracted surrogates with independently trained models, but the theorems do not establish the corresponding separation or a false-positive guarantee. The distinction between parameter stability and ownership verification should be made explicit. **3. The extra fine-tuning needs a matched control.** Appendix E.4 describes 200 epochs of initial training, and Appendix E.5 adds 50 epochs of fine-tuning with the original task labels after signature generation. Appendix E.6 specifies 200 epochs for the baselines. Fine-tuning with the original labels does not by itself imply signature injection, but the extra optimization could explain part of the utility gains in Table 1. The reported training budgets need to be reconciled before attributing those gains to CITED. I would like to see CITED without fine-tuning, ordinary fine-tuning for the same additional 50 epochs, and the full CITED procedure, with utility and verification results under matched training budgets. Please also specify which labeled nodes and data split are used for fine-tuning, whether the fine-tuning objective or sampling depends on the signature set, and whether the signatures remain fixed or are recomputed afterward. **4. The results may depend on the boundary-focused extraction protocol.** Appendix E.2 constructs the query set using 20% boundary samples and 80% randomly selected samples. The protocol is reasonable for one extraction strategy, but it gives the surrogate access to the same type of boundary information that CITED uses for verification. It is therefore unclear how much the verification results depend on this query choice. A random-only query control and a sweep over the boundary-query fraction would help answer the question. Query budgets should be matched, and verification results should be compared at similar surrogate utility, or at least reported separately by utility level. Otherwise, lower verification performance could simply reflect a less successful extraction. Final signature sets selected randomly or by entropy alone, with the same number of nodes, would also help isolate the value of the proposed selection rule. The adaptive-filtering experiments are useful, but filtering an existing query set does not directly answer how verification changes under different initial query strategies. **5. The discussion of label-level fingerprinting is too broad.** Section 3.2 states that fingerprinting does not generalize to label-level verification. However, IPGuard (Cao et al., 2021), which the paper already cites, fingerprints a classifier using inputs near its decision boundary and checks agreement between predicted labels. Label-level boundary verification is therefore an existing idea. The contribution of CITED may lie in graph-specific node selection, neighborhood information, and support for both output levels. I would like the paper to explain those differences more clearly. A graph-adapted boundary-fingerprinting baseline would make the comparison more convincing. If such an adaptation is not appropriate, please explain the specific reason.Questions for authors
-
What are the implemented forms of Equations (1) and (5)? Which formulas were used in the experiments, and how does heterogeneity affect candidate selection?
-
Can the authors correct the proofs of Theorems 4.1 and 4.2, including the missing control of the nonlinear remainder relative to the classification margin? How do the theoretical assumptions relate to the independently trained and cross-architecture surrogates used in the experiments?
-
How do the results change when the additional fine-tuning is controlled for? Which labels are used, does fine-tuning depend on the signature set, and when are the final signatures computed?
-
How does verification change under random-only queries and different boundary-query fractions at matched query budgets and comparable surrogate utility?