Tootfinder

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

A loss of 60,000 jobs in and around academia is ~50% more than all coal mining jobs in the entire country.
https://bsky.app/profile/franzferdinand2.bsky.social/post/3lvjvdzol222m

Some Tur\'{a}n-type results for signless Laplacian spectral radius
Jian Zheng, Yongtao Li, Yi-Zheng Fan
https://arxiv.org/abs/2507.02263 https://

Some Turán-type results for signless Laplacian spectral radius
Half a century ago, Bollobás and Erdős [Bull. London Math. Soc. 5 (1973)] proved that every $n$-vertex graph $G$ with $e(G)\ge (1- \frac{1}{k} + \varepsilon )\frac{n^2}{2}$ edges contains a blowup $K_{k+1}[t]$ with $t=Ω_{k,\varepsilon}(\log n)$. A well-known theorem of Nikiforov [Combin. Probab. Comput. 18 (3) (2009)] asserts that if $G$ is an $n$-vertex graph with adjacency spectral radius $λ(G)\ge (1- \frac{1}{k} + \varepsilon)n$, then $G$ contains a blowup $K_{k+1}[t]$ with $t=Ω_{k,\var…

@… What are the odds it simply contains a staircase down into a vast, cavernous bunker?

Selfishness.
Lack of accountability.
Cowardice.
Moral rot.
#LisaMurkowski #Cowardice #immorality

Polynomials over division rings
Alina G. Goutor, Sergey V. Tikhonov
https://arxiv.org/abs/2509.03748 https://arxiv.org/pdf/2509.03748

Polynomials over division rings
We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root of a polynomial over an arbitrary division ring, then the conjugacy class of this element contains infinitely many elements that are not roots of this polynomial. The paper also contains estimates for the number of different conjugacy classes of spherical ro…

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

This https://arxiv.org/abs/2505.24772 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Mixed state concurrence for symmetric systems
We present a method to quantify entanglement in mixed states of highly symmetric systems. Symmetry constrains interactions between parts and predicts the degeneracies of the states. While symmetry alone produces entangled eigenstates, the thermal mixed state (density) which contains all of the eigenstate densities weighted by their Boltzmann factors is not necessarily as entangled as the eigenstates themselves because generally the mixed state can be re-expressed as a sum over densities which a…

Transcendental formulas for the coefficients of Ramanujan's mock theta functions
Nickolas Andersen, Gradin Anderson
https://arxiv.org/abs/2509.02777 https://

Transcendental formulas for the coefficients of Ramanujan's mock theta functions
Ramanujan's 1920 last letter to Hardy contains seventeen examples of mock theta functions which he organized into three "orders." The most famous of these is the third-order function $f(q)$ which has received the most attention of any individual mock theta function in the intervening century. In 1964, Andrews--improving on a result of Dragonette--gave an asymptotic formula for the coefficients of $f(q)$ and conjectured an exact formula for the coefficients: a conditionally convergent series tha…

VisCoder: Fine-Tuning LLMs for Executable Python Visualization Code Generation
Yuansheng Ni, Ping Nie, Kai Zou, Xiang Yue, Wenhu Chen
https://arxiv.org/abs/2506.03930

VisCoder: Fine-Tuning LLMs for Executable Python Visualization Code Generation
Large language models (LLMs) often struggle with visualization tasks like plotting diagrams, charts, where success depends on both code correctness and visual semantics. Existing instruction-tuning datasets lack execution-grounded supervision and offer limited support for iterative code correction, resulting in fragile and unreliable plot generation. We present VisCode-200K, a large-scale instruction tuning dataset for Python-based visualization and self-correction. It contains over 200K exampl…

On the equivariant vector bundles on $\mathbb{CP}^1$
Indranil Biswas, Manish Kumar, A. J. Parameswaran
https://arxiv.org/abs/2507.02359 https://

On the equivariant vector bundles on $\mathbb{CP}^1$
Let $H$ be a subgroup of ${\rm PGL}(2,\mathbb C)$ (respectively, ${\rm SL}(2,\mathbb C)$) such that the Zariski closure in ${\rm PGL}(2,\mathbb C)$ (respectively, ${\rm SL}(2,\mathbb C)$) of some compact subgroup of $H$ contains $H$. We classify the $H$--equivariant holomorphic vector bundles on $\mathbb{CP}^1$. This generalizes \cite{BM} where $H$ was assumed to be a finite abelian group.

On irredundant orthogonal arrays
Maryam Bajalan, Peter Boyvalenkov
https://arxiv.org/abs/2506.03688 https://arxiv.org/pdf/2506.03688

On irredundant orthogonal arrays
An orthogonal array (OA), denoted by $\text{OA}(M, n, q, t)$, is an $M \times n$ matrix over an alphabet of size $q$ such that every selection of $t$ columns contains each possible $t$-tuple exactly $λ=M / q^t$ times. An irredundant orthogonal array (IrOA) is an OA with the additional property that, in any selection of $n - t$ columns, all resulting rows are distinct. IrOAs were first introduced by Goyeneche and Życzkowski in 2014 to construct $t$-uniform quantum states without redundant info…

A Supergeometric Fa\`{a} di Bruno Formula
Andreas Swerdlow
https://arxiv.org/abs/2508.00092 https://arxiv.org/pdf/2508.00092…

A Supergeometric Faà di Bruno Formula
We extend the multivariate Faà di Bruno formula to the super case, where anticommuting odd coordinates are considered. The formula takes the same form as the classical case but contains some nontrivial signs, which essentially measure the failure to order the odd factors and derivatives optimally. As a quick application, we obtain an explicit combinatorial formula for the generalized super Bell polynomials, defined by Fan and Hon.

Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
Shuichi Hirahara, Naoto Ohsaka
https://arxiv.org/abs/2508.00276 https://arxiv.org/pdf/…

Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
In the Maxmin E$k$-SAT Reconfiguration problem, we are given a satisfiable $k$-CNF formula $φ$ where each clause contains exactly $k$ literals, along with a pair of its satisfying assignments. The objective is transform one satisfying assignment into the other by repeatedly flipping the value of a single variable, while maximizing the minimum fraction of satisfied clauses of $φ$ throughout the transformation. In this paper, we demonstrate that the optimal approximation factor for Maxmin E$k$-…

Renormalization group flows in area-metric gravity
Johanna Borissova, Bianca Dittrich, Astrid Eichhorn, Marc Schiffer
https://arxiv.org/abs/2507.02034 http…

Renormalization group flows in area-metric gravity
We put forward the first analysis of renormalization group flows in an area-metric theory, motivated by spin-foam quantum gravity. Area-metric gravity contains the well-known length-metric degrees of freedom of standard gravity as well as additional shape-mismatching degrees of freedom. To be phenomenologically viable, the shape-mismatching degrees of freedom have to decouple under the renormalization group flow towards lower scales. We test this scenario by calculating the renormalization grou…

HST Observations of the CV Propeller LAMOST J024048.51 195226.9
Jordan Tweddale, Peter Garnavich, Colin Littlefield, Paula Szkody
https://arxiv.org/abs/2508.00990 https://

HST Observations of the CV Propeller LAMOST J024048.51+195226.9
We present Hubble Space Telescope (HST) FUV spectra and light curves of the magnetic cataclysmic variable (CV) LAMOST J024048.51+195226.9 (J0240), the second known CV propeller. The five consecutive HST orbits span a full 7.34 hour binary orbital period. We detect a 24.939 $\pm$ 0.006 s FUV modulation, confirming that J0240 contains the fastest spinning white dwarf (WD) in a CV. A high N V/C IV emission line ratio is considered an indicator of a recent episode of thermal time-scale mass transfe…

Implications of a dark grand unification
Phung Van Dong, Do Thi Huong
https://arxiv.org/abs/2508.01429 https://arxiv.org/pdf/2508.01429

Implications of a dark grand unification
Given that dark matter and normal matter are nontrivially unified in a grand unified theory, called dark grand unification, we derive novel residual theories at low energy explaining dark matter and neutrino mass. The first chain of which is $E_6\to SU(3)_C\otimes SU(3)_L\otimes SU(3)_R$, which contains a matter parity by itself stabilizing a dark matter candidate and producing neutrino mass via a seesaw. The second chain is $\mathrm{Trinification}\to SU(3)_C \otimes SU(3)_L\otimes U(1)_X\otime…

reuters: Reuters news stories (1987, 2000)
A bipartite network of Reuters news stories and words. Edges connect each story to all the words it contains.
This network has 1065176 nodes and 60569726 edges.
Tags: Informational, Language, Unweighted
https://networks.skewed.de/net/reuters…

This https://arxiv.org/abs/2409.08429 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

The Atacama Cosmology Telescope: Systematic Transient Search of Single Observation Maps
We conduct a systematic search for astrophysical transients using data from the Atacama Cosmology Telescope (ACT). The data were taken from 2017 to 2022 in three frequency bands spanning 77 GHz to 277 GHz. In this paper we present a pipeline for transient detection using single observation maps where each pixel of a map contains one observation with an integration time of approximately four minutes. We detect 34 transient events at 27 unique locations. All but two of the transients are associat…

Predictions of dust continuum observations of circumplanetary disks with ngVLA: A case study of PDS 70 c
Yuhito Shibaike, Takahiro Ueda, Misato Fukagawa
https://arxiv.org/abs/2508.00393

Predictions of dust continuum observations of circumplanetary disks with ngVLA: A case study of PDS 70 c
A gas giant forms a small gas disk called a "circumplanetary disk (CPD)" around the planet during its gas accretion process. The small gas disk contains dust particles like those in a protoplanetary disk, and these particles could be the building material of large moons. A young T Tauri star PDS 70 has two gas accreting planets, and continuum emission from one of the forming planets, PDS 70 c, has been detected by ALMA Bands 6 and 7, which is considered as the dust thermal emission from its CPD…

A potential reading list...
https://www.ctvnews.ca/edmonton/article/potential-list-of-books-slated-for-removal-from-edmonton-school-libraries-contains-significant-works-…

This https://arxiv.org/abs/2505.21124 has been replaced.
initial toot: https://mastoxiv.page/@ar…

UniFoil: A Universal Dataset of Airfoils in Transitional and Turbulent Regimes for Subsonic and Transonic Flows
We present UniFoil, a large publicly available universal airfoil dataset based on Reynolds-averaged Navier-Stokes (RANS) simulations. It contains over 500,000 samples spanning a wide range of Reynolds and Mach numbers, capturing both transitional and fully turbulent flows across incompressible to compressible regimes. UniFoil is designed to support machine learning research in fluid dynamics, particularly for modeling complex aerodynamic phenomena. Most existing datasets are limited to incompre…

Link Statistics of Dislocation Network during Strain Hardening
Sh. Akhondzadeh, Hanfeng Zhai, Wurong Jian, Ryan B. Sills, Nicolas Bertin, Wei Cai
https://arxiv.org/abs/2509.03743

Link Statistics of Dislocation Network during Strain Hardening
Dislocations are line defects in crystals that multiply and self-organize into a complex network during strain hardening. The length of dislocation links, connecting neighboring nodes within this network, contains crucial information about the evolving dislocation microstructure. By analyzing data from Discrete Dislocation Dynamics (DDD) simulations in face-centered cubic (fcc) Cu, we characterize the statistical distribution of link lengths of dislocation networks during strain hardening on in…

Negated String Containment is Decidable (Technical Report)
Vojt\v{e}ch Havlena, Michal He\v{c}ko, Luk\'a\v{s} Hol\'ik, Ond\v{r}ej Leng\'al
https://arxiv.org/abs/2506.22061

Negated String Containment is Decidable (Technical Report)
We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbolic execution of string manipulating programs. Particularly, we show that the predicate notContains(x1 ... xn, y1 ... ym), where x1 ... xn and y1 ... ym are sequences of string variables constrained by regular languages, is decidable. Decidability of a not-contains predicate combined with chain-free word equations and …

This https://arxiv.org/abs/2501.11772 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

A New Master Supernovae Ia sample and the investigation of the $H_0$ tension
Modern cosmological research still thoroughly debates the discrepancy between local probes and the Cosmic Microwave Background observations in the Hubble constant (\texorpdfstring{$H_0$}{H0}) measurements, ranging from 4 to 6$σ$. In the current study, we examine this tension using the Supernovae Ia (SNe Ia) data from the Pantheon, Pantheon+ (P+), Joint Lightcurve Analysis (JLA), and Dark Energy Survey, (DES) catalogs combined together into the so-called Master Sample. The sample contains 3714 …

A Relaxation Approach to Synthetic Control
Chengwang Liao, Zhentao Shi, Yapeng Zheng
https://arxiv.org/abs/2508.01793 https://arxiv.org/pdf/2508.01793

A Relaxation Approach to Synthetic Control
The synthetic control method (SCM) is widely used for constructing the counterfactual of a treated unit based on data from control units in a donor pool. Allowing the donor pool contains more control units than time periods, we propose a novel machine learning algorithm, named SCM-relaxation, for counterfactual prediction. Our relaxation approach minimizes an information-theoretic measure of the weights subject to a set of relaxed linear inequality constraints in addition to the simplex constra…

Plasmons in a network of topological states in twisted bilayer graphene
Brian S. Vermilyea, Michael M. Fogler
https://arxiv.org/abs/2509.03781 https://arxi…

Plasmons in a network of topological states in twisted bilayer graphene
We study surface plasmons in minimally-twisted bilayer graphene that contains a triangular network of partial dislocations (or AB-BA domain walls) hosting one-dimensional electronic states. We calculate plasmon dispersion by solving classical equations of motion for charge dynamics on the network links with impedance boundary conditions at the network nodes. The plasmon band structure is shown to be quasi-periodic in frequency and damped everywhere except at high-symmetry points of the moiré B…

On the Lagrangian Hofer geometry of Clifford tori
Frol Zapolsky
https://arxiv.org/abs/2508.02501 https://arxiv.org/pdf/2508.02501

On the Lagrangian Hofer geometry of Clifford tori
We show that the space of Lagrangians which are Hamiltonian isotopic to the Clifford torus in a complex projective space or in the four-dimensional quadric, taken with Chekanov's Lagrangian Hofer metric, contains a quasi-isometric copy of the real line, and in particular has infinite diameter.

The new PixelFed update looks so dope! It really brings me back to the good old days of the internet, where the focus was purely on community and content without the clutter of ads. It’s so refreshing to see people building something that really feels like the internet used to.
#pixelfed
#mastodon

WaveMixings.jl: a Julia package for performing on-the-fly time-resolved nonlinear electronic spectra from quasi-classical trajectories
Luis Vasquez, Sebastian Pios, Lipeng Chen, Zhenggang Lan, Wolfgang Domcke, Maxim Gelin
https://arxiv.org/abs/2509.03917

WaveMixings.jl: a Julia package for performing on-the-fly time-resolved nonlinear electronic spectra from quasi-classical trajectories
We present an efficient numerical implementation of the quasi-classical doorway-window approximation, specifically designed for on-the-fly simulations of time-resolved nonlinear spectroscopic signals in the Julia package WaveMixings.jl. The package contains modules that facilitate standard tasks such as input/output data handling, data filtering, and post-processing, among others. WaveMixings.jl includes implementations of various methods developed by the authors, including integral and dispers…

sp_infectious: Art exhibit dynamic contacts (2011)
This dataset contains the daily dynamic contact networks collected during the Infectious SocioPatterns event that took place at the Science Gallery in Dublin, Ireland, during the artscience exhibition INFECTIOUS: STAY AWAY. Each file in the downloadable package contains a tab-separated list representing the active contacts during 20-second intervals of one day of data collection. Each line has the form “t i j“, where i and j are the a…

When the International Criminal Court gets hacked in June 2025, it's not clear who you might expect the culprits to be.
https://www.icc-cpi.int/news/icc-detects-and-contains-new-sophisticated-cyber-security-incident

Ransomware Group Anubis has leaked what they extracted from Disneyland Paris
#ransomware

Ransomware.live 👀
Ransomware.live tracks ransomware groups and their activity. It was created by Julien Mousqueton, a security researcher. The website provides information on the groups' infrastructure, victims, and payment demands. It also includes a live map that shows the latest ransomware attacks.

Not to brag, but I can _still_ complete this level in the TMNT (NES) game. A few years ago I installed a rom emulator for my kid, and obviously I needed to test it out.
A lot of games I sucked at (Street Fighter 2 (for SNES), which I spent countless hundreds of hours playing, somehow I'd forgotten all the combo moves), but some games I still had locked down. Punch Out I was able to almost beat. And TMNT, I disarmed the bombs and finished this level on my first try.

New bounds for some small multicolor Ramsey numbers
William J. Wesley
https://arxiv.org/abs/2509.03784 https://arxiv.org/pdf/2509.03784

New bounds for some small multicolor Ramsey numbers
The Ramsey number $R(G_1,\dots,G_k)$ is the smallest $n$ such that every $k$-coloring of the edges of $K_n$ contains a monochromatic copy of $G_i$ in color $i$. Ramsey numbers are challenging to compute, and few are known exactly. We use Boolean satisfiability (SAT) solvers to search for structured colorings that give lower bounds, and we show $R(K_4,K_4-e,K_4-e) \ge 35$ and $R(K_3,K_4,C_4,C_4) \ge 49$. Moreover, we tighten some recent upper bounds for multicolor Ramsey numbers for cycles and s…

Popescu-Rohrlich box fraction of dimensionally restricted nonlocality and secure quantum key distribution
Chellasamy Jebarathinam
https://arxiv.org/abs/2507.02473

Popescu-Rohrlich box fraction of dimensionally restricted nonlocality and secure quantum key distribution
With a measure of dimensionally restricted nonlocality in the bipartite Bell scenario with two inputs and two outputs, a different decomposition of any nonsignaling box that is a convex mixture of a single Popescu-Rohrlich box and a Bell-local box, with the measure being zero, is introduced. It is shown that any nonsignaling box shared by Alice and Bob that has dimensionally restricted nonlocality contains secret correlations against any third party, Eve, who is also dimensionally restricted. I…

Privacy, Informed Consent and the Demand for Anonymisation of Smart Meter Data
Saurab Chhachhi, Fei Teng
https://arxiv.org/abs/2509.00101 https://arxiv.org…

Privacy, Informed Consent and the Demand for Anonymisation of Smart Meter Data
Access to smart meter data offers system-wide benefits but raises significant privacy concerns due to the personal information it contains. Privacy-preserving techniques could facilitate wider access, though they introduce privacy-utility trade-offs. Understanding consumer valuations for anonymisation can help identify appropriate trade-offs. However, existing studies do not focus on anonymisation specifically or account for information asymmetries regarding privacy risks, raising questions abo…

I think it's really underappreciated that solar panels are now about as cheap per unit area as mass-produced building materials like wood, siding, shingles/shakes, etc.
The Republican reconciliation bill aims to make solar expensive again in the US through tariffs and taxes.
https://bsky…

PanTS: The Pancreatic Tumor Segmentation Dataset
Wenxuan Li, Xinze Zhou, Qi Chen, Tianyu Lin, Pedro R. A. S. Bassi, Szymon Plotka, Jaroslaw B. Cwikla, Xiaoxi Chen, Chen Ye, Zheren Zhu, Kai Ding, Heng Li, Kang Wang, Yang Yang, Yucheng Tang, Daguang Xu, Alan L. Yuille, Zongwei Zhou
https://arxiv.org/abs/2507.01291

PanTS: The Pancreatic Tumor Segmentation Dataset
PanTS is a large-scale, multi-institutional dataset curated to advance research in pancreatic CT analysis. It contains 36,390 CT scans from 145 medical centers, with expert-validated, voxel-wise annotations of over 993,000 anatomical structures, covering pancreatic tumors, pancreas head, body, and tail, and 24 surrounding anatomical structures such as vascular/skeletal structures and abdominal/thoracic organs. Each scan includes metadata such as patient age, sex, diagnosis, contrast phase, in-p…

HiFiTTS-2: A Large-Scale High Bandwidth Speech Dataset
Ryan Langman, Xuesong Yang, Paarth Neekhara, Shehzeen Hussain, Edresson Casanova, Evelina Bakhturina, Jason Li
https://arxiv.org/abs/2506.04152

HiFiTTS-2: A Large-Scale High Bandwidth Speech Dataset
This paper introduces HiFiTTS-2, a large-scale speech dataset designed for high-bandwidth speech synthesis. The dataset is derived from LibriVox audiobooks, and contains approximately 36.7k hours of English speech for 22.05 kHz training, and 31.7k hours for 44.1 kHz training. We present our data processing pipeline, including bandwidth estimation, segmentation, text preprocessing, and multi-speaker detection. The dataset is accompanied by detailed utterance and audiobook metadata generated by o…

A Strong Kurepa Tree
John Krueger
https://arxiv.org/abs/2507.01133 https://arxiv.org/pdf/2507.01133

A Strong Kurepa Tree
We prove that it is consistent that there exists a Kurepa tree $T$ such that ${}^{ω_1}2$ is a continuous image of the topological space $[T]$ consisting of all cofinal branches of $T$ with respect to the cone topologies. This result solves an open problem due to Bergfalk, Chodounský, Guzmán, and Hrušák. We also prove that any Kurepa tree with the above property contains an Aronszajn subtree.

On the sum of a prime and two Fibonacci numbers
Ji-Zhen Xu, Yong-Gao Chen
https://arxiv.org/abs/2506.03631 https://arxiv.org/pdf/2506…

On the sum of a prime and two Fibonacci numbers
Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative integers with $k_1\le k_2$. In this paper, it is proved that $\{ n : r(n)=0\} $ contains an infinite arithmetic progression, and both sets $\{ n : r(n)=1\} $ and $\{ n : r(n)\ge 2\}$ have positive asymptotic densities.

sp_infectious: Art exhibit dynamic contacts (2011)
This dataset contains the daily dynamic contact networks collected during the Infectious SocioPatterns event that took place at the Science Gallery in Dublin, Ireland, during the artscience exhibition INFECTIOUS: STAY AWAY. Each file in the downloadable package contains a tab-separated list representing the active contacts during 20-second intervals of one day of data collection. Each line has the form “t i j“, where i and j are the a…

Energy momentum tensor correlators in $\phi^4$ theory II: The spin-two sector
Nikos Irges, Leonidas Karageorgos
https://arxiv.org/abs/2507.01713 https://…

Energy momentum tensor correlators in $ϕ^4$ theory II: The spin-two sector
We extend the computation of the C_T charge of the 2-point function of the Energy-Momentum Tensor to 4-loops. We show that C_T decomposes into two sectors, the conformal sector, which encodes the value of the central charge at fixed points and an RG-sector that contains logarithmic and constant corrections proportional to the beta-function. This latter constitutes the main new result of this work and is inaccessible via CFT methods alone. Furthermore, we demonstrate that C_T satisfies an eigenv…

Multishot Capacity of Networks with Restricted Adversaries
Giuseppe Cotardo, Gretchen L. Matthews, Alberto Ravagnani, Julia Shapiro
https://arxiv.org/abs/2506.03361

Multishot Capacity of Networks with Restricted Adversaries
We investigate adversarial network coding and decoding, focusing on the multishot regime and when the adversary is restricted to operate on a vulnerable region of the network. Errors can occur on a proper subset of the network edges and are modeled via an adversarial channel. The paper contains both bounds and capacity-achieving schemes for the Diamond Network, the Mirrored Diamond Network, and generalizations of these networks. We also initiate the study of the capacity of 3-level networks in …

Anomalous free energy expansions of planar Coulomb gases: multi-component and conformal singularity
Sung-Soo Byun
https://arxiv.org/abs/2508.00316 https://…

Anomalous free energy expansions of planar Coulomb gases: multi-component and conformal singularity
We study the partition function $$ Z_n = \int_{\mathbb{C}^n } \prod_{1 \le j-1$ and $$ V(z)= |z|^{2d}-t(z^{d}+\overline{z}^{d}), \qquad t >0, \, d \in \mathbb{N}. $$ The associated droplet reveals a topological phase transition: for $t > 1/\sqrt{d}$, it consists of $d$ connected components; whereas for $t < 1/\sqrt{d}$, it becomes simply connected and contains t…

Rigidity aspects of a cosmological singularity theorem
Eric Ling, Carl Rossdeutscher, Walter Simon, Roland Steinbauer
https://arxiv.org/abs/2508.00524 https://

Rigidity aspects of a cosmological singularity theorem
Inspired by the classical singularity theorems in General Relativity, Galloway and Ling have shown the following (cf. Theorem 0): If a globally hyperbolic spacetime satisfying the null energy condition contains a closed, spacelike Cauchy surface $(V,g,K)$ (with metric $g$ and extrinsic curvature ${K}$) which is strictly 2-convex (meaning that the sum of the lowest two eigenvalues of $K$ is positive) then $V$ is either a spherical space or past null geodesically incomplete \cite{Ling, Ling2}. In…

This https://arxiv.org/abs/2408.10938 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

YSO Jets Magnetocentrifugally Driven by Reconnecting Atmospheric Avalanche Accretion Streams Above Inner Circumstellar Disks
Fast, collimated jets are ubiquitous features of young stellar objects (YSOs). They are generally thought to be powered by disk accretion, but the details are debated. Through 2D (axisymmetric) MHD simulations, we find that a fast ($>100$~km/s) collimated bipolar jet is continuously driven along the north and south poles of the circumstellar disk that is initially magnetized by a large-scale open poloidal field and contains a thermally ionized inner magnetically active zone surrounded by a dead…

" About half of all AI-generated code contains security flaws.
Veracode tasked over 100 different large language models with completing 80 separate coding tasks, from using different coding languages to building different types of applications. The results were not exactly inspiring if security is your top priority, with just 55% of tasks completed ultimately generating “secure” code."
Read This Before You Trust Any AI-Written Code
https://gizmodo.com/read-this-before-you-trust-any-ai-written-code-2000637243

The CR Yamabe invariant and constant scalar curvature Sasaki metrics
Abdellah Lahdili, Eveline Legendre, Carlo Scarpa
https://arxiv.org/abs/2509.00743 https://

The CR Yamabe invariant and constant scalar curvature Sasaki metrics
We propose a new approach to the existence of constant transversal scalar curvature Sasaki structures drawing on ideas and tools from the CR Yamabe problem, establishing a link between the CR Yamabe invariant, the existence of Sasaki structures of constant transversal scalar curvature, and the K-stability of Sasaki manifolds. Assuming that the Sasaki-Reeb cone contains a regular vector field, we show that if the CR Yamabe invariant of a compact Sasaki manifold attains a specific value determine…

Intermittent localization and fast spatial learning by non-Markov random walks with decaying memory
Paulina R. Mart\'i n-Cornejo, Denis Boyer
https://arxiv.org/abs/2509.01806

Intermittent localization and fast spatial learning by non-Markov random walks with decaying memory
Random walks on lattices with preferential relocation to previously visited sites provide a simple modeling of the displacements of animals and humans. When the lattice contains a single impurity or resource site where the walker spends more time on average at each visit than on the other sites, the long range memory can suppress diffusion and induce by reinforcement a steady state localized around the resource. This phenomenon can be identified with a spatial learning process by the walker. He…

“About half of all AI-generated code contains security flaws.” https://gizmodo.com/read-this-before-you-trust-any-ai-written-code-2000637243

A numerical study of stability for solitary waves of a quasi-linear Schr{\"o}dinger equation
Meriem Bahhi (LJAD), Jonas Lampart (ICB), Christian Klein (IUF), Simona Rota Nodari (LJAD, IUF)
https://arxiv.org/abs/2509.02236

A numerical study of stability for solitary waves of a quasi-linear Schr{ö}dinger equation
We discuss the (in)stability of solitary waves for a quasi-linear Schr{ö}dinger equation. The equation contains a quasi-linear term, responsible for a saturation effect, as well as a power nonlinearity. For different exponents of the nonlinearity, we determine analytically the asymptotic behavior of the $L^2$-mass of the solution as a function of the frequency close to the critical frequencies, which leads to natural conjectures concerning their stability. Depending on the exponent and the dim…

Numerical solutions of the complete two-body system in QUMOND
J. Pflamm-Altenburg
https://arxiv.org/abs/2509.01493 https://arxiv.org/pdf/2509.01493

Numerical solutions of the complete two-body system in QUMOND
Due to the non-linearity of the QUMOND field equations, in the modelling of binaries so far the two-body system is replaced by an effective one-body system, where the central particle contains the total mass of both binary components and is orbited by a massless test particle. In this work, the discrepancy between the effective one-body treatment and the complete two-body solution in QUMOND is quantified. Particles are treated as limits of Dirac sequences. Then, the QUMOND contribution to the t…

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

Colored base-3 partitions, sequences of polynomials, and perfect numbers
Karl Dilcher, Larry Ericksen
https://arxiv.org/abs/2509.03147 https://arxiv.org/pd…

Colored base-3 partitions, sequences of polynomials, and perfect numbers
Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties and combinatorial interpretations. We then concentrate on certain subsequences that are related to the Chebyshev polynomials of both kinds. Finally, we consider several sequences of single-variable polynomials that have meaningful combinatorial interpretation…

I've always thought of civility like I think of objectivity in news:
well intended, but entirely optional standard that often results in things that need to be said not being said in order to keep messages more palatable.
Of course, I am a Midwestern guy who teaches the 1st Amendment for a living.
-- Christopher Terry
…

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

This https://arxiv.org/abs/2501.13486 has been replaced.
initial toot: https://mastoxiv.page/@a…

Radial Stabilization of Magnetic Skyrmions Under Strong External Magnetic Field
The skyrmion number density, $q\equiv\vec{n}\cdot\left(\partial_x\vec{n}\times\partial_y\vec{n}\right)/(4π)$, is one of the key quantities that characterizes the topological properties of a magnetic skyrmion. In this work, we propose a model for a two-dimensional magnetic system with Hamiltonian that contains an interaction term proportional to $q^2$ which preserves inversion symmetry. The proposed $q^2$ term is also known as the Skyrme term and is a two-dimensional version of the well-known q…

New Bounds for Linear Codes with Applications
Liren Lin, Guanghui Zhang, Bocong Chen, Hongwei Liu
https://arxiv.org/abs/2509.03337 https://arxiv.org/pdf/25…

New Bounds for Linear Codes with Applications
Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results characterize this trade-off solely in terms of the parameters $n$, $k$, $d$ and $q$. In this work we derive new bounds under the additional assumption that the code contains a nonzero codeword of weight $w$.By combining residual-code techniques with classical results su…

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

Gravastars with Kuchowicz Metric Potential in $f(R, \Sigma, T)$ Gravity
Bharat Singh, S. Surendra Singh
https://arxiv.org/abs/2509.03553 https://arxiv.org/…

Gravastars with Kuchowicz Metric Potential in $f(R, Σ, T)$ Gravity
This manuscript explores the gravastar model in the $f(R,Σ,T)$ gravity framework, with the help of Kuchowicz metric funcition, offering an alternative to black holes. A gravastar has three regions: interior, intermediate shell, and exterior. The interior region has pressure equal to negative density, generating a repulsive force across the thin shell. The intermediate shell contains ultra-relativistic plasma fluids, with pressure proportional to density, balancing the interior's repulsive forc…

The Local Structure Theorem for Graph Minors with Finite Index
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
https://arxiv.org/abs/2507.02769

The Local Structure Theorem for Graph Minors with Finite Index
The Local Structure Theorem (LST) for graph minors roughly states that every $H$-minor free graph $G$ that contains a sufficiently large wall $W$, there is a set of few vertices $A$ such that, upon removing $A$, the resulting graph $G':=G - A$ admits an "almost embedding" $δ$ into a surface $Σ$ in which $H$ does not embed. By almost embedding, we mean that there exists a hypergraph $\mathcal{H}$ whose vertex set is a subset of the vertex set of $G$ and an embedding of $\mathcal{H}$ in $Σ$ su…

us_roads: United States roads (2000)
The road networks of the 50 US States and the District of Columbia based on UA Census 2000 TIGER/Line Files. Edges are stretches of road and vertices are intersections of roads. The data sets were assembled by Dominik Schultes. The 'merged' network contains all the states merged together.
This network has 467967 nodes and 525995 edges.
Tags: Transportation, Roads, Unweighted

The Balmer spectrum of Voevodsky motives and pure symbols
Alexander Vishik
https://arxiv.org/abs/2509.00584 https://arxiv.org/pdf/2509.00584

The Balmer spectrum of Voevodsky motives and pure symbols
In this article we introduce invariants of points of the Balmer spectrum of the Voevodsky motivic category whose values are "light Rost cycle submodules" of the module of pure symbols in Milnor's K-theory (mod 2). As an application, we show that isotropic points of the Balmer spectrum are closed. We also introduce the notion of points of a boundary type and show that this class contains isotropic points, but not the etale one.

The generalized Tur\'an number for K_3 in graphs without suspensions of a path on five vertices
Doudou Hei, Xinmin Hou, Yue Ma
https://arxiv.org/abs/2509.03851 https://

The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices
Given graphs $H$ and $F$, the generalized Turán number $\ex(n, H, F)$ is defined as the maximum number of copies of $H$ in an $n$-vertex graph that contains no copy of $F$. The suspension $\widehat{F}$ of a graph $F$ is obtained by adding a new vertex that is adjacent to every vertex of $F$. Mubayi and Mukherjee (2023, DM) conjectured that $\ex(n, K_3, \widehat{P_k})=\left\lfloor \frac{k-2}{2}\right\rfloor \cdot \frac{n^2}{8}+o(n^2)$, where $P_k$ is a path on $k\ge 4$ vertices. Using…

Beyond morphophoricity: $s$-tight IC measurements in geometric generalised probabilistic theories
Anna Szymusiak
https://arxiv.org/abs/2507.01745 https://

Beyond morphophoricity: $s$-tight IC measurements in geometric generalised probabilistic theories
The analysed in this paper new class of $s$-tight IC measurements contains both morphophoric measurements, preserving the geometry of the states space, and tight IC measurements, introduced nearly 20 years ago by Scott in the quantum case as optimal for the task of linear quantum tomography. By looking at the mathematical side of these classes we discover their common feature, which is also preserved in the broader class of $s$-tight IC measurements: a particularly elegant form of the formula t…

Sen. Murkowski admits Trump's budget bill is harmful after she folded and voted yes on it:
"I know that in many parts of the country, there are Americans that are not going to be advantaged by this bill"
(Skip to 1:20 for her admissions)
https://bsky.app/profile/amwcl…

All rectangles exhibit canonical Ramsey property
Gennian Ge, Yang Shu, Zixiang Xu
https://arxiv.org/abs/2508.02465 https://arxiv.org/pdf/2508.02465

All rectangles exhibit canonical Ramsey property
In a seminal work, Cheng and Xu proved that for any positive integer \(r\), there exists an integer \(n_0\), independent of \(r\), such that every \(r\)-coloring of the \(n\)-dimensional Euclidean space \(\mathbb{E}^n\) with \(n \ge n_0\) contains either a monochromatic or a rainbow congruent copy of a square. This phenomenon of dimension-independence was later formalized as the canonical Ramsey property by Geheér, Sagdeev, and Tóth, who extended the result to all hypercubes, and to rectangle…

All large primes have Property D
Schlage-Puchta, Jan-Christoph
https://arxiv.org/abs/2509.02436 https://arxiv.org/pdf/2509.02436

All large primes have Property D
Let $p$ be a prime number, $a_1, a_2, \ldots a_{4p-4}$ a sequence of elements in $(\mathbb{Z}/p\\mathbb{Z})^2$, which does not contain a subsequence of length $p$ which adds up to 0. We show that if $p$ is sufficiently large, then the sequence contains exactly four different elements.

Generalized Turan number with given size
Yan Wang, Yue Xu, Jiasheng Zeng, Xiao-Dong Zhang
https://arxiv.org/abs/2508.00483 https://arxiv.org/pdf/2508.00483…

Generalized Turan number with given size
Generalized Turán problem with given size, denoted as $\mathrm{mex}(m,K_r,F)$, determines the maximum number of $K_r$-copies in an $F$-free graph with $m$ edges. We prove that for $r\ge 3$ and $α\in(\frac 2 r,1]$, any graph $G$ with $m$ edges and $Ω(m^{\frac{αr}{2}})$ $K_r$-copies has a subgraph of order $n_0=Ω(m^\fracα{2})$, which contains $Ω(n_0^{\frac{i(r-2)α}{(2-α)r-2}})$ $K_i$-copies for each $i = 2, \ldots, r$. This implies an upper bound of $\mathrm{mex}(m, K_r, F)$ when an uppe…

This is part of the overall assault on knowledge that the administration is undertaking.
Everything that has made this nation a shining beacon in any way whatsoever is being dismantled
-- with the worst aspects of American history being held up as aspirational.
Please call Congress if you are able.
🛰️🧪

sp_hospital: Hospital ward dynamic contacts (2010)
This dataset contains the temporal network of contacts between patients, patients and health-care workers (HCWs) and among HCWs in a hospital ward in Lyon, France, from Monday, December 6, 2010 at 1:00 pm to Friday, December 10, 2010 at 2:00 pm. The study included 46 HCWs and 29 patients.
This network has 75 nodes and 32424 edges.
Tags: Social, Offline, Unweighted, Temporal, Metadata

reuters: Reuters news stories (1987, 2000)
A bipartite network of Reuters news stories and words. Edges connect each story to all the words it contains.
This network has 1065176 nodes and 60569726 edges.
Tags: Informational, Language, Unweighted
https://networks.skewed.de/net/reuters…

pokec: Pokec online social network (2012)
The online social network of Pokec, a popular OSN in Slovakia, from 2012. Date covers about 10 years and more than 1.6 million people. Profile data contains gender, age, hobbies, interest, education etc. Profile metadata are in Slovak language. Friendships in Pokec are oriented.
This network has 1632804 nodes and 30622564 edges.
Tags: Social, Online, Metadata

sp_infectious: Art exhibit dynamic contacts (2011)
This dataset contains the daily dynamic contact networks collected during the Infectious SocioPatterns event that took place at the Science Gallery in Dublin, Ireland, during the artscience exhibition INFECTIOUS: STAY AWAY. Each file in the downloadable package contains a tab-separated list representing the active contacts during 20-second intervals of one day of data collection. Each line has the form “t i j“, where i and j are the a…

Trump believes in American
Non-Exceptionalism.
His claim that America is as amoral as authoritarian regimes has long been false. But he longs to make it true.
https://bsky.app/profile/davidrlurie.bsky.social/post/3lsqzsdnsbs25

Random Cayley graphs and random sumsets
Noga Alon, Huy Tuan Pham
https://arxiv.org/abs/2509.02561 https://arxiv.org/pdf/2509.02561

Random Cayley graphs and random sumsets
We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in the sumset $A+A$ and is not much smaller than it. Using this result we obtain improved bounds for the problem of estimating the typical independence number of sparse random Cayley or Cayley-sum graphs, and for the problem of estimating the smallest size of a…

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

Size-Ramsey numbers of tight paths
Shoham Letzter, Alexey Pokrovskiy, Liana Yepremyan
https://arxiv.org/abs/2507.01498 https://arxiv.…

Size-Ramsey numbers of tight paths
The $s$-colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$-edge-colouring contains a monochromatic copy of $H$. We show that the $s$-colour size-Ramsey number of the $r$-uniform tight path on $n$ vertices is linear in $n$, for every fixed $r$ and $s$, thereby answering a question of Dudek, La Fleur, Mubayi and Rödl (2017).

Got a yard sign at the Evanston Main Street Fair from @katmabu.bsky.social.
Really respect her hustle in this campaign. Just out there at everything, meeting voters face to face. Her platform seems solid, and it would be great to have her enthusiasm and energy representing the 9th.
The best way to support her campaign is to donate

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
Jiangdong Ai, Qiwen Guo, Gregory Gutin, Yimin Hao, Anders Yeo
https://arxiv.org/abs/2509.01428

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
A long-standing and well-known conjecture (see e.g. Caro, Discrete Math, 1994) states that every $n$-vertex graph $G$ without isolated vertices contains an induced subgraph where all vertices have an odd degree and whose order is linear in $n$. Ferber and Krivelevich (Adv. Math., 2022) confirmed the conjecture. In this short paper, we generalize this result by considering $G$ with vertices labeled 0 or 1 and requiring that in an induced subgraph of $G$, the 0-labeled vertices are of even degree…

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

ICE *already* can't meet their detainment numbers without rounding up children, veterans, people born in the U.S., people with no criminal records, people at immigration hearings, plus academics and visitors with valid visas.
So who do they plan to detain with >10x the budget?
The answer is: you.
h…

Spectral radius and homeomorphically irreducible spanning trees of graphs
Bingqian Gao, Huiqing Liu, Jing Zhao
https://arxiv.org/abs/2509.02021 https://arx…

Spectral radius and homeomorphically irreducible spanning trees of graphs
For a connected graph $G$, a spanning tree $T$ of $G$ is called a homeomorphically irreducible spanning tree (HIST) if $T$ has no vertices of degree 2. Albertson {\em et al.} proved that it is $NP$-complete to decide whether a graph contains a HIST. In this paper, we provide some spectral conditions that guarantee the existence of a HIST in a connected graph. Furthermore, we also present some sufficient conditions in terms of the order of a graph $G$ to ensure the existence of a HIST in $G$.

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 23 nodes and 3197 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

Edge-colouring and orientations: applications to degree-boundedness and $\chi$-boundedness
Arnab Char, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
https://arxiv.org/abs/2506.23054

Edge-colouring and orientations: applications to degree-boundedness and $χ$-boundedness
We prove that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. As a consequence, we deduce that some classes of graphs are degree-bounded. A class $\mathcal{G}$ is {\it degree-bounded} if, for every integer $s$, there exists $d=d(s)$ such that every graph $G\in \mathcal{G}$ either contains $K_{s,s}$ or has minimum degree at most $d$. We obtain that the following classes are degree-bounded: (i) fo…

Formulas and Upper Bounds for the Carath{\'e}odory Number of Hamming Graphs
Ezequiel Dratman, Luc\'ia M. Gonz\'alez, Luciano N. Grippo
https://arxiv.org/abs/2509.01645

Formulas and Upper Bounds for the Carath{é}odory Number of Hamming Graphs
Let $G$ be a simple graph and let $S$ be a subset of its vertices. We say that $S$ is $P_3$-convex if every vertex $v \in V(G)$ that has at least two neighbors in $S$ also belongs to $S$. The $P_3$-hull set of $S$ is the smallest $P_3$-convex set of $G$ that contains $S$. Carathéodory number of a graph $G$, denoted by $c(G)$, is the smallest integer $c$ such that for every subset $S \subseteq V(G)$ and every vertex $p$ in the $P_3$-hull of $S$, there exists a subset $F \subseteq S$ with $|…

sp_hospital: Hospital ward dynamic contacts (2010)
This dataset contains the temporal network of contacts between patients, patients and health-care workers (HCWs) and among HCWs in a hospital ward in Lyon, France, from Monday, December 6, 2010 at 1:00 pm to Friday, December 10, 2010 at 2:00 pm. The study included 46 HCWs and 29 patients.
This network has 75 nodes and 32424 edges.
Tags: Social, Offline, Unweighted, Temporal, Metadata

Extended Weak Order for the Rank 3 Universal Coxeter Group
Grant Barkley, Colin Defant, Patricia Hersh, Jon McCammond, Thomas McConville, David E Speyer
https://arxiv.org/abs/2509.00871

Extended Weak Order for the Rank 3 Universal Coxeter Group
The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced the extended weak order, a poset that contains a copy of the weak order as an order ideal, and he conjectured that the extended weak order for any Coxeter group is a lattice. We prove Dyer's conjecture for the rank 3 universal Coxeter group. This is the first …

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…

dom: Animal dominance archive (2022)
Animal dominance interaction data published over a century of research. The archive contains 434 agonistic interaction datasets, totaling over 241,000 interactions. A directed edge (i,j) corresponds to an antagonist interaction between i (winner) and j (loser). If a 'weight' edge property map exists, it counts the number of such interactions.
This network has 6 nodes and 16 edges.
Tags: Social, Animal, Weighted

petster: Pet owner social networks (2016)
A network of friendships among users on catster.com and dogster.com. Node represents a user, and edge exists if two users self-identify as friends on either website. The dogster/catster network also contains family links between dog and dog, cat and cat, as well as dog and cat.
This network has 623766 nodes and 15699276 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 68746 nodes and 51971 edges.

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

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 13 nodes and 63095 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

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…

sp_infectious: Art exhibit dynamic contacts (2011)
This dataset contains the daily dynamic contact networks collected during the Infectious SocioPatterns event that took place at the Science Gallery in Dublin, Ireland, during the artscience exhibition INFECTIOUS: STAY AWAY. Each file in the downloadable package contains a tab-separated list representing the active contacts during 20-second intervals of one day of data collection. Each line has the form “t i j“, where i and j are the a…

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.