Papers › Rethinking Graph Backdoor Attacks: A Distribution-Preserving Perspective

Rethinking Graph Backdoor Attacks: A Distribution-Preserving Perspective

17 May 2024arXiv:2405.10757archive 2025-07-28

Zhiwei Zhang, Minhua Lin, Enyan Dai, Suhang Wang

Graph Neural Networks (GNNs) have shown remarkable performance in various tasks. However, recent works reveal that GNNs are vulnerable to backdoor attacks. Generally, backdoor attack poisons the graph by attaching backdoor triggers and the target class label to a set of nodes in the training graph. A GNN trained on the poisoned graph will then be misled to predict test nodes attached with trigger to the target class. Despite their effectiveness, our empirical analysis shows that triggers generated by existing methods tend to be out-of-distribution (OOD), which significantly differ from the clean data. Hence, these injected triggers can be easily detected and pruned with widely used outlier detection methods in real-world applications. Therefore, in this paper, we study a novel problem of unnoticeable graph backdoor attacks with in-distribution (ID) triggers. To generate ID triggers, we introduce an OOD detector in conjunction with an adversarial learning strategy to generate the attributes of the triggers within distribution. To ensure a high attack success rate with ID triggers, we introduce novel modules designed to enhance trigger memorization by the victim model trained on poisoned graph. Extensive experiments on real-world datasets demonstrate the effectiveness of the proposed method in generating in distribution triggers that can by-pass various defense strategies while maintaining a high attack success rate.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2405.10757")

Code

Syntology Ran 7 of 7 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 7 ran with no contract checked.

By repository: official repository: 7 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

zzwjames/dpgba officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 7 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7ran

Licence: 7 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zzwjames/dpgba. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

GCNAdjNorm zzwjames/dpgba/DPGBA/run/models/RobustGCN.py official repository ran no licence file found · pointer only · 031697fa4856f0d8 · report
clu_prune_unrelated_edge zzwjames/dpgba/DPGBA/run/help_funcs.py official repository ran no licence file found · pointer only · 17e5f0c32d079478 · report
edge_sim_analysis zzwjames/dpgba/DPGBA/run/help_funcs.py official repository ran no licence file found · pointer only · 6146c5fcef9e81f3 · report
max_norm zzwjames/dpgba/DPGBA/run/heuristic_selection.py official repository ran fingerprinted no licence file found · pointer only · 9f2e2960cd2522f1 · report
obtain_attach_nodes zzwjames/dpgba/DPGBA/run/heuristic_selection.py official repository ran no licence file found · pointer only · d9a8deac302c4489 · report
obtain_attach_nodes_by_cluster zzwjames/dpgba/DPGBA/run/heuristic_selection.py official repository ran no licence file found · pointer only · a3cc7d50b2b12549 · report
prune_unrelated_edge zzwjames/dpgba/DPGBA/run/help_funcs.py official repository ran no licence file found · pointer only · e3c6ff9b9c469f8c · report

Tasks

Backdoor AttackMemorizationOutlier Detection

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections