Tootfinder

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…

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 …

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

Ah, where to begin…
"Fi.pool.ntp.org contains a server with inappropriate name"
https://community.ntppool.org/t/fi-pool-ntp-org-contains-a-server-with-inappropriate-name/3835/1

DAPFAM: A Domain-Aware Patent Retrieval Dataset Aggregated at the Family Level
Iliass Ayaou (ICube), Denis Cavallucci (ICube), Hicham Chibane (ICube)
https://arxiv.org/abs/2506.22141

DAPFAM: A Domain-Aware Patent Retrieval Dataset Aggregated at the Family Level
In the landscape of publicly available patent retrieval datasets, the need for explicit indomain and out-of-domain labeling, multi-jurisdiction coverage, balanced query domain representation and manageable sizes that support sub document level experiments on moderate computational resources is often overlooked. To address these gaps, we propose DAPFAM, a new open access domain-aware patent retrieval dataset constructed at the simple-family level. The dataset contains 1,247 domain balanced full …

Polarization-sensitive vector magnetometry using nitrogen-vacancy centers in diamond
M. S. J. Barson, T. J. Christie, J. P. Duff, K. Helmerson
https://arxiv.org/abs/2506.23878

Polarization-sensitive vector magnetometry using nitrogen-vacancy centers in diamond
By using an ensemble of nitrogen-vacancy (NV) centers, the vector components of a time-varying (AC) magnetic field are measured in a phase sensitive manner. This allows for the determination of the magnetic field's polarization. This polarization contains useful information about the nearby magnetic environment, such as the response of lossy or anisotropic materials, or the reactance of electrical currents.

On large configurations of lines on quartic surfaces
Alex Degtyarev, S{\l}awomir Rams
https://arxiv.org/abs/2506.22733 https://arxiv.…

On large configurations of lines on quartic surfaces
We estimate the number of lines on a non-K3 quartic surface. Such a surface with only isolated double point(s) contains at most twenty lines; this bound is attained by a unique configuration of lines and by a surface with a certain limited set of singularities. We have similar itemized bounds for other types of non-simple singularities, which culminate in at most 31 lines on a non-K3 quartic not ruled by lines; this bound is only attained on the quartic monoids described by K.~Rohn.

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

Sometimes {renv} just isnt enough to ensure your environment is controlled. Maybe {slushy} could be an option? https://gsk-biostatistics.github.io/slushy/index.html

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…

Today in #ITSecurity gone wrong: I am in Austria as a German. I just received a notification via cell broadcast about a fire in the area. The broadcast contains a URL - but this URL is only accessible from an Austrian IP address. My LTE roaming IP isn’t allowed. So… I guess I just suffocate because I have the wrong IP address, then? 😅

Not a rickroll.
https://fed.brid.gy/r/https://bsky.app/profile/did:plc:qrllvid7s54k4hnwtqxwetrf/post/3lspl4j4fls2h

MeerKAT radio continuum imaging of nearby star-forming spirals in the NGC 6221, NGC 3256/3263, and NGC 2434 galaxy groups
J. Saponara, B. S. Koribalski, J. English, P. K. Humire
https://arxiv.org/abs/2506.22382

MeerKAT radio continuum imaging of nearby star-forming spirals in the NGC 6221, NGC 3256/3263, and NGC 2434 galaxy groups
Context. We present high-resolution MeerKAT 1.3 GHz radio continuum images of star-forming spirals in the nearby galaxy groups around NGC 6221, NGC 3256/3263 and NGC 2434. This sample spans the evolutionary timeline for galaxy groups, encompassing early, intermediate, and late stages, respectively. The NGC 6221 group contains an interacting galaxy pair with tidal debris, along with at least three dwarf galaxies. In contrast, the NGC 3256/3263 group represents a loose group consisting of several…

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…

Automorphisms and derivations of a universal left-symmetric enveloping algebra
D. Zhangazinova, A. Naurazbekova, U. Umirbaev
https://arxiv.org/abs/2506.24051

Automorphisms and derivations of a universal left-symmetric enveloping algebra
Let $A_n$ be an $n$-dimensional algebra with zero multiplication over a field $K$ of characteristic $0$. Then its universal (multiplicative) enveloping algebra $U_n$ in the variety of left-symmetric algebras is a homogeneous quadratic algebra generated by $2n$ elements $l_1,\ldots,l_n,r_1,\ldots,r_n$, which contains both the polynomial algebra $L_n=K[l_1,\ldots,l_n]$ and the free associative algebra $R_n=K\langle r_1,\ldots,r_n\rangle$. We show that the automorphism groups of the polynomial alg…

Ah, where to begin…
"Fi.pool.ntp.org contains a server with inappropriate name"
https://community.ntppool.org/t/fi-pool-ntp-org-contains-a-server-with-inappropriate-name/3835/1

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

On the complexity of upper frequently hypercyclic vectors
Szymon Glab, Paolo Leonetti
https://arxiv.org/abs/2506.22341 https://arxiv.…

On the complexity of upper frequently hypercyclic vectors
Given a continuous linear operator $T:X\to X$, where $X$ is a topological vector space, let $\mathrm{UFHC}(T)$ be the set of upper frequently hypercyclic vectors, that is, the set of vectors $x \in X$ such that $\{n \in ω: T^nx \in U\}$ has positive upper asymptotic density for all nonempty open sets $U\subseteq X$. It is known that $\mathrm{UFHC}(T)$ is a $G_{δσδ}$-set which is either empty or contains a dense $G_δ$-set. Using a purely topological proof, we improve it by showing that $\ma…

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

Localising invariants in derived bornological geometry
We study several categories of analytic stacks relative to the category of bornological modules over a Banach ring. When the underlying Banach ring is a nonarchimedean valued field, this category contains derived rigid analytic spaces as a full subcategory. When the underlying field is the complex numbers, it contains the category of derived complex analytic spaces. In the second part of the paper, we consider localising invariants of rigid categories associated to bornological algebras. The ma…

"Stop abusing poor UN Resolution 2758"
#Taiwan…

Stop abusing poor UN Resolution 2758 - Min Chao - Medium
UN Resolution 2758 contains 155 words, and the word “Taiwan” is not one of them. So how can Communist China keep claiming its UN enrollment paper proves, once and for all, that it is entitled to…

On Spectral Stability for Rank One Perturbations
Mario Alberto Ruiz Caballero, Rafael del Rio
https://arxiv.org/abs/2506.21694 https://

On Spectral Stability for Rank One Perturbations
Embedded point spectra of rank one singular perturbations of an arbitrary self-adjoint operator A on a Hilbert space H is studied. It is shown that these perturbations can be regarded as self-adjoint extensions of a densely defined closed symmetric operator B with deficiency indices (1; 1). Assuming the deficiency vector of B is cyclic for its self-adjoint extensions, we prove that the spectrum of A contains a dense Gδ subset where it is not possible to have eigenvalues for any rank one singul…

A large hole in pseudo-random graphs
Sahar Diskin, Michael Krivelevich, Itay Markbreit, Maksim Zhukovskii
https://arxiv.org/abs/2505.23384 https://

A large hole in pseudo-random graphs
We show that there exist constants $δ_1,δ_2>0$ such that if $G$ is an $(n,d,λ)$-graph with $λ/d\leδ_1$, then $G$ contains an induced cycle of length at least $δ_2n/d$. We further demonstrate that, up to a constant factor, this is best possible. Utilising our techniques, we derive that the number of non-isomorphic induced subgraphs of such $G$ is at least exponential in $n\log d/d$, and further demonstrate that this is tight up to a constant factor in the exponent.

A dinner in #Cologne a long time ago

On plane cycles in geometric multipartite graphs
Marco Ricci, Jonathan Rollin, Andr\'e Schulz, Alexandra Weinberger
https://arxiv.org/abs/2506.20421 ht…

On plane cycles in geometric multipartite graphs
A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study plane cycles in geometric complete multipartite graphs. We prove that if a geometric complete multipartite graph contains a plane cycle of length $t$, with $t \geq 6$, it also contains a smaller plane cycle of length at least $\lfloor t/2\rfloor + 1$. We further…

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

Today's #MicroPrompt: tome
Reply with:
A #story that contains the prompt word (derivations and tense changes ok), or
An excerpt from your current #WIP that contains the prompt word, or
A #poem!
The only rules: keep it to a single toot and be sure to check out the other replies!
#amWriting #WritingCommunity

Count the bears. An important test of your outdoor survival skills, human.
#wildlife #Bristol #Zoo

Oh fuck, good save, thanks!

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

The NIKA2 cosmological legacy survey at 2 mm: catalogs, colors, redshift distributions, and implications for deep surveys
M. B\'ethermin, G. Lagache, C. Carvajal-Bohorquez, R. Adam, P. Ade, H. Ajeddig, S. Amarantidis, P. Andr\'e, H. Aussel, A. Beelen, A. Beno\^it, S. Berta, L. J. Bing, A. Bongiovanni, J. Bounmy, O. Bourrion, M. Calvo, A. Catalano, D. Ch\'erouvrier, M. De Petris, F. -X. D\'esert, S. Doyle, E. F. C. Driessen, G. Ejlali, A. Ferragamo, A. Gomez, J. Goupy, C…

The NIKA2 cosmological legacy survey at 2 mm: catalogs, colors, redshift distributions, and implications for deep surveys
Millimeter galaxy surveys are particularly effective in detecting dusty star-forming galaxies at high redshift. While such observations are typically conducted at ~1mm, studies suggest that 2mm may be better suited for selecting sources at even higher redshifts. We use the unprecedented 2mm data from the N2CLS, together with the SIDES simulation, to study and interpret the statistical properties of 2mm-selected galaxies. We use the N2CLS robust sample at 2mm, which contains 25 sources in the de…

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

Multiple-Nanowire Superconducting Quantum Interference Devices: Critical Currents, Symmetries, and Vorticity Stability Regions
Cliff Sun, Alexey Bezryadin
https://arxiv.org/abs/2505.23095

Multiple-Nanowire Superconducting Quantum Interference Devices: Critical Currents, Symmetries, and Vorticity Stability Regions
An ordinary superconducting quantum interference device (SQUID) contains two weak links connected in parallel. We model a multiple-wire SQUID (MW-SQUID), generalized in two ways. First, the number of weak links, which are provided by parallel superconducting nanowires, is larger than two. Second, the current-phase relationship of each nanowire is assumed linear, which is typical for a homogeneous superconducting thin wire. For such MW-SQUIDs, our model predicts that the critical current ($I_c$)…

https://bsky.app/profile/davidcolquhoun.bsky.social/post/3lpwwj3nwbk2m

Refining Datapath for Microscaling ViTs
Can Xiao, Jianyi Cheng, Aaron Zhao
https://arxiv.org/abs/2505.22194 https://arxiv.org/pdf/250…

Refining Datapath for Microscaling ViTs
Vision Transformers (ViTs) leverage the transformer architecture to effectively capture global context, demonstrating strong performance in computer vision tasks. A major challenge in ViT hardware acceleration is that the model family contains complex arithmetic operations that are sensitive to model accuracy, such as the Softmax and LayerNorm operations, which cannot be mapped onto efficient hardware with low precision. Existing methods only exploit parallelism in the matrix multiplication ope…

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.

I want to make a video detailing the history of the Glup Shitto, will inevitably turn into a 12 hour long epic that contains a retrospective on the original trilogy, the prequels, the Disney trilogy, the reaction and disparity in the reaction between the latter 2 trilogies, how barely a couple years later after the passionate screaming contest of TLJ basically everyone agreed ROS sucked shit outa dogs ass and the franchise was dead and I GUESS how all of that culminated in fake character rev…

The Sunspot Solar Observatory Data Archive: Continuing Operations at the Dunn Solar Telescope
Sean G. Sellers, Juie Shetye, Damian J. Christian, David B. Jess, Peter H. Keys, Gordon A. MacDonald, R. T. James McAteer, Jason Jackiewicz, Colin Hancock, Michael S. Thompson, Jamey E. Eriksen, Sara Jeffreys
https://arxiv.org/abs/2505.…

The Sunspot Solar Observatory Data Archive: Continuing Operations at the Dunn Solar Telescope
The Sunspot Solar Observatory Data Archive (SSODA) stores data acquired with the suite of instruments at the Richard B. Dunn Solar Telescope (DST) from February 2018 to the present. The instrumentation at the DST continues to provide high cadence imaging, spectroscopy, and polarimetry of the solar photosphere and chromosphere across a wavelength range from 3500Å to 11,000Å. At time of writing, the archive contains approximately 374 TiB of data across more than 520 observing days (starting on …

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.

On biquadratic fields: when 5 squares are not enough
Daniel Dombek
https://arxiv.org/abs/2506.20820 https://arxiv.org/pdf/2506.20820

On biquadratic fields: when 5 squares are not enough
In this paper we study the Pythagoras number $\mathcal{P}(\mathcal{O}_K)$ for the rings of integers in totally real biquadratic fields $K$. We continue the work of Tinková towards proving the conjecture by Krásenský, Raška and Sgallová that a biquadratic $K$ satisfies $\mathcal{P}(\mathcal{O}_K)\geq 6$ if and only if it contains neither $\sqrt{2}$ nor $\sqrt{5}$, with only finitely many exceptions. We fully solve two out of three remaining classes of fields by proving that all but finitely…

Poset saturation of unions of chains
Shengjin Ji, Bal\'azs Patk\'os, Erfei Yue
https://arxiv.org/abs/2505.23128 https://arxiv…

Poset saturation of unions of chains
A family $\mathcal{G}$ of sets is a(n induced) copy of a poset $P=(P,\leqslant)$ if there exists a bijection $b:P\rightarrow \mathcal{G}$ such that $p\leqslant q$ holds if and only if $b(p)\subseteq b(q)$. The induced saturation number sat$^*(n,P)$ is the minimum size of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain any copy of $P$, but for any $G\in 2^{[n]}\setminus \mathcal{F}$, the family $\mathcal{F}\cup \{G\}$ contains a copy of $P$. We consider sat$^*(n,P)$ for posets $P$ …

Causal Inference for Experiments with Latent Outcomes: Key Results and Their Implications for Design and Analysis
Jiawei Fu, Donald P. Green
https://arxiv.org/abs/2505.21909

Causal Inference for Experiments with Latent Outcomes: Key Results and Their Implications for Design and Analysis
How should we analyze randomized experiments in which the main outcome is measured in multiple ways and each measure contains some degree of error? Since Costner (1971) and Bagozzi (1977), methodological discussions of experiments with latent outcomes have reviewed the modeling assumptions that are invoked when the quantity of interest is the average treatment effect (ATE) of a randomized intervention on a latent outcome that is measured with error. Many authors have proposed methods to estimat…

Today's #MicroPrompt: tome
Reply with:
A #story that contains the prompt word (derivations and tense changes ok), or
An excerpt from your current #WIP that contains the prompt word, or
A #poem!
The only rules: keep it to a single toot and be sure to check out the other replies!
#amWriting #WritingCommunity

How fake news can turn against its spreader
Dorje C. Brody, Tomooki Yuasa
https://arxiv.org/abs/2504.17820 https://arxiv.org/pdf/2504…

Updated constraints on the primordial power spectrum at sub-Mpc scales
Torsten Bringmann, Djuna Croon, Sergio Sevillano Mu\~noz
https://arxiv.org/abs/2506.20704

Updated constraints on the primordial power spectrum at sub-Mpc scales
The primordial power spectrum of matter density perturbations contains highly valuable information about new fundamental physics, in particular cosmological inflation, but is only very weakly constrained observationally for small cosmological scales $k\gtrsim 3\,{\rm Mpc}^{-1}$. We derive novel constraints, $\mathcal{P}_\mathcal{R}(k)\lesssim 5\cdot10^{-6}$ over a large range of such scales, from the formation of ultracompact minihalos in the early universe. Unlike most existing constraints of …

Small thing I noticed today: splitting `.mkv` files using `ffmpeg` via the `-ss` and `-t` options works great, but the resulting `.mkv` file contains the wrong number of frames in the metadata. Evidently the total frames from the source file gets written into the metadata instead of the resulting frames post-splitting which is annoying. Not a deal breaker, but kind of annoying...easy to fix with a quick run through `mkvmerge` but still just weird.

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

Instance-Optimal Imprecise Convex Hull
Imprecise measurements of a point set P = (p1, ..., pn) can be modelled by a family of regions F = (R1, ..., Rn), where each imprecise region Ri contains a unique point pi. A retrieval models an accurate measurement by replacing an imprecise region Ri with its corresponding point pi. We construct the convex hull of an imprecise point set in the plane, where regions in F may be retrieved at unit cost. The goal is to determine the cyclic ordering of the convex hull vertices of P as efficiently as…

Finally completed a photo culling project in which I cut ~2600 photos down to ~300 😵‍💫😮‍💨
This Flickr album contains my picks, including alternate edits for several photos: #Photography

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

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

Simplicity of crossed products by FC-hypercentral groups
In this paper, we give a complete, two-way characterization, of when a noncommutative crossed product $A \rtimes_λG$ is simple, in the case of $G$ being an FC-hypercentral group. This is a large class of amenable groups that contains all virtually nilpotent groups, and in the finitely-generated setting, coincides with the set of groups which have polynomial growth. We further completely characterize the ideal intersection property under the assumption that the group is FC, meaning that every e…

Electric field-induced clustering in nanocomposite films of highly polarizable inclusions
Elshad Allahyarov, Hartmut L\"owen
https://arxiv.org/abs/2506.20903

Electric field-induced clustering in nanocomposite films of highly polarizable inclusions
A nanocomposite film containing highly polarizable inclusions in a fluid background is explored when an external electric field is applied perpendicular to the planar film. For small electric fields, the induced dipole moments of the inclusions are all polarized in field direction, resulting in a mutual repulsion between the inclusions. Here we show that this becomes qualitatively different for high fields: the total system self-organizes into a state which contains both polarizations, parallel…

TumorHoPe2: An updated database for Tumor Homing Peptides
Diksha Kashyap, Devanshi Gupta, Naman Kumar Mehta, Gajendra P. S. Raghava
https://arxiv.org/abs/2505.20913

TumorHoPe2: An updated database for Tumor Homing Peptides
Addressing the growing need for organized data on tumor homing peptides (THPs), we present TumorHoPe2, a manually curated database offering extensive details on experimentally validated THPs. This represents a significant update to TumorHoPe, originally developed by our group in 2012. TumorHoPe2 now contains 1847 entries, representing 1297 unique tumor homing peptides, a substantial expansion from the 744 entries in its predecessor. For each peptide, the database provides critical information, …

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

Anharmonic phonons via quantum thermal bath simulations
Taylor Baird, Rodolphe Vuilleumier, Sara Bonella
https://arxiv.org/abs/2506.21139 https://

Anharmonic phonons via quantum thermal bath simulations
Lattice vibrations within crystalline solids, or phonons, provide information on a variety of important material characteristics, from thermal qualities to optical properties and phase transition behaviour. When the material contains light ions, or is subjected to sufficiently low temperatures and/or high pressures, anharmonic and nuclear quantum effects (NQEs) may significantly alter its phonon characteristics. Unfortunately, accurate inclusion of these two effects within numerical simulations…

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
Eike Neumann
https://arxiv.org/abs/2506.21481 https://

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial decision method for this problem which is complete in the sense that its halting set contains the halting set of all sound partial decision methods for the problem. Equivalently, our decision method terminates on all problem instances whose answer is robust under a…

Collective excitations in Hydrogen across the pressure-induced transition from molecular to atomic fluid
I. -M. Ilenkov, T. Bryk
https://arxiv.org/abs/2506.20791

Collective excitations in Hydrogen across the pressure-induced transition from molecular to atomic fluid
Dispersion of collective excitations in fluid Hydrogen along the isothermal line T=2500~K, including the region of molecular-to-atomis fluid transition, is studied by ab initio molecular dynamics (AIMD) simulations. The obtained density dependence of the adiabatic and high-frequency speed of sound contains a plateau in the region of the molecular-to-atomic fluid transition. We show, that the five-variable thermo-viscoelastic model of generalized hydrodynamics for pure molecular H$_2$ and pure a…

Vo-Ve: An Explainable Voice-Vector for Speaker Identity Evaluation
Jaejun Lee, Kyogu Lee
https://arxiv.org/abs/2506.19446 https://arx…

Vo-Ve: An Explainable Voice-Vector for Speaker Identity Evaluation
In this paper, we propose Vo-Ve, a novel voice-vector embedding that captures speaker identity. Unlike conventional speaker embeddings, Vo-Ve is explainable, as it contains the probabilities of explicit voice attribute classes. Through extensive analysis, we demonstrate that Vo-Ve not only evaluates speaker similarity competitively with conventional techniques but also provides an interpretable explanation in terms of voice attributes. We strongly believe that Vo-Ve can enhance evaluation schem…

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

The tangle-valued 1-cocycle for knots
Thomas Fiedler
https://arxiv.org/abs/2506.17738 https://arxiv.org/pdf/2506.17738

The tangle-valued 1-cocycle for knots
This paper contains the strongest and at the same time most calculable knot invariant ever. Let $Θ$ be the topological moduli space of all ordered oriented tangles in 3-space. We construct a non-trivial combinatorial 1-cocycle $\mathbb{L}$ for $Θ$ that takes its values in $H_0(Θ;\mathbb{Z})$. The 1-cocycle $\mathbb{L}$ has a very nice property, called the {\em scan-property}: if we slide a tangle $T$ over or under a given crossing $c$ of a fixed tangle $T'$, then the value of $\mathbb{L}$ …

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

Embeddings of Certain Exceptional Shimura Varieties into Siegel Modular Varieties
Mohammad Hadi Hedayatzadeh, Ali Partofard
https://arxiv.org/abs/2506.21217

Embeddings of Certain Exceptional Shimura Varieties into Siegel Modular Varieties
We define a class of local Shimura varieties that contains some local Shimura varieties for exceptional groups, and for this class, we construct a functor from $\left(G, μ\right)$-displays to $p$-divisible groups. As an application, we prove that for this class, the local Shimura variety is representable and perfectoid at the infinite level. Considering the global counterpart of this class, we embed certain exceptional Shimura varieties into Siegel modular varieties. In particular, we prove th…

Period relations for Rankin-Selberg convolutions for $\mathrm{GL}(n)\times\mathrm{GL}(n)$
Yubo Jin, Jian-Shu Li, Dongwen Liu, Binyong Sun
https://arxiv.org/abs/2506.20942

Period relations for Rankin-Selberg convolutions for $\mathrm{GL}(n)\times\mathrm{GL}(n)$
In this paper, we study the special values of Rankin-Selberg L-functions as a continuation of [LLS24]. Utilizing the modular symbol approach, we prove the rationality and period relations for critical values of Rankin-Selberg L-functions for $\mathrm{GL}(n)\times\mathrm{GL}(n)$ over any number field that contains a CM field.

The Kaleidoscope Survey: Strong Gravitational Lensing in Galaxy Clusters with Radial Arcs
Catherine Cerny, Mathilde Jauzac, David Lagattuta, Anna Niemiec, Guillaume Mahler, Alastair Edge, Richard Massey
https://arxiv.org/abs/2506.21531

The Kaleidoscope Survey: Strong Gravitational Lensing in Galaxy Clusters with Radial Arcs
We measure the dark matter density profiles of six galaxy clusters: A383, MS 2137-23, MACS J0326.8-0043, MACS J1427.6-2521, MACS J0417.5-1154, and MACS J0949.8+1708. Each cluster contains at least one radial arc, a unique physical feature that allows for more precise measurements of the inner mass profile (R < 50 kpc) from strong lensing. We present the first strong lensing analysis for MACS J0326 and MACS J1427. We use a combination of HST imaging and VLT/MUSE observations from the ESO Kaleido…

Never woulda happened if we didn’t let chicks write games with no guns.
https://bsky.app/profile/maiamindel.bsky.social/post/3ls5slysxyk2p

Hamiltonian paths extending a set of matchings in hypercubes
Abid Ali, Lina Ba, Weihua Yang
https://arxiv.org/abs/2506.21432 https://…

Hamiltonian paths extending a set of matchings in hypercubes
The hypercube \( Q_n \) contains a Hamiltonian path joining \( x \) and \( y \) (where $x$ and $y$ from the opposite partite set) containing \( P \) if and only if the induced subgraph of \( P \) is a linear forest, where none of these paths have \( x \) or \( y \) as internal vertices nor both as endpoints. Dvořák and Gregor answered a problem posed by Caha and Koubek and proved that for every \( n \geq 5 \), there exist vertices \( x \) and \( y \) with a set of \( 2n - 4 \) edges in \( Q_n…

This #Connections contains material that parents may find unsuitable for younger children.
#Connections742
Puzzle № 742
🟦🟦🟦🟦
🟨🟨🟨🟨
🟩🟩🟩🟩
🟪🟪🟪🟪

Cycle lengths in the percolated hypercube
Michael Anastos, Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich, Lyuben Lichev
https://arxiv.org/abs/2506.16858

Cycle lengths in the percolated hypercube
Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$ such that, if $pd\ge c$, then typically $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. We strengthen this result to show that, under the same assumptions, typically $Q^d_p$ contains cycles of all even lengths between $4$ and $(1-\varepsilon)2…

Deciding Termination of Simple Randomized Loops
\'El\'eanore Meyer, J\"urgen Giesl
https://arxiv.org/abs/2506.18541 https://

Deciding Termination of Simple Randomized Loops
We show that universal positive almost sure termination (UPAST) is decidable for a class of simple randomized programs, i.e., it is decidable whether the expected runtime of such a program is finite for all inputs. Our class contains all programs that consist of a single loop, with a linear loop guard and a loop body composed of two linear commuting and diagonalizable updates. In each iteration of the loop, the update to be carried out is picked at random, according to a fixed probability. We s…

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

The 4th really could use a little love, it seems like it hasn’t been applied in forever… https://fed.brid.gy/r/https://bsky.app/profile/did:plc:bbp2b224lro3bfnzcqwwnkfo/post/3lryhesroes2l

Today's #MicroPrompt: Bubble
Reply with:
A #story that contains the prompt word (derivations and tense changes ok), or
An excerpt from your current #WIP that contains the prompt word, or
A #poem!
The only rules: keep it to a single toot and be sure to check out the other replies!
#amWriting #WritingCommunity

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.

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 89209 nodes and 237010 edges.

Minors of non-hamiltonian polyhedra and the Herschel family
On-Hei Solomon Lo, Kenta Ozeki
https://arxiv.org/abs/2506.20086 https://a…

Minors of non-hamiltonian polyhedra and the Herschel family
We show that every non-hamiltonian polyhedron contains the Herschel graph as a minor. As an application, we provide a characterization of non-hamiltonian polyhedra without $K_{2,6}$ minors, thereby resolving a conjecture by Ellingham, Marshall, Ozeki, Royle, and Tsuchiya.

Today's #MicroPrompt: Bubble
Reply with:
A #story that contains the prompt word (derivations and tense changes ok), or
An excerpt from your current #WIP that contains the prompt word, or
A #poem!
The only rules: keep it to a single toot and be sure to check out the other replies!
#amWriting #WritingCommunity

On minors of non-hamiltonian graphs
On-Hei Solomon Lo
https://arxiv.org/abs/2506.20087 https://arxiv.org/pdf/2506.20087

On minors of non-hamiltonian graphs
A theorem of Tutte states that every 4-connected non-hamiltonian graph contains $K_{3,3}$ as a minor. We strengthen this result by proving that such a graph must contain $K_{3,4}$ as a minor, thereby confirming a special case of a conjecture posed by Chen, Yu, and Zang in a strong form. This result may be viewed as a step toward characterizing the minor-minimal 4-connected non-hamiltonian graphs. As a 3-connected analog, Ding and Marshall conjectured that every 3-connected non-hamiltonian graph…

Words avoiding the morphic images of most of their factors
Pascal Ochem, Matthieu Rosenfeld
https://arxiv.org/abs/2506.13368 https://…

Words avoiding the morphic images of most of their factors
We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite binary word contains an imaged factor of length at least 6 and that 6 is best possible. We show that every infinite binary word contains at least 36 distinct imaged factors and that 36 is best possible.

Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
Huye Chen, Jingjian Li, Hao Yu
https://arxiv.org/abs/2506.19888 https://arxi…

Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
After a long term efforts, the Hamiltonian problem of connected vertex-transitive graphs of order $pq$ (where $p$ and $q$ are primes) was finally finshed in 2021, see [10]. Fifteen years ago, mathematicians began to challenge this problem for graphs of order $2pq$. Among of them, it was proved in 2012 (see [21]) that every connected vertex-transitive graph of order $10p$ (where $p\neq7$ is a prime) contains a Hamilton path, with the exception of a family of graphs which was recently confirmed i…

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

Short monochromatic odd cycles
Oliver Janzer, Fredy Yip
https://arxiv.org/abs/2506.14910 https://arxiv.org/pdf/2506.14910

Short monochromatic odd cycles
It is easy to see that every $k$-edge-colouring of the complete graph on $2^k+1$ vertices contains a monochromatic odd cycle. In 1973, Erdős and Graham asked to estimate the smallest $L(k)$ such that every $k$-edge-colouring of $K_{2^k+1}$ contains a monochromatic odd cycle of length at most $L(k)$. Recently, Girão and Hunter obtained the first nontrivial upper bound by showing that $L(k)=O(\frac{2^k}{k^{1-o(1)}})$, which improves the trivial bound by a polynomial factor. We obtain an exponen…

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

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 116920 nodes and 133415 edges.
Tags: Transportation, Roads, Unweighted

Infinite polynomial patterns in large subsets of the rational numbers
Ethan Ackelsberg
https://arxiv.org/abs/2506.19667 https://arxiv…

Infinite polynomial patterns in large subsets of the rational numbers
Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there exists an infinite set $B = \{b_n : n \in \mathbb{N}\} \subseteq \mathbb{Q}$ such that $\{b_i, b_i^2 + b_j : i < j\}$ is monochromatic. Second, we prove that every subset of positive density in the rational numbers contains a translate of such an infinite conf…

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…

us_congress: US Congressional co-sponsorship (1973-2016)
Two temporal networks of bill co-sponsorship tendencies among US Congresspeople, from 1973 (93rd Congress) to 2016 (114th Congress). Edges are signed, indicating the presence of a significant tendency to co-sponsor, or tendency to not co-sponsor, bills. Two networks per year, one for each chamber (House, Senate). Each file contains the signed network for a chamber of congress (H = House, S = Senate) in one session (e.g. 93 = 93rd…

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

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

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

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

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

us_congress: US Congressional co-sponsorship (1973-2016)
Two temporal networks of bill co-sponsorship tendencies among US Congresspeople, from 1973 (93rd Congress) to 2016 (114th Congress). Edges are signed, indicating the presence of a significant tendency to co-sponsor, or tendency to not co-sponsor, bills. Two networks per year, one for each chamber (House, Senate). Each file contains the signed network for a chamber of congress (H = House, S = Senate) in one session (e.g. 93 = 93rd…

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

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

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

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 308401 nodes and 385164 edges.
Tags: Transportation, Roads, Unweighted

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…