Tootfinder

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

TIEG-Youpu Solution for NeurIPS 2022 WikiKG90Mv2-LSC
Feng Nie, Zhixiu Ye, Sifa Xie, Shuang Wu, Xin Yuan, Liang Yao, Jiazhen Peng, Xu Cheng
https://arxiv.org/abs/2603.28512 https://arxiv.org/pdf/2603.28512 https://arxiv.org/html/2603.28512
arXiv:2603.28512v1 Announce Type: new
Abstract: WikiKG90Mv2 in NeurIPS 2022 is a large encyclopedic knowledge graph. Embedding knowledge graphs into continuous vector spaces is important for many practical applications, such as knowledge acquisition, question answering, and recommendation systems. Compared to existing knowledge graphs, WikiKG90Mv2 is a large scale knowledge graph, which is composed of more than 90 millions of entities. Both efficiency and accuracy should be considered when building graph embedding models for knowledge graph at scale. To this end, we follow the retrieve then re-rank pipeline, and make novel modifications in both retrieval and re-ranking stage. Specifically, we propose a priority infilling retrieval model to obtain candidates that are structurally and semantically similar. Then we propose an ensemble based re-ranking model with neighbor enhanced representations to produce final link prediction results among retrieved candidates. Experimental results show that our proposed method outperforms existing baseline methods and improves MRR of validation set from 0.2342 to 0.2839.
toXiv_bot_toot

March was the first month above 430 ppm atmospheric CO₂ of this year, and only the second in about 15 million years!
The first one was May 2025; many more to follow, unfortunately.
Based on daily values at Mauna Loa, the average was ~430.2 ppm, that's 2.0 ppm higher than last year.

A new CBS News/YouGov poll shows Republican Steve Hilton narrowly leading a fractured California governor’s primary field
as Democrats split support among several high-profile candidates.
With six weeks until the June 2 primary, undecided voters outnumber any single candidate, making the race unusually volatile.
A divided Democratic electorate raises the risk of a top‑two shutout, giving Republicans a rare opening in deep‑blue California.
Thurmond, Villaregosa and Ma…

Weird things that happen when you have a 100GbE pipe to your desk. 8 Gbps of sustained network traffic and the network monitor is like "yeah you're not using much bandwidth"
Also I think there's a 32-bit overflow or something in xfce4-netload-plugin because the rate shows 0.00 Mbps when I get above some threshold (not sure what it is exactly but it's in the 15-40 Gbps range)

topology: Internet AS graph (2004)
An integrated snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from multiple sources, including the RouteViews and RIPE BGP trace collectors, route servers, looking glasses, and the Internet Routing Registry databases. This snapshot was created around October 2004.
This network has 34761 nodes and 171403 edges.
Tags: Technological, Communication, Unweighted, Multigraph, Timestamps

That plot about github having lots of issues after it was aquired by Microsoft, remember it's a zoomed in graph between 99.5% and 100%
It's still really impressive how the cutoff is really clear. And I think it's not a good look on github, even in the right context.
But it's not enough for people to leave it. And it's not even the major reason why they should.

🪟 Full Window Function support: ROW_NUMBER, RANK, DENSE_RANK, LAG, LEAD, NTILE, FIRST_VALUE, LAST_VALUE & more for analytical workloads
🔄 Common Table Expressions including recursive CTEs for complex hierarchical and graph-style data queries
📈 Advanced aggregations: ROLLUP, CUBE & GROUPING SETS for multi-dimensional reporting and subtotal calculations
💾 Write-Ahead Logging (WAL) periodic snapshots for crash-safe persistence – runs in both in-memory and file-based …

Probing Graph Neural Network Activation Patterns Through Graph Topology
Floriano Tori, Lorenzo Bini, Marco Sorbi, St\'ephane Marchand-Maillet, Vincent Ginis
https://arxiv.org/abs/2602.21092 https://arxiv.org/pdf/2602.21092 https://arxiv.org/html/2602.21092
arXiv:2602.21092v1 Announce Type: new
Abstract: Curvature notions on graphs provide a theoretical description of graph topology, highlighting bottlenecks and denser connected regions. Artifacts of the message passing paradigm in Graph Neural Networks, such as oversmoothing and oversquashing, have been attributed to these regions. However, it remains unclear how the topology of a graph interacts with the learned preferences of GNNs. Through Massive Activations, which correspond to extreme edge activation values in Graph Transformers, we probe this correspondence. Our findings on synthetic graphs and molecular benchmarks reveal that MAs do not preferentially concentrate on curvature extremes, despite their theoretical link to information flow. On the Long Range Graph Benchmark, we identify a systemic \textit{curvature shift}: global attention mechanisms exacerbate topological bottlenecks, drastically increasing the prevalence of negative curvature. Our work reframes curvature as a diagnostic probe for understanding when and why graph learning fails.
toXiv_bot_toot

i would have a lot more sympathy for this graph if 99% of github's blog posts weren't boosting the very thing that causes it

Based on daily values, the February average of atmospheric CO2 at Mauna Loa was ~429.4 ppm; that's 2.3 ppm higher than last year. We made our climate problem worse again.
#ClimateChange #co2 #emissions

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Automated Reencoding Meets Graph Theory
Benjamin Przybocki, Bernardo Subercaseaux, Marijn J. H. Heule
https://arxiv.org/abs/2603.27774 https://arxiv.org/pd…

Thinking about Vulkan queue allocation in ngscopeclient.
We currently use the following queues:
* Libscopehal wide: one for host/device transfers
* Drivers: one compute queue for each ThunderScope, demo, Tek, Pico, Haasoscope, or TinySA instrument active in the session
* Filter graph: one compute queue per executor thread (default 8)
* Scope deskew wizard: one compute queue
* GUI: one render/compute queue
In order to manage contention when hardware has le…

Mediamarkt.de hat fast denselben PageRank wie Otto.de – aber einen HC Rank von 418.396 vs. 5.153. 📊
Harmonic Centrality misst, wo eine Domain im Web-Netzwerk sitzt. Nicht wer auf dich verlinkt, sondern wie zentral du bist. Common Crawl nutzt genau diesen Wert für die Crawl-Priorität – und 64 % aller LLMs trainieren auf Common-Crawl-Daten.
Backlink-Stärke und Netzwerkposition sind nicht dasselbe.

Harmonic Centrality: Das Ranking-Signal für KI-Systeme 🔗
Harmonic Centrality aus dem Common Crawl Web Graph zeigt, wie nah deine Domain am Kern des Webs ist – und wie oft LLMs sie zitieren. Mit echten Daten.

Dutch Rabobank expects food inflation due to the Trump-Netanyahu war to reach 7% by the end of 2026. https://nos.nl/l/2612549

Quantum Graph Theory by Example
Gian Luca Spitzer, Ion Nechita
https://arxiv.org/abs/2603.23651 https://arxiv.org/pdf/2603.23651 https://arxiv.org/html/2603.23651
arXiv:2603.23651v1 Announce Type: new
Abstract: Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in working with quantum graphs compared to classical graphs stems from the fact that they are no longer discrete objects. This makes it generally difficult to construct insightful, non-trivial examples. We present a collection of non-trivial quantum graphs that can be thought of in discrete terms, and that can be expressed in the diagrammatic formalism introduced by Musto, Reutter, and Verdon. The examples arise as the quantum graphs acted on by increasingly smaller classical matrix groups, and are parametrised by triples of matrices $(A, B, C)$. The parametrisation reveals a clean decomposition of quantum graph structure into classical and genuinely quantum components: $A$ and $C$ are described by a classical weighted graph called the strange graph, while $B$ provides a purely quantum contribution with no classical analogue. Based on this model, we give exact formulas or establish bounds for quantum graph parameters, such as the number of connected components, the chromatic number, the independence number, and the clique number. Our results provide the first large, parametric families of quantum graphs for which standard graph parameters can be computed analytically.
toXiv_bot_toot

GraphWalker: Agentic Knowledge Graph Question Answering via Synthetic Trajectory Curriculum
Shuwen Xu, Yao Xu, Jiaxiang Liu, Chenhao Yuan, Wenshuo Peng, Jun Zhao, Kang Liu
https://arxiv.org/abs/2603.28533 https://arxiv.org/pdf/2603.28533 https://arxiv.org/html/2603.28533
arXiv:2603.28533v1 Announce Type: new
Abstract: Agentic knowledge graph question answering (KGQA) requires an agent to iteratively interact with knowledge graphs (KGs), posing challenges in both training data scarcity and reasoning generalization. Specifically, existing approaches often restrict agent exploration: prompting-based methods lack autonomous navigation training, while current training pipelines usually confine reasoning to predefined trajectories. To this end, this paper proposes \textit{GraphWalker}, a novel agentic KGQA framework that addresses these challenges through \textit{Automated Trajectory Synthesis} and \textit{Stage-wise Fine-tuning}. GraphWalker adopts a two-stage SFT training paradigm: First, the agent is trained on structurally diverse trajectories synthesized from constrained random-walk paths, establishing a broad exploration prior over the KG; Second, the agent is further fine-tuned on a small set of expert trajectories to develop reflection and error recovery capabilities. Extensive experiments demonstrate that our stage-wise SFT paradigm unlocks a higher performance ceiling for a lightweight reinforcement learning (RL) stage, enabling GraphWalker to achieve state-of-the-art performance on CWQ and WebQSP. Additional results on GrailQA and our constructed GraphWalkerBench confirm that GraphWalker enhances generalization to out-of-distribution reasoning paths. The code is publicly available at https://github.com/XuShuwenn/GraphWalker
toXiv_bot_toot

Wer mal richtig mit Musik 🎶 , KI 🤖 und dem Culture Knowledge Graph 🐙 hacken will, ist ganz herzlich zur Teilnahme an der Data Challenge von @… und @… eingeladen! Das Ziel lautet "Develo…

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

Calibrations for the Sasaki volume on odd spheres and the no-gap problem
Jonas Matuzas
https://arxiv.org/abs/2602.22961 https://arxiv.org/pdf/2602.22961 https://arxiv.org/html/2602.22961
arXiv:2602.22961v1 Announce Type: new
Abstract: For each odd sphere $S^{n}$ with $n=2m 1\ge 5$, we consider the Sasaki volume functional $\mathrm{Vol}^S(V)=\int_{S^{n}}\sqrt{\det(I (\nabla V)^{\top}(\nabla V))}\,d\mathrm{vol}$ on smooth unit tangent vector fields $V$. Using the Brito--Chacon--Naveira calibration $\omega=a\wedge\Theta$ on the unit tangent bundle $E=UTS^{n}$, we establish the universal calibrated lower bound $\mathrm{Vol}^S(V)\ge c(m;1)\,\mathrm{vol}(S^{n})$, where $c(m;1)=4^{m}/\binom{2m}{m}$. In the relaxed (integral-current) setting, we show that the section-constrained stable mass in $E$ equals the calibration value and is attained by an $\omega$-calibrated mass-minimizing integral $n$-cycle in the section class.
We also analyze the equality case on smooth graphs. If a smooth graph is $\omega$-calibrated on an open set, then it satisfies the rigidity system $\nabla_V V=0$ and $\nabla_X V=\lambda X$ for all $X\perp V$, hence is locally a radial distance-gradient field. In particular, for $m\ge 2$ there is no smooth unit field on $S^n$ whose graph is $\omega$-calibrated everywhere.
Finally, we construct an explicit smooth recovery sequence (presented in detail for $S^5$ and then extended to all odd dimensions) and prove a uniform nonvanishing estimate for the polar-shell normalization in the patching construction. As a consequence, $\inf_{V}\,\mathrm{Vol}^S(V)=c(m;1)\,\mathrm{vol}(S^{n})$, so there is no Lavrentiev gap.
toXiv_bot_toot

Take a deep breath now.
In theory, the #Fediverse is federated.
It's in the name.
So you'd expect a huge colorful graph with many cliques.
Reality differs: It's a loose collection of nodes, with partially disjoint subgraphs, some connections unidirectional.
For a multitude of reasons, some instances choose to defederate others. Some deliberately block a l…

Turns out the Azure Agent for Linux has been costing me $50/month in Azure disk usage. Graph from before and after me uninstalling it.
It's a DNS server. The whole zone file is <<10KB. 50 GB read and 25 GB write per day.
#Azure
#Billing

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

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

The R Graph Gallery – Help and inspiration for R charts
The R graph gallery displays hundreds of charts made with R, always providing the reproducible code.

UK parliament descending into anti-immigrationbhate in just 7 years.
How rightwing rhetoric has risen sharply in the UK parliament – an exclusive visual analysis | Politics | The Guardian
https://www.theguardian…

So it looks like AMD GPUs have a lot less Vulkan queues than NVIDIA ones do and that is breaking some things in the filter graph scheduler.
This new GPU is already paying off and I've only had it installed for a couple of hours.
It has one graphics/compute/transfer queue, four compute/transfer queues, and one sparse binding queue (not sure what this is, I don't use them).
We run six threads in the filter graph scheduler so there are more threads than queues. We do h…

epsteinvisualizer.com - a graph explorer of the Epstein emails #Epstein https://rmendes.net/content/bookmarks/2026-02-04-epsteinvisualizer-com-a-graph-explorer-…

epsteinvisualizer.com - a graph explorer of the Epstein emails #Epstein
epsteinvisualizer.com - a graph explorer of the Epstein emails #Epstein 4 February 2026 Epstein 🔖 https://epsteinvisualizer.com/ - Alternative URL : https://epstein-doc-explorer-1.onrender.com/ Alter...

notre_dame_web: Webgraph (Notre Dame)
The web graph of Notre Dame University (nd.edu), as collected in 1999.
This network has 325729 nodes and 1497134 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/notre_dame_web
Ridiculogram…

The rewrite of the Sisyphus server continues, I've got all of the GET endpoints and about 60% of all the endpoints finished overall. Some initial testing on the `/workers` and `/queue` endpoints show some worrying results from the old version and some great results from the new version. The `/workers` endpoint started throwing errors at about 800 RPS on the Python/Flask version (the old one), the rewrite is showing around 4800 RPS (Golang/Gin). The `/queue` endpoint doesn't show a…

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/s…

Towards Autonomous Graph Data Analytics with Analytics-Augmented Generation
Qiange Wang, Chaoyi Chen, Jingqi Gao, Zihan Wang, Yanfeng Zhang, Ge Yu
https://arxiv.org/abs/2602.21604

Apple kauft Datenbankfirma Kuzu aus Kanada
Schnelle, flexible Graph-Datenbanken ließen sich mit Kuzu erstellen. Das Unternehmen wurde ohne große Ankündigung von Apple geschluckt.
https://www.heise.d…

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

Trump and Netanyahu have now managed to drive up the oil price to $120 per barrel. This has consequences: Cries for support from fossil car/truck drivers and airlines, acceleration of EV sales, inflation, a push to accelerate the energy transition. And massive problems for developing countries.

Somewhat surprisingly (but very welcome): these RAM and CPU upgrades, so far, have not materially increased the power demand of my lab.
I put the new RAM in the VM server yesterday (the 25th) and the upgraded CPU/RAM in the lab bench box a few hours ago.
I'm sure if I were to max them out for hours a day, I'd see a difference. But since my compute demands tend to be very bursty, the average power draw is the bigger concern and that seems to be roughly unchanged.

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 108300 nodes and 186936 edges.

Europe is the fastest-warming continent: over half a degree C per decade; double the global average!
It's already 2.5°C warmer than in pre-industrial times here.
From @copernicusecmwf.bsky.social European State of the Climate 2025: https://climate.copernicus.eu/esotc/20

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Marco DeepResearch: Unlocking Efficient Deep Research Agents via Verification-Centric Design
Bin Zhu, Qianghuai Jia, Tian Lan, Junyang Ren, Feng Gu, Feihu Jiang, Longyue Wang, Zhao Xu, Weihua Luo
https://arxiv.org/abs/2603.28376 https://arxiv.org/pdf/2603.28376 https://arxiv.org/html/2603.28376
arXiv:2603.28376v1 Announce Type: new
Abstract: Deep research agents autonomously conduct open-ended investigations, integrating complex information retrieval with multi-step reasoning across diverse sources to solve real-world problems. To sustain this capability on long-horizon tasks, reliable verification is critical during both training and inference. A major bottleneck in existing paradigms stems from the lack of explicit verification mechanisms in QA data synthesis, trajectory construction, and test-time scaling. Errors introduced at each stage propagate downstream and degrade the overall agent performance. To address this, we present Marco DeepResearch, a deep research agent optimized with a verification-centric framework design at three levels: \textbf{(1)~QA Data Synthesis:} We introduce verification mechanisms to graph-based and agent-based QA synthesis to control question difficulty while ensuring answers are unique and correct; \textbf{(2)~Trajectory Construction:} We design a verification-driven trajectory synthesis method that injects explicit verification patterns into training trajectories; and \textbf{(3)~Test-time scaling:} We use Marco DeepResearch itself as a verifier at inference time and effectively improve performance on challenging questions. Extensive experimental results demonstrate that our proposed Marco DeepResearch agent significantly outperforms 8B-scale deep research agents on most challenging benchmarks, such as BrowseComp and BrowseComp-ZH. Crucially, under a maximum budget of 600 tool calls, Marco DeepResearch even surpasses or approaches several 30B-scale agents, like Tongyi DeepResearch-30B.
toXiv_bot_toot

$k$-graph algebras are iterated Cuntz-Pimsner algebras -- from the bottom up
Valentin Deaconu, Menev\c{s}e Ery\"uzl\"u Paulovicks, S. Kaliszewski, John Quigg
https://arxiv.org/abs/2603.20923 https://arxiv.org/pdf/2603.20923 https://arxiv.org/html/2603.20923
arXiv:2603.20923v1 Announce Type: new
Abstract: We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our process, on the other hand, starts at the bottom, with Pimsner's theorem for graph algebras, and iterates upward. We actually work with product systems over $\mathbb N^k$, and the result for $k$-graphs is a special case. Our iteration step involves a ``decategorization'' of a recent theorem showing that the Cuntz-Pimsner construction is functorial at the level of ``enchilada categories''.
toXiv_bot_toot

I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration
Liang Li, Shufeng Gong, Yanan Yang, Yiduo Wang, Jie Wu
https://arxiv.org/abs/2602.21514

Replaced article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[1/5]:
- Beyond In-Distribution Success: Scaling Curves of CoT Granularity for Language Model Generalization
Ru Wang, Wei Huang, Selena Song, Haoyu Zhang, Qian Niu, Yusuke Iwasawa, Yutaka Matsuo, Jiaxian Guo
https://arxiv.org/abs/2502.18273 https://mastoxiv.page/@arXiv_csCL_bot/114069031700102129
- Benchmarking NLP-supported Language Sample Analysis for Swiss Children's Speech
Anja Ryser, Yingqiang Gao, Sarah Ebling
https://arxiv.org/abs/2504.00780 https://mastoxiv.page/@arXiv_csCL_bot/114267149909002069
- Cultural Biases of Large Language Models and Humans in Historical Interpretation
Fabio Celli, Georgios Spathulas
https://arxiv.org/abs/2504.02572 https://mastoxiv.page/@arXiv_csCL_bot/114278467094094490
- BRIDGE: Benchmarking Large Language Models for Understanding Real-world Clinical Practice Text
Jiageng Wu, et al.
https://arxiv.org/abs/2504.19467 https://mastoxiv.page/@arXiv_csCL_bot/114420036189999973
- Understanding the Anchoring Effect of LLM with Synthetic Data: Existence, Mechanism, and Potentia...
Yiming Huang, Biquan Bie, Zuqiu Na, Weilin Ruan, Songxin Lei, Yutao Yue, Xinlei He
https://arxiv.org/abs/2505.15392 https://mastoxiv.page/@arXiv_csCL_bot/114550277171100272
- Just as Humans Need Vaccines, So Do Models: Model Immunization to Combat Falsehoods
Raza, Qureshi, Farooq, Lotif, Chadha, Pandya, Emmanouilidis
https://arxiv.org/abs/2505.17870 https://mastoxiv.page/@arXiv_csCL_bot/114572956853819813
- LingoLoop Attack: Trapping MLLMs via Linguistic Context and State Entrapment into Endless Loops
Fu, Jiang, Hong, Li, Guo, Yang, Chen, Zhang
https://arxiv.org/abs/2506.14493 https://mastoxiv.page/@arXiv_csCL_bot/114703502552989170
- GHTM: A Graph-based Hybrid Topic Modeling Approach with a Benchmark Dataset for the Low-Resource ...
Farhana Haque, Md. Abdur Rahman, Sumon Ahmed
https://arxiv.org/abs/2508.00605 https://mastoxiv.page/@arXiv_csCL_bot/114969875643478303
- Link Prediction for Event Logs in the Process Industry
Anastasia Zhukova, Thomas Walton, Christian E. Lobm\"uller, Bela Gipp
https://arxiv.org/abs/2508.09096 https://mastoxiv.page/@arXiv_csCL_bot/115020938764936882
- AirQA: A Comprehensive QA Dataset for AI Research with Instance-Level Evaluation
Huang, Cao, Zhang, Kang, Wang, Wang, Luo, Zheng, Qian, Chen, Yu
https://arxiv.org/abs/2509.16952 https://mastoxiv.page/@arXiv_csCL_bot/115253526588472475
- Multi-View Attention Multiple-Instance Learning Enhanced by LLM Reasoning for Cognitive Distortio...
Jun Seo Kim, Hyemi Kim, Woo Joo Oh, Hongjin Cho, Hochul Lee, Hye Hyeon Kim
https://arxiv.org/abs/2509.17292 https://mastoxiv.page/@arXiv_csCL_bot/115253586227941157
- Dual-Space Smoothness for Robust and Balanced LLM Unlearning
Han Yan, Zheyuan Liu, Meng Jiang
https://arxiv.org/abs/2509.23362 https://mastoxiv.page/@arXiv_csCL_bot/115293308293558024
- The Rise of AfricaNLP: Contributions, Contributors, Community Impact, and Bibliometric Analysis
Tadesse Destaw Belay, et al.
https://arxiv.org/abs/2509.25477 https://mastoxiv.page/@arXiv_csCL_bot/115298213432594791
- Open ASR Leaderboard: Towards Reproducible and Transparent Multilingual and Long-Form Speech Reco...
Srivastav, Zheng, Bezzam, Le Bihan, Koluguri, \.Zelasko, Majumdar, Moumen, Gandhi
https://arxiv.org/abs/2510.06961 https://mastoxiv.page/@arXiv_csCL_bot/115343748052193267
- Neuron-Level Analysis of Cultural Understanding in Large Language Models
Taisei Yamamoto, Ryoma Kumon, Danushka Bollegala, Hitomi Yanaka
https://arxiv.org/abs/2510.08284 https://mastoxiv.page/@arXiv_csCL_bot/115349533441895984
- CLMN: Concept based Language Models via Neural Symbolic Reasoning
Yibo Yang
https://arxiv.org/abs/2510.10063 https://mastoxiv.page/@arXiv_csCL_bot/115372392366793754
- Schema for In-Context Learning
Chen, Chen, Wang, Leong, Fung, Bernales, Aspuru-Guzik
https://arxiv.org/abs/2510.13905 https://mastoxiv.page/@arXiv_csCL_bot/115389057899856601
- Evaluating Latent Knowledge of Public Tabular Datasets in Large Language Models
Matteo Silvestri, Fabiano Veglianti, Flavio Giorgi, Fabrizio Silvestri, Gabriele Tolomei
https://arxiv.org/abs/2510.20351 https://mastoxiv.page/@arXiv_csCL_bot/115428615784704418
- LuxIT: A Luxembourgish Instruction Tuning Dataset from Monolingual Seed Data
Julian Valline, Cedric Lothritz, Siwen Guo, Jordi Cabot
https://arxiv.org/abs/2510.24434 https://mastoxiv.page/@arXiv_csCL_bot/115457025096322944
- Surfacing Subtle Stereotypes: A Multilingual, Debate-Oriented Evaluation of Modern LLMs
Muhammed Saeed, Muhammad Abdul-mageed, Shady Shehata
https://arxiv.org/abs/2511.01187 https://mastoxiv.page/@arXiv_csCL_bot/115491321130591723
toXiv_bot_toot

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
Tobias Rubel, Richard Wen, Laxman Dhulipala, Lars Gottesb\"uren, Rajesh Jayaram, Jakub {\L}\k{a}cki
https://arxiv.org/abs/2602.21247

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

Replaced article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[2/5]:
- POTSA: A Cross-Lingual Speech Alignment Framework for Speech-to-Text Translation
Li, Cui, Wang, Ge, Huang, Li, Peng, Lu, Tashi, Wang, Dang
https://arxiv.org/abs/2511.09232 https://mastoxiv.page/@arXiv_csCL_bot/115541846907664054
- Beyond Elicitation: Provision-based Prompt Optimization for Knowledge-Intensive Tasks
Yunzhe Xu, Zhuosheng Zhang, Zhe Liu
https://arxiv.org/abs/2511.10465 https://mastoxiv.page/@arXiv_csCL_bot/115547607561282911
- $\pi$-Attention: Periodic Sparse Transformers for Efficient Long-Context Modeling
Dong Liu, Yanxuan Yu
https://arxiv.org/abs/2511.10696 https://mastoxiv.page/@arXiv_csCL_bot/115564418836654965
- Based on Data Balancing and Model Improvement for Multi-Label Sentiment Classification Performanc...
Zijin Su, Huanzhu Lyu, Yuren Niu, Yiming Liu
https://arxiv.org/abs/2511.14073 https://mastoxiv.page/@arXiv_csCL_bot/115575715073023141
- HEAD-QA v2: Expanding a Healthcare Benchmark for Reasoning
Alexis Correa-Guill\'en, Carlos G\'omez-Rodr\'iguez, David Vilares
https://arxiv.org/abs/2511.15355 https://mastoxiv.page/@arXiv_csCL_bot/115581410328165116
- Towards Hyper-Efficient RAG Systems in VecDBs: Distributed Parallel Multi-Resolution Vector Search
Dong Liu, Yanxuan Yu
https://arxiv.org/abs/2511.16681 https://mastoxiv.page/@arXiv_csCL_bot/115603508442305146
- Estonian WinoGrande Dataset: Comparative Analysis of LLM Performance on Human and Machine Transla...
Marii Ojastu, Hele-Andra Kuulmets, Aleksei Dorkin, Marika Borovikova, Dage S\"arg, Kairit Sirts
https://arxiv.org/abs/2511.17290 https://mastoxiv.page/@arXiv_csCL_bot/115604083224487885
- A Systematic Study of In-the-Wild Model Merging for Large Language Models
O\u{g}uz Ka\u{g}an Hitit, Leander Girrbach, Zeynep Akata
https://arxiv.org/abs/2511.21437 https://mastoxiv.page/@arXiv_csCL_bot/115621178703846052
- CREST: Universal Safety Guardrails Through Cluster-Guided Cross-Lingual Transfer
Lavish Bansal, Naman Mishra
https://arxiv.org/abs/2512.02711 https://mastoxiv.page/@arXiv_csCL_bot/115655090475535157
- Multilingual Medical Reasoning for Question Answering with Large Language Models
Pietro Ferrazzi, Aitor Soroa, Rodrigo Agerri
https://arxiv.org/abs/2512.05658 https://mastoxiv.page/@arXiv_csCL_bot/115683267711014189
- OnCoCo 1.0: A Public Dataset for Fine-Grained Message Classification in Online Counseling Convers...
Albrecht, Lehmann, Poltermann, Rudolph, Steigerwald, Stieler
https://arxiv.org/abs/2512.09804 https://mastoxiv.page/@arXiv_csCL_bot/115700409397020978
- Does Tone Change the Answer? Evaluating Prompt Politeness Effects on Modern LLMs: GPT, Gemini, an...
Hanyu Cai, Binqi Shen, Lier Jin, Lan Hu, Xiaojing Fan
https://arxiv.org/abs/2512.12812 https://mastoxiv.page/@arXiv_csCL_bot/115729149622659403
- Beg to Differ: Understanding Reasoning-Answer Misalignment Across Languages
Ovalle, Ross, Ruder, Williams, Ullrich, Ibrahim, Sagun
https://arxiv.org/abs/2512.22712 https://mastoxiv.page/@arXiv_csCL_bot/115808161882146194
- Activation Steering for Masked Diffusion Language Models
Adi Shnaidman, Erin Feiglin, Osher Yaari, Efrat Mentel, Amit Levi, Raz Lapid
https://arxiv.org/abs/2512.24143 https://mastoxiv.page/@arXiv_csCL_bot/115819533211103315
- JMedEthicBench: A Multi-Turn Conversational Benchmark for Evaluating Medical Safety in Japanese L...
Liu, Li, Niu, Zhang, Xun, Hou, Wang, Iwasawa, Matsuo, Hatakeyama-Sato
https://arxiv.org/abs/2601.01627 https://mastoxiv.page/@arXiv_csCL_bot/115847901607405421
- FACTUM: Mechanistic Detection of Citation Hallucination in Long-Form RAG
Dassen, Kotula, Murray, Yates, Lawrie, Kayi, Mayfield, Duh
https://arxiv.org/abs/2601.05866 https://mastoxiv.page/@arXiv_csCL_bot/115881545684182376
- {\dag}DAGGER: Distractor-Aware Graph Generation for Executable Reasoning in Math Problems
Zabir Al Nazi, Shubhashis Roy Dipta, Sudipta Kar
https://arxiv.org/abs/2601.06853 https://mastoxiv.page/@arXiv_csCL_bot/115887753245730019
- Symphonym: Universal Phonetic Embeddings for Cross-Script Name Matching
Stephen Gadd
https://arxiv.org/abs/2601.06932 https://mastoxiv.page/@arXiv_csCL_bot/115887767008671765
- LLMs versus the Halting Problem: Revisiting Program Termination Prediction
Sultan, Armengol-Estape, Kesseli, Vanegue, Shahaf, Adi, O'Hearn
https://arxiv.org/abs/2601.18987 https://mastoxiv.page/@arXiv_csCL_bot/115972010510378715
- MuVaC: A Variational Causal Framework for Multimodal Sarcasm Understanding in Dialogues
Diandian Guo, Fangfang Yuan, Cong Cao, Xixun Lin, Chuan Zhou, Hao Peng, Yanan Cao, Yanbing Liu
https://arxiv.org/abs/2601.20451 https://mastoxiv.page/@arXiv_csCL_bot/115977891530875024
toXiv_bot_toot

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 64347 nodes and 1397072 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/n…

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 83392 nodes and 1553757 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/ne…

BuffCut: Prioritized Buffered Streaming Graph Partitioning
Linus Baumg\"artner, Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
https://arxiv.org/abs/2602.21248 https…

Replaced article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[3/5]:
- Can Small Language Models Handle Context-Summarized Multi-Turn Customer-Service QA? A Synthetic D...
Lakshan Cooray, Deshan Sumanathilaka, Pattigadapa Venkatesh Raju
https://arxiv.org/abs/2602.00665 https://mastoxiv.page/@arXiv_csCL_bot/116006686092324902
- SEAD: Self-Evolving Agent for Multi-Turn Service Dialogue
Dai, Gao, Zhang, Wang, Luo, Wang, Wang, Wu, Wang
https://arxiv.org/abs/2602.03548
- OmniRAG-Agent: Agentic Omnimodal Reasoning for Low-Resource Long Audio-Video Question Answering
Yifan Zhu, Xinyu Mu, Tao Feng, Zhonghong Ou, Yuning Gong, Haoran Luo
https://arxiv.org/abs/2602.03707
- GreekMMLU: A Native-Sourced Multitask Benchmark for Evaluating Language Models in Greek
Zhang, Konomi, Xypolopoulos, Divriotis, Skianis, Nikolentzos, Stamou, Shang, Vazirgiannis
https://arxiv.org/abs/2602.05150
- Using LLMs for Knowledge Component-level Correctness Labeling in Open-ended Coding Problems
Zhangqi Duan, Arnav Kankaria, Dhruv Kartik, Andrew Lan
https://arxiv.org/abs/2602.17542 https://mastoxiv.page/@arXiv_csCL_bot/116102514058414603
- MetaState: Persistent Working Memory Enhances Reasoning in Discrete Diffusion Language Models
Kejing Xia, Mingzhe Li, Lixuan Wei, Zhenbang Du, Xiangchi Yuan, Dachuan Shi, Qirui Jin, Wenke Lee
https://arxiv.org/abs/2603.01331 https://mastoxiv.page/@arXiv_csCL_bot/116165314672421581
- A Browser-based Open Source Assistant for Multimodal Content Verification
Milner, Foster, Karmakharm, Razuvayevskaya, Roberts, Porcellini, Teyssou, Bontcheva
https://arxiv.org/abs/2603.02842 https://mastoxiv.page/@arXiv_csCL_bot/116170368271004704
- Nw\=ach\=a Mun\=a: A Devanagari Speech Corpus and Proximal Transfer Benchmark for Nepal Bhasha ASR
Sharma, Shrestha, Poudel, Tiwari, Shrestha, Ghimire, Bal
https://arxiv.org/abs/2603.07554 https://mastoxiv.page/@arXiv_csCL_bot/116204797995674104
- Model Merging in the Era of Large Language Models: Methods, Applications, and Future Directions
Mingyang Song, Mao Zheng
https://arxiv.org/abs/2603.09938 https://mastoxiv.page/@arXiv_csCL_bot/116210189810004206
- AgentDrift: Unsafe Recommendation Drift Under Tool Corruption Hidden by Ranking Metrics in LLM Ag...
Zekun Wu, Adriano Koshiyama, Sahan Bulathwela, Maria Perez-Ortiz
https://arxiv.org/abs/2603.12564 https://mastoxiv.page/@arXiv_csCL_bot/116237800898328349
- GhanaNLP Parallel Corpora: Comprehensive Multilingual Resources for Low-Resource Ghanaian Languages
Gyamfi, Azunre, Moore, Budu, Asare, Owusu, Asiamah
https://arxiv.org/abs/2603.13793 https://mastoxiv.page/@arXiv_csCL_bot/116243544688031749
- sebis at ArchEHR-QA 2026: How Much Can You Do Locally? Evaluating Grounded EHR QA on a Single Not...
Ibrahim Ebrar Yurt, Fabian Karl, Tejaswi Choppa, Florian Matthes
https://arxiv.org/abs/2603.13962 https://mastoxiv.page/@arXiv_csCL_bot/116243646346563497
- ExPosST: Explicit Positioning with Adaptive Masking for LLM-Based Simultaneous Machine Translation
Yuzhe Shang, Pengzhi Gao, Yazheng Yang, Jiayao Ma, Wei Liu, Jian Luan, Jinsong Su
https://arxiv.org/abs/2603.14903 https://mastoxiv.page/@arXiv_csCL_bot/116243711232778054
- BanglaSocialBench: A Benchmark for Evaluating Sociopragmatic and Cultural Alignment of LLMs in Ba...
Tanvir Ahmed Sijan, S. M Golam Rifat, Pankaj Chowdhury Partha, Md. Tanjeed Islam, Md. Musfique Anwar
https://arxiv.org/abs/2603.15949 https://mastoxiv.page/@arXiv_csCL_bot/116249122231759766
- EngGPT2: Sovereign, Efficient and Open Intelligence
G. Ciarfaglia, et al.
https://arxiv.org/abs/2603.16430 https://mastoxiv.page/@arXiv_csCL_bot/116249228411487178
- HypeLoRA: Hyper-Network-Generated LoRA Adapters for Calibrated Language Model Fine-Tuning
Bartosz Trojan, Filip G\k{e}bala
https://arxiv.org/abs/2603.19278 https://mastoxiv.page/@arXiv_csCL_bot/116277612915482857
- Automatic Analysis of Collaboration Through Human Conversational Data Resources: A Review
Yi Yu, Maria Boritchev, Chlo\'e Clavel
https://arxiv.org/abs/2603.19292 https://mastoxiv.page/@arXiv_csCL_bot/116277620779254916
- Alignment Whack-a-Mole : Finetuning Activates Verbatim Recall of Copyrighted Books in Large Langu...
Xinyue Liu, Niloofar Mireshghallah, Jane C. Ginsburg, Tuhin Chakrabarty
https://arxiv.org/abs/2603.20957 https://mastoxiv.page/@arXiv_csCL_bot/116283538317671552
- KG-Hopper: Empowering Compact Open LLMs with Knowledge Graph Reasoning via Reinforcement Learning
Shuai Wang, Yinan Yu
https://arxiv.org/abs/2603.21440 https://mastoxiv.page/@arXiv_csCL_bot/116283595007808076
toXiv_bot_toot

polblogs: Political blogs network (2004)
A directed network of hyperlinks among a large set of U.S. political weblogs from before the 2004 election. Includes blog political affiliation as metadata.
This network has 1490 nodes and 19090 edges.
Tags: Informational, Web graph, Unweighted, Metadata
https://networks.skewed.d…

The Trump-Netanyahu war in the Middle East already drove up the price of urea fertiliser, produced there as well, by 75%.

polblogs: Political blogs network (2004)
A directed network of hyperlinks among a large set of U.S. political weblogs from before the 2004 election. Includes blog political affiliation as metadata.
This network has 1490 nodes and 19090 edges.
Tags: Informational, Web graph, Unweighted, Metadata
https://networks.skewed.d…

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 108300 nodes and 186936 edges.

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 63448 edges.
Tags: Biolo…

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

edit_wikinews: Wikipedia news edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about news events. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 124174 nodes and 3129705 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
https://networks.skewed.de/net/edit_wikinews#sr
Ridiculogram:

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

topology: Internet AS graph (2004)
An integrated snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from multiple sources, including the RouteViews and RIPE BGP trace collectors, route servers, looking glasses, and the Internet Routing Registry databases. This snapshot was created around October 2004.
This network has 34761 nodes and 171403 edges.
Tags: Technological, Communication, Unweighted, Multigraph, Timestamps

notre_dame_web: Webgraph (Notre Dame)
The web graph of Notre Dame University (nd.edu), as collected in 1999.
This network has 325729 nodes and 1497134 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/notre_dame_web
Ridiculogram…

trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net…

edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 5297 nodes and 27934 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

edit_wikinews: Wikipedia news edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about news events. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 2511 nodes and 7745 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net…

trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net…

dblp_coauthor_snap: DBLP authors (2012)
A coauthorship network extracted from the DBLP computer science manuscript database, in 2012. This network is a one-mode projection from the bipartite graph of computer scientists and their publications.
This network has 425957 nodes and 1049866 edges.
Tags: Social, Collaboration, Unweighted, Metadata, Projection

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/s…

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

internet_top_pop: Internet topology (PoP level) (1969-2012)
Assorted snapshots of internet graph at the Point of Presence (PoP) level (which lies between the IP and AS levels), collected from around the world and at various times. The earliest snapshots are for ARPANET (1969-1972), with a few more from pre-2000. Most are from 2006 onward. Metadata include link type or speed, longitudes, and latitudes of nodes, URL, and date of record.
This network has 61 nodes and 89 edges.

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 52560 nodes and 1241806 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/ne…

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

polblogs: Political blogs network (2004)
A directed network of hyperlinks among a large set of U.S. political weblogs from before the 2004 election. Includes blog political affiliation as metadata.
This network has 1490 nodes and 19090 edges.
Tags: Informational, Web graph, Unweighted, Metadata
https://networks.skewed.d…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

student_cooperation: Student cooperation (2012)
Network of cooperation among students in the "Computer and Network Security" course at Ben-Gurion University, in 2012. Nodes are students, and edges denote cooperation between students while doing their homework. The graph contains three types of links: Time, Computer, Partners.
This network has 185 nodes and 360 edges.
Tags: Social, Offline, Multigraph, Unweighted