Tootfinder

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…

T(R,O) Grasp: Efficient Graph Diffusion of Robot-Object Spatial Transformation for Cross-Embodiment Dexterous Grasping
Xin Fei, Zhixuan Xu, Huaicong Fang, Tianrui Zhang, Lin Shao
https://arxiv.org/abs/2510.12724

T(R,O) Grasp: Efficient Graph Diffusion of Robot-Object Spatial Transformation for Cross-Embodiment Dexterous Grasping
Dexterous grasping remains a central challenge in robotics due to the complexity of its high-dimensional state and action space. We introduce T(R,O) Grasp, a diffusion-based framework that efficiently generates accurate and diverse grasps across multiple robotic hands. At its core is the T(R,O) Graph, a unified representation that models spatial transformations between robotic hands and objects while encoding their geometric properties. A graph diffusion model, coupled with an efficient inverse…

A note on the number of non-cycle components in a pseudo 2-factor of graphs
Masaki Kashima
https://arxiv.org/abs/2510.12155 https://arxiv.org/pdf/2510.1215…

A note on the number of non-cycle components in a pseudo 2-factor of graphs
A pseudo 2-factor of a graph is a spanning subgraph such that each component is $K_1$, $K_2$, or a cycle. This notion was introduced by Bekkai and Kouider in 2009, where they showed that every graph $G$ has a pseudo 2-factor with at most $α(G)-δ(G)+1$ components that are not cycles. For a graph $G$ and a set of vertices $S$, let $δ_G(S)$ denote the minimum degree of vertices in $S$. In this note, we show that every graph $G$ has a pseudo 2-factor with at most $f(G)$ components that are not c…

GPU-Accelerated Algorithms for Process Mapping
Petr Samoldekin, Christian Schulz, Henning Woydt
https://arxiv.org/abs/2510.12196 https://arxiv.org/pdf/2510…

GPU-Accelerated Algorithms for Process Mapping
Process mapping asks to assign vertices of a task graph to processing elements of a supercomputer such that the computational workload is balanced while the communication cost is minimized. Motivated by the recent success of GPU-based graph partitioners, we propose two GPU-accelerated algorithms for this optimization problem. The first algorithm employs hierarchical multisection, which partitions the task graph alongside the hierarchy of the supercomputer. The method utilizes GPU-based graph pa…

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…

MedKGEval: A Knowledge Graph-Based Multi-Turn Evaluation Framework for Open-Ended Patient Interactions with Clinical LLMs
Yuechun Yu, Han Ying, Haoan Jin, Wenjian Jiang, Dong Xian, Binghao Wang, Zhou Yang, Mengyue Wu
https://arxiv.org/abs/2510.12224

MedKGEval: A Knowledge Graph-Based Multi-Turn Evaluation Framework for Open-Ended Patient Interactions with Clinical LLMs
The reliable evaluation of large language models (LLMs) in medical applications remains an open challenge, particularly in capturing the complexity of multi-turn doctor-patient interactions that unfold in real clinical environments. Existing evaluation methods typically rely on post hoc review of full conversation transcripts, thereby neglecting the dynamic, context-sensitive nature of medical dialogues and the evolving informational needs of patients. In this work, we present MedKGEval, a nove…

A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning
Yang Xiang, Li Fan, Chenke Yin, Chengtao Ji
https://arxiv.org/abs/2510.12369 http…

A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning
Recent progress in language and vision foundation models demonstrates the importance of discrete token interfaces that transform complex inputs into compact sequences for large-scale modeling. Extending this paradigm to graphs requires a tokenization scheme that handles non-Euclidean structures and multi-scale dependencies efficiently. Existing approaches to graph tokenization, linearized, continuous, and quantized, remain limited in adaptability and efficiency. In particular, most current quan…

PromoGuardian: Detecting Promotion Abuse Fraud with Multi-Relation Fused Graph Neural Networks
Shaofei Li, Xiao Han, Ziqi Zhang, Minyao Hua, Shuli Gao, Zhenkai Liang, Yao Guo, Xiangqun Chen, Ding Li
https://arxiv.org/abs/2510.12652

PromoGuardian: Detecting Promotion Abuse Fraud with Multi-Relation Fused Graph Neural Networks
As e-commerce platforms develop, fraudulent activities are increasingly emerging, posing significant threats to the security and stability of these platforms. Promotion abuse is one of the fastest-growing types of fraud in recent years and is characterized by users exploiting promotional activities to gain financial benefits from the platform. To investigate this issue, we conduct the first study on promotion abuse fraud in e-commerce platforms MEITUAN. We find that promotion abuse fraud is a g…

Arctic sea ice extent is still at a record low for this time of the year, around a million km² below the average in the 2010s.
From zacklabe.com, by @…

I have at least two more converts to The Story Graph in the last couple days, yanking them away from Amazon’s Good Reads.
I use it:
https://app.thestorygraph.com/profile/aardrian
Not perfect but definitely *not* Amazon. Just sayin’.

Can Representation Gaps Be the Key to Enhancing Robustness in Graph-Text Alignment?
Heng Zhang, Tianyi Zhang, Yuling Shi, Xiaodong Gu, Yaomin Shen, Zijian Zhang, Yilei Yuan, Hao Zhang, Jin Huang
https://arxiv.org/abs/2510.12087

Can Representation Gaps Be the Key to Enhancing Robustness in Graph-Text Alignment?
Representation learning on text-attributed graphs (TAGs) integrates structural connectivity with rich textual semantics, enabling applications in diverse domains. Current methods largely rely on contrastive learning to maximize cross-modal similarity, assuming tighter coupling between graph and text representations improves transfer performance. However, our empirical analysis reveals that both natural gap expansion and forced gap reduction result in performance degradation by disrupting pre-tr…

Working on improving error reporting in ngscopeclient rather than having filters simply silently produce no output, or log to stdout, when something goes wrong.
Here's my current WIP: the block that has problems displays a warning icon and summary title up top, then you can mouse over it to see more detailed error information.
Thoughts? Anything I should change before I start working on adding this sort of feedback to more filter blocks?

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…

Kudos to #Tuta for not having "genAI" and Tutanuta users for not wanting "genAI" 🙌
Link to @… 's survey:

TFGA-Net: Temporal-Frequency Graph Attention Network for Brain-Controlled Speaker Extraction
Youhao Si, Yuan Liao, Qiushi Han, Yuhang Yang, Rui Dai, Liya Huang
https://arxiv.org/abs/2510.12275

TFGA-Net: Temporal-Frequency Graph Attention Network for Brain-Controlled Speaker Extraction
The rapid development of auditory attention decoding (AAD) based on electroencephalography (EEG) signals offers the possibility EEG-driven target speaker extraction. However, how to effectively utilize the target-speaker common information between EEG and speech remains an unresolved problem. In this paper, we propose a model for brain-controlled speaker extraction, which utilizes the EEG recorded from the listener to extract the target speech. In order to effectively extract information from E…

Hypothesis testing for the dimension of random geometric graph
Mingao Yuan, Feng Yu
https://arxiv.org/abs/2510.11844 https://arxiv.org/pdf/2510.11844

Hypothesis testing for the dimension of random geometric graph
Random geometric graphs (RGGs) offer a powerful tool for analyzing the geometric and dependence structures in real-world networks. For example, it has been observed that RGGs are a good model for protein-protein interaction networks. In RGGs, nodes are randomly distributed over an $m$-dimensional metric space, and edges connect the nodes if and only if their distance is less than some threshold. When fitting RGGs to real-world networks, the first step is probably to input or estimate the dimens…

Disentangling Neurodegeneration with Brain Age Gap Prediction Models: A Graph Signal Processing Perspective
Saurabh Sihag, Gonzalo Mateos, Alejandro Ribeiro
https://arxiv.org/abs/2510.12763

Disentangling Neurodegeneration with Brain Age Gap Prediction Models: A Graph Signal Processing Perspective
Neurodegeneration, characterized by the progressive loss of neuronal structure or function, is commonly assessed in clinical practice through reductions in cortical thickness or brain volume, as visualized by structural MRI. While informative, these conventional approaches lack the statistical sophistication required to fully capture the spatially correlated and heterogeneous nature of neurodegeneration, which manifests both in healthy aging and in neurological disorders. To address these limit…

Column Generation for Periodic Timetabling
Stephanie Riedm\"uller, Niels Lindner
https://arxiv.org/abs/2510.12466 https://arxiv.org/pdf/2510.12466

Column Generation for Periodic Timetabling
Periodic timetabling for public transportation networks is typically modelled as a Periodic Event Scheduling Problem (PESP). Solving instances of the benchmark library PESPlib to optimality continues to pose a challenge. As a further approach towards this goal, we remodel the problem by a time discretization of the underlying graph and consider arc-based as well as path-based integer programming formulations. For the path-based case, we use cycles on the graph expansion of the operational lines…

Thin Trees via $k$-Respecting Cut Identities
Mohit Daga
https://arxiv.org/abs/2510.12050 https://arxiv.org/pdf/2510.12050

Thin Trees via $k$-Respecting Cut Identities
Thin spanning trees lie at the intersection of graph theory, approximation algorithms, and combinatorial optimization. They are central to the long-standing \emph{thin tree conjecture}, which asks whether every $k$-edge-connected graph contains an $O(1/k)$-thin tree, and they underpin algorithmic breakthroughs such as the $O(\log n/\log\log n)$-approximation for ATSP. Yet even the basic algorithmic task of \emph{verifying} that a given tree is thin has remained elusive: checking thinness requir…

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…

#Federation works once again:
@…, @… & @…

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
Kaiwen He, Petros Drineas, Rajiv Khanna
https://arxiv.org/abs/2510.12669 https://arxiv.or…

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
Spectral clustering is a fundamental method for graph partitioning, but its reliance on eigenvector computation limits scalability to massive graphs. Classical sparsification methods preserve spectral properties by sampling edges proportionally to their effective resistances, but require expensive preprocessing to estimate these resistances. We study whether uniform edge sampling-a simple, structure-agnostic strategy-can suffice for spectral clustering. Our main result shows that for graphs adm…

Planted clique recovery in random geometric graphs
Konstantin Avrachenkov, Andrei Bobu, Nelly Litvak, Riccardo Michielan
https://arxiv.org/abs/2510.12365 https://

Planted clique recovery in random geometric graphs
We investigate the problem of identifying planted cliques in random geometric graphs, focusing on two distinct algorithmic approaches: the first based on vertex degrees (VD) and the other on common neighbors (CN). We analyze the performance of these methods under varying regimes of key parameters, namely the average degree of the graph and the size of the planted clique. We demonstrate that exact recovery is achieved with high probability as the graph size increases, in a specific set of parame…

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://

'nut' is a UPS monitor program; you can configure your host to switch off when your UPS is running low and change settings on the UPS and monitor charge. The 'N' stands for Network - so you can do a lot of things remotely, for example making a bunch of machines speak to one host monitoring the UPS and get them all to shut down.
I also use some of my own scripts to feed it into some graphing stuff with Grafana and get pretty line voltage graphs;

Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
Yu-Zhen Janice Chen, Laurent Massouli\'e, Don Towsley
https://arxiv.org/abs/2510.12774 https://

Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
We investigate whether Gaussian Boson Sampling (GBS) can provide a computational advantage for solving the planted biclique problem, which is a graph problem widely believed to be classically hard when the planted structure is small. Although GBS has been heuristically and experimentally observed to favor sampling dense subgraphs, its theoretical performance on this classically hard problem remains largely unexplored. We focus on a natural statistic derived from GBS output: the frequency with w…

Dominating Hadwiger's Conjecture for graphs $G$ with $\alpha(G)=2$
Michael Scully, Zi-Xia Song
https://arxiv.org/abs/2510.12564 https://arxiv.org/pdf/2…

Dominating Hadwiger's Conjecture for graphs $G$ with $α(G)=2$
Hadwiger's Conjecture from 1943 states that every graph with chromatic number $t$ contains a $K_t$ minor. Illingworth and Wood [arXiv:2405.14299] introduced the concept of a ``dominating $K_t$ minor'' and asked whether every graph with chromatic number $t$ contains a dominating $K_t$ minor. This question is a substantial strengthening of Hadwiger's Conjecture. Norin referred to it as the ``Dominating Hadwiger's Conjecture'' and believes it is likely false. In this paper we first observe that a …

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://

MIARec: Mutual-influence-aware Heterogeneous Network Embedding for Scientific Paper Recommendation
Wenjin Xie, Tao Jia
https://arxiv.org/abs/2510.12054 https://

MIARec: Mutual-influence-aware Heterogeneous Network Embedding for Scientific Paper Recommendation
With the rapid expansion of scientific literature, scholars increasingly demand precise and high-quality paper recommendations. Among various recommendation methodologies, graph-based approaches have garnered attention by effectively exploiting the structural characteristics inherent in scholarly networks. However, these methods often overlook the asymmetric academic influence that is prevalent in scholarly networks when learning graph representations. To address this limitation, this study pro…

Competing Localizations on Disordered Non-Hermitian Random Graph Lattice
S Rahul, A Harshitha
https://arxiv.org/abs/2511.10156 https://arxiv.org/pdf/2511.1…

Stranding $\mathfrak{sl}_n$ webs
Heather M. Russell, Julianna Tymoczko
https://arxiv.org/abs/2510.12035 https://arxiv.org/pdf/2510.12035

Stranding $\mathfrak{sl}_n$ webs
Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing matchings and the Temperley-Lieb algebra, before being formalized by Kuperberg for $\mathfrak{sl}_2$ and $\mathfrak{sl}_3$ as the morphisms in a diagrammatic categorification of quantum representations called the spider category. Various models extend webs t…

SDGraph: Multi-Level Sketch Representation Learning by Sparse-Dense Graph Architecture
Xi Cheng, Pingfa Feng, Zhichao Liao, Mingyu Fan, Long Zeng
https://arxiv.org/abs/2510.12192

SDGraph: Multi-Level Sketch Representation Learning by Sparse-Dense Graph Architecture
Freehand sketches exhibit unique sparsity and abstraction, necessitating learning pipelines distinct from those designed for images. For sketch learning methods, the central objective is to fully exploit the effective information embedded in sketches. However, there is limited research on what constitutes effective sketch information, which in turn constrains the performance of existing approaches. To tackle this issue, we first proposed the Multi-Level Sketch Representation Scheme to systemati…

BRB, rewriting all my graph algorithms https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/

New Method Is the Fastest Way To Find the Best Routes | Quanta Magazine
A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
Zi-Xia Song, Thomas Tibbetts
https://arxiv.org/abs/2510.12567 https://arxiv.org/pdf/2…

Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
A dominating $K_t$ minor in a graph $G$ is a sequence $(T_1,\dots,T_t)$ of pairwise disjoint non-empty connected subgraphs of $G$, such that for $1 \leq i

Using Medical Algorithms for Task-Oriented Dialogue in LLM-Based Medical Interviews
Rui Reis, Pedro Rangel Henriques, Jo\~ao Ferreira-Coimbra, Eva Oliveira, Nuno F. Rodrigues
https://arxiv.org/abs/2510.12490

Using Medical Algorithms for Task-Oriented Dialogue in LLM-Based Medical Interviews
We developed a task-oriented dialogue framework structured as a Directed Acyclic Graph (DAG) of medical questions. The system integrates: (1) a systematic pipeline for transforming medical algorithms and guidelines into a clinical question corpus; (2) a cold-start mechanism based on hierarchical clustering to generate efficient initial questioning without prior patient information; (3) an expand-and-prune mechanism enabling adaptive branching and backtracking based on patient responses; (4) a t…

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.

Topological Signatures of ReLU Neural Network Activation Patterns
Vicente Bosca, Tatum Rask, Sunia Tanweer, Andrew R. Tawfeek, Branden Stone
https://arxiv.org/abs/2510.12700 htt…

Topological Signatures of ReLU Neural Network Activation Patterns
This paper explores the topological signatures of ReLU neural network activation patterns. We consider feedforward neural networks with ReLU activation functions and analyze the polytope decomposition of the feature space induced by the network. Mainly, we investigate how the Fiedler partition of the dual graph and show that it appears to correlate with the decision boundary -- in the case of binary classification. Additionally, we compute the homology of the cellular decomposition -- in a regr…

Worldwide, sales of new cars with a fossil fuel combustion engine dropped to the level of 2004, by 2024. And sales of new cars that use fossil fuels (100% or partially, in hybrids) dropped to the level of 2012. EVs are on the march.
https://www.canarymedia.com/articles/clean

Gaussian Semantic Field for One-shot LiDAR Global Localization
Pengyu Yin, Shenghai Yuan, Haozhi Cao, Xingyu Ji, Ruofei Bai, Siyu Chen, Lihua Xie
https://arxiv.org/abs/2510.12101

Gaussian Semantic Field for One-shot LiDAR Global Localization
We present a one-shot LiDAR global localization algorithm featuring semantic disambiguation ability based on a lightweight tri-layered scene graph. While landmark semantic registration-based methods have shown promising performance improvements in global localization compared with geometric-only methods, landmarks can be repetitive and misleading for correspondence establishment. We propose to mitigate this problem by modeling semantic distributions with continuous functions learned from a popu…

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

Isn't that something? This graph shows traffic to pages on @… that don't exist (404 #error).
It seems like #AI really is sending much more traffic to page…

Total Cohort Fertility Rate and Total Period Fertility Rate for Ireland, using birth data up to end 2024. Consistent downward trend in both, the relative pause in the middle of the TPFR decline is associated with large net in-migration (including of young women) during the Celtic Tiger.
#mastodaoine

@… TiL about the Petersen Graph, which is the exact combination of mathematics and pentagrams that I feel epitomises The Laundry Files.
https://en.wikipedia.org/wiki/Petersen

Petersen graph - Wikipedia

Vizing's Theorem in Deterministic Almost-Linear Time
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Mart\'in Costa, Shay Solomon, Tianyi Zhang
https://arxiv.org/abs/2510.12619

Vizing's Theorem in Deterministic Almost-Linear Time
Vizing's theorem states that any $n$-vertex $m$-edge graph of maximum degree $Δ$ can be edge colored using at most $Δ+ 1$ different colors. Vizing's original proof is easily translated into a deterministic $O(mn)$ time algorithm. This deterministic time bound was subsequently improved to $\tilde O(m \sqrt n)$ time, independently by [Arjomandi, 1982] and by [Gabow et al., 1985]. A series of recent papers improved the time bound of $\tilde O(m\sqrt{n})$ using randomization, culminating in the…

Crosslisted article(s) found for cs.CV. https://arxiv.org/list/cs.CV/new
[1/1]:
- CC-GRMAS: A Multi-Agent Graph Neural System for Spatiotemporal Landslide Risk Assessment in High ...
Mihir Panchal, Ying-Jung Chen, Surya Parkash

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[4/6]:
- TFGA-Net: Temporal-Frequency Graph Attention Network for Brain-Controlled Speaker Extraction
Youhao Si, Yuan Liao, Qiushi Han, Yuhang Yang, Rui Dai, Liya Huang

RE: https://social.linux.pizza/@midtsveen/115873448416894765
It now has an open graph banner.

This graph perfectly illustrates how bad the Raiders have been on both sides of the ball https://raiderswire.usatoday.com/story/sports/nfl/raiders/2025/10/30/raiders-offense-defense-epa-graph-turnover-differe…

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…

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…

Engineering Dominating Patterns: A Fine-grained Case Study
Jonathan Dransfeld, Marvin K\"unnemann, Mirza Redzic, Marcus Wunderlich
https://arxiv.org/abs/2510.12232 https://…

Engineering Dominating Patterns: A Fine-grained Case Study
The \emph{Dominating $H$-Pattern} problem generalizes the classical $k$-Dominating Set problem: for a fixed \emph{pattern} $H$ and a given graph $G$, the goal is to find an induced subgraph $S$ of $G$ such that (1) $S$ is isomorphic to $H$, and (2) $S$ forms a dominating set in $G$. Fine-grained complexity results show that on worst-case inputs, any significant improvement over the naive brute-force algorithm is unlikely, as this would refute the Strong Exponential Time Hypothesis. Nevertheless…

Leveraging Language Semantics for Collaborative Filtering with TextGCN and TextGCN-MLP: Zero-Shot vs In-Domain Performance
Andrei Chernov, Haroon Wahab, Oleg Novitskij
https://arxiv.org/abs/2510.12461 …

Leveraging Language Semantics for Collaborative Filtering with TextGCN and TextGCN-MLP: Zero-Shot vs In-Domain Performance
In recent years, various approaches have been proposed to leverage large language models (LLMs) for incorporating textual information about items into recommender systems. Existing methods primarily focus on either fine-tuning LLMs to generate recommendations or integrating LLM-based embeddings into downstream models. In this work, we follow the latter direction and propose \textbf{TextGCN}, which applies parameter-free graph convolution layers directly over LLM-based item-title embeddings, ins…

Metric Dimension of Generalized Theta Graphs
Nadia Benakli, Nicole Froitzheim, David Martinez
https://arxiv.org/abs/2510.12100 https://arxiv.org/pdf/2510.1…

Metric Dimension of Generalized Theta Graphs
A vertex $w$ in a graph $G$ is said to resolve two vertices $u$ and $v$ if $d(w,u)\neq d(w, v)$. A set $W$ of vertices is a resolving set for $G$ if every pair of distinct vertices is resolved by some vertex in $W$. The metric dimension of $G$ is the minimum cardinality of such a set. In this paper, we investigate the metric dimension of generalized theta graphs, providing exact values and structural insights for several subclasses.

A thread dumping some (non-obvious?) notes about #firewalld - I think I've got it doing what I want, but it's been a bit of a fight, and I made a bunch of wrong turns.
It's a layer on top of nftables or iptables; is XML based but you can just drive it from a command line tool firewall-cmd and avoid the XML.
It's main idea is a graph of 'zones' where a 'zo…

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://

Market share of Dutch car sales. The market for diesel cars here crashed after Volkswagen's Dieselgate scandal broke in 2015.
And then gasoline's share collapsed, from over 70% in 2019 to just 13% last year.
The winners: EVs (40% now) and hybrids (45%).

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://

Tur\'an densities of stars in uniformly dense hypergraphs
Hao Lin, Wenling Zhou
https://arxiv.org/abs/2510.12576 https://arxiv.org/pdf/2510.12576

Turán densities of stars in uniformly dense hypergraphs
A $3$-uniform hypergraph (or $3$-graph) $H=(V,E)$ is $(d,μ, \text{dot})$-dense if for any subsets $X, Y, Z\subseteq V$, the number of triples $(x,y,z)\in X\times Y\times Y$ with $\{x,y,z\}$ being an edge of $H$ is at least $d|X||Y||Z|-μ|V|^3$. Similarly, we say that $H$ is $(d,μ, \text{dot-edge})$-dense if for any subset $X\subseteq V$ and every pair set $P\subseteq V\times V$, the number of pairs $(x,(y,z))\in X\times P$ with $\{x,y,z\}$ being an edge…

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
Nicolas El Maalouly, Kostas Lakis
https://arxiv.org/abs/2510.12552 https://…

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
The Exact Matching (EM) problem asks whether there exists a perfect matching which uses a prescribed number of red edges in a red/blue edge-colored graph. While there exists a randomized polynomial-time algorithm for the problem, only some special cases admit a deterministic one so far, making it a natural candidate for testing the P=RP hypothesis. A polynomial-time equivalent problem, Top-k Perfect Matching (TkPM), asks for a perfect matching maximizing the weight of the $k$ heaviest edges. …

Completions of pairwise comparison data that minimize the triad measure of inconsistency
Susana Furtado, Charles Johnson
https://arxiv.org/abs/2510.12351 https://

Completions of pairwise comparison data that minimize the triad measure of inconsistency
We consider incomplete pairwise comparison matrices and determine exactly when they have a consistent completion and, if not, when they have a nearly consistent completion. We use the maximum 3-cycle product as a measure of inconsistency and show that, when the graph of the specified entries is chordal, a completion in which this measure is not increased is always possible. Methodology to produce such completions is developed. Such methodology may also be used to reduce inconsistency with few c…

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

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

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<…

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

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

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…

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 112890 edges.
Tags: Biol…

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…

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…

wikipedia_growth: en-Wikipedia links (2007)
The network of hyperlinks among English wikipedia pages, in 2007. An edge (i,j) indicates that article i hyperlinks to article j, and each edge is timestamped with its creation.
This network has 1870709 nodes and 39953145 edges.
Tags: Informational, Web graph, Unweighted, Timestamps
https:/…

edit_wikibooks: Wikipedia book edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about books. 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 1671 nodes and 2861 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 4946 nodes and 23441 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

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://

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

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

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 26197 nodes and 28980 edges.

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

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, 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://

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

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

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…

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…

netscience: Scientific collaborations in network science (2006)
A coauthorship network among scientists working on network science, from 2006. This network is a one-mode projection from the bipartite graph of authors and their scientific publications.
This network has 1589 nodes and 2742 edges.
Tags: Social, Collaboration, Weighted, Projection

edit_wikibooks: Wikipedia book edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about books. 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 1135 nodes and 2572 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
<…

edit_wikibooks: Wikipedia book edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about books. 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 5267 nodes and 12212 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
…

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…

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://

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…

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…

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

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 68746 nodes and 51971 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

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 133280 nodes and 396160 edges.

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<…

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://