English

DRGW: Learning Disentangled Representations for Robust Graph Watermarking

Machine Learning 2026-01-22 v2 Cryptography and Security

Abstract

Graph-structured data is foundational to numerous web applications, and watermarking is crucial for protecting their intellectual property and ensuring data provenance. Existing watermarking methods primarily operate on graph structures or entangled graph representations, which compromise the transparency and robustness of watermarks due to the information coupling in representing graphs and uncontrollable discretization in transforming continuous numerical representations into graph structures. This motivates us to propose DRGW, the first graph watermarking framework that addresses these issues through disentangled representation learning. Specifically, we design an adversarially trained encoder that learns an invariant structural representation against diverse perturbations and derives a statistically independent watermark carrier, ensuring both robustness and transparency of watermarks. Meanwhile, we devise a graph-aware invertible neural network to provide a lossless channel for watermark embedding and extraction, guaranteeing high detectability and transparency of watermarks. Additionally, we develop a structure-aware editor that resolves the issue of latent modifications into discrete graph edits, ensuring robustness against structural perturbations. Experiments on diverse benchmark datasets demonstrate the superior effectiveness of DRGW.

Keywords

Cite

@article{arxiv.2601.13569,
  title  = {DRGW: Learning Disentangled Representations for Robust Graph Watermarking},
  author = {Jiasen Li and Yanwei Liu and Zhuoyi Shang and Xiaoyan Gu and Weiping Wang},
  journal= {arXiv preprint arXiv:2601.13569},
  year   = {2026}
}

Comments

Published at The Web Conference 2026 (WWW '26)

R2 v1 2026-07-01T09:11:46.895Z