Pith. sign in

REVIEW 2 cited by

Attacks on Node Attributes in Graph Neural Networks

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 2402.12426 v2 pith:QOZKVB7U submitted 2024-02-19 cs.SI cs.CRcs.LG

classification cs.SIcs.CRcs.LG
keywords attacksgraphnodeattributesattackdecisiongraphsmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graphs are commonly used to model complex networks prevalent in modern social media and literacy applications. Our research investigates the vulnerability of these graphs through the application of feature based adversarial attacks, focusing on both decision time attacks and poisoning attacks. In contrast to state of the art models like Net Attack and Meta Attack, which target node attributes and graph structure, our study specifically targets node attributes. For our analysis, we utilized the text dataset Hellaswag and graph datasets Cora and CiteSeer, providing a diverse basis for evaluation. Our findings indicate that decision time attacks using Projected Gradient Descent (PGD) are more potent compared to poisoning attacks that employ Mean Node Embeddings and Graph Contrastive Learning strategies. This provides insights for graph data security, pinpointing where graph-based models are most vulnerable and thereby informing the development of stronger defense mechanisms against such attacks.

Discussion (0). Continue with ORCID 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. Attacking Graph Foundation Models Through Their Shared Representation

    cs.AI 2026-07 conditional novelty 6.0 of 10

    A shared representation layer in graph foundation models is a distinct attack surface: input edits break three of six models and one spectral tokenizer is uniquely fragile.

  2. Graph Prompting for Graph Learning Models: Recent Advances and Future Directions

    cs.LG 2025-06 conditional novelty 3.0 of 10

    A survey of graph prompting methods that categorizes them by the stage at which prompts are applied: data, representation, or task.

Pith tools