Pith. sign in

REVIEW 2 cited by

Adversarial Attack and Defense on Graph Data: A Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.10528 v4 pith:OKDZAUUB submitted 2018-12-26 cs.CR cs.AIcs.SI

classification cs.CRcs.AIcs.SI
keywords graphadversarialdataattackattacksdefenseanalysisdifferent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep neural networks (DNNs) have been widely applied to various applications, including image classification, text generation, audio recognition, and graph data analysis. However, recent studies have shown that DNNs are vulnerable to adversarial attacks. Though there are several works about adversarial attack and defense strategies on domains such as images and natural language processing, it is still difficult to directly transfer the learned knowledge to graph data due to its representation structure. Given the importance of graph analysis, an increasing number of studies over the past few years have attempted to analyze the robustness of machine learning models on graph data. Nevertheless, existing research considering adversarial behaviors on graph data often focuses on specific types of attacks with certain assumptions. In addition, each work proposes its own mathematical formulation, which makes the comparison among different methods difficult. Therefore, this review is intended to provide an overall landscape of more than 100 papers on adversarial attack and defense strategies for graph data, and establish a unified formulation encompassing most graph adversarial learning models. Moreover, we also compare different graph attacks and defenses along with their contributions and limitations, as well as summarize the evaluation metrics, datasets and future trends. We hope this survey can help fill the gap in the literature and facilitate further development of this promising new field.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Under a fixed leakage-free protocol, NC→LP transfer reliably helps on homophilic graphs while LP→NC helps mainly when LP is easy and NC is unsaturated; homophily and CoTask Score guide mechanism choice.

  2. Learning Causality for Modern Machine Learning

    cs.LG 2025-06 conditional novelty 2.0 of 10

    A thesis compiling six papers that use causal invariance to improve graph neural networks' out-of-distribution generalization, interpretability, and robustness.

Pith tools