History of wiki_rfa
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] Fix parse bugs and improve descriptions and metadata 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/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index 8a78822..186f452 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__init__.py
@@ -19,13 +19,21 @@
from .. import *
title = "Wikipedia RfA voting network (2013)"
-description = """The set of all votes on Requests for Adminships (RfA), from 2003 to May 2013, represented as a directed, signed network in which nodes represent Wikipedia members and edges represent votes.[^icon]
-[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
+description = r"""Network of the votes in the elections for adminship of the English Wikipedia (Requests for Adminship, RfA), from 2003 to May 2013, collected by R. West, H. S. Paskov, J. Leskovec and C. Potts. To become an administrator, a Wikipedia user (or another user on their behalf) submits a request, and members of the community vote in favor, against or neutrally, usually with a short comment. Nodes are users, and a directed edge $i \to j$ is a vote cast by user $i$ in an election of candidate $j$. A user can vote in several elections of the same candidate, so that there can be parallel edges.
+
+The network has the following properties:
+
+- `name`: the Wikipedia user name. In about 1,700 votes the voter's name is missing in the upstream data (as are the date and the comment); each of these votes is assigned to a separate node with an empty name.
+- `vote`: the vote: $1$ (support), $0$ (neutral) or $-1$ (oppose).
+- `result`: the outcome of the election: $1$ (the candidate was promoted) or $-1$ (not promoted).
+- `year`: the year of the election.
+- `date`: the date and time of the vote, as text (e.g. `23:13, 19 April 2013`).
+- `txt`: the comment accompanying the vote, in Wikipedia markup."""
tags = ['Social', 'Relationships', 'Signed']
url = 'http://snap.stanford.edu/data/wiki-RfA.html'
citation = [('R. West, H. S. Paskov, J. Leskovec, and C. Potts, "Exploiting Social Network Structure for Person-to-Person Sentiment Analysis." Trans. of the Assoc. for Comp. Ling. 2, 297-310 (2014). arxiv:1409.2450', 'https://doi.org/10.1162/tacl_a_00184')]
icon_hash = '56a85c8e26855e083a2f78c0'
-ustream_license = None
+upstream_license = None
upstream_prefix = 'https://snap.stanford.edu/data'
files = [('wiki-RfA.txt.gz', None, None)]
@@ -55,6 +63,10 @@ def parse(alts=None):
g.ep.date = g.new_ep("string")
g.ep.txt = g.new_ep("string")
+ # about 1,700 votes have no voter name (nor date or comment) in
+ # the upstream data; each of them is assigned to a separate node
+ # with an empty name, since the voters are unknown
+ anon = set()
def edges():
rec = {}
for line in fs[0]:
@@ -64,10 +76,17 @@ def parse(alts=None):
rec[k] = v.strip()
if k == "TXT":
- yield [rec[k] for k in ["SRC", "TGT", "VOT", "RES", "YEA", "DAT", "TXT"]]
+ row = [rec[k] for k in ["SRC", "TGT", "VOT", "RES", "YEA", "DAT", "TXT"]]
+ if row[0] == "":
+ row[0] = f"\0anonymous-{len(anon)}"
+ anon.add(row[0])
+ yield row
g.vp.name = g.add_edge_list(edges(), hashed=True, hash_type="string",
eprops=[g.ep[k] for k in ["vote", "result",
"year", "date",
"txt"]])
+ for v in g.vertices():
+ if g.vp.name[v] in anon:
+ g.vp.name[v] = ""
yield alt, g
Update copyright information 73a4f0d
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index b8f7de2..8a78822 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__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
Update copyright information 3d288ea
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index acc39c2..b8f7de2 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__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
Update copyright information 8d005ae
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index 9ea9001..acc39c2 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__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
Update copyright info db2efcc
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index a848b9a..9ea9001 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__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
Update citations to use DOIs e878874
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index f8d3f89..a848b9a 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__init__.py
@@ -23,7 +23,7 @@ description = """The set of all votes on Requests for Adminships (RfA), from 200
[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
tags = ['Social', 'Relationships', 'Signed']
url = 'http://snap.stanford.edu/data/wiki-RfA.html'
-citation = [('R. West, H. S. Paskov, J. Leskovec, and C. Potts, "Exploiting Social Network Structure for Person-to-Person Sentiment Analysis." Trans. of the Assoc. for Comp. Ling. 2, 297-310 (2014). arxiv:1409.2450', 'http://infolab.stanford.edu/~west1/pubs/West-Paskov-Leskovec-Potts_TACL-14.pdf')]
+citation = [('R. West, H. S. Paskov, J. Leskovec, and C. Potts, "Exploiting Social Network Structure for Person-to-Person Sentiment Analysis." Trans. of the Assoc. for Comp. Ling. 2, 297-310 (2014). arxiv:1409.2450', 'https://doi.org/10.1162/tacl_a_00184')]
icon_hash = '56a85c8e26855e083a2f78c0'
ustream_license = None
upstream_prefix = 'https://snap.stanford.edu/data'
Change license from GPLv3 to AGPLv3 d754be5
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index afc096b..f8d3f89 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__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 *
Add explicit attribution to descriptions obtained from ICON 1645314
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
index bfdbb16..afc096b 100644
--- a/entries/wiki_rfa/__init__.py
+++ b/entries/wiki_rfa/__init__.py
@@ -19,7 +19,8 @@
from .. import *
title = "Wikipedia RfA voting network (2013)"
-description = "The set of all votes on Requests for Adminships (RfA), from 2003 to May 2013, represented as a directed, signed network in which nodes represent Wikipedia members and edges represent votes."
+description = """The set of all votes on Requests for Adminships (RfA), from 2003 to May 2013, represented as a directed, signed network in which nodes represent Wikipedia members and edges represent votes.[^icon]
+[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
tags = ['Social', 'Relationships', 'Signed']
url = 'http://snap.stanford.edu/data/wiki-RfA.html'
citation = [('R. West, H. S. Paskov, J. Leskovec, and C. Potts, "Exploiting Social Network Structure for Person-to-Person Sentiment Analysis." Trans. of the Assoc. for Comp. Ling. 2, 297-310 (2014). arxiv:1409.2450', 'http://infolab.stanford.edu/~west1/pubs/West-Paskov-Leskovec-Potts_TACL-14.pdf')]
add entry: wiki_rfa c66f008
diff --git a/entries/wiki_rfa/__init__.py b/entries/wiki_rfa/__init__.py
new file mode 100644
index 0000000..bfdbb16
--- /dev/null
+++ b/entries/wiki_rfa/__init__.py
@@ -0,0 +1,72 @@
+#! /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 = "Wikipedia RfA voting network (2013)"
+description = "The set of all votes on Requests for Adminships (RfA), from 2003 to May 2013, represented as a directed, signed network in which nodes represent Wikipedia members and edges represent votes."
+tags = ['Social', 'Relationships', 'Signed']
+url = 'http://snap.stanford.edu/data/wiki-RfA.html'
+citation = [('R. West, H. S. Paskov, J. Leskovec, and C. Potts, "Exploiting Social Network Structure for Person-to-Person Sentiment Analysis." Trans. of the Assoc. for Comp. Ling. 2, 297-310 (2014). arxiv:1409.2450', 'http://infolab.stanford.edu/~west1/pubs/West-Paskov-Leskovec-Potts_TACL-14.pdf')]
+icon_hash = '56a85c8e26855e083a2f78c0'
+ustream_license = None
+upstream_prefix = 'https://snap.stanford.edu/data'
+files = [('wiki-RfA.txt.gz', None, 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()
+
+ g.ep.vote = g.new_ep("string")
+ g.ep.result = g.new_ep("string")
+ g.ep.year = g.new_ep("string")
+ g.ep.date = g.new_ep("string")
+ g.ep.txt = g.new_ep("string")
+
+ def edges():
+ rec = {}
+ for line in fs[0]:
+ vals = line.split(":")
+ k = vals[0].strip()
+ v = ":".join(vals[1:])
+ rec[k] = v.strip()
+
+ if k == "TXT":
+ yield [rec[k] for k in ["SRC", "TGT", "VOT", "RES", "YEA", "DAT", "TXT"]]
+
+ g.vp.name = g.add_edge_list(edges(), hashed=True, hash_type="string",
+ eprops=[g.ep[k] for k in ["vote", "result",
+ "year", "date",
+ "txt"]])
+ yield alt, g