logo Netzschleuder network catalog, repository, and centrifuge

History of kleinberg_web

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] Remove superfluous details of the upstream distribution from the descriptions by Tiago de Paula Peixoto dc07aa0
The descriptions mentioned incidental details of how the upstream data
are made available: the file formats (CSV, JSON, XML, GEXF, SBML, HIF,
Pajek, UCINET, ...), file names, where the files were published or
obtained from (Zenodo, figshare, Kaggle, the Pajek datasets page, the
Internet Archive), and that some networks are only available in the gt
format. These are left out; caveats about the data themselves are kept,
referring to "the data" instead of "the file". The description of
sp_baboons now lists its properties instead of the upstream columns,
and says that events without a recipient are left out.
diff --git a/entries/kleinberg_web/__init__.py b/entries/kleinberg_web/__init__.py
index 35142e1..f0a2a3b 100644
--- a/entries/kleinberg_web/__init__.py
+++ b/entries/kleinberg_web/__init__.py
@@ -19,7 +19,7 @@
 from .. import *
 
 title = 'Kleinberg web query graphs (1999)'
-description = """Web graphs constructed by J. Kleinberg by expanding the response set of 200 pages returned by a search engine for a query, as in his hub/authority (HITS) algorithm: the root set of pages is expanded with the pages that link to them and the pages they link to. Nodes are web pages, and directed edges are hyperlinks. Many of the pages have no links to or from the other pages in the distributed data, and appear as isolated nodes. The graphs were distributed on Kleinberg's course page (Cornell CS685, 2002), and adapted for Pajek by V. Batagelj (2006). They were used, e.g., by A. N. Langville and C. D. Meyer to study the reordering of the PageRank problem. The data were distributed in Pajek format on the Pajek datasets page of V. Batagelj and A. Mrvar, from which this version was obtained.
+description = """Web graphs constructed by J. Kleinberg by expanding the response set of 200 pages returned by a search engine for a query, as in his hub/authority (HITS) algorithm: the root set of pages is expanded with the pages that link to them and the pages they link to. Nodes are web pages, and directed edges are hyperlinks. Many of the pages have no links to or from the other pages in the data, and appear as isolated nodes. They were used, e.g., by A. N. Langville and C. D. Meyer to study the reordering of the PageRank problem.
 
 - `california`: pages matching the query "California".
 - `epa`: pages linking to www.epa.gov.
[entries] Add the date when each entry was added, and remove icon_hash by Tiago de Paula Peixoto 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/kleinberg_web/__init__.py b/entries/kleinberg_web/__init__.py
index 813d9c5..35142e1 100644
--- a/entries/kleinberg_web/__init__.py
+++ b/entries/kleinberg_web/__init__.py
@@ -31,7 +31,7 @@ tags = ['Informational', 'Web graph', 'Unweighted', 'Metadata']
 url = 'https://web.archive.org/web/20090301185253/http://vlado.fmf.uni-lj.si/pub/networks/data/mix/mixed.htm'
 citation = [('J. M. Kleinberg, "Authoritative sources in a hyperlinked environment." Journal of the ACM 46(5), 604-632 (1999)', 'https://doi.org/10.1145/324133.324140'),
             ('A. N. Langville, C. D. Meyer, "A Reordering for the PageRank Problem." SIAM Journal on Scientific Computing 27(6), 2112-2120 (2006)', 'https://doi.org/10.1137/040607551')]
-icon_hash = '5923357262da63251188ee80'
+date_added = '2026-10-25'
 upstream_license = None
 # The Pajek data site (vlado.fmf.uni-lj.si) is no longer reachable, so the
 # files are obtained from the Internet Archive.
[entries] Prefix the properties in the descriptions with (Node), (Edge) or (Graph) by Tiago de Paula Peixoto 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/kleinberg_web/__init__.py b/entries/kleinberg_web/__init__.py
index e21977c..813d9c5 100644
--- a/entries/kleinberg_web/__init__.py
+++ b/entries/kleinberg_web/__init__.py
@@ -26,7 +26,7 @@ description = """Web graphs constructed by J. Kleinberg by expanding the respons
 
 The networks have the following properties:
 
-- Nodes: `name`, the URL of the page."""
+- (Node) `name`: the URL of the page."""
 tags = ['Informational', 'Web graph', 'Unweighted', 'Metadata']
 url = 'https://web.archive.org/web/20090301185253/http://vlado.fmf.uni-lj.si/pub/networks/data/mix/mixed.htm'
 citation = [('J. M. Kleinberg, "Authoritative sources in a hyperlinked environment." Journal of the ACM 46(5), 604-632 (1999)', 'https://doi.org/10.1145/324133.324140'),
[entries] New entry: kleinberg_web by Tiago de Paula Peixoto aa92c25
diff --git a/entries/kleinberg_web/__init__.py b/entries/kleinberg_web/__init__.py
new file mode 100644
index 0000000..e21977c
--- /dev/null
+++ b/entries/kleinberg_web/__init__.py
@@ -0,0 +1,54 @@
+#! /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 = 'Kleinberg web query graphs (1999)'
+description = """Web graphs constructed by J. Kleinberg by expanding the response set of 200 pages returned by a search engine for a query, as in his hub/authority (HITS) algorithm: the root set of pages is expanded with the pages that link to them and the pages they link to. Nodes are web pages, and directed edges are hyperlinks. Many of the pages have no links to or from the other pages in the distributed data, and appear as isolated nodes. The graphs were distributed on Kleinberg's course page (Cornell CS685, 2002), and adapted for Pajek by V. Batagelj (2006). They were used, e.g., by A. N. Langville and C. D. Meyer to study the reordering of the PageRank problem. The data were distributed in Pajek format on the Pajek datasets page of V. Batagelj and A. Mrvar, from which this version was obtained.
+
+- `california`: pages matching the query "California".
+- `epa`: pages linking to www.epa.gov.
+
+The networks have the following properties:
+
+- Nodes: `name`, the URL of the page."""
+tags = ['Informational', 'Web graph', 'Unweighted', 'Metadata']
+url = 'https://web.archive.org/web/20090301185253/http://vlado.fmf.uni-lj.si/pub/networks/data/mix/mixed.htm'
+citation = [('J. M. Kleinberg, "Authoritative sources in a hyperlinked environment." Journal of the ACM 46(5), 604-632 (1999)', 'https://doi.org/10.1145/324133.324140'),
+            ('A. N. Langville, C. D. Meyer, "A Reordering for the PageRank Problem." SIAM Journal on Scientific Computing 27(6), 2112-2120 (2006)', 'https://doi.org/10.1137/040607551')]
+icon_hash = '5923357262da63251188ee80'
+upstream_license = None
+# The Pajek data site (vlado.fmf.uni-lj.si) is no longer reachable, so the
+# files are obtained from the Internet Archive.
+upstream_prefix = 'https://web.archive.org/web/20090302171457id_/http://vlado.fmf.uni-lj.si/pub/networks/data/web'
+files = [('California.net', 'california', None),
+         ('Epa.net', 'epa', 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):
+    name = __name__.split(".")[-1]
+    for fname, alt, fmt in files:
+        if alts is not None and alt not in alts:
+            continue
+        yield alt, pajek_graph(get_pajek_item(load_pajek(name, fname), "network"))