History of cora_arxiv_dblp
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.
[entries] Add the date when each entry was added, and remove icon_hash beff7c9
The dates are those of the commits that first added the entries' files (2020-08-11 for the entries of the initial commit); renamed entries keep the date of their first name. Changed: none
diff --git a/entries/cora_arxiv_dblp/__init__.py b/entries/cora_arxiv_dblp/__init__.py
index 9826beb..ee7ceae 100644
--- a/entries/cora_arxiv_dblp/__init__.py
+++ b/entries/cora_arxiv_dblp/__init__.py
@@ -40,7 +40,7 @@ The networks have the following properties:
tags = ['Informational', 'Citation', 'Collaboration', 'Unweighted']
url = 'https://wwwlovre.appspot.com/support.jsp'
citation = [('L. Šubelj, M. Bajec, B. Mileva Boshkoska, A. Kastrin, Z. Levnajić, "Quantifying the Consistency of Scientific Databases." PLOS ONE 10(5), e0127390 (2015)', 'https://doi.org/10.1371/journal.pone.0127390')]
-icon_hash = ['589a630fa411221d0e7c67af', '589a6381a411221d0e7c67b0']
+date_added = '2026-10-25'
upstream_license = None
upstream_prefix = 'https://wwwlovre.appspot.com/resources/research/networks/acc'
files = [('Cora-cit', 'cora_cit', True),
[entries] Prefix the properties in the descriptions with (Node), (Edge) or (Graph) bc3dbbd
The lists of properties at the end of the descriptions marked edge properties with "Edge" but left node properties unmarked, or grouped them in "Nodes: `a`, ...; `b`, ..." items, so the kind of a property was often unclear. Every item now starts with (Node), (Edge) or (Graph), followed by the property names, a colon and the explanation, one item per property or group of properties; qualifications (kinds of nodes, networks) follow the names in parentheses. Properties that were only named got a short explanation, and a few items that named the wrong kind of property were corrected.
diff --git a/entries/cora_arxiv_dblp/__init__.py b/entries/cora_arxiv_dblp/__init__.py
index 9024d17..9826beb 100644
--- a/entries/cora_arxiv_dblp/__init__.py
+++ b/entries/cora_arxiv_dblp/__init__.py
@@ -36,7 +36,7 @@ According to the authors, papers and authors neither citing nor cited were disca
The networks have the following properties:
-- Nodes: `name`, the author name (in the normalized form used by the source), or the paper identifier (Cora identifier or arXiv identifier)."""
+- (Node) `name`: the author name (in the normalized form used by the source), or the paper identifier (Cora identifier or arXiv identifier)."""
tags = ['Informational', 'Citation', 'Collaboration', 'Unweighted']
url = 'https://wwwlovre.appspot.com/support.jsp'
citation = [('L. Šubelj, M. Bajec, B. Mileva Boshkoska, A. Kastrin, Z. Levnajić, "Quantifying the Consistency of Scientific Databases." PLOS ONE 10(5), e0127390 (2015)', 'https://doi.org/10.1371/journal.pone.0127390')]
[entries] Remove unneeded code from the entries 2c69f19
Unneeded "global files" statements, unused imports and variables, f-strings without placeholders, duplicate keys in foodweb_little_rock (keeping the order and the values used), and the second definition of get_lines() in twitter_higgs. Nothing changes in the networks or descriptions. Changed: none
diff --git a/entries/cora_arxiv_dblp/__init__.py b/entries/cora_arxiv_dblp/__init__.py
index b0b2fc4..9024d17 100644
--- a/entries/cora_arxiv_dblp/__init__.py
+++ b/entries/cora_arxiv_dblp/__init__.py
@@ -58,7 +58,6 @@ def fetch_upstream(force=False):
@coerce_props()
@annotate()
def parse(alts=None):
- global files
name = __name__.split(".")[-1]
for fname, alt, directed in files:
if alts is not None and alt not in alts:
[entries] New entry: cora_arxiv_dblp 24515ef
diff --git a/entries/cora_arxiv_dblp/__init__.py b/entries/cora_arxiv_dblp/__init__.py
new file mode 100644
index 0000000..b0b2fc4
--- /dev/null
+++ b/entries/cora_arxiv_dblp/__init__.py
@@ -0,0 +1,85 @@
+#! /usr/bin/env python
+# -*- coding: utf-8 -*-
+#
+# 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
+# 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 Affero General Public License for more
+# details.
+#
+# 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/>.
+
+import re
+from .. import *
+
+title = "Cora, arXiv and DBLP bibliometric networks (1992-2014)"
+description = """Paper citation, author citation and co-authorship networks constructed by Šubelj, Bajec, Mileva Boshkoska, Kastrin and Levnajić from three bibliographic databases, to study the consistency among scientific databases. From each database, the following networks were constructed:
+
+- Paper citation (`*_cit`, directed): nodes are papers, and a directed edge means that one paper cites another.
+- Author citation (`*_act`, directed): nodes are authors, and a directed edge means that an author cites another author in at least one of their papers.
+- Co-authorship (`*_acl`, undirected): nodes are authors, and an edge means that two authors co-authored at least one paper.
+
+The databases are:
+
+- `cora_*`: the Cora computer science research paper search engine, which collected publication records from the websites of computer science departments at major universities in August 1998 (195,950 papers, 24,911 authors and 623,287 citations).
+- `arxiv_*`: the arXiv High Energy Physics Theory category, between 1992 and 2003 (27,770 papers and 12,820 authors), as distributed by SNAP. The corresponding paper citation network is available separately (see the `arxiv_citation` entry, `HepTh` network).
+- `dblp_act`: the DBLP Computer Science Bibliography, as of September 2014 (1,424,895 authors). Only the author citation network is available. Citation information in DBLP is scarce, so that only about 15 thousand of the authors are connected by citations; the remaining authors are isolated nodes.
+
+According to the authors, papers and authors neither citing nor cited were discarded, together with authors not collaborating, and self-citations of papers that occur due to errors were discarded; however, the distributed author networks include all authors of each database, which leaves some isolated nodes. The `cora_cit` network contains repeated edges.
+
+The networks have the following properties:
+
+- Nodes: `name`, the author name (in the normalized form used by the source), or the paper identifier (Cora identifier or arXiv identifier)."""
+tags = ['Informational', 'Citation', 'Collaboration', 'Unweighted']
+url = 'https://wwwlovre.appspot.com/support.jsp'
+citation = [('L. Šubelj, M. Bajec, B. Mileva Boshkoska, A. Kastrin, Z. Levnajić, "Quantifying the Consistency of Scientific Databases." PLOS ONE 10(5), e0127390 (2015)', 'https://doi.org/10.1371/journal.pone.0127390')]
+icon_hash = ['589a630fa411221d0e7c67af', '589a6381a411221d0e7c67b0']
+upstream_license = None
+upstream_prefix = 'https://wwwlovre.appspot.com/resources/research/networks/acc'
+files = [('Cora-cit', 'cora_cit', True),
+ ('Cora-act', 'cora_act', True),
+ ('Cora-acl', 'cora_acl', False),
+ ('arXiv-act', 'arxiv_act', True),
+ ('arXiv-acl', 'arxiv_acl', False),
+ ('DBLP.zip:DBLP-act', 'dblp_act', True)]
+
+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 fname, alt, directed in files:
+ if alts is not None and alt not in alts:
+ continue
+ g = Graph(directed=directed)
+ g.vp.name = g.new_vp("string")
+ edges = []
+ with open_upstream_file(name, fname, "r") as f:
+ for line in f:
+ if line.startswith("#"):
+ m = re.match(r'# (\d+) nodes', line)
+ if m:
+ g.add_vertex(int(m.group(1)))
+ m = re.match(r'# (\d+) "(.*)"\s*$', line)
+ if m:
+ g.vp.name[int(m.group(1)) - 1] = m.group(2)
+ continue
+ vals = line.split()
+ if len(vals) >= 2:
+ edges.append((int(vals[0]) - 1, int(vals[1]) - 1))
+ n = g.num_vertices()
+ g.add_edge_list(edges)
+ assert g.num_vertices() == n
+ yield alt, g