Tootfinder

It's lightning talk time at Gophercon! First talk is about using SSA and control flow graphs for finding e.g. session leaks in the Cloud Spanner SDK #GophersUnite

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 31163 nodes and 120029 edges.
Tags: Social, Collaborati…

#FotoVorschlag #ComputerSaysNo

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 5505 nodes and 11719 edges.
Tags: Technological, Communication, Unweighted, Temporal

Among the findings in this new Pew report: Most Americans don’t support AI playing a role in religion. https://www.pewresearch.org/science/2025/09/17/how-americans-view-ai-and-its-impact-on-people-and-society/

the "i am routinely looking at access logs of the static file server for purposes of development" version of "someone's talking about me, my ears are burning!":
someone (no idea who or where) posted a link to https://glasgow-embedded.org/latest/conduct.html

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

Friends Don't Let Friends Make Bad Graphs! Do you agree with the examples of bad graphs and the alternatives Chenxin Li (@chenxinli2.bsky.social) lists at #RStats

GitHub - cxli233/FriendsDontLetFriends: Friends don't let friends make certain types of data visualization - What are they and why are they bad.
Friends don't let friends make certain types of data visualization - What are they and why are they bad. - GitHub - cxli233/FriendsDontLetFriends: Friends don't let friends make certain ty...

Plotted my MacBook Pro's battery usage history based on almost 4 years of coconutBattery data for shits and giggles

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 6235 nodes and 13326 edges.
Tags: Technological, Communication, Unweighted, Temporal

Model-free algorithms for fast node clustering in SBM type graphs and application to social role inference in animals
Bertrand Cloez, Adrien Cotil, Jean-Baptiste Menassol, Nicolas Verzelen
https://arxiv.org/abs/2509.15989

Model-free algorithms for fast node clustering in SBM type graphs and application to social role inference in animals
We propose a novel family of model-free algorithms for node clustering and parameter inference in graphs generated from the Stochastic Block Model (SBM), a fundamental framework in community detection. Drawing inspiration from the Lloyd algorithm for the $k$-means problem, our approach extends to SBMs with general edge weight distributions. We establish the consistency of our estimator under a natural identifiability condition. Through extensive numerical experiments, we benchmark our methods a…

Switched some load-profile graphs I produce from #PNG to #SVG for about an order of magnitude fewer bytes on the wire ... Almost small enough to inline... #frugalComputing

On Website Technicals (2025-09)
Tech updates: note 100, Opus vs MP3, Codeberg, Purrmetrix, AntennaPod, SVG load profiles...

Hab ein paar richtig coole #Logseq Templates von @… gefunden:
https://github.com/wieerwill/logseq_t…

Evading Overlapping Community Detection via Proxy Node Injection
Dario Loi, Matteo Silvestri, Fabrizio Silvestri, Gabriele Tolomei
https://arxiv.org/abs/2509.21211 https://

Evading Overlapping Community Detection via Proxy Node Injection
Protecting privacy in social graphs requires preventing sensitive information, such as community affiliations, from being inferred by graph analysis, without substantially altering the graph topology. We address this through the problem of \emph{community membership hiding} (CMH), which seeks edge modifications that cause a target node to exit its original community, regardless of the detection algorithm employed. Prior work has focused on non-overlapping community detection, where trivial stra…

When I am King, all graphs will be required to use the label "lots" along the Y-axis.
https://mastodon.gamedev.place/@eniko/115373539503634831

Eniko Fox (@eniko@mastodon.gamedev.place)
Attached: 1 image people will be like "i've got the summer flu" and this is the wastewater graph for their area

#ScribesAndMakers - 10 Oct. Shameless self-promotion day.
Neat demos of incremental/pseudoinfinite PCG ideas:
https://cs.wellesley.edu/~pmwh/labyrinfinite/
https://cs.wellesley.edu/~pmwh/effervescent/
https://cs.wellesley.edu/~pmwh/hydrodendron/
Incremental reversible RNG library for PCG:
https://cs.wellesley.edu/~pmwh/anarchy
Exploration graphs library:
https://pypi.org/project/exploration/
With visualizer:
https://cs.wellesley.edu/~pmwh/mvmap/egviewer/explorationViewer/viewer
Not quite final form but playable pseudoinfinite minesweeper game:
https://cs.wellesley.edu/~pmwh/chlorophyll/

I've added another script to my bikeStats Python scripts. It's all pretty simple stuff, but maybe someone will find it useful.
I need to clean up and release all the bike mapping GPX stuff I've been working on lately as well.
https://codeberg.org/raster/milesBiked

milesBiked
A Python script to make bar graphs showing how many miles I've biked...

Efficient Learning-based Graph Simulation for Temporal Graphs
Sheng Xiang, Chenhao Xu, Dawei Cheng, Xiaoyang Wang, Ying Zhang
https://arxiv.org/abs/2510.05569 https://

Efficient Learning-based Graph Simulation for Temporal Graphs
Graph simulation has recently received a surge of attention in graph processing and analytics. In real-life applications, e.g. social science, biology, and chemistry, many graphs are composed of a series of evolving graphs (i.e., temporal graphs). While most of the existing graph generators focus on static graphs, the temporal information of the graphs is ignored. In this paper, we focus on simulating temporal graphs, which aim to reproduce the structural and temporal properties of the observed…

Whee #KDEnlive is available for macOS and even Apple Silicon CPUs. During Project Rendering it seems make use of all the CPU core at least. Not the GPU though.

https://kdenlive.org

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

r-charts.com provides example code for a variety of chart types, both in base R and ggplot: #rstats #ggplot…

R CHARTS | A collection of charts and graphs made with the R programming language
Over 1400 graphs with reproducible code divided in 8 big categories and over 50 chart types, in addition of tools to choose and create colors and color palettes

So many dickish posts from people “welcoming” Bluesky users while making “how could you not see this coming” jokes etc.
Really the very reason why one wouldn’t want to be on mastodon on full display.
It’s also just fake and mainly self indulgence because non of the fediverse graphs actually shows even any significant uptick in active users.

Open PhD/Junior Researcher Position in Neurosymbolic AI and Information Extraction on historical documents at FIZ Karlsruhe - Knowledge-driven AI research group (former ISE research group), starting at Jan 1, 2026.
Application Deadline: Oct 31, 2025
https://www.fiz-karlsruhe.de/en/stellenan…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

Visualize dependencies between functions: #rstats

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

Diameter Bounds for Friends-and-Strangers Graphs
Amogh Akella, Rupert Li
https://arxiv.org/abs/2509.23511 https://arxiv.org/pdf/2509.23511

Diameter Bounds for Friends-and-Strangers Graphs
Consider two $n$-vertex graphs $X$ and $Y$, where we interpret $X$ as a social network with edges representing friendships and $Y$ as a movement graph with edges representing adjacent positions. The friends-and-strangers graph $\mathsf{FS}(X,Y)$ is a graph on the $n!$ permutations $V(X)\to V(Y)$, where two configurations are adjacent if and only if one can be obtained from the other by swapping two friends located on adjacent positions. Friends-and-strangers graphs were first introduced by De…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 15 nodes and 50 edges.
Tags: Social, Fictional, Weighted

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 22706 nodes and 92826 edges.
Tags: Technological, Communication, Unweighted, Temporal

SIGMUS: Semantic Integration for Knowledge Graphs in Multimodal Urban Spaces
Brian Wang, Mani Srivastava
https://arxiv.org/abs/2509.00287 https://arxiv.org…

SIGMUS: Semantic Integration for Knowledge Graphs in Multimodal Urban Spaces
Modern urban spaces are equipped with an increasingly diverse set of sensors, all producing an abundance of multimodal data. Such multimodal data can be used to identify and reason about important incidents occurring in urban landscapes, such as major emergencies, cultural and social events, as well as natural disasters. However, such data may be fragmented over several sources and difficult to integrate due to the reliance on human-driven reasoning for identifying relationships between the mul…

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3752 nodes and 7449 edges.
Tags: Technological, Communication, Unweighted, Temporal

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…

Wow, the #benchmark|s of the #rack compatible #Ruby webserver #Itsi look amazing!

Revisiting Node Affinity Prediction in Temporal Graphs
Krishna Sri Ipsit Mantri, Or Feldman, Moshe Eliasof, Chaim Baskin
https://arxiv.org/abs/2510.06940 https://

Revisiting Node Affinity Prediction in Temporal Graphs
Node affinity prediction is a common task that is widely used in temporal graph learning with applications in social and financial networks, recommender systems, and more. Recent works have addressed this task by adapting state-of-the-art dynamic link property prediction models to node affinity prediction. However, simple heuristics, such as Persistent Forecast or Moving Average, outperform these models. In this work, we analyze the challenges in training current Temporal Graph Neural Networks …

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 27 nodes and 96 edges.
Tags: Social, Fictional, Weighted

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 33 nodes and 61 edges.
Tags: Social, Fictional, Weighted

Crosslisted article(s) found for cs.SI. https://arxiv.org/list/cs.SI/new
[1/1]:
- Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
Danila Valko, Rohan Paranjpe, Jorge Marx G\'omez

Stability and Robustness of Time-Varying Opinion Dynamics: A Graph-Theoretic Approach
M. Hossein Abedinzadeh, Emrah Akyol
https://arxiv.org/abs/2510.01580 https://

Stability and Robustness of Time-Varying Opinion Dynamics: A Graph-Theoretic Approach
We study the stability of opinion dynamics in the time-varying Friedkin-Johnsen (TVFJ) model, which captures both persistent individual biases and adaptive social influence. We introduce two temporal structures, defected temporal graphs (DTGs) and weakly defected temporal graphs (WDTGs), that serve as graph-theoretic certificates linking stubborn influence and temporal connectivity to contraction of the state-transition matrix. Using these tools, we prove asymptotic stability of TVFJ dynamics u…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

Chordless cycle filtrations for dimensionality detection in complex networks via topological data analysis
Aina Ferr\`a Marc\'us, Robert Jankowski, Meritxell Vila Mi\~nana, Carles Casacuberta, M. \'Angeles Serrano
https://arxiv.org/abs/2509.08350

Chordless cycle filtrations for dimensionality detection in complex networks via topological data analysis
Many complex networks, ranging from social to biological systems, exhibit structural patterns consistent with an underlying hyperbolic geometry. Revealing the dimensionality of this latent space can disentangle the structural complexity of communities, impact efficient network navigation, and fundamentally shape connectivity and system behavior. We introduce a novel topological data analysis weighting scheme for graphs, based on chordless cycles, aimed at estimating the dimensionality of networ…

Hybrid Quantum-Classical Walks for Graph Representation Learning in Community Detection
Adri\'an Mar{\i}n, Mauricio Soto-Gomez, Giorgio Valentini, Elena Casiraghi, Carlos Cano, Daniel Manzano
https://arxiv.org/abs/2510.01918

Hybrid Quantum-Classical Walks for Graph Representation Learning in Community Detection
Graph Representation Learning (GRL) has emerged as a cornerstone technique for analysing complex, networked data across diverse domains, including biological systems, social networks, and data analysis. Traditional GRL methods often struggle to capture intricate relationships within complex graphs, particularly those exhibiting non-trivial structural properties such as power-law distributions or hierarchical structures. This paper introduces a novel quantum-inspired algorithm for GRL, utilizing…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 24454 nodes and 99660 edges.
Tags: Technological, Communication, Unweighted, Temporal

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 21245 nodes and 84962 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4776 nodes and 9866 edges.
Tags: Technological, Communication, Unweighted, Temporal

Replaced article(s) found for cs.SI. https://arxiv.org/list/cs.SI/new
[1/1]:
- Top-r Influential Community Search in Bipartite Graphs
Yanxin Zhang, Zhengyu Hua, Long Yuan, Zi Chen

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 40 nodes and 188 edges.
Tags: Social, Fictional, Weighted

The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
Jiajun Ning, Xian'an Jin, Meiqiao Zhang
https://arxiv.org/abs/2509.03144

The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
Inspired by the spread of information in social networks and graph-theoretic processes such as Firefighting and graph cleaning, Bonato, Janssen and Roshanbin introduced in 2016 the burning number $b(G)$ of any finite graph $G$. They conjectured that $b(G)\le \lceil n^\frac{1}{2}\rceil$ holds for all connected graphs $G$ of order $n$, and observed that it suffices to prove the conjecture for all trees. In 2024, Murakami confirmed the conjecture for trees without degree-2 vertices. In this paper,…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 43 nodes and 113 edges.
Tags: Social, Fictional, Weighted

Crosslisted article(s) found for cs.SI. https://arxiv.org/list/cs.SI/new
[1/1]:
- The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
Zylan Benjert, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 27 nodes and 69 edges.
Tags: Social, Fictional, Weighted

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16726 nodes and 47594 edges.
Tags: Social, Collaboratio…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 25696 nodes and 105332 edges.
Tags: Technological, Communication, Unweighted, Temporal

Revealing Higher-Order Interactions in Complex Networks: A U.S. Diplomacy Case Study
Arthur Rondeau, Didier Wernli, Roland Bouffanais
https://arxiv.org/abs/2509.10333 https://…

Revealing Higher-Order Interactions in Complex Networks: A U.S. Diplomacy Case Study
Although diplomatic communication has long been examined in the social sciences, its network structure remains underexplored. Using the U.S. diplomatic cables released by WikiLeaks in 2010 as a case study, we adopt a network-science perspective. We represent diplomatic interactions as a hypergraph and develop a general, random-walk-based pipeline to evaluate this representation against traditional pairwise graphs. We further evaluate the pipeline on legislative co-sponsorship and organizational…

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4330 nodes and 8711 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 2948 nodes and 5515 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3971 nodes and 7604 edges.
Tags: Technological, Communication, Unweighted, Temporal

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 40 nodes and 152 edges.
Tags: Social, Fictional, Weighted

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 20906 nodes and 85988 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4900 nodes and 10295 edges.
Tags: Technological, Communication, Unweighted, Temporal