This is a temporal higher-order network dataset, which here means a sequence of timestamped simplices where each simplex is a set of nodes. In this dataset, nodes are tags and simplices are the sets of tags applied to questions on math.stackexchange.com. The timestamps are recorded at millisecond resolution but are normalized to start at 0. The projected graph is a weighted undirected graph representing how many times each pair of nodes co-appears in a simplex. Some basic statistics of this dataset are:

• number of nodes: 1,629
• number of timestamped simplices: 822,059
• number of unique simplices: 174,933
• number of edges in projected graph: 91,685

Data:

• tags-math-sx.tar.gz (timestamped simplices, node labels, and simplex labels)
• tags-math-sx-proj-graph.tar.gz (weighted projected graph)

If you use this data, please cite the following paper:

• Simplicial closure and higher-order link prediction.
  Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg.
  Proceedings of the National Academy of Sciences (PNAS), 2018. [bibtex]