History of dblp_simplices

The changes to the source code of this entry in the repository, newest first, each with the differences it made to the entry's files. They are also listed on GitLab.

2026-10-25 [entries] Fix parse bugs and improve descriptions and metadata by Tiago de Paula Peixoto 6bb6851

- parse fixes from the review of the descriptions, e.g. us_patents
  (directed), celegans_2019 (synapse direction), ecoli_transcription and
  yeast_transcription (regulator to target), bitcoin (direction, phantom
  node), ego_social (Google+ features and circles), scotus_majority,
  arxiv_authors and social_location (as in SNAP), caida_as, dnc, dom,
  mist, reuters and bibsonomy (names on the right nodes), uci_zoo
- every description now states explicitly what the nodes and edges
  represent; corrected titles, years, tags, citations and licences
- the "Hypergraph" tag is removed; very large entries are marked
  `huge = True` (see --skip-huge)
- ICON ids of partial duplicates added (hiv_transmission, congress_bills,
  openflights, dutch_school)

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index 8805d4e..5947ac0 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -19,7 +19,7 @@
 from .. import *
 
 title = "DBLP coauthor simplices (2017)"
-description = """A temporal hypergraph of co-authorship among computer scientists, constructed by A. R. Benson and collaborators from the DBLP computer science bibliography, as of 3 September 2017. Each publication is a simplex (hyperedge) formed by the set of its authors, and is timestamped with the year of publication. The networks are named `<dataset>-<representation>`, where the dataset is either `full`, with all publications, or `max-25`, restricted to publications with at most 25 authors, and the representation is one of:
+description = """A temporal bipartite network of co-authorship among computer scientists, constructed by A. R. Benson and collaborators from the DBLP computer science bibliography, as of 3 September 2017. Each publication is a simplex formed by the set of its authors, and is timestamped with the year of publication. The networks are named `<dataset>-<representation>`, where the dataset is either `full`, with all publications, or `max-25`, restricted to publications with at most 25 authors, and the representation is one of:
 
 - `bip`: a bipartite network of publications and authors, in which each publication is connected to each of its authors. Publication nodes come first, followed by the author nodes.
 - `proj`: the one-mode projection onto the authors, where each publication adds an edge between every pair of its authors, so that pairs of authors who wrote several papers together are connected by multiple parallel edges, one for each paper. Publications with a single author do not contribute edges.
@@ -28,7 +28,7 @@ The networks have the following properties:
 
 - Nodes: `label`, the name of the author (empty for publication nodes); `is_simplex` (`bip` only), whether the node is a publication (otherwise an author).
 - Edges: `time`, the year of the publication."""
-tags = ['Social', 'Collaboration', 'Unweighted', 'Timestamps', 'Hypergraph', 'Weighted', 'Projection']
+tags = ['Social', 'Collaboration', 'Unweighted', 'Timestamps', 'Weighted', 'Projection']
 url = 'http://www.cs.cornell.edu/~arb/data/coauth-DBLP/index.html'
 citation = [('A. R. Benson et al., "Simplicial Closure and Higher-order Link Prediction." Preprint, arXiv:1802.06916 (2018)', 'https://arxiv.org/abs/1802.06916')]
 icon_hash = '5b4f74d2dfd5c2fc3b0716be'

2026-10-25 [entries] Fix parse bugs and improve the metadata of existing entries by Tiago de Paula Peixoto c996a0e

From a review of the dataset descriptions against the upstream sources
and papers, and from user reports:

- parse fixes (wrong edge direction or directedness, shifted or
  misnamed properties, merged node identities, duplicated or missing
  edges and nodes, wrong types), e.g. arxiv_citation (the HepTh dates
  were a copy of the HepPh ones; now from the KDD Cup 2003 data),
  eu_procurements, foursquare_global, hiv_transmission, genetic_multiplex,
  gnutella (adds the 05 snapshot), roadnet, macaque_neural, python_dependency
- descriptions rewritten from the upstream sources, documenting every
  property
- corrected titles, citations and DOIs, licences (ustream_license typo,
  the data's own terms), tags and ICON ids
- url lists for entries with several sources or dataset pages
- SocioPatterns entries moved to the site's new data location, with the
  daily networks of sp_infectious and sp_primary_school
- the Michael Fire entries marked as orphans (served from the mirror)
- redundant type forcings removed after the graph-tool coercion fixes

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index 47a149c..8805d4e 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -19,13 +19,20 @@
 from .. import *
 
 title = "DBLP coauthor simplices (2017)"
-description = """A hypergraph representing collaborations among authors listed in DBLP, the computer science bibliographic database, as of 3 Sept. 2017. Each node represents an author, and each publication is represented by a simplex (a set of nodes, i.e., a hyperedge), timestamped by the year of publication. In addition to the hypergraph, a weighted projection of the same network is available.[^icon]
-[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
+description = """A temporal hypergraph of co-authorship among computer scientists, constructed by A. R. Benson and collaborators from the DBLP computer science bibliography, as of 3 September 2017. Each publication is a simplex (hyperedge) formed by the set of its authors, and is timestamped with the year of publication. The networks are named `<dataset>-<representation>`, where the dataset is either `full`, with all publications, or `max-25`, restricted to publications with at most 25 authors, and the representation is one of:
+
+- `bip`: a bipartite network of publications and authors, in which each publication is connected to each of its authors. Publication nodes come first, followed by the author nodes.
+- `proj`: the one-mode projection onto the authors, where each publication adds an edge between every pair of its authors, so that pairs of authors who wrote several papers together are connected by multiple parallel edges, one for each paper. Publications with a single author do not contribute edges.
+
+The networks have the following properties:
+
+- Nodes: `label`, the name of the author (empty for publication nodes); `is_simplex` (`bip` only), whether the node is a publication (otherwise an author).
+- Edges: `time`, the year of the publication."""
 tags = ['Social', 'Collaboration', 'Unweighted', 'Timestamps', 'Hypergraph', 'Weighted', 'Projection']
 url = 'http://www.cs.cornell.edu/~arb/data/coauth-DBLP/index.html'
 citation = [('A. R. Benson et al., "Simplicial Closure and Higher-order Link Prediction." Preprint, arXiv:1802.06916 (2018)', 'https://arxiv.org/abs/1802.06916')]
 icon_hash = '5b4f74d2dfd5c2fc3b0716be'
-ustream_license = None
+upstream_license = None
 upstream_prefix = 'gdrive://'
 files = [(('15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-nverts.txt',
            '15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-times.txt',

2026-10-24 Update copyright information by Tiago de Paula Peixoto 73a4f0d

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index 182f144..47a149c 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -1,7 +1,7 @@
 #! /usr/bin/env python
 # -*- coding: utf-8 -*-
 #
-# Copyright (C) 2020-2024 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2026 Tiago de Paula Peixoto <tiago@skewed.de>
 #
 # This program is free software: you can redistribute it and/or modify it under
 # the terms of the GNU Affero General Public License as published by the Free

2024-05-27 Update copyright information by Tiago de Paula Peixoto 3d288ea

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index 0d3ee90..182f144 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -1,7 +1,7 @@
 #! /usr/bin/env python
 # -*- coding: utf-8 -*-
 #
-# Copyright (C) 2020-2023 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2024 Tiago de Paula Peixoto <tiago@skewed.de>
 #
 # This program is free software: you can redistribute it and/or modify it under
 # the terms of the GNU Affero General Public License as published by the Free

2023-02-19 Update copyright information by Tiago de Paula Peixoto 8d005ae

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index 9308196..0d3ee90 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -1,7 +1,7 @@
 #! /usr/bin/env python
 # -*- coding: utf-8 -*-
 #
-# Copyright (C) 2021 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2023 Tiago de Paula Peixoto <tiago@skewed.de>
 #
 # This program is free software: you can redistribute it and/or modify it under
 # the terms of the GNU Affero General Public License as published by the Free

2021-06-22 Update copyright info by Tiago de Paula Peixoto db2efcc

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index 8a7be44..9308196 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -1,7 +1,7 @@
 #! /usr/bin/env python
 # -*- coding: utf-8 -*-
 #
-# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2021 Tiago de Paula Peixoto <tiago@skewed.de>
 #
 # This program is free software: you can redistribute it and/or modify it under
 # the terms of the GNU Affero General Public License as published by the Free

2020-09-15 Change license from GPLv3 to AGPLv3 by Tiago de Paula Peixoto d754be5

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index c719211..8a7be44 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -3,18 +3,18 @@
 #
 # Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
 #
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
+# This program is free software: you can redistribute it and/or modify it under
+# the terms of the GNU Affero General Public License as published by the Free
+# Software Foundation, either version 3 of the License, or (at your option) any
+# later version.
 #
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
+# This program is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE.  See the GNU Affero General Public License for more
+# details.
 #
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+# You should have received a copy of the GNU Affero General Public License along
+# with this program.  If not, see <http://www.gnu.org/licenses/>.
 
 from .. import *

2020-09-13 Add explicit attribution to descriptions obtained from ICON by Tiago de Paula Peixoto 1645314

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
index 846ee58..c719211 100644
--- a/entries/dblp_simplices/__init__.py
+++ b/entries/dblp_simplices/__init__.py
@@ -19,7 +19,8 @@
 from .. import *
 
 title = "DBLP coauthor simplices (2017)"
-description = "A hypergraph representing collaborations among authors listed in DBLP, the computer science bibliographic database, as of 3 Sept. 2017. Each node represents an author, and each publication is represented by a simplex (a set of nodes, i.e., a hyperedge), timestamped by the year of publication. In addition to the hypergraph, a weighted projection of the same network is available."
+description = """A hypergraph representing collaborations among authors listed in DBLP, the computer science bibliographic database, as of 3 Sept. 2017. Each node represents an author, and each publication is represented by a simplex (a set of nodes, i.e., a hyperedge), timestamped by the year of publication. In addition to the hypergraph, a weighted projection of the same network is available.[^icon]
+[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
 tags = ['Social', 'Collaboration', 'Unweighted', 'Timestamps', 'Hypergraph', 'Weighted', 'Projection']
 url = 'http://www.cs.cornell.edu/~arb/data/coauth-DBLP/index.html'
 citation = [('A. R. Benson et al., "Simplicial Closure and Higher-order Link Prediction." Preprint, arXiv:1802.06916 (2018)', 'https://arxiv.org/abs/1802.06916')]

2020-08-11 Initial commit by Tiago de Paula Peixoto cc85872

diff --git a/entries/dblp_simplices/__init__.py b/entries/dblp_simplices/__init__.py
new file mode 100644
index 0000000..846ee58
--- /dev/null
+++ b/entries/dblp_simplices/__init__.py
@@ -0,0 +1,98 @@
+#! /usr/bin/env python
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+from .. import *
+
+title = "DBLP coauthor simplices (2017)"
+description = "A hypergraph representing collaborations among authors listed in DBLP, the computer science bibliographic database, as of 3 Sept. 2017. Each node represents an author, and each publication is represented by a simplex (a set of nodes, i.e., a hyperedge), timestamped by the year of publication. In addition to the hypergraph, a weighted projection of the same network is available."
+tags = ['Social', 'Collaboration', 'Unweighted', 'Timestamps', 'Hypergraph', 'Weighted', 'Projection']
+url = 'http://www.cs.cornell.edu/~arb/data/coauth-DBLP/index.html'
+citation = [('A. R. Benson et al., "Simplicial Closure and Higher-order Link Prediction." Preprint, arXiv:1802.06916 (2018)', 'https://arxiv.org/abs/1802.06916')]
+icon_hash = '5b4f74d2dfd5c2fc3b0716be'
+ustream_license = None
+upstream_prefix = 'gdrive://'
+files = [(('15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-nverts.txt',
+           '15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-times.txt',
+           '15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-simplices.txt',
+           '15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-node-labels.txt'), 'max-25-bip', None),
+         (('15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-nverts.txt',
+           '15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-times.txt',
+           '15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-simplices.txt',
+           '15YpIK8vvzQJXyQC4bt-Sz951e4eb0rc_:tar.gz:coauth-DBLP/coauth-DBLP-node-labels.txt'), 'max-25-proj', None),
+         (('1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-nverts.txt',
+           '1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-times.txt',
+           '1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-simplices.txt',
+           '1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-node-labels.txt'), 'full-bip', None),
+         (('1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-nverts.txt',
+           '1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-times.txt',
+           '1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-simplices.txt',
+           '1tC0TdzV_IMTzhkIN_4P8y9M1a3lH-ScK:tar.gz:coauth-DBLP-full/coauth-DBLP-full-node-labels.txt'), 'full-proj', None)]
+
+def fetch_upstream(force=False):
+    return fetch_upstream_files(__name__.split(".")[-1], upstream_prefix, files,
+                                force)
+
+@cache_network()
+@coerce_props()
+@annotate()
+def parse(alts=None):
+    global files
+    name = __name__.split(".")[-1]
+    for fnames, alt, fmt in files:
+        if alts is not None and alt not in alts:
+            continue
+        if isinstance(fnames, str):
+            fnames = [fnames]
+        with ExitStack() as stack:
+            fs = [stack.enter_context(open_upstream_file(name, fn, "r")) for fn in fnames]
+            g = Graph(directed=False)
+
+            g.vp.label = label = g.new_vp("string")
+            g.ep.time = time = g.new_ep("int64_t")
+            names = [" ".join(s.split()[1:]) for s in fs[3]]
+
+            bip = "bip" in alt
+            if bip:
+                g.vp.is_simplex = is_simplex = g.new_vp("bool")
+                n_simplex = 0
+
+            for n_simplex, line in enumerate(fs[0]):
+                pass
+            n_simplex += 1
+            fs[0].seek(0)
+            for s, (n, t) in enumerate(zip(fs[0], fs[1])):
+                n = int(n)
+                t = int(t)
+                vs = []
+                for i in range(n):
+                    vs.append(int(next(fs[2]))-1)
+                if bip:
+                    for v in vs:
+                        e = g.add_edge(s, v + n_simplex, add_missing=True)
+                        time[e] = t
+                        label[v + n_simplex] = names[v]
+                    is_simplex[s] = True
+                else:
+                    for u in vs:
+                        for v in vs:
+                            if v <= u:
+                                continue
+                            e = g.add_edge(u, v, add_missing=True)
+                            time[e] = t
+                        label[u] = names[u]
+        yield alt, g