Tootfinder

Membership Inference Attacks on Sequence Models
Lorenzo Rossi, Michael Aerni, Jie Zhang, Florian Tram\`er
https://arxiv.org/abs/2506.05126 https://

Membership Inference Attacks on Sequence Models
Sequence models, such as Large Language Models (LLMs) and autoregressive image generators, have a tendency to memorize and inadvertently leak sensitive information. While this tendency has critical legal implications, existing tools are insufficient to audit the resulting risks. We hypothesize that those tools' shortcomings are due to mismatched assumptions. Thus, we argue that effectively measuring privacy leakage in sequence models requires leveraging the correlations inherent in sequential g…

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

On the logarithmic Hodge-de Rham spectral sequence for curves on K3 surfaces
We show that if $X$ is a supersingular K3 surface then there exists a curve $D$ on $X$ such that the logarithmic Hodge-de Rham spectral sequence for $(X,D)$ is nondegenerate.

Well-hued graphs with first difference two
Geoffrey Boyer, Kirsti Kuenzel, Jeremy Lyle, Ryan Pellico
https://arxiv.org/abs/2506.04993 https://

Well-hued graphs with first difference two
A graph $G$ is said to be well-hued if every maximal $k$-colorable subgraph of $G$ has the same order $a_k$. Therefore, if $G$ is well-hued, we can associate with $G$ a sequence $\{a_k\}$. Necessary and sufficient conditions were given as to when a sequence $\{a_k\}$ is realized by a well-hued graph. Further, it was conjectured there is only one connected well-hued graph with $a_2 = a_1 + 2$ for every $a_1 \ge 4$. In this paper, we prove this conjecture as well as characterize nearly all well-h…

On the number of divisors of Mersenne numbers
Vjekoslav Kova\v{c}, Florian Luca
https://arxiv.org/abs/2506.04883 https://arxiv.org/pd…

On the number of divisors of Mersenne numbers
Denote $f(n):=\sum_{1\le k\le n} τ(2^k-1)$, where $τ$ is the number of divisors function. Motivated by a question of Paul Erdős, we show that the sequence of ratios $f(2n)/f(n)$ is unbounded. We also present conditional results on the divergence of this sequence to infinity. Finally, we test numerically both the conjecture $f(2n)/f(n)\to\infty$ and our sufficient conditions for it to hold.

Large Deviations for Sequential Tests of Statistical Sequence Matching
Lin Zhou, Qianyun Wang, Yun Wei, Jingjing Wang
https://arxiv.org/abs/2506.03976 http…

Large Deviations for Sequential Tests of Statistical Sequence Matching
We revisit the problem of statistical sequence matching initiated by Unnikrishnan (TIT 2015) and derive theoretical performance guarantees for sequential tests that have bounded expected stopping times. Specifically, in this problem, one is given two databases of sequences and the task is to identify all matched pairs of sequences. In each database, each sequence is generated i.i.d. from a distinct distribution and a pair of sequences is said matched if they are generated from the same distribu…

DM-SegNet: Dual-Mamba Architecture for 3D Medical Image Segmentation with Global Context Modeling
Hangyu Ji
https://arxiv.org/abs/2506.05297 https://

DM-SegNet: Dual-Mamba Architecture for 3D Medical Image Segmentation with Global Context Modeling
Accurate 3D medical image segmentation demands architectures capable of reconciling global context modeling with spatial topology preservation. While State Space Models (SSMs) like Mamba show potential for sequence modeling, existing medical SSMs suffer from encoder-decoder incompatibility: the encoder's 1D sequence flattening compromises spatial structures, while conventional decoders fail to leverage Mamba's state propagation. We present DM-SegNet, a Dual-Mamba architecture integrating direct…

New King of the Hill episodes August 4. Hilarious
https://www.animationmagazine.net/2025/05/hulu-drops-new-king-of-the-hill-opening-sequence-premiere-date

Hulu Drops New 'King of the Hill' Opening Sequence & Premiere Date
Following up on the reveal of the resurrected series' new key art earlier this month, Hulu has unveiled the opening credit sequence for the 14th season of Kin

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

Large Language Models are Locally Linear Mappings
We demonstrate that the inference operations of several open-weight large language models (LLMs) can be mapped to an exactly equivalent linear system for an input sequence without modifying the model weights or altering output predictions. Extending techniques from image diffusion models that exhibit local or piecewise linearity, we strategically alter the gradient computation with respect to a given input sequence for a next-token prediction such that the Jacobian of the model nearly exactly r…

Patterns Within the Markov Tree
Robert A. Gore
https://arxiv.org/abs/2506.04299 https://arxiv.org/pdf/2506.04299

Patterns Within the Markov Tree
An analysis of the Markov tree is presented. Markov triplets, {x,R,z}, are the positive integer solutions to the Diophantine equation x2 + R2 + z2 = 3xRz. Inspired by patterns of the Fibonacci and Pell triplets in Region 1 and Region 2 of the tree, an investigation of interior regions of the Markov tree finds generating functions and sequence functions for all triplets of all regions. These sequence functions lead to the discovery of a Pell equation for the Markov region numbers along the edges…

STELLA: Towards Protein Function Prediction with Multimodal LLMs Integrating Sequence-Structure Representations
Hongwang Xiao, Wenjun Lin, Xi Chen, Hui Wang, Kai Chen, Jiashan Li, Yuancheng Sun, Sicheng Dai, Boya Wu, Qiwei Ye
https://arxiv.org/abs/2506.03800

STELLA: Towards Protein Function Prediction with Multimodal LLMs Integrating Sequence-Structure Representations
Protein biology focuses on the intricate relationships among sequences, structures, and functions. Deciphering protein functions is crucial for understanding biological processes, advancing drug discovery, and enabling synthetic biology applications. Since protein sequences determine tertiary structures, which in turn govern functions, integrating sequence and structure information is essential for accurate prediction of protein functions. Traditional protein language models (pLMs) have advance…

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

Learning pure quantum states (almost) without regret
We initiate the study of sample-optimal quantum state tomography with minimal disturbance to the samples. Can we efficiently learn a precise description of a quantum state through sequential measurements of samples while at the same time making sure that the post-measurement state of the samples is only minimally perturbed? Defining regret as the cumulative disturbance of all samples, the challenge is to find a balance between the most informative sequence of measurements on the one hand and me…

#Clojure map-interval
Like `map` -- apply function `f` to each element in `col` in turn and return the values returned in sequence, but in a single thread and pausing between each invocation of `f`.

Useful for example in circumstances where you're querying a rate-limited service.

Map, but with a delay
Map, but with a delay. GitHub Gist: instantly share code, notes, and snippets.

Using the Coolest Ae Stars to Constrain Circumstellar Disk Viscosity
R. Anusha, T. A. A. Sigut
https://arxiv.org/abs/2506.04486 https://

Using the Coolest Ae Stars to Constrain Circumstellar Disk Viscosity
Classical Ae (CAe) stars are main sequence, A-type stars with Hα emission but no signature of dust. They are thought to be the cool extension of the classical Be stars to lower masses. Recent surveys based on Hα spectroscopy have significantly increased the number of known CAe stars, with the population extending to spectral types as cool as A4 (Teff approx. 8500 K). We compute the temperature structure of gaseous, circumstellar disks around A-type stars, including both radiative heating from…

On the modular cohomology of $GL_2(\mathbb{Z}/p^n)$ and $SL_2(\mathbb{Z}/p^n)$
Anja Meyer
https://arxiv.org/abs/2506.04720 https://ar…

On the modular cohomology of $GL_2(\mathbb{Z}/p^n)$ and $SL_2(\mathbb{Z}/p^n)$
Let $p$ be an odd prime. Denote a Sylow $p$-subgroup of $GL_2(\mathbb{Z}/p^n)$ and $SL_2(\mathbb{Z}/p^n)$ by $S_p(n,GL)$ and $S_p(n,SL)$ respectively. The theory of stable elements tells us that the mod-$p$ cohomology of a finite group is given by the stable elements of the mod-$p$ cohomology of it's Sylow $p$-subgroup. We prove that for suitable group extensions of $S_p(n,GL)$ and $S_p(n,SL)$ the $E_2$-page of the Lyndon-Hochschild-Serre spectral sequence associated to these extensions does no…

Minimizing the Gauss map area of surfaces in $\mathbb{S}^3$
Gerard Orriols, Tristan Rivi\`ere
https://arxiv.org/abs/2506.05141 https://

Minimizing the Gauss map area of surfaces in $\mathbb{S}^3$
We establish the lower bound of $4π(1+g)$ for the area of the Gauss map of any immersion of a closed oriented surface of genus $g$ into $\mathbb{S}^3$, taking values in the Grassmannian of $2$-planes in $\mathbb{R}^4$. This lower bound is proved to be optimal for any genus $g \in \mathbb{N}$ but attained only when $g = 0$. For $g \neq 0$ we describe the behavior of any minimizing sequence of embeddings: we prove that, modulo extraction of a subsequence, the surfaces converge in the Hausdorff d…

An Augmented Lagrangian Preconditioner for Navier--Stokes Equations with Runge--Kutta in Time
Santolo Leveque, Yunhui He, Maxim Olshanskii
https://arxiv.org/abs/2506.04451

An Augmented Lagrangian Preconditioner for Navier--Stokes Equations with Runge--Kutta in Time
We consider a Runge--Kutta method for the numerical time integration of the nonstationary incompressible Navier--Stokes equations. This yields a sequence of nonlinear problems to be solved for the stages of the Runge--Kutta method. The resulting nonlinear system of differential equations is discretized using a finite element method. To compute a numerical approximation of the stages at each time step, we employ Newton's method, which requires the solution of a large and sparse generalized saddl…

On the Dynamics of Weighted Composition Operators
Nilson C. Bernardes Jr., Antonio Bonilla, Jo\~ao V. A. Pinto
https://arxiv.org/abs/2506.04476 https://

On the Dynamics of Weighted Composition Operators
We study the properties of power-boundedness, Li-Yorke chaos, distributional chaos, absolutely Cesàro boundedness and mean Li-Yorke chaos for weighted composition operators on $L^p(μ)$ spaces and on $C_0(Ω)$ spaces. We illustrate the general results by presenting several applications to weighted shifts on the classical sequence spaces $c_0(\mathbb{N})$, $c_0(\mathbb{Z})$, $\ell^p(\mathbb{N})$ and $\ell^p(\mathbb{Z})$ ($1 \leq p < \infty$) and to weighted translation operators on the classica…

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

Effects of Metallicity on Graphite, TiC, and SiC Condensation in Carbon Stars
From transmission electron microscopy and other laboratory studies of presolar grains, the implicit condensation sequence of carbon-bearing condensates in circumstellar envelopes of carbon stars is (from first to last) TiC-graphite-SiC. We use thermochemical equilibrium condensation calculations and show that the condensation sequence of TiC, graphite, and SiC depends on metallicity in addition to C/O ratio and total pressure. Calculations were performed for a characteristic carbon star ratio o…

TransAct V2: Lifelong User Action Sequence Modeling on Pinterest Recommendation
Xue Xia, Saurabh Vishwas Joshi, Kousik Rajesh, Kangnan Li, Yangyi Lu, Nikil Pancha, Dhruvil Deven Badani, Jiajing Xu, Pong Eksombatchai
https://arxiv.org/abs/2506.02267

TransAct V2: Lifelong User Action Sequence Modeling on Pinterest Recommendation
Modeling user action sequences has become a popular focus in industrial recommendation system research, particularly for Click-Through Rate (CTR) prediction tasks. However, industry-scale CTR models often rely on short user sequences, limiting their ability to capture long-term behavior. Additionally, these models typically lack an integrated action-prediction task within a point-wise ranking framework, reducing their predictive power. They also rarely address the infrastructure challenges invo…

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

On a connection between total positivity and Bernoulli stopping problems
Consider the optimal stopping problem of maximising the expected payoff in a game where a nonnegative reward is granted upon stopping on a success in a sequence of independent Bernoulli trials. These Bernoulli stopping problems are characterised by a recurrence relation connecting the stopping and continuation payoffs. This recurrence is used to establish optimality of the myopic strategy under unimodal continuation payoffs. Further, by embedding the success epochs of the trials into a Markov c…

Direct reciprocity in asynchronous interactions
Ketian Sun, Qi Su, Long Wang
https://arxiv.org/abs/2506.04264 https://arxiv.org/pdf/2…

Direct reciprocity in asynchronous interactions
Cooperation is vital for the survival of living systems but is challenging due to the costs borne by altruistic individuals. Direct reciprocity, where actions are based on past encounters, is a key mechanism fostering cooperation. However, most studies assume synchronous decision-making, whereas real-world interactions are often asynchronous, with individuals acting in sequence. This asynchrony can undermine standard cooperative strategies like Tit-for-Tat and Win-Stay Lose-Shift. To better und…

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

The ergodicity of Orlicz sequence spaces
We prove that non-Hilbertian separable Orlicz sequence spaces are ergodic, i.e., the equivalence relation $\mathbb{E}_0$ Borel reduces to the isomorphism relation between subspaces of every such space. This is done by exhibiting non-Hilbertian asymptotically Hilbertian subspaces in those spaces, and appealing to a result by Anisca. In particular, each non-Hilbertian Orlicz sequence space contains continuum many pairwise non-isomorphic subspaces. As a consequence, we prove that the twisted Hil…

Riemannian Time Warping: Multiple Sequence Alignment in Curved Spaces
Julian Richter, Christopher Erd\"os, Christian Scheurer, Jochen J. Steil, Niels Dehio
https://arxiv.org/abs/2506.01635

Riemannian Time Warping: Multiple Sequence Alignment in Curved Spaces
Temporal alignment of multiple signals through time warping is crucial in many fields, such as classification within speech recognition or robot motion learning. Almost all related works are limited to data in Euclidean space. Although an attempt was made in 2011 to adapt this concept to unit quaternions, a general extension to Riemannian manifolds remains absent. Given its importance for numerous applications in robotics and beyond, we introduce Riemannian Time Warping~(RTW). This novel approa…

On a Recursive Integer Sequence Implying the Nonexistence of Odd Perfect Numbers
Ritesh Dwivedi, Rohit Yadav
https://arxiv.org/abs/2506.01830 https://

On a Recursive Integer Sequence Implying the Nonexistence of Odd Perfect Numbers
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent term is half the term. It is conjectured that the sequence eventually reaches one for all initial values. In this paper, we classify a family of integers for which this conjecture holds.

We have in fact encountered similar things to "linguistic sequence processing". Bullshit artists, politicians with the "truthiness" of Ronald Reagan (coined by a comedian at the time). I have had personal experience being a rabbit in a spotlight where this kind of "thinking" kicks in. Got out of that game, thankfully.

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

Sequence modeling of higher-order wave modes of binary black hole mergers
Higher-order gravitational wave modes from quasi-circular, spinning, non-precessing binary black hole mergers encode key information about these systems' nonlinear dynamics. We model these waveforms using transformer architectures, targeting the evolution from late inspiral through ringdown. Our data is derived from the \texttt{NRHybSur3dq8} surrogate model, which includes spherical harmonic modes up to $\ell \leq 4$ (excluding $(4,0)$, $(4,\pm1)$ and including $(5,5)$ modes). These waveforms s…

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

Conditional Entropies of k-Deletion/Insertion Channels
The channel output entropy of a transmitted sequence is the entropy of the possible channel outputs and similarly the channel input entropy of a received sequence is the entropy of all possible transmitted sequences. The goal of this work is to study these entropy values for the k-deletion, k-insertion channels, where exactly k symbols are deleted, inserted in the transmitted sequence, respectively. If all possible sequences are transmitted with the same probability then studying the input and …

gnutella: Gnutella p2p networks (2002)
A sequence of 9 snapshots of the Gnutella peer-to-peer file sharing network from 5-31 August 2002. Nodes are hosts in the Gnutella network topology and edges are connections between them.
This network has 36682 nodes and 88328 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

Life Sequence Transformer: Generative Modelling for Counterfactual Simulation
Alberto Cabezas, Carlotta Montorsi
https://arxiv.org/abs/2506.01874 https://

Life Sequence Transformer: Generative Modelling for Counterfactual Simulation
Social sciences rely on counterfactual analysis using surveys and administrative data, generally depending on strong assumptions or the existence of suitable control groups, to evaluate policy interventions and estimate causal effects. We propose a novel approach that leverages the Transformer architecture to simulate counterfactual life trajectories from large-scale administrative records. Our contributions are: the design of a novel encoding method that transforms longitudinal administrative …

"The RDBMS field is so young, we can actually see it grow through the pages of computer magazines of the 1980s. BYTE Magazine had its first issue dedicated to databases in November 1981, and then another one in October 1984. Dr. Dobb’s Journal did not feature an article about databases until 1984 and did not have many more throughout the decade; actually most of them were authored by Gene Head, and talk about dBASE."

The Elephant In The Room
We have often highlighted in the pages of this magazine the seemingly never-ending sequence of fashion waves hitting the software industry. We have discussed in 2020 the one impacting type systems, and more recently, another one concerning object-oriented programming. What is important in both cases is not the details of the technologies per se, but the social mechanisms at play in both situations. In this edition, we will encounter yet another example of such a clash, this time concerning rela…

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

RIS-Enabled NLoS Near-Field Joint Position and Velocity Estimation under User Mobility
In the context of single-base station (BS) non-line-of-sight (NLoS) single-epoch localization with the aid of a reflective reconfigurable intelligent surface (RIS), this paper introduces a novel three-step algorithm that jointly estimates the position and velocity of a mobile user equipment (UE), while compensating for the Doppler effects observed in near-field (NF) at the RIS elements over the short transmission duration of a sequence of downlink (DL) pilot symbols. First, a low-complexity ini…

Some functors preserving exceptionality
Dajun Liu, Hanpeng Gao, Yu-Zhe Liu
https://arxiv.org/abs/2506.00122 https://arxiv.org/pdf/250…

Some functors preserving exceptionality
We constructed some tensor functors that send each exceptional sequence in a module category to another exceptional sequence in another module category by using split extensions and recollements.

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

The TIP of the Iceberg: Revealing a Hidden Class of Task-in-Prompt Adversarial Attacks on LLMs
We present a novel class of jailbreak adversarial attacks on LLMs, termed Task-in-Prompt (TIP) attacks. Our approach embeds sequence-to-sequence tasks (e.g., cipher decoding, riddles, code execution) into the model's prompt to indirectly generate prohibited inputs. To systematically assess the effectiveness of these attacks, we introduce the PHRYGE benchmark. We demonstrate that our techniques successfully circumvent safeguards in six state-of-the-art language models, including GPT-4o and LLaMA…

Hm... Apparently, the screamer is Russian?

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

Sample Compression for Continual Learning
Continual learning algorithms aim to learn from a sequence of tasks, making the training distribution non-stationary. The majority of existing continual learning approaches in the literature rely on heuristics and do not provide learning guarantees. In this paper, we present a new method called Continual Pick-to-Learn (CoP2L), which is able to retain the most representative samples for each task in an efficient way. CoP2L combines the Pick-to-Learn algorithm (rooted in the sample compression th…

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

On a Recursive Integer Sequence Implying the Nonexistence of Odd Perfect Numbers
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent term is half the term. It is conjectured that the sequence eventually reaches one for all initial values. In this paper, we classify a family of integers for which this conjecture holds.

GeoChain: Multimodal Chain-of-Thought for Geographic Reasoning
Sahiti Yerramilli, Nilay Pande, Rynaa Grover, Jayant Sravan Tamarapalli
https://arxiv.org/abs/2506.00785

GeoChain: Multimodal Chain-of-Thought for Geographic Reasoning
This paper introduces GeoChain, a large-scale benchmark for evaluating step-by-step geographic reasoning in multimodal large language models (MLLMs). Leveraging 1.46 million Mapillary street-level images, GeoChain pairs each image with a 21-step chain-of-thought (CoT) question sequence (over 30 million Q&A pairs). These sequences guide models from coarse attributes to fine-grained localization across four reasoning categories - visual, spatial, cultural, and precise geolocation - annotated by d…

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

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
Given points from an arbitrary metric space and a sequence of point updates sent by an adversary, what is the minimum recourse per update (i.e., the minimum number of changes needed to the set of centers after an update), in order to maintain a constant-factor approximation to a $k$-clustering problem? This question has received attention in recent years under the name consistent clustering. Previous works by Lattanzi and Vassilvitskii [ICLM '17] and Fichtenberger, Lattanzi, Norouzi-Fard, and…

One of the things I like about the #Quartiles puzzle game in the Apple News app, is how many non-words there are that could very well be words, but aren’t. The sequence of letters follow basic general conventions that look & sound like a word, but nobody’s used it yet. With just the right buzz that sounds profound.

RenderFormer: Transformer-based Neural Rendering of Triangle Meshes with Global Illumination
Chong Zeng, Yue Dong, Pieter Peers, Hongzhi Wu, Xin Tong
https://arxiv.org/abs/2505.21925

RenderFormer: Transformer-based Neural Rendering of Triangle Meshes with Global Illumination
We present RenderFormer, a neural rendering pipeline that directly renders an image from a triangle-based representation of a scene with full global illumination effects and that does not require per-scene training or fine-tuning. Instead of taking a physics-centric approach to rendering, we formulate rendering as a sequence-to-sequence transformation where a sequence of tokens representing triangles with reflectance properties is converted to a sequence of output tokens representing small patc…

Hot exozodiacal dust around Fomalhaut: The MATISSE perspective
Kevin Ollmann, Florian Kirchschlager, Thomas A. Stuber, Katsiaryna Tsishchankava, Alexis Matter, Steve Ertel, Tim D. Pearce, Alexander V. Krivov, Sebastian Wolf
https://arxiv.org/abs/2506.02826

Hot exozodiacal dust around Fomalhaut: The MATISSE perspective
Excess over the stellar photospheric emission of main-sequence stars has been found in interferometric near-infrared observations, and is attributed to the presence of hot exozodiacal dust (HEZD). As part of our effort to detect and characterize HEZD around the nearby A3 V star Fomalhaut, we carried out the first interferometric observations with the MATISSE instrument at the VLTI in the photometric bands L and M for the Fomalhaut system. Assuming a dust distribution either as a narrow ring or …

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

Progenitor Dependence of Neutrino-driven Supernova Explosions with the Aid of Heavy Axion-like Particles
We perform spherically symmetric simulations of core-collapse supernovae with the aid of heavy axion-like particles (ALPs) which interact with photons and redistribute energy within supernova matter. We explore a wide ALP parameter space that includes MeV-scale ALP mass $m_{\,a}$ and the ALP-photon coupling constant $g_{\,a γ} \sim 10^{\,-10} \, \rm{GeV}^{\,-1}$ , employing three progenitor models with zero-age main-sequence mass of $11.2\,M_\odot$, $20.0\,M_\odot$, and $25.0\,M_\odot$. We fin…

A Fox-Neuwirth Basis for the Sinha Spectral Sequence
Andrea Marino
https://arxiv.org/abs/2505.22958 https://arxiv.org/pdf/2505.22958

A Fox-Neuwirth Basis for the Sinha Spectral Sequence
Recently, Sinha defined a spectral sequence approximating the (co)homology of the space of long knots in R^m modulo immersions, stemming from a cosimplicial structure on the compactified configuration spaces à la Kontsevich. We provide an equivalent cosimplicial structure on (the barycentric subdivision of) a regular CW complex with cells indexed by Fox-Neuwirth trees. As a corollary, we give a combinatorial presentation of the Sinha Spectral Sequence in terms of Fox-Neuwirth trees for all dim…

In our #ISE2025 lecture last Wednesday, we learned how in n-gram language models via Markov assumption and maximum likelihood estimation we can predict the probability of the occurrence of a word given a specific context (i.e. n words previous in the sequence of words).
#NLP

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

Generators of top cohomology
Let $R$ be a commutative noetherian ring and $f: X \to \mathrm{Spec} R$ a proper smooth morphism, of relative dimension $n$. From Hartshorne, Residues and Duality, Springer, 1966, one knows that the trace map $\mathrm{Tr}_f : \mathrm{H}^n(X, ω_{X/R}) \to R$ is an isomorphism when $f$ has geometrically connected fibres. We construct an exact sequence that generates $\mathrm{Ext}_X^n(\mathcal{O}_X, ω_{X/R}) = \mathrm{H}^n(X, ω_{X/R})$ as an $R$-module in the following cases: (1) when $R$ is…

Refinements on higher order Weil-Oesterl\'e bounds via a Serre type argument
Emmanuel Hallouin, Philippe Moustrou, Marc Perret
https://arxiv.org/abs/2506.05212

Refinements on higher order Weil-Oesterlé bounds via a Serre type argument
Weil's theorem gives the most standard bound on the number of points of a curve over a finite field. This bound was improved by Ihara and Oesterlé for larger genus. Recently, Hallouin and Perret gave a new point of view on these bounds, that can be obtained by solving a sequence of semi-definite programs, and the two first steps of this hierarchy recover Weil's and Ihara's bounds. On the other hand, by taking into account arithmetic constraints, Serre obtained a refinement on Weil's bound. In …

DV365: Extremely Long User History Modeling at Instagram
Wenhan Lyu, Devashish Tyagi, Yihang Yang, Ziwei Li, Ajay Somani, Karthikeyan Shanmugasundaram, Nikola Andrejevic, Ferdi Adeputra, Curtis Zeng, Arun K. Singh, Maxime Ransan, Sagar Jain
https://arxiv.org/abs/2506.00450

DV365: Extremely Long User History Modeling at Instagram
Long user history is highly valuable signal for recommendation systems, but effectively incorporating it often comes with high cost in terms of data center power consumption and GPU. In this work, we chose offline embedding over end-to-end sequence length optimization methods to enable extremely long user sequence modeling as a cost-effective solution, and propose a new user embedding learning strategy, multi-slicing and summarization, that generates highly generalizable user representation of …

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

Spectral Sequence Computation of Higher Twisted $K$-Groups of $ SU(n)$
Motivated by the Freed-Hopkins-Teleman theorem we study graded equivariant higher twists of $K$-theory for the groups $G = SU(n)$ induced by exponential functors. We compute the rationalisation of these groups for all $n$ and all non-trivial functors. Classical twists use the determinant functor and yield equivariant bundles of compact operators that are classified by Dixmier-Douady theory. Their equivariant $K$-theory reproduces the Verlinde ring of conformal field theory. Higher twists give e…

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
Benjamin Schiffer, Mark Sellke
https://arxiv.org/abs/2506.01685 h…

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
In the incentivized exploration model, a principal aims to explore and learn over time by interacting with a sequence of self-interested agents. It has been recently understood that the main challenge in designing incentive-compatible algorithms for this problem is to gather a moderate amount of initial data, after which one can obtain near-optimal regret via posterior sampling. With high-dimensional contexts, however, this \emph{initial exploration} phase requires exponential sample complexity…

Transformers as Multi-task Learners: Decoupling Features in Hidden Markov Models
Yifan Hao, Chenlu Ye, Chi Han, Tong Zhang
https://arxiv.org/abs/2506.01919

Transformers as Multi-task Learners: Decoupling Features in Hidden Markov Models
Transformer based models have shown remarkable capabilities in sequence learning across a wide range of tasks, often performing well on specific task by leveraging input-output examples. Despite their empirical success, a comprehensive theoretical understanding of this phenomenon remains limited. In this work, we investigate the layerwise behavior of Transformers to uncover the mechanisms underlying their multi-task generalization ability. Taking explorations on a typical sequence model, i.e, H…

RS Sagittarii: Revealing the component spectra and the mass transfer
Hicran Bak{\i}\c{s}, \"Omr\"um Hilal Y{\i}ld{\i}z, Volkan Bak{\i}\c{s}, G\"okhan Y\"ucel
https://arxiv.org/abs/2506.01516

RS Sagittarii: Revealing the component spectra and the mass transfer
We present an analysis of high-resolution (R ~ 48000) spectroscopic and photometric data of RS Sgr, a short-period Algol-type binary system. For the first time, precise spectroscopic and absolute parameters of the system have been determined. The primary component is identified as a B3 main-sequence star with an effective temperature of 19000K, while the secondary is classified as an A0-type star with a temperature of 9700 K. The secondary appears to have recently evolved off the main sequence …

gnutella: Gnutella p2p networks (2002)
A sequence of 9 snapshots of the Gnutella peer-to-peer file sharing network from 5-31 August 2002. Nodes are hosts in the Gnutella network topology and edges are connections between them.
This network has 36682 nodes and 88328 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

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

Fast uncovering of protein sequence diversity from structure
We present InvMSAFold, an inverse folding method for generating protein sequences that is optimized for diversity and speed. For a given structure, InvMSAFold generates the parameters of a probability distribution over the space of sequences with pairwise interactions, capturing the amino acid covariances observed in Multiple Sequence Alignments (MSA) of homologous proteins. This allows for the efficient generation of highly diverse protein sequences while preserving structural and functional i…

Twisted associative algebras associated to vertex algebras
Shun Xu
https://arxiv.org/abs/2506.01321 https://arxiv.org/pdf/2506.01321

Twisted associative algebras associated to vertex algebras
Let $V$ be a vertex algebra and $g$ an automorphism of $V$ of order $T$. We construct a sequence of associative algebras $\tilde{A}_{g,n}(V )$ for any $n\in(1/T)\mathbb{N}$, which are not depend on the conformal structure of $V$. We show that for a vertex operator algebra, $g$-rationality, $g$-regularity, and twisted fusion rules are independent of the choice of the conformal vector.

Effective Versions of Strong Measure Zero
Matthew Rayman
#toXiv_bot_toot

AI Accelerators for Large Language Model In-ference: Architecture Analysis and Scaling Strategies
Amit Sharma
https://arxiv.org/abs/2506.00008 https://

AI Accelerators for Large Language Model In-ference: Architecture Analysis and Scaling Strategies
The rapid growth of large-language models (LLMs) is driving a new wave of specialized hardware for inference. This paper presents the first workload-centric, cross-architectural performance study of commercial AI accelerators, spanning GPU-based chips, hybrid packages, and wafer-scale engines. We compare memory hierarchies, compute fabrics, and on-chip interconnects, and observe up to 3.7x performance variation across architectures as batch size and sequence length change. Four scaling techniqu…

Performance of the image persistence model for Euclid infrared detectors
B. Kubik, R. Barbier, G. Smadja, S. Ferriol, Y. Conseil, Y. Copin, W. Gillard, S. Dusini, K. Jahnke, E. Prieto, N. Auricchio, E. Balbi, A. Balestra, P. Battaglia, V. Capobianco, R. Chary, L. Corcione, F. Cogato, G. Delucchi, E. Franceschi, L. Gabarra, F. Gianotti, F. Grupp, E. Lentini, S. Ligori, E. Medinaceli, G. Morgante, K. Paterson, E. Romelli, L. Sauniere, M. Schirmer, C. Sirignano G. Testera, M. Trifoglio, A. Troja, L. Valenziano, M. Frailis, M. Scodeggio, J. -C. Barriere, M. Berthe, C. Bodendorf, A. Caillat, M. Carle, R. Casas, H. Cho, A. Costille, F. Ducret, B. Garilli, W. Holmes, F. Hormuth, A. Hornstrup, M. Jhabvala, R. Kohley, D. Le Mignant, P. B. Lilje, I. Lloro, C. Padilla, G. Polenta, J. -C. Salvignol, G. Seidel, B. Serra, A. Secroun, L. Stanco, R. Toledo-Moreo, S. Anselmi, E. Borsato, L. Caillat, C. Colodro-Conde, V. Conforti, J. E. Davies, A. Renzi, F. Dal Corso, S. Davini, A. Derosa, J. J. Diaz, S. Di Domizio, D. Di Ferdinando, R. Farinelli, A. G. Ferrari, F. Fornari, F. Giacomini, O. Krause, F. Laudisio, J. Macias-Perez, J. Marpaud, N. Mauri, R. da Silva, M. Niclas, F. Passalacqua, I. Risso, P. Lagier, A. N. Sorensen, P. Stassi, J. Steinwagner, M. Tenti, C. Thizy, S. Tosi, R. Travaglini, O. Tubio, C. Valieri, S. Ventura, C. Vescovi, J. Zoubian
#toXiv_bot_toot

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

Bounds on Trees with Topological Indices Among Degree Sequence
In this paper, we investigate The relationship between the Albertson index and the first Zagreb index for trees. For a tree $T=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges, we provide several bounds and exact formulas for these two topological indices, and we show that the Albertson index $\irr(T)$ and the first Zagreb index $M_1(T)$ satisfy the association \[ \operatorname{irr}(T)=d_1^2+d_n^2+(n-2)\left(\frac{Δ+ δ}{2}\right)^2+\sum_{i=2}^{n-1} d_i+d_n - d_1-2n-2.\] Our …

https://blog.atuin.sh/atuin-scripts-shareable-syncable-shell-snippets/ @… scripts makes it really easy to turn a sequence of a few commands into a script.
Since I've started using it I created a few scripts I probably wouldn't have if I had to create them the old fashioned way

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

Risk-Sensitive Model Predictive Control for Interaction-Aware Planning -- A Sequential Convexification Algorithm
This paper considers risk-sensitive model predictive control for stochastic systems with a decision-dependent distribution. This class of systems is commonly found in human-robot interaction scenarios. We derive computationally tractable convex upper bounds to both the objective function, and to frequently used penalty terms for collision avoidance, allowing us to efficiently solve the generally nonconvex optimal control problem as a sequence of convex problems. Simulations of a robot navigatin…

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

Sparse Nullstellensatz, resultants and determinants of complexes
We refine and extend a result by Tuitman on the supports of a Bezout identity satisfied by a finite sequence of sparse Laurent polynomials without common zeroes in the toric variety associated to their supports. When the number of these polynomials is one more than the dimension of the ambient space, we obtain a formula for computing the sparse resultant as the determinant of a Koszul type complex.

Nearby dwarf galaxies with extreme star formation rates: a window into dwarf-galaxy evolution in the early Universe
S. Kaviraj, B. Bichang'a, I. Lazar, A. E. Watkins, G. Martin, R. A. Jackson
https://arxiv.org/abs/2506.03265

Nearby dwarf galaxies with extreme star formation rates: a window into dwarf-galaxy evolution in the early Universe
We study a sample of nearby (z~0.2) low-luminosity dwarf (10^7 MSun < M* < 10^8 MSun) galaxies which have extreme (0.1 - 3 MSun/yr) star formation rates (SFRs) for this mass regime, making them plausible analogues of dwarfs at z~5.5. We compare the properties of these analogues to control samples of 'normal' dwarfs, which reside on the star formation main sequence (SFMS) at z~0.2 and are matched in their stellar mass and redshift distributions to the analogue population. The analogue and normal…

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

Random walk based snapshot clustering for detecting community dynamics in temporal networks
The evolution of many dynamical systems that describe relationships or interactions between objects can be effectively modeled by temporal networks, which are typically represented as a sequence of static network snapshots. In this paper, we introduce a novel random walk-based approach that can identify clusters of time-snapshots in which network community structures are stable. This allows us to detect significant structural shifts over time, such as the splitting or merging of communities or …

Enhancing GOP in CTC-Based Mispronunciation Detection with Phonological Knowledge
Aditya Kamlesh Parikh, Cristian Tejedor-Garcia, Catia Cucchiarini, Helmer Strik
https://arxiv.org/abs/2506.02080

Enhancing GOP in CTC-Based Mispronunciation Detection with Phonological Knowledge
Computer-Assisted Pronunciation Training (CAPT) systems employ automatic measures of pronunciation quality, such as the goodness of pronunciation (GOP) metric. GOP relies on forced alignments, which are prone to labeling and segmentation errors due to acoustic variability. While alignment-free methods address these challenges, they are computationally expensive and scale poorly with phoneme sequence length and inventory size. To enhance efficiency, we introduce a substitution-aware alignment-fr…

Series B, Episode 06 - Trial
ZIL: To be alone must not be feared. The Host is slow to recognize one who is alone. Though there are many, all stay alone. [Clears off a patch of ground] Do you hunger? [Tears the ground open, scoops up some of the lining of the opening and eats it.] Do you hunger?
BLAKE: What is it?
https://

Blakes7Bot | Search
Companion site to the Blakes7Bot Twitter, Mastodon, and Bluesky accounts. Automated lines of Blakes 7 dialog. Includes a script search facility.

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

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
Given points from an arbitrary metric space and a sequence of point updates sent by an adversary, what is the minimum recourse per update (i.e., the minimum number of changes needed to the set of centers after an update), in order to maintain a constant-factor approximation to a $k$-clustering problem? This question has received attention in recent years under the name consistent clustering. Previous works by Lattanzi and Vassilvitskii [ICLM '17] and Fichtenberger, Lattanzi, Norouzi-Fard, and…

Monitoring Robustness and Individual Fairness
Ashutosh Gupta, Thomas A. Henzinger, Konstantin Kueffner, Kaushik Mallik, David Pape
https://arxiv.org/abs/2506.00496

Monitoring Robustness and Individual Fairness
Input-output robustness appears in various different forms in the literature, such as robustness of AI models to adversarial or semantic perturbations and individual fairness of AI models that make decisions about humans. We propose runtime monitoring of input-output robustness of deployed, black-box AI models, where the goal is to design monitors that would observe one long execution sequence of the model, and would raise an alarm whenever it is detected that two similar inputs from the past…

Where's the Line? A Classroom Activity on Ethical and Constructive Use of Generative AI in Physics
Zosia Krusberg
https://arxiv.org/abs/2506.00229 http…

Where's the Line? A Classroom Activity on Ethical and Constructive Use of Generative AI in Physics
Generative AI tools like ChatGPT are rapidly reshaping how students and instructors engage with course material-and how they think about academic integrity. This paper presents a classroom activity designed to help physics students critically examine the ethical and educational implications of using AI in coursework. Through a structured sequence of case analysis, discussion, and optional policy drafting, students develop the metacognitive, ethical, and collaborative skills needed to navigate e…

hqQUBO: A Hybrid-querying Quantum Optimization Model Validated with 16-qubits on an Ion Trap Quantum Computer for Life Science Applications
Rong Chen, Quan-Xin Mei, Wen-Ding Zhao, Lin Yao, Hao-Xiang Yang, Shun-Yao Zhang, Jiao Chen, Hong-Lin Li
https://arxiv.org/abs/2506.01559

hqQUBO: A Hybrid-querying Quantum Optimization Model Validated with 16-qubits on an Ion Trap Quantum Computer for Life Science Applications
AlphaFold has achieved groundbreaking advancements in protein structure prediction, exerting profound influence across biology, medicine, and drug discovery. However, its reliance on multiple sequence alignment (MSA) is inherently time-consuming due to the NP-hard nature of constructing MSAs. Quantum computing emerges as a promising alternative, compared to classical computers, offering the potentials for exponential speedup and improved accuracy on such complex optimization challenges. This wo…

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

Notes on a Gaussian-Based Distribution Algebra for the Non-linear Wave Equation of the Shift Vector in Quantum Foam
In these notes, a non-linear distributional algebra is developed, tailored to the geometry of Gaussian Quantum Foam. The construction is based on sequences of smooth Gaussian functions restricted to spacelike hypersurfaces in a sequence of homotopic and globally hyperbolic spacetimes, converging in the sense of distributions to Quantum Foam. A restricted subspace of Schwartz functions is defined, consisting of finite products of scaled Gaussians supported on the hypersurfaces. An associated dis…

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

Nonlinear Graphon mean-field systems
We address a system of weakly interacting particles where the heterogenous connections among the particles are described by a graph sequence and the number of particles grows to infinity. Our results extend the existing law of large numbers and propagation of chaos results to the case where the interaction between one particle and its neighbors is expressed as a nonlinear function of the local empirical measure. In the limit of the number of particles which tends to infinity, if the graph seque…

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

SPOT-Trip: Dual-Preference Driven Out-of-Town Trip Recommendation
Out-of-town trip recommendation aims to generate a sequence of Points of Interest (POIs) for users traveling from their hometowns to previously unvisited regions based on personalized itineraries, e.g., origin, destination, and trip duration. Modeling the complex user preferences--which often exhibit a two-fold nature of static and dynamic interests--is critical for effective recommendations. However, the sparsity of out-of-town check-in data presents significant challenges in capturing such us…

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

The only Class 0 Flower snark is the smallest
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. The pebbling number is the smallest $t$ so that from any initial configuration of $t$ pebbles it is possible, after a sequence of pebbling moves, to place a pebble on any given target vertex. Graphs whose pebbling number is equal to the number of vertices are called Class~$0$ and provide a challenging set of graphs that resist…

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.

This https://arxiv.org/abs/2402.00354 has been replaced.
link: https://scholar.google.com/scholar?q=a

Uniform twisted homological stability
We prove a homological stability theorem for families of discrete groups (e.g. mapping class groups, automorphism groups of free groups, braid groups) with coefficients in a sequence of irreducible algebraic representations of arithmetic groups. The novelty is that the stable range is independent of the choice of representation. Combined with earlier work of Bergström--Diaconu--Petersen--Westerland this proves the Conrey--Farmer--Keating--Rubinstein--Snaith predictions for all moments of the f…

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

Finding White Dwarfs' Hidden Companions using an Unsupervised Machine Learning Technique
White dwarfs (WD) with main-sequence (MS) companions are crucial probes of stellar evolution. However, due to the significant difference in their luminosities, the WD is often outshined by the MS star. The aim of this work is to find hidden companions in Gaia's sample of WD candidates. Our methodology involves applying an unsupervised machine learning algorithm for dimensionality reduction and clustering, known as Self-Organizing Map (SOM), to Gaia BP/RP (XP) spectra. This strategy allows us to…

Some computational aspects of spectral sequences in \v{C}ech cohomology
Matthias Zach
https://arxiv.org/abs/2506.02636 https://arxiv.…

Some computational aspects of spectral sequences in Čech cohomology
Sheaf cohomology or, more generally, higher direct images of coherent sheaves along proper morphisms are central to modern algebraic geometry. However, the computation of these objects is a non-trivial and expensive task which easily challenges the capacities of modern computers. We describe an algorithm and its implementation to compute a spectral sequence converging to the higher direct images of a bounded complex of sheaves on a product of projective spaces $\mathbb P = \mathbb P^{r_1}\times…

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

Summable analogous to the Ivashev-Musatov Theorems
We investigate summable analogues of the classical Ivashev-Musatov Theorem and threshold phenomenons alike. In the setting of weighted $\ell^1$ and Orlicz sequence spaces, we exhibit elements with critically pathological support and range, both topologically and in the sense of measure theory. Our results complement earlier works of J. P. Kahane, Y. Katznelson and T. W. Körner.

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

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
In this paper, we consider the \emph{metric $k$-center} problem in the fully dynamic setting, where we are given a metric space $(V,d)$ evolving via a sequence of point insertions and deletions and our task is to maintain a subset $S \subseteq V$ of at most $k$ points that minimizes the objective $\max_{x \in V} \min_{y \in S}d(x, y)$. We want to design our algorithm so that we minimize its \emph{approximation ratio}, \emph{recourse} (the number of changes it makes to the solution $S$), and \em…

Sequence-Only Prediction of Binding Affinity Changes: A Robust and Interpretable Model for Antibody Engineering
Chen Liu, Mingchen Li, Yang Tan, Wenrui Gou, Guisheng Fan, Bingxin Zhou
https://arxiv.org/abs/2505.20301

Sequence-Only Prediction of Binding Affinity Changes: A Robust and Interpretable Model for Antibody Engineering
A pivotal area of research in antibody engineering is to find effective modifications that enhance antibody-antigen binding affinity. Traditional wet-lab experiments assess mutants in a costly and time-consuming manner. Emerging deep learning solutions offer an alternative by modeling antibody structures to predict binding affinity changes. However, they heavily depend on high-quality complex structures, which are frequently unavailable in practice. Therefore, we propose ProtAttBA, a deep learn…

Online Fair Allocations with Binary Valuations and Beyond
Yuanyuan Wang, Tianze Wei
https://arxiv.org/abs/2505.24321 https://arxiv.or…

Online Fair Allocations with Binary Valuations and Beyond
In an online fair allocation problem, a sequence of indivisible items arrives online and needs to be allocated to offline agents immediately and irrevocably. In our paper, we study the online allocation of either goods or chores. We adapt popular fairness notions, including envy-freeness up to one item (EF1) and maximin share fairness (MMS), and use utilitarian social welfare (USW) to measure efficiency. For both settings of items, we present a series of positive results regarding the existence…

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

Low-Cost FlashAttention with Fused Exponential and Multiplication Hardware Operators
Attention mechanisms, particularly within Transformer architectures and large language models (LLMs), have revolutionized sequence modeling in machine learning and artificial intelligence applications. To compute attention for increasingly long sequences, specialized accelerators have been proposed to execute key attention steps directly in hardware. Among the various recently proposed architectures, those based on variants of the FlashAttention algorithm, originally designed for GPUs, stand ou…

Jacob's ladders, E. C. Titchmarsh's hypothesis (1934) and new $\zeta$-equivalents of the Fermat-Wiles theorem or connections between Fermat's rationals and the Gram's sequence
Jan Moser
https://arxiv.org/abs/2506.01706

Jacob's ladders, E. C. Titchmarsh's hypothesis (1934) and new $ζ$-equivalents of the Fermat-Wiles theorem or connections between Fermat's rationals and the Gram's sequence
In connection of our proof (1980) of the Titchmarsh's hypothesis (1934), we have obtained two asymptotic formulae (1991). In this paper we obtain three new $ζ$-equivalents of the Fermat-Wiles theorem based on the mentioned asymptotic formulae.

State-aware protein-ligand complex prediction using AlphaFold3 with purified sequences
Enming Xing, Junjie Zhang, Shen Wang, Xiaolin Cheng
https://arxiv.org/abs/2506.00147

State-aware protein-ligand complex prediction using AlphaFold3 with purified sequences
Deep learning-based prediction of protein-ligand complexes has advanced significantly with the development of architectures such as AlphaFold3, Boltz-1, Chai-1, Protenix, and NeuralPlexer. Multiple sequence alignment (MSA) has been a key input, providing coevolutionary information critical for structural inference. However, recent benchmarks reveal a major limitation: these models often memorize ligand poses from training data and perform poorly on novel chemotypes or dynamic binding events inv…

Graded representations of current Lie superalgebras $\mathfrak{sl}(1|2)[t]$
Shushma Rani, Divya Setia
https://arxiv.org/abs/2506.01134 https://

Graded representations of current Lie superalgebras $\mathfrak{sl}(1|2)[t]$
This paper is the study of finite-dimensional graded representations of current lie superalgebras $\mathfrak{sl}(1|2)[t]$. We define the notion of super POPs, a combinatorial tool to provide another parametrization of the basis of the local Weyl module given in [2]. We derive the graded character formula of local Weyl module for $\mathfrak{sl}(1|2)[t]$. Furthermore, we construct a short exact sequence of Chari-Venkatesh modules for $\mathfrak{sl}(1|2)[t]$. As a consequence, we pr…

Symbolic Higher-Order Analysis of Multivariate Time Series
Andrea Civilini, Fabrizio de Vico Fallani, Vito Latora
https://arxiv.org/abs/2506.00508 https://…

Symbolic Higher-Order Analysis of Multivariate Time Series
Identifying patterns of relations among the units of a complex system from measurements of their activities in time is a fundamental problem with many practical applications. Here, we introduce a method that detects dependencies of any order in multivariate time series data. The method first transforms a multivariate time series into a symbolic sequence, and then extract statistically significant strings of symbols through a Bayesian approach. Such motifs are finally modelled as the hyperedges …

Generalizations of Dini's Theorem under Weakened Monotonicity Conditions
Riwaj Khatiwada
https://arxiv.org/abs/2506.00013 https://

Generalizations of Dini's Theorem under Weakened Monotonicity Conditions
Dini's Theorem guarantees that a monotone sequence of continuous functions converges pointwise on a compact interval to a continuous limit that converges uniformly. In this paper, we establish new theorems generalizing Dini's result by replacing the restrictive monotonicity assumption with more flexible conditions like equicontinuity, convexity, and controlled variation hypotheses.

Series B, Episode 06 - Trial
ZIL: To be alone must not be feared. The Host is slow to recognize one who is alone. Though there are many, all stay alone. [Clears off a patch of ground] Do you hunger? [Tears the ground open, scoops up some of the lining of the opening and eats it.] Do you hunger?
BLAKE: What is it?
https://

Blakes7Bot | Search
Companion site to the Blakes7Bot Twitter, Mastodon, and Bluesky accounts. Automated lines of Blakes 7 dialog. Includes a script search facility.

A note on multi-transitivity in non-autonomous discrete systems
Hongbo Zeng
https://arxiv.org/abs/2505.24657 https://arxiv.org/pdf/25…

A note on multi-transitivity in non-autonomous discrete systems
This paper is concerned with some stronger forms of transitivity in non-autonomous discrete systems$(f_{ 1,\infty})$ generated by a uniformly convergent sequence of continuous self maps. Firstly, we present two counterexamples to show that Theorem 3.1 obtained by Salman and Das in [Multi-transitivity in nonautonomous discrete systems Topol. Appl. 278(2020)107237] is not true. Then, we introduce and study mildly mixing in non-autonomous discrete systems, which is stronger than mixing. We obtain …

SPACE: Your Genomic Profile Predictor is a Powerful DNA Foundation Model
Zhao Yang, Jiwei Zhu, Bing Su
https://arxiv.org/abs/2506.01833 https://

SPACE: Your Genomic Profile Predictor is a Powerful DNA Foundation Model
Inspired by the success of unsupervised pre-training paradigms, researchers have applied these approaches to DNA pre-training. However, we argue that these approaches alone yield suboptimal results because pure DNA sequences lack sufficient information, since their functions are regulated by genomic profiles like chromatin accessibility. Here, we demonstrate that supervised training for genomic profile prediction serves as a more effective alternative to pure sequence pre-training. Furthermore,…

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

ACT-R: Adaptive Camera Trajectories for Single View 3D Reconstruction
We introduce the simple idea of adaptive view planning to multi-view synthesis, aiming to improve both occlusion revelation and 3D consistency for single-view 3D reconstruction. Instead of producing an unordered set of views independently or simultaneously, we generate a sequence of views, leveraging temporal consistency to enhance 3D coherence. More importantly, our view sequence is not determined by a pre-determined and fixed camera setup. Instead, we compute an adaptive camera trajectory (AC…

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

Existence and spectrality of infinite convolutions generated by infinitely many admissible pairs
In this paper, we study the spectrality of infinite convolutions generated by infinitely many admissible pairs which may not be compactly supported, where the spectrality means the corresponding square integrable function space admits a family of exponential functions as an orthonormal basis. First, we prove that the infinite convolution exists and is a spectral measure if the sequence of admissible pairs satisfies the remainder bounded condition, and it has a subsequence consisting of genera…

Sums and differences of sets: a further improvement over AlphaEvolve
Fan Zheng
https://arxiv.org/abs/2506.01896 https://arxiv.org/pdf…

Sums and differences of sets: a further improvement over AlphaEvolve
We present a new advancement in the sum and difference of sets problem, which improves upon recent results by both DeepMind's AlphaEvolve ($θ= 1.1584$) and subsequent explicit constructions ($θ= 1.173050$). In this work, we construct a sequence of $U$ sets which in the limit establishes a new lower bound of $θ= 1.173077$.

SPOT-Trip: Dual-Preference Driven Out-of-Town Trip Recommendation
Yinghui Liu, Hao Miao, Guojiang Shen, Yan Zhao, Xiangjie Kong, Ivan Lee
https://arxiv.org/abs/2506.01705

SPOT-Trip: Dual-Preference Driven Out-of-Town Trip Recommendation
Out-of-town trip recommendation aims to generate a sequence of Points of Interest (POIs) for users traveling from their hometowns to previously unvisited regions based on personalized itineraries, e.g., origin, destination, and trip duration. Modeling the complex user preferences--which often exhibit a two-fold nature of static and dynamic interests--is critical for effective recommendations. However, the sparsity of out-of-town check-in data presents significant challenges in capturing such us…

Critical Metallicity of Cool Supergiant Formation. II. Physical Origin
Po-Sheng Ou, Ke-Jung Chen
https://arxiv.org/abs/2506.01753 https://

Critical Metallicity of Cool Supergiant Formation. II. Physical Origin
This study investigates the physical origin of the critical metallicity ($Z_{\rm c}\sim 0.001$) required for the formation of cool supergiants, as revealed by stellar evolution models. Using model grids that vary in mass, metallicity, opacity, and nuclear reaction rates, we identify a threshold terminal-age main-sequence (TAMS) radius ($R_{\rm T}$) that determines whether a star of a given mass can evolve into the red supergiant (RSG) phase. Through stellar models and homology relations, we sho…

A New Deep-learning-Based Approach For mRNA Optimization: High Fidelity, Computation Efficiency, and Multiple Optimization Factors
Zheng Gong, Ziyi Jiang, Weihao Gao, Deng Zhuo, Lan Ma
https://arxiv.org/abs/2505.23862

A New Deep-learning-Based Approach For mRNA Optimization: High Fidelity, Computation Efficiency, and Multiple Optimization Factors
The mRNA optimization is critical for therapeutic and biotechnological applications, since sequence features directly govern protein expression levels and efficacy. However, current methods face significant challenges in simultaneously achieving three key objectives: (1) fidelity (preventing unintended amino acid changes), (2) computational efficiency (speed and scalability), and (3) the scope of optimization variables considered (multi-objective capability). Furthermore, existing methods often…

On Characterizations of Convex and Approximately Subadditive Sequences
Angshuman Robin Goswami
https://arxiv.org/abs/2505.22668 https://

On Characterizations of Convex and Approximately Subadditive Sequences
A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and demonstrate that such sequences can be locally interpolated by quadratic polynomials. Furthermore, the converse assertion of this statement is also established. On the other hand, a sequence $\Big(u_n\Big)_{n=1}^{\infty}$ is called approximately subadditive …

Systematically Measuring Ultra-Diffuse Galaxies. VIII. Misfits, Miscasts, and Miscreants
Dennis Zaritsky, Richard Donnerstein, Donghyeon J. Khim
https://arxiv.org/abs/2505.24755

Systematically Measuring Ultra-Diffuse Galaxies. VIII. Misfits, Miscasts, and Miscreants
We re-examine the 7,070 candidate ultra-diffuse galaxies (UDGs) in the SMUDGes survey and provide classifications based on their visual morphology. Among the more interesting cases, we identify objects along a low surface brightness galaxy merger sequence (ongoing mergers (8) and post-mergers (7)) and a distinct set of dwarf ring galaxies (29). The ring galaxies are hypothesized to be the result of nearly polar-axis collisions, but the responsible companions are undetected. We also highlight ob…

Predicting protein folding dynamics using sequence information
Ezequiel A. Galpern, Federico Caama\~no, Diego U. Ferreiro
https://arxiv.org/abs/2505.17237 …

Predicting protein folding dynamics using sequence information
Natural protein sequences somehow encode the structural forms that these molecules adopt. Recent developments in structure-prediction are agnostic to the mechanisms by which proteins fold and represent them as static objects. However, the amino acid sequences also encode information about how the folding process can happen, and how variations in the sequences impact on the populations of the distinct structural forms that proteins acquire. Here we present a method to infer protein folding dynam…

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

HSTU-BLaIR: Lightweight Contrastive Text Embedding for Generative Recommender
Recent advances in recommender systems have underscored the complementary strengths of generative modeling and pretrained language models. We propose HSTU-BLaIR, a hybrid framework that augments the Hierarchical Sequential Transduction Unit (HSTU)-based generative recommender with BLaIR, a lightweight contrastive text embedding model. This integration enriches item representations with semantic signals from textual metadata while preserving HSTU's powerful sequence modeling capabilities. We e…