Unblackboxing the Foundational GCN-GRU Detector: Topology, Short-Term Patterns, and Long-Term History

AddGraph [1] is the foundational method for anomaly detection in dynamic graphs that combines a Graph Convolutional Network (GCN) for structural encoding with a contextual attention-based GRU for temporal integration. Despite its significance as the first and most widely cited GCN+GRU anomaly detection framework, AddGraph has not been equipped with any form of explainability. When AddGraph flags an edge as anomalous, it produces a score but no rationale: an analyst cannot determine whether the anomaly is driven by the current structural neighborhood, by a specific short-term temporal window, or by long-term historical memory encoded in the GRU. This opacity makes AddGraph operationally unusable in regulated environments where decisions must be justified. We present X-AddGraph, a post-hoc explainability framework for AddGraph, and to our knowledge the first for any GCN+GRU dynamic graph anomaly detection method. X-AddGraph introduces a three-component Dual Spatial-Temporal Attribution (DSTA) mechanism that simultaneously answers three distinct questions about every flagged anomaly: (1) Which structural neighbors in the current snapshot drove the anomaly score, via Integrated Gradients on the GCN adjacency mask? (2) Which short-term timestep in the attention window was most suspicious, via the CAB attention weights already computed during inference? (3) Which long-term historical snapshot contributed most to the GRU memory, via gradient backpropagation through GRU hidden states? The three attributions are combined into a unified anomaly explanation triplet per flagged edge. X-AddGraph is strictly posthoc: it requires no modification to AddGraph’s training, weights, or inference pipeline, adding only two targeted backward passes per flagged anomaly. We evaluate X-AddGraph on the UCI Message and Digg benchmark datasets, demonstrating that the spatial attribution is sufficient to reproduce anomaly decisions (Fidelity+ = 1.00) and that detection AUC is preserved exactly by post-hoc construction.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-26
DOI
https://doi.org/10.5281/zenodo.22113839
Primary Topic
Advanced Graph Neural Networks
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Unblackboxing the Foundational GCN-GRU Detector: Topology, Short-Term Patterns, and Long-Term History

Hamida Seba, Karima Amrouche, Walid-Khaled Hidouci, Iyad Assaad Nekka
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Neural Networks
preprint

Unblackboxing the Foundational GCN-GRU Detector: Topology, Short-Term Patterns, and Long-Term History

Hamida Seba, Karima Amrouche, Walid-Khaled Hidouci, Iyad Assaad Nekka
preprint en

Abstract

AddGraph [1] is the foundational method for anomaly detection in dynamic graphs that combines a Graph Convolutional Network (GCN) for structural encoding with a contextual attention-based GRU for temporal integration. Despite its significance as the first and most widely cited GCN+GRU anomaly detection framework, AddGraph has not been equipped with any form of explainability. When AddGraph flags an edge as anomalous, it produces a score but no rationale: an analyst cannot determine whether the anomaly is driven by the current structural neighborhood, by a specific short-term temporal window, or by long-term historical memory encoded in the GRU. This opacity makes AddGraph operationally unusable in regulated environments where decisions must be justified. We present X-AddGraph, a post-hoc explainability framework for AddGraph, and to our knowledge the first for any GCN+GRU dynamic graph anomaly detection method. X-AddGraph introduces a three-component Dual Spatial-Temporal Attribution (DSTA) mechanism that simultaneously answers three distinct questions about every flagged anomaly: (1) Which structural neighbors in the current snapshot drove the anomaly score, via Integrated Gradients on the GCN adjacency mask? (2) Which short-term timestep in the attention window was most suspicious, via the CAB attention weights already computed during inference? (3) Which long-term historical snapshot contributed most to the GRU memory, via gradient backpropagation through GRU hidden states? The three attributions are combined into a unified anomaly explanation triplet per flagged edge. X-AddGraph is strictly posthoc: it requires no modification to AddGraph’s training, weights, or inference pipeline, adding only two targeted backward passes per flagged anomaly. We evaluate X-AddGraph on the UCI Message and Digg benchmark datasets, demonstrating that the spatial attribution is sufficient to reproduce anomaly decisions (Fidelity+ = 1.00) and that detection AUC is preserved exactly by post-hoc construction.

Zenodo (CERN European Organization for Nuclear Research)
Université Claude Bernard Lyon 1 (FR), Lyon College (US), École Nationale Supérieure d'Informatique (DZ)
Peace, Justice and strong institutions
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.