Figure 4:

Sensitive neighborhood graph. A simple example of a 1-sensitive neighborhood graph, G_S, with $\mathcal{X}=\{1,2,3,4,5\}$, ℓ_1-metric over $\mathcal{X}\times \mathcal{X}$, and (β = 3, r = 1)-anomaly. Note that G_S is an undirected graph; arrowheads indicates the record is added at the end node; the color of the edge corresponds (as per the given color code) to the value of the record added. Further, each database x is represented as a 5-tuple with x_i for $i\in \mathcal{X}$ representing the number of records in x that have value i.