logo Netzschleuder network catalog, repository, and centrifuge

pgp_strong — PGP web of trust (2009)

Description

Strongly connected component of the Pretty Good Privacy (PGP) web of trust, circa November 2009, assembled by O. Richters and T. P. Peixoto from a dump of the public OpenPGP key servers (key-server.de). Nodes are public keys (which usually correspond to users), and a directed edge $(i,j)$ indicates that the owner of key $i$ signed key $j$, i.e. certified that key $j$ belongs to the person named in it, which is an expression of trust. Only the largest strongly connected component is included.

The network has the following properties:

  • id: the key ID (64-bit, in hexadecimal).
  • uid: the primary user ID of the key (usually a name and an email address).
  • subkeys: the IDs of the subkeys of the key.
  • date: the creation time of the key (Unix time).
  • expire_date, rev_date: the expiration and revocation times of the key (Unix time), or $2^{63}-1$ if the key does not expire or was not revoked.
  • valid: whether the key is valid.
  • s: an undocumented integer label of the node.
  • vb, eb: the betweenness centrality of the node and of the edge.
  • e_id: the IDs of the keys that issued the signatures of the edge (the signing key or one of its subkeys), separated by commas; an edge can correspond to several signatures.
  • e_time: the creation times of the signatures of the edge (Unix time).
Tags
Social Online Unweighted
Citation
Upstream URL OK
https://git.skewed.de/count0/graph-tool/-/raw/master/src/graph_tool/collection/pgp-strong-2009.gt.gz
Networks
Tip: hover over a column header for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
pgp_strong 39,796 301,498 7.58 36.51 101.60 6430.29 0.03 0.29 21 1.00 Directed Unipartite valid vb uid rev_date s subkeys expire_date id date e_id e_time eb 7.2 MiB 9.7 MiB 9.5 MiB 10.4 MiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.