History of ljournal_2008
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] New entry: ljournal_2008 6d4f711
diff --git a/entries/ljournal_2008/__init__.py b/entries/ljournal_2008/__init__.py
new file mode 100644
index 0000000..dcdbf7a
--- /dev/null
+++ b/entries/ljournal_2008/__init__.py
@@ -0,0 +1,47 @@
+#! /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/>.
+
+from .. import *
+
+title = "LiveJournal friendships (2008)"
+description = """A directed network of declared friendships among users of LiveJournal, a virtual-community site started in 1999 in which members maintain journals and blogs. Nodes are users, and a directed edge from x to y indicates that x registered y among their friends (which does not require the permission of y). This is the 2008 snapshot used by F. Chierichetti et al. in their study of the compression of social networks, which they provided to the Laboratory for Web Algorithmics (LAW). The network has 5,363,260 users and 79,023,142 edges. Nodes are anonymous."""
+tags = ['Social', 'Online', 'Unweighted']
+url = 'http://data.law.di.unimi.it/webdata/ljournal-2008/'
+citation = [('F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan, "On compressing social networks." Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009), 219-228 (2009).', 'https://doi.org/10.1145/1557019.1557049'),
+ ('P. Boldi and S. Vigna, "The WebGraph framework I: compression techniques." Proceedings of the 13th International Conference on World Wide Web (WWW 2004), 595-602 (2004).', 'https://doi.org/10.1145/988672.988752'),
+ ('P. Boldi, M. Rosa, M. Santini, and S. Vigna, "Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks." Proceedings of the 20th International Conference on World Wide Web (WWW 2011), 587-596 (2011).', 'https://doi.org/10.1145/1963405.1963488')]
+icon_hash = '56a85c8e26855e083a2f7935'
+upstream_license = None
+upstream_prefix = 'http://data.law.di.unimi.it/webdata'
+files = [(('ljournal-2008/ljournal-2008.graph', 'ljournal-2008/ljournal-2008.properties'), 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
+ g = law_graph(name, fnames, directed=True)
+ yield alt, g