Tootfinder

Streaming Sequence-to-Sequence Learning with Delayed Streams Modeling
Neil Zeghidour, Eugene Kharitonov, Manu Orsini, V\'aclav Volhejn, Gabriel de Marmiesse, Edouard Grave, Patrick P\'erez, Laurent Mazar\'e, Alexandre D\'efossez
https://arxiv.org/abs/2509.08753

Streaming Sequence-to-Sequence Learning with Delayed Streams Modeling
We introduce Delayed Streams Modeling (DSM), a flexible formulation for streaming, multimodal sequence-to-sequence learning. Sequence-to-sequence generation is often cast in an offline manner, where the model consumes the complete input sequence before generating the first output timestep. Alternatively, streaming sequence-to-sequence rely on learning a policy for choosing when to advance on the input stream, or write to the output stream. DSM instead models already time-aligned streams with a …

Clip Your Sequences Fairly: Enforcing Length Fairness for Sequence-Level RL
Hanyi Mao, Quanjia Xiao, Lei Pang, Haixiao Liu
https://arxiv.org/abs/2509.09177 https://

Clip Your Sequences Fairly: Enforcing Length Fairness for Sequence-Level RL
We propose FSPO (Fair Sequence Policy Optimization), a sequence-level reinforcement learning method for LLMs that enforces length-fair clipping directly in the importance-sampling (IS) weight space. We revisit sequence-level RL methods and identify a mismatch when PPO/GRPO-style clipping is transplanted to sequences: a fixed clip range systematically reweights short vs. long responses, distorting the effective objective. Theoretically, we formalize length fairness via a Length Reweighting Error…

A decomposition of graph a-numbers
Suyuong Choi, Younghan Yoon
https://arxiv.org/abs/2508.06855 https://arxiv.org/pdf/2508.06855

A decomposition of graph a-numbers
We study the $a$-sequence $(a_0(G), a_1(G), \cdots)$ of a finite simple graph $G$, defined recursively through a combinatorial rule and known to coincide with the sequence of rational Betti numbers of the real toric variety associated with $G$. In this paper, we establish a combinatorial and topological decomposition formula for the $a$-sequence. As an application, we show that the $a$-sequence is monotone under graph inclusion; that is, $a_i(G) \geq a_i(H)$ for all $i \geq 0$ whenever $H$ is…

UVI Releases Percussion Factory 2
https://sonicstate.com/news/2025/07/10/uvi-releases-percussion-factory-2/

UVI Releases Percussion Factory 2 - A significant update to the 8-part percussion instrument and sequence designer
A significant update to the 8-part percussion instrument and sequence designer

Pangenome-guided sequence assembly via binary optimisation
Josh Cudby, James Bonfield, Chenxi Zhou, Richard Durbin, Sergii Strelchuk
https://arxiv.org/abs/2508.08200 https://

Pangenome-guided sequence assembly via binary optimisation
De novo genome assembly is challenging in highly repetitive regions; however, reference-guided assemblers often suffer from bias. We propose a framework for pangenome-guided sequence assembly, which can resolve short-read data in complex regions without bias towards a single reference genome. Our method frames assembly as a graph traversal optimisation problem, which can be implemented on quantum computers. The pipeline first annotates pangenome graphs with estimated copy numbers for each node,…

White dwarfs in wide binaries: the strong effects of stellar evolution and mass loss
Hsiang-Chih Hwang (IAS), Nadia Zakamska (JHU, IAS)
https://arxiv.org/abs/2508.08364 https://…

White dwarfs in wide binaries: the strong effects of stellar evolution and mass loss
We examine the statistics of main-sequence / main-sequence, main-sequence / white-dwarf and white-dwarf / white-dwarf wide binaries at 10^2.5-10^4 AU separations in Gaia data. For binaries containing a white dwarf, we find a complex dependence of the wide binary fraction on the white dwarf mass, including a steep decline as a function of mass at >0.6Msun. Furthermore, we find that wide binaries containing white dwarfs have significantly lower eccentricities than main-sequence binaries at the sa…

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 26518 nodes and 65369 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

Topos Theory for Generative AI and LLMs
Sridhar Mahadevan
https://arxiv.org/abs/2508.08293 https://arxiv.org/pdf/2508.08293

Topos Theory for Generative AI and LLMs
We propose the design of novel categorical generative AI architectures (GAIAs) using topos theory, a type of category that is ``set-like": a topos has all (co)limits, is Cartesian closed, and has a subobject classifier. Previous theoretical results on the Transformer model have shown that it is a universal sequence-to-sequence function approximator, and dense in the space of all continuous functions with compact support on the Euclidean space of embeddings of tokens. Building on this theoretica…

Doctor during annual physical, in a sequence of questions: “Any nausea?”
Me: “Just one day last week… when I read too much news.”
Doctor laughs and professional poise falls apart.
A nice human moment.
👨‍⚕️😆

Integrating Rules and Semantics for LLM-Based C-to-Rust Translation
Feng Luo, Kexing Ji, Cuiyun Gao, Shuzheng Gao, Jia Feng, Kui Liu, Xin Xia, Michael R. Lyu
https://arxiv.org/abs/2508.06926

Integrating Rules and Semantics for LLM-Based C-to-Rust Translation
Automated translation of legacy C code into Rust aims to ensure memory safety while reducing the burden of manual migration. Early approaches in code translation rely on static rule-based methods, but they suffer from limited coverage due to dependence on predefined rule patterns. Recent works regard the task as a sequence-to-sequence problem by leveraging large language models (LLMs). Although these LLM-based methods are capable of reducing unsafe code blocks, the translated code often exhibit…

Watching the Once Upon a Time... intro hits me with how tiny and temporary my life is compared to the giant sweep of history.
The scenes of people through different ages make me wonder what any of us really mean in the big picture.
The vast flow of time shown reminds me that anarchism is the way forward to break free from repeating cycles of power.
#Anarchism

Efficient Transformer-Based Piano Transcription With Sparse Attention Mechanisms
Weixing Wei, Kazuyoshi Yoshii
https://arxiv.org/abs/2509.09318 https://arx…

Efficient Transformer-Based Piano Transcription With Sparse Attention Mechanisms
This paper investigates automatic piano transcription based on computationally-efficient yet high-performant variants of the Transformer that can capture longer-term dependency over the whole musical piece. Recently, transformer-based sequence-to-sequence models have demonstrated excellent performance in piano transcription. These models, however, fail to deal with the whole piece at once due to the quadratic complexity of the self-attention mechanism, and music signals are thus typically proce…

Properties of cluster red-sequence spiral galaxies
Wayne A. Barkhouse (University of North Dakota), Lane M. Kashur (Colorado State University), Moreom Akter (University of North Dakota), Sandanuwan P. Kalawila (University of North Dakota), Gihan L. Gamage (New Mexico State University-Alamogordo), Omar L\'opez-Cruz (Instituto Nacional de Astrofisica, Optica y Electronica)

Properties of cluster red-sequence spiral galaxies
We identify a sample of 324 red and 273 blue face-on spiral galaxies selected from 115 low-redshift (0.014 < z < 0.18) galaxy clusters imaged with CFHT+MegaCam in u- and r-band, KPNO 0.9-meter 2TkA and MOSAIC 8K camera in B and Rc, and images and catalogs extracted from the WINGS survey. Multi-wavelength photometry and spectroscopy were obtained by cross-matching sources with SDSS, GALEX, and WISE datasets. Our main results suggest that up to 45% of optically red spirals are dusty compared to b…

Asymptotic properties of zeros of Riemann zeta function
Juan Arias de Reyna, Yves Meyer
https://arxiv.org/abs/2507.07253 https://arxi…

Asymptotic properties of zeros of Riemann zeta function
We try to define the sequence of zeros of the Riemann zeta function by an intrinsic property. Let $(z_k)_{k\in \mathbb{N}}$ be the sequence of nontrivial zeros of $ζ(s)$ with positive imaginary part. We write $z_k= 1/2+iτ_k$ (RH says that these $τ_k$ are all real). Then the sequence $(τ_k)_{k\in \mathbb{N}},$ satisfies the following asymptotic relation \[\sum_{k\in\mathbb{N}}\frac{2x}{x^2+τ_k^2}\simeq \frac12\log\frac{x}{2π}+\sum_{n=1}^\infty \frac{a_n}{x^n},\,\,x\to +\infty\] where $a_{2…

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Teenage Sequence:
🎵 Get Weird!
#TeenageSequence
https://teenagesequence.bandcamp.com/track/get-weird
https://open.spotify.com/track/2MGnsfbrvd87LjK0bn1gCi

A new deepening of mass-radius empirical relation for main sequence stars
Salvatore Camposeo
https://arxiv.org/abs/2508.08845 https://arxiv.org/pdf/2508.08…

A new deepening of mass-radius empirical relation for main sequence stars
In the following paper I have compared some typical mass-radius relations for main sequence stars by studying their level of agreement with DEBCat [https://doi.org/10.48550/arXiv.1411.1219], which is a recent catalogue by J. Southworth. Models chosen for testing were originally developed using older, smaller datasets than DEBCat. Each model follows a two-piece function structure, where each branch is a monomial power-law. This approach is motivated by theoretical considerations suggesting that …

CCF: A Context Compression Framework for Efficient Long-Sequence Language Modeling
Wenhao Li, Bangcheng Sun, Weihao Ye, Tianyi Zhang, Daohai Yu, Fei Chao, Rongrong Ji
https://arxiv.org/abs/2509.09199

CCF: A Context Compression Framework for Efficient Long-Sequence Language Modeling
Scaling language models to longer contexts is essential for capturing rich dependencies across extended discourse. However, naïve context extension imposes significant computational and memory burdens, often resulting in inefficiencies during both training and inference. In this work, we propose CCF, a novel context compression framework designed to enable efficient long-context modeling by learning hierarchical latent representations that preserve global semantics while aggressively reducing …

DualTrack: Sensorless 3D Ultrasound needs Local and Global Context
Paul F. R. Wilson, Matteo Ronchetti, R\"udiger G\"obl, Viktoria Markova, Sebastian Rosenzweig, Raphael Prevost, Parvin Mousavi, Oliver Zettinig
https://arxiv.org/abs/2509.09530

DualTrack: Sensorless 3D Ultrasound needs Local and Global Context
Three-dimensional ultrasound (US) offers many clinical advantages over conventional 2D imaging, yet its widespread adoption is limited by the cost and complexity of traditional 3D systems. Sensorless 3D US, which uses deep learning to estimate a 3D probe trajectory from a sequence of 2D US images, is a promising alternative. Local features, such as speckle patterns, can help predict frame-to-frame motion, while global features, such as coarse shapes and anatomical structures, can situate the sc…

The trouble with Louis Armstrong's first movie is, well, there are two troubles, one is that it was widely considered dull, but beyond that while widely praised for the music, it is apparently missing.
I'm thinking, if anyone can find it, Fediverse can.
It did play Canada, including #Toronto in January 1931 and

In-Context Learning as Nonparametric Conditional Probability Estimation: Risk Bounds and Optimality
Chenrui Liu, Falong Tan, Chuanlong Xie, Yicheng Zeng, Lixing Zhu
https://arxiv.org/abs/2508.08673

In-Context Learning as Nonparametric Conditional Probability Estimation: Risk Bounds and Optimality
This paper investigates the expected excess risk of In-Context Learning (ICL) for multiclass classification. We model each task as a sequence of labeled prompt samples and a query input, where a pre-trained model estimates the conditional class probabilities of the query. The expected excess risk is defined as the average truncated Kullback-Leibler (KL) divergence between the predicted and ground-truth conditional class distributions, averaged over a specified family of tasks. We establish a ne…

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

Scots, as a language, is rich in insults; and an ancient one is 'toom (empty) tabard' for a worthless person -- an epithet most notably applied to John de Balliol, who served as King of Scots during the middle period of the wars of independence.
It's interesting to see Grauniad cartoonist Ben Jenkins apply the idea to #Starmer's cabinet.

Mitigating Multi-Sequence 3D Prostate MRI Data Scarcity through Domain Adaptation using Locally-Trained Latent Diffusion Models for Prostate Cancer Detection
Emerson P. Grabke, Babak Taati, Masoom A. Haider
https://arxiv.org/abs/2507.06384

Mitigating Multi-Sequence 3D Prostate MRI Data Scarcity through Domain Adaptation using Locally-Trained Latent Diffusion Models for Prostate Cancer Detection
Objective: Latent diffusion models (LDMs) could mitigate data scarcity challenges affecting machine learning development for medical image interpretation. The recent CCELLA LDM improved prostate cancer detection performance using synthetic MRI for classifier training but was limited to the axial T2-weighted (AxT2) sequence, did not investigate inter-institutional domain shift, and prioritized radiology over histopathology outcomes. We propose CCELLA++ to address these limitations and improve cl…

Topological Sequence Analysis of Genomes: Delta Complex approaches
Jian Liu, Li Shen, Dong Chen, Guo-Wei Wei
https://arxiv.org/abs/2507.05452 https://

Topological Sequence Analysis of Genomes: Delta Complex approaches
Algebraic topology has been widely applied to point cloud data to capture geometric shapes and topological structures. However, its application to genome sequence analysis remains rare. In this work, we propose topological sequence analysis (TSA) techniques by constructing $Δ$-complexes and classifying spaces, leading to persistent homology, and persistent path homology on genome sequences. We also develop $Δ$-complex-based persistent Laplacians to facilitate the topological spectral analysis…

Monitoring Decomposition Attacks in LLMs with Lightweight Sequential Monitors
Chen Yueh-Han, Nitish Joshi, Yulin Chen, Maksym Andriushchenko, Rico Angell, He He
https://arxiv.org/abs/2506.10949

Monitoring Decomposition Attacks in LLMs with Lightweight Sequential Monitors
Current LLM safety defenses fail under decomposition attacks, where a malicious goal is decomposed into benign subtasks that circumvent refusals. The challenge lies in the existing shallow safety alignment techniques: they only detect harm in the immediate prompt and do not reason about long-range intent, leaving them blind to malicious intent that emerges over a sequence of seemingly benign instructions. We therefore propose adding an external monitor that observes the conversation at a higher…

KnapFormer: An Online Load Balancer for Efficient Diffusion Transformers Training
Kai Zhang, Peng Wang, Sai Bi, Jianming Zhang, Yuanjun Xiong
https://arxiv.org/abs/2508.06001 ht…

KnapFormer: An Online Load Balancer for Efficient Diffusion Transformers Training
We present KnapFormer, an efficient and versatile framework to combine workload balancing and sequence parallelism in distributed training of Diffusion Transformers (DiT). KnapFormer builds on the insight that strong synergy exists between sequence parallelism and the need to address the significant token imbalance across ranks. This imbalance arises from variable-length text inputs and varying visual token counts in mixed-resolution and image-video joint training. KnapFormer redistributes toke…

Convexity of Optimization Curves: Local Sharp Thresholds, Robustness Impossibility, and New Counterexamples
Le Duc Hieu
https://arxiv.org/abs/2509.08954 https://

Convexity of Optimization Curves: Local Sharp Thresholds, Robustness Impossibility, and New Counterexamples
We study when the \emph{optimization curve} of first--order methods -- the sequence \${f(x\_n)}*{n\ge0}\$ produced by constant--stepsize iterations -- is convex, equivalently when the forward differences \$f(x\_n)-f(x*{n+1})\$ are nonincreasing. For gradient descent (GD) on convex \$L\$--smooth functions, the curve is convex for all stepsizes \$η\le 1.75/L\$, and this threshold is tight. Moreover, gradient norms are nonincreasing for all \$η\le 2/L\$, and in continuous time (gradient flow) th…

Modeling FO-limits for monadically stable sequences
S. Braunfeld, J. Ne\v{s}et\v{r}il, P. Ossona de Mendez
https://arxiv.org/abs/2508.08960 https://arxiv.o…

Modeling FO-limits for monadically stable sequences
We show that given a monadically stable theory $T$, a sufficiently saturated $\mathbf M \models T$, and a coherent system of probability measures on the $σ$-algebras generated by parameter-definable sets of $\mathbf M$ in each dimension, we may produce a totally Borel $\mathbf B \prec \mathbf M$ realizing these measures. Our main application is to prove that every FO-convergent sequence of structures (with countable signature) from a monadically stable class admits a modeling limit. As another…

Luminaries in the Sky: The TESS Legacy Sample of Bright Stars. I. Asteroseismic detections in naked-eye main-sequence and sub-giant solar-like oscillators
Mikkel N. Lund, Ashley Chontos, Frank Grundahl, Savita Mathur, Rafael A. Garc\'ia, Daniel Huber, Derek Buzasi, Timothy R. Bedding, Marc Hon, Yaguang Li
https://arxiv.org/abs/2508.086…

Luminaries in the Sky: The TESS Legacy Sample of Bright Stars. I. Asteroseismic detections in naked-eye main-sequence and sub-giant solar-like oscillators
We aim to detect and characterise solar-like oscillations in bright naked-eye (V<6) main-sequence (MS) and subgiant stars observed by TESS. We seek to expand the current benchmark sample of oscillators, provide accurate global asteroseismic parameters for these bright targets, and assess their potential for future detailed investigations -- including missions such as the HWO and PLATO. Our sample of bright stars was selected from the Hipparcos/Tycho catalogues. We analysed TESS 120-s and 20-s c…

Sequential Spectral Clustering of Data Sequences
G Dhinesh Chandran, Kota Srinivas Reddy, Srikrishna Bhashyam
https://arxiv.org/abs/2509.09144 https://arxi…

Sequential Spectral Clustering of Data Sequences
We study the problem of nonparametric clustering of data sequences, where each data sequence comprises i.i.d. samples generated from an unknown distribution. The true clusters are the clusters obtained using the Spectral clustering algorithm (SPEC) on the pairwise distance between the true distributions corresponding to the data sequences. Since the true distributions are unknown, the objective is to estimate the clusters by observing the minimum number of samples from the data sequences for a …

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fr\'echet distance
Anne Driemel, Jan H\"ockendorff, Ioannis Psarros, Christian Sohler
https://arxiv.org/abs/2508.07008

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
A time series of complexity $m$ is a sequence of $m$ real valued measurements. The discrete Fréchet distance $d_{dF}(x,y)$ is a distance measure between two time series $x$ and $y$ of possibly different complexity. Given a set of $n$ time series represented as $m$-dimensional vectors over the reals, the $(k,\ell)$-median problem under discrete Fréchet distance aims to find a set $C$ of $k$ time series of complexity $\ell$ such that $$\sum_{x\in P} \min_{c\in C} d_{dF}(x,c)$$ is minimized. In …

Solvability of Infinite Systems of Nonlinear Caputo Fractional Differential equations in generalized Hahn Sequence Space
Khurshida Parvin, Bipan Hazarika, Awad A. Bakery
https://arxiv.org/abs/2509.06959

Solvability of Infinite Systems of Nonlinear Caputo Fractional Differential equations in generalized Hahn Sequence Space
This paper presents the Hausdorff measure of noncompactness (MNC) within the framework of the generalized Hahn sequence space. By applying the MNC, we explore the existence of solutions for nonlinear Caputo fractional differential equations subject to three-point integral boundary conditions in the generalized Hahn sequence space. We apply certain sufficient conditions to ensure the uniqueness of solutions to the aforementioned problem, utilizing the Banach fixed-point theorem, and discuss the …

A neural drift-plus-penalty algorithm for network power allocation and routing
Ahmed Rashwan, Keith Briggs, Chris Budd
https://arxiv.org/abs/2509.09637 https://

A neural drift-plus-penalty algorithm for network power allocation and routing
The drift-plus-penalty method is a Lyapunov optimisation technique commonly applied to network routing problems. It reduces the original stochastic planning task to a sequence of greedy optimizations, enabling the design of distributed routing algorithms which stabilize data queues while simultaneously optimizing a specified penalty function. While drift-plus-penalty methods have desirable asymptotic properties, they tend to incur higher network delay than alternative control methods, especiall…

Efficient adaptive randomized algorithms for fixed-threshold low-rank matrix approximation
Qiaohua Liu, Yuejuan Yu
https://arxiv.org/abs/2508.07553 https://

Efficient adaptive randomized algorithms for fixed-threshold low-rank matrix approximation
The low-rank matrix approximation problems within a threshold are widely applied in information retrieval, image processing, background estimation of the video sequence problems and so on. This paper presents an adaptive randomized rank-revealing algorithm of the data matrix $A$, in which the basis matrix $Q$ of the approximate range space is adaptively built block by block, through a recursive deflation procedure on $A$. Detailed analysis of randomized projection schemes are provided to analyz…

Predicting function of evolutionarily implausible DNA sequences
Shiyu Jiang, Xuyin Liu, Zitong Jerry Wang
https://arxiv.org/abs/2506.10271 https://

Predicting function of evolutionarily implausible DNA sequences
Genomic language models (gLMs) show potential for generating novel, functional DNA sequences for synthetic biology, but doing so requires them to learn not just evolutionary plausibility, but also sequence-to-function relationships. We introduce a set of prediction tasks called Nullsettes, which assesses a model's ability to predict loss-of-function mutations created by translocating key control elements in synthetic expression cassettes. Across 12 state-of-the-art models, we find that mutation…

The embedded deformation problem for monomial ideals
Benjamin Briggs, Elo\'isa Grifo, Josh Pollitz
https://arxiv.org/abs/2506.10827 https://

The embedded deformation problem for monomial ideals
This article is concerned with homological properties of local or graded rings whose defining relations are monomials on some regular sequence. The main result of the article positively answers a question of Avramov for such a ring $R$. More precisely, we establish that an embedded deformation of $R$ corresponds exactly to a degree two central element in the homotopy Lie algebra of $R$, as well as a free summand of the conormal module of $R$. A major input in the proof is an analysis of cohomol…

Saddle-node bifurcation during the relaminarization of turbulent puffs in pipe
Basheer Ahmad Khan, Shai Arogeti, Oriel Shoshani, Alexander Yakhot
https://arxiv.org/abs/2508.08862

Saddle-node bifurcation during the relaminarization of turbulent puffs in pipe
Turbulent puffs in a pipe persist for a long time before abruptly transitioning to laminar flow through viscous exponential decay. Direct numerical simulation results reveal a saddle-node bifurcation sequence governing the final relaminarization stage. Specifically, a universal square-root scaling law in the annihilation of critical points that is indicative of a saddle-node bifurcation. The Riccati equation has been proposed as a straightforward approach to modeling these bifurcations.

Toward Precise Curve Offsetting Constrained to Parametric Surfaces
Jin Zhao, Pengfei Wang, Shuangmin Chen, Jiong Guo, Shiqing Xin, Changhe Tu, Wenping Wang
https://arxiv.org/abs/2509.09333

Toward Precise Curve Offsetting Constrained to Parametric Surfaces
Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex self intersection handling, while discrete methods often struggle with precision. In this paper, we propose a totally different algorithm paradigm. Our key insight is that by representing the source curve as a sequence of line segment primitives, the Voronoi dec…

Nonequilibrium Work Fluctuations in Force-induced Melting of a Short B-DNA
S. Siva Nasarayya Chari, Prabal K. Maiti
https://arxiv.org/abs/2508.07354 https://

Nonequilibrium Work Fluctuations in Force-induced Melting of a Short B-DNA
A system of a solvated canonical B-DNA of 12 base pairs with the specified sequence is initially equilibrated in a state of zero external force $f$ acting on it. After equilibration, a switching experiment is performed over the system by pulling one end of the DNA while restraining its other end. The finite time pulling process is performed at a constant rate of the applied force until a maximum value of 400 pN. The associated nonequilibrium work done $(W)$ during this process is determined by …

Orbits and Masses for 156 Companions from Combined Astrometry and Radial Velocities, and A Validation of Gaia Non-Single Star Solutions
Qier An, Timothy D. Brandt, G. Mirek Brandt, Alexander Venner
https://arxiv.org/abs/2508.08374

Orbits and Masses for 156 Companions from Combined Astrometry and Radial Velocities, and A Validation of Gaia Non-Single Star Solutions
We combine absolute astrometry from Hipparcos and Gaia with archival radial velocities from the Keck/HIRES and ESO/HARPS spectrographs, as well as relative astrometry (when available), to derive masses and orbits for 156 companions around main-sequence stars, including 111 stellar companions, 12 brown dwarfs, and 33 planets. Although this sample is not compiled for occurrence-rate statistics due to systematic biases in non-uniform target selection and varied observing strategies, we nonetheless…

A sequence of compact metric spaces and an isometric embedding into the Gromov-Hausdorff space
Takuma Byakuno
https://arxiv.org/abs/2507.07449 https://

A sequence of compact metric spaces and an isometric embedding into the Gromov-Hausdorff space
For a convergent series with positive terms, we prove that the $\ell^\infty$ product space of bounded subspaces of the Gromov-Hausdorff space can be isometrically embedded into the Gromov-Hausdorff space, where each subspace consists of compact metric spaces with the diameter less than or equal to the term.

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

A note on $\mathscr{B}$-free sets and the existence of natural density
Aurelia Dymek, Stanis{\l}aw Kasjan, Joanna Ku{\l}aga-Przymus
https://arxiv.org/abs/2506.10218

A note on $\mathscr{B}$-free sets and the existence of natural density
Given $\mathscr{B}\subseteq \mathbb{N}$, let $\mathcal{M}_\mathscr{B}=\bigcup_{b\in\mathscr{B}}b\mathbb{Z}$ be the correspoding set of multiples. We say that $\mathscr{B}$ is taut if the logarithmic density of $\mathcal{M}_\mathscr{B}$ decreases after removing any element from $\mathscr{B}$. We say that $\mathscr{B}$ is minimal if it is primitive (i.e.\ $b| b'$ for $b,b'\in\mathscr{B}$ implies $b=b'$) and the characteristic function $η$ of $\mathcal{M}_\mathscr{B}$ is a Toeplitz sequence …

Quantum magnetotransport in monolayer $\mathrm{Pt_{2}HgSe_{3}}$
Muzamil Shah, Imtiaz Khan, Kashif Sabeeh, Muhammad Sabieh Anwar, Reza Asgari
https://arxiv.org/abs/2506.10697

Quantum magnetotransport in monolayer $\mathrm{Pt_{2}HgSe_{3}}$
We present a theoretical framework to investigate quantum magnetotransport in monolayer jacutingaite, focusing on its response to external electric fields and off-resonant circularly polarized laser irradiation. Our analysis reveals a sequence of topological phase transitions triggered by tuning these external parameters. We find that the zeroth LL exhibits spin- and valley-polarized splitting, leading to four distinct peaks in the DOSs for the $K$ and $K'$ valleys. Using the Kubo formalism, we…

Funny green effects during a particularly clear #sunset in Bochum, Germany, on 9 July: the Sun disappeared behind a horizontal cloud bank about 7 arc minutes above the true horizon, the image sequence spans 3 seconds.

When will the FBI release the documents that prove Stanley Kubrick is a time traveler who came forward in time to 2023 for movie ideas and after seeing the Barbie movie decided to make a whole movie based on the opening sequence.

Multi-Level Service Performance Forecasting via Spatiotemporal Graph Neural Networks
Zhihao Xue, Yun Zi, Nia Qi, Ming Gong, Yujun Zou
https://arxiv.org/abs/2508.07122 https://…

Multi-Level Service Performance Forecasting via Spatiotemporal Graph Neural Networks
This paper proposes a spatiotemporal graph neural network-based performance prediction algorithm to address the challenge of forecasting performance fluctuations in distributed backend systems with multi-level service call structures. The method abstracts system states at different time slices into a sequence of graph structures. It integrates the runtime features of service nodes with the invocation relationships among services to construct a unified spatiotemporal modeling framework. The mode…

COSMOS-Web galaxy groups: Evolution of red sequence and quiescent galaxy fraction
Greta Toni, Matteo Maturi, Gianluca Castignani, Lauro Moscardini, Ghassem Gozaliasl, Alexis Finoguenov, Sina Taamoli, B. Hollis Akins, C. Rafael Arango-Toro, M. Caitlin Casey, E. Nicole Drakos, L. Andreas Faisst, Carter Flayhart, Maximilien Franco, Fabrizio Gentile, Ali Hadi, Santosh Harish, Hossein Hatamnia, Olivier Ilbert, Shuowen Jin, S. Jeyhan Kartaltepe, Ali Ahmad Khostovan, M. Anton Koekemoer, Gavin…

COSMOS-Web galaxy groups: Evolution of red sequence and quiescent galaxy fraction
We investigate the redshift and group richness dependence of the quiescent fraction and red-sequence (RS) parameters in COSMOS galaxy groups from z=0 to z=3.7. We analyzed the deep and well-characterized sample of groups detected with AMICO in the COSMOS(-Web) field. Our study of the quiescent galaxy population is based on a machine-learning classification tool based on rest-frame magnitudes. The algorithm learns from several traditional methods to estimate the probability of a galaxy being qui…

A New Classification of Positive Integers Via New Divisor Functions
Brahim Mittou
https://arxiv.org/abs/2509.08844 https://arxiv.org/pdf/2509.08844

A New Classification of Positive Integers Via New Divisor Functions
Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{τ(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $α$, we define and study some properties of two new divisor functions $σ_{e,α}$ and $σ_{o,α}$. The first computes the sum of the $α$-th powers of the divisors of $n$ with even indices, and the second computes the sum of the $α$-th powers of the divisors of $n$ with odd indices. We also introduce a new type of positive in…

Managing Data for Scalable and Interactive Event Sequence Visualization
Sayef Azad Sakin, Katherine E. Isaacs
https://arxiv.org/abs/2508.03974 https://arxi…

Managing Data for Scalable and Interactive Event Sequence Visualization
Parallel event sequences, such as those collected in program execution traces and automated manufacturing pipelines, are typically visualized as interactive parallel timelines. As the dataset size grows, these charts frequently experience lag during common interactions such as zooming, panning, and filtering. Summarization approaches can improve interaction performance, but at the cost of accuracy in representation. To address this challenge, we introduce ESeMan (Event Sequence Manager), an eve…

Obfuscated Quantum and Post-Quantum Cryptography
Anju Rani, Xiaoyu Ai, Aman Gupta, Ravi Singh Adhikari, Robert Malaney
https://arxiv.org/abs/2508.07635 https://

Obfuscated Quantum and Post-Quantum Cryptography
In this work, we present an experimental deployment of a new design for combined quantum key distribution (QKD) and post-quantum cryptography (PQC). Novel to our system is the dynamic obfuscation of the QKD-PQC sequence of operations, the number of operations, and parameters related to the operations; coupled to the integration of a GPS-free quantum synchronization protocol within the QKD process. We compare the performance and overhead of our QKD-PQC system relative to a standard QKD system wi…

Improved Bounds on Rainbow $k$-partite Matchings
Pitchayut Saengrungkongka
https://arxiv.org/abs/2508.07331 https://arxiv.org/pdf/2508.07331

Improved Bounds on Rainbow $k$-partite Matchings
Let $n$, $s$, and $k$ be positive integers. We say that a sequence $f_1,\dots,f_s$ of nonnegative integers is satisfying if for any collection of $s$ families $\mathcal F_1,\dots,\mathcal F_s\subseteq [n]^k$ such that $|\mathcal F_i|=f_i$ for all $i$, there exists a rainbow matching, i.e., a list of pairwise disjoint tuples $F_1\in\mathcal F_1$, $\dots$, $F_s\in\mathcal F_s$. We investigate the question, posed by Kupavskii and Popova, of determining the smallest $c=c(n,s,k)$ such that…

Not One to Rule Them All: Mining Meaningful Code Review Orders From GitHub
Abir Bouraffa, Carolin Brandt, Andy Zaidmann, Walid Maalej
https://arxiv.org/abs/2506.10654

Not One to Rule Them All: Mining Meaningful Code Review Orders From GitHub
Developers use tools such as GitHub pull requests to review code, discuss proposed changes, and request modifications. While changed files are commonly presented in alphabetical order, this does not necessarily coincide with the reviewer's preferred navigation sequence. This study investigates the different navigation orders developers follow while commenting on changes submitted in pull requests. We mined code review comments from 23,241 pull requests in 100 popular Java and Python repositorie…

Sequence Reconstruction over Coloring Channels for Protein Identification
Jessica Bariffi, Antonia Wachter-Zeh, Eitan Yaakobi
https://arxiv.org/abs/2508.02229 https://

Sequence Reconstruction over Coloring Channels for Protein Identification
This paper studies the sequence reconstruction problem for a channel inspired by protein identification. We introduce a coloring channel, where a sequence is transmitted through a channel that deletes all symbols not belonging to a fixed subset (the coloring) of the alphabet. By extending this to a coloring profile, a tuple of distinct colorings, we analyze the channel's information rate and capacity. We prove that optimal (i.e., achieving maximum information rate) coloring profiles correspond …

Today I found out that ffmpeg can process an input image sequence not only using the printf-style pattern (i.e. frame.d.jpg) but also using a glob pattern. It needs the parameter "-pattern_type glob" before your -i argument.
The advantage of glob patterns is the fact that it will skip over missing numbers. You can use this to turn a bunch of numbered photos from your location scouting into a movie clip that you can show to the client or upload as a preview to an asset libr…

Repdigits as Product of Consecutive Shifted Tribonacci Numbers
Pranabesh Das, Salah Eddine Rihane, Alain Togb\'e
https://arxiv.org/abs/2509.09578 https://

Repdigits as Product of Consecutive Shifted Tribonacci Numbers
A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci. This paper deals with the presence of repdigits in the products of consecutive shifted Tribonacci numbers.

C3PO V: Comoving Pairs Indicate Rotational Spin-Down Drives the Main-Sequence Li-Dip
Qinghui Sun (Lucy), Yuan-Sen Ting (Lucy), Barbara J. Anthony-Twarog (Lucy), Bruce A. Twarog (Lucy), Fan Liu (Lucy), Yuxi (Lucy), Lu
https://arxiv.org/abs/2508.08671

C3PO V: Comoving Pairs Indicate Rotational Spin-Down Drives the Main-Sequence Li-Dip
The lithium-dip observed in mid-F dwarfs remains a long-standing challenge for stellar evolution models. We present high-precision stellar parameters and A(Li) for 22 new comoving pairs, primarily located on the hotter side of the Li-Dip. Combined with pairs from the C3PO catalog, our sample includes 124 stars with Teff between 6000 and 7300 K, encompassing and extending slightly beyond the Li-Dip. Among them, 49 comoving pairs (98 stars) have both components within the temperature range of int…

The First Eigenvalue of Embedded Minimal Hypersurfaces in the Unit Sphere I: Yau's Conjecture
Lingzhong Zeng
https://arxiv.org/abs/2508.06123 https://a…

The First Eigenvalue of Embedded Minimal Hypersurfaces in the Unit Sphere I: Yau's Conjecture
In this paper, by meticulously constructing a minimizing sequence within a suitable Sobolev space and leveraging the variational principle, we establish that the first non-zero eigenvalue of the Laplace-Beltrami operator on an embedded minimal hypersurface in the unit sphere equals the dimension of the hypersurface. This result furnishes an affirmative resolution to a renowned conjecture posed by Yau, which had remained unresolved for an extended period. As some important applications, several …

LLM4ES: Learning User Embeddings from Event Sequences via Large Language Models
Aleksei Shestov, Omar Zoloev, Maksim Makarenko, Mikhail Orlov, Egor Fadeev, Ivan Kireev, Andrey Savchenko
https://arxiv.org/abs/2508.05688

LLM4ES: Learning User Embeddings from Event Sequences via Large Language Models
This paper presents LLM4ES, a novel framework that exploits large pre-trained language models (LLMs) to derive user embeddings from event sequences. Event sequences are transformed into a textual representation, which is subsequently used to fine-tune an LLM through next-token prediction to generate high-quality embeddings. We introduce a text enrichment technique that enhances LLM adaptation to event sequence data, improving representation quality for low-variability domains. Experimental resu…

Totally normal night:
1. Scratching the cat.
2. The first continuous sleep, ending with a #nightmare. I've dreamt that my first return train was delayed, and I'm likely to be stuck in Głogów. On top of that, the train looked looked like a nightmare contraption, with a sequence of cubic compartments with no seats, and weirdly shaped holes in the walls instead of doors.
3. Toilet.
4. Checking blood sugar, just in case.
5. Looking for a spot in the bed that's free of sweat.
6. Scratching the cat.
7. A series of nightmares. The most interesting one was about getting up in the morning, in middle of a gale. The mains voltage was so low I couldn't turn the lights on, and instead of getting myself ready to go out, I was trying hard to measure it, helping myself with a flashlight.
My working theory is that these are side effects of my current medication. One week to go.

ProteoKnight: Convolution-based phage virion protein classification and uncertainty analysis
Samiha Afaf Neha, Abir Ahammed Bhuiyan, Md. Ishrak Khan
https://arxiv.org/abs/2508.07345

ProteoKnight: Convolution-based phage virion protein classification and uncertainty analysis
\textbf{Introduction:} Accurate prediction of Phage Virion Proteins (PVP) is essential for genomic studies due to their crucial role as structural elements in bacteriophages. Computational tools, particularly machine learning, have emerged for annotating phage protein sequences from high-throughput sequencing. However, effective annotation requires specialized sequence encodings. Our paper introduces ProteoKnight, a new image-based encoding method that addresses spatial constraints in existing …

Retrospective Sparse Attention for Efficient Long-Context Generation
Seonghwan Choi, Beomseok Kang, Dongwon Jo, Jae-Joon Kim
https://arxiv.org/abs/2508.09001 https://

Retrospective Sparse Attention for Efficient Long-Context Generation
Large Language Models (LLMs) are increasingly deployed in long-context tasks such as reasoning, code generation, and multi-turn dialogue. However, inference over extended contexts is bottlenecked by the Key-Value (KV) cache, whose memory footprint grows linearly with sequence length and dominates latency at each decoding step. While recent KV cache compression methods identify and load important tokens, they focus predominantly on input contexts and fail to address the cumulative attention erro…

On lengths of modules over certain Artinian complete intersections
Tony J. Puthenpurakal
https://arxiv.org/abs/2506.10368 https://arx…

On lengths of modules over certain Artinian complete intersections
Let $(Q,\mathfrak{n})$ be a regular local ring of dimension $c \geq 2$ with algebraically closed residue field $k = Q/\mathfrak{n}$. Let $f_1, f_2, \ldots f_{c-1}, g$ be a regular sequence in $Q$ such that $ f_i \in \mathfrak{n}^2$ for all $i$ and $g \in \mathfrak{n}$. Set $A = Q/(f_1,\ldots, f_{c-1}, g^r)$ with $r \geq 2$. Notice $A$ is an Artinian complete intersection of codimension $c$. We show that there exists $α_A \in \mathbb{P}^{c-1}(k)$ such that there exists integer $m_A \geq 2…

CROP: Integrating Topological and Spatial Structures via Cross-View Prefixes for Molecular LLMs
Jianting Tang, Yubo Wang, Haoyu Cao, Linli Xu
https://arxiv.org/abs/2508.06917 ht…

CROP: Integrating Topological and Spatial Structures via Cross-View Prefixes for Molecular LLMs
Recent advances in molecular science have been propelled significantly by large language models (LLMs). However, their effectiveness is limited when relying solely on molecular sequences, which fail to capture the complex structures of molecules. Beyond sequence representation, molecules exhibit two complementary structural views: the first focuses on the topological relationships between atoms, as exemplified by the graph view; and the second emphasizes the spatial configuration of molecules, …

Minor-excluded graphs and soficity
Oriol Sol\'e-Pi
https://arxiv.org/abs/2508.06731 https://arxiv.org/pdf/2508.06731

Minor-excluded graphs and soficity
A random rooted graph is said to be sofic if it is the Benjamini-Schramm limit of a sequence of finite graphs. Given any finite graph $H$, we prove that every one-ended, unimodular random rooted graph that does not have H as a minor must be sofic. The hypothesis regarding the number of ends can be dropped under the additional assumption that the graph is quasi-transitive.

The impact of metallicity on the period-luminosity relation of Mira variables
Yuri Fadeyev
https://arxiv.org/abs/2508.07739 https://arxiv.org/pdf/2508.0773…

The impact of metallicity on the period-luminosity relation of Mira variables
Evolution of stars with initial masses $M_\mathrm{ZAMS}=1.1M_\odot$, $1.3M_\odot$, $1.5M_\odot$ and relative mass abundances of metals $Z=0.006$ and 0.02 was computed from the main sequence up to the final AGB stage. Selected models of evolutionary sequences were used as initial conditions for solution of the equations of hydrodynamics describing pulsations of red giants, whereas for each evolutionary sequence of Mira variables pulsating in the fundamental mode we determined the theoretical per…

Society of Mind Meets Real-Time Strategy: A Hierarchical Multi-Agent Framework for Strategic Reasoning
Daechul Ahn, San Kim, Jonghyun Choi
https://arxiv.org/abs/2508.06042 https…

Society of Mind Meets Real-Time Strategy: A Hierarchical Multi-Agent Framework for Strategic Reasoning
Large Language Models (LLMs) have recently demonstrated impressive action sequence prediction capabilities but often struggle with dynamic, long-horizon tasks such as real-time strategic games. In a game such as StarCraftII (SC2), agents need to manage resource constraints and adapt to evolving battlefield situations in a partially observable environment. This often overwhelms exisiting LLM-based approaches. To address these challenges, we propose a hierarchical multi-agent framework that emplo…

Periodicity and Dynamical Systems of Dickson Polynomials in Finite Fields
Wayne Peng, Yen-Ju Chen
https://arxiv.org/abs/2508.08621 https://arxiv.org/pdf/25…

Periodicity and Dynamical Systems of Dickson Polynomials in Finite Fields
This paper investigates the dynamical properties of Dickson polynomials over finite fields, focusing on the periodicity and structural behavior of their iterated sequences. We introduce and analyze the sequence \( [D_n(x, α) \mod (x^q - x)]_n \), where \( D_n(x, α) \) denotes a Dickson polynomial of the first kind, and explore its periodic nature when reduced modulo \( x^q - x \). We derive explicit formulas for the period of these sequences, particularly in the case when \( n \) is coprime t…

Controllable Singing Voice Synthesis using Phoneme-Level Energy Sequence
Yerin Ryu, Inseop Shin, Chanwoo Kim
https://arxiv.org/abs/2509.07038 https://arxiv…

Controllable Singing Voice Synthesis using Phoneme-Level Energy Sequence
Controllable Singing Voice Synthesis (SVS) aims to generate expressive singing voices reflecting user intent. While recent SVS systems achieve high audio quality, most rely on probabilistic modeling, limiting precise control over attributes such as dynamics. We address this by focusing on dynamic control--temporal loudness variation essential for musical expressiveness--and explicitly condition the SVS model on energy sequences extracted from ground-truth spectrograms, reducing annotation costs…

ASASSN-24fw: Candidate circumplanetary disk occultation of a main-sequence star
Nadia L. Zakamska, Gautham Adamane Pallathadka, Dmitry Bizyaev, Jaroslav Merc, James E. Owen, Kevin C. Schlaufman, Karolina B\k{a}kowska, S{\l}awomir Bednarz, Krzysztof Bernacki, Agnieszka Gurgul, Kirsten R. Hall, Franz-Josef Hambsch, Krzysztof Kotysz, Sebastian Kurowski, Alexios Liakos, Przemys{\l}aw J. Miko{\l}ajczyk, Erika Pak\v{s}tien\.e, Grzegorz Pojma\'nski, Adam Popowicz, Henrique Reggiani, Danie…

ASASSN-24fw: Candidate circumplanetary disk occultation of a main-sequence star
Dusty disks around planets in outer reaches of exo-planetary systems can be detected as long-lasting occultations, provided the observer is close to the planet's orbital plane. Here we report follow-up observations of ASASSN-24fw (Gaia 07:05:18.97+06:12:19.4), a 4-magnitude dimming event of a main-sequence star which lasted 8.5 months. Using optical spectroscopy with KOSMOS (APO), MagE (Magellan) and GHOST (Gemini-S), we find strong Na I D absorption indicating that the occulter is gas rich. We…

SAFT: Shape and Appearance of Fabrics from Template via Differentiable Physical Simulations from Monocular Video
David Stotko, Reinhard Klein
https://arxiv.org/abs/2509.08828 ht…

SAFT: Shape and Appearance of Fabrics from Template via Differentiable Physical Simulations from Monocular Video
The reconstruction of three-dimensional dynamic scenes is a well-established yet challenging task within the domain of computer vision. In this paper, we propose a novel approach that combines the domains of 3D geometry reconstruction and appearance estimation for physically based rendering and present a system that is able to perform both tasks for fabrics, utilizing only a single monocular RGB video sequence as input. In order to obtain realistic and high-quality deformations and renderings, …

Special restricted partition functions for the stable sheaf cohomology on flag varieties
Mircea Cimpoeas
https://arxiv.org/abs/2509.09418 https://arxiv.org…

Special restricted partition functions for the stable sheaf cohomology on flag varieties
Let $\mathbf a:=(a_1,\ldots,a_r)$ be a sequence of positive integers, $d\geq 2$ and $j\geq 1$, some integers. We study the functions $p_{\mathbf a,d}(n):=$ the number of integer solutions $(x_1,\dots,x_r)$ of $\sum_{i=1}^r a_ix_i=n$, with $x_i\geq 0$ and $x_i \equiv 0,1(\bmod\;d)$, for all $1\leq i\leq r$, and $p_{\mathbf a,d}(n;j):=$ the number of $(x_1,\ldots,x_r)$ as above which satisfy also the condition $\sum_{i=1}^r \left(x_i-(d-2)\left\lfloor \frac{x_i}{d} \right\rfloor\right) =j$. We …

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

DP-SPRT: Differentially Private Sequential Probability Ratio Tests
Thomas Michel, Debabrota Basu, Emilie Kaufmann
https://arxiv.org/abs/2508.06377 https://…

DP-SPRT: Differentially Private Sequential Probability Ratio Tests
We revisit Wald's celebrated Sequential Probability Ratio Test for sequential tests of two simple hypotheses, under privacy constraints. We propose DP-SPRT, a wrapper that can be calibrated to achieve desired error probabilities and privacy constraints, addressing a significant gap in previous work. DP-SPRT relies on a private mechanism that processes a sequence of queries and stops after privately determining when the query results fall outside a predefined interval. This OutsideInterval mecha…

The Hubble Arp Galaxy Survey
Julianne J. Dalcanton (Center for Computational Astrophysics, Flatiron Institute, Department of Astronomy, University of Washington), Meredith J. Durbin (Department of Astronomy, University of Washington, Department of Astronomy, University of California, Berkeley), Benjamin F. Williams (Department of Astronomy, University of Washington)

The Hubble Arp Galaxy Survey
The typical galaxy in the local universe is expected to be in a self-regulated quasi-equilibrium, displaying a settled morphology that falls within the Hubble Sequence. The Arp and Arp-Madore catalogs are filled with striking examples of galaxies that defy these expectations, making them useful targets for studying the astrophysics that controls dramatic, but short-lived, episodes of disequilibrium that mark galaxies' evolution. In this paper, we greatly expand the available Hubble Space Telesc…

Recursive Aperture Decoded Ultrasound Imaging (READI) With Estimated Motion-Compensated Compounding (EMC2)
Tyler Keith Henry, Darren Dahunsi, Randy Palamar, Negar Majidi, Mohammad Rahim Sobhani, Roger Zemp
https://arxiv.org/abs/2509.08781

Recursive Aperture Decoded Ultrasound Imaging (READI) With Estimated Motion-Compensated Compounding (EMC2)
Fast Orthogonal Row-Column Electronic Scanning (FORCES) is a Hadamard-encoded Synthetic Transmit Aperture (STA) imaging sequence using bias-sensitive Top-Orthogonal to Bottom Electrode (TOBE) arrays. It produces images with a higher Signal-to-Noise Ratio (SNR) and improved penetration depth compared to traditional STA techniques, but suffers from motion sensitivity due to ensemble size and aperture encoding. This work presents Recursive Aperture Decoded Ultrasound Imaging (READI), a novel decod…

Splittings in a complete local ring and decomposition its group of units
Abolfazl Tarizadeh
https://arxiv.org/abs/2508.08753 https://arxiv.org/pdf/2508.087…

Splittings in a complete local ring and decomposition its group of units
Let $(R,M,k)$ be a complete local ring (not necessarily Noetherian). Then we prove that the natural surjective ring map $R\rightarrow k$ admits a splitting if and only if $\Char(R)=\Char(k)$. In addition, if $\Char(R)\neq\Char(k)$, then we prove that the natural surjective map between the groups of units $R^{\ast}\rightarrow k^{\ast}$ admits a splitting. As an application of this theorem, we show that the following short exact sequence of Abelian groups: $$\xymatrix{1\ar[r]&1+M\ar[r]& R^{\ast}\…

Sequence space representations of Beurling-Bj\"orck spaces via Gabor frames and Wilson bases
Andreas Debrouwere, Lenny Neyt
https://arxiv.org/abs/2508.05565 https://…

Sequence space representations of Beurling-Björck spaces via Gabor frames and Wilson bases
We establish sequence space representations of a broad class of Beurling-Björck spaces $\mathcal{S}^{(ω)}_{(η)}$ and $\mathcal{S}^{\{ω\}}_{\{η\}}$. We develop two different approaches: a non-constructive one based on Gabor frames and the structure theory of Fréchet spaces, and a constructive one using Wilson bases, under stronger assumptions on the defining weight functions $ω$ and $η$. As an application, we provide an isomorphic classification of the spaces $\mathcal{S}^{(ω)}_{(η)}$ …

Robust Lindbladian Estimation for Quantum Dynamics
Yinchen Liu, James R. Seddon, Tamara Kohler, Emilio Onorati, Toby S. Cubitt
https://arxiv.org/abs/2507.07912

Robust Lindbladian Estimation for Quantum Dynamics
We revisit the problem of fitting Lindbladian models to the outputs of quantum process tomography. A sequence of prior theoretical works approached the problem by considering whether there exists a Lindbladian generator close to a matrix logarithm of the tomographically estimated transfer matrix. This technique must take into account the non-uniqueness of the matrix logarithm, so that in general multiple branches of the logarithm must be checked. In contrast, all practical demonstrations of Lin…

Polynomial extension of Van der Waerden's Theorem near zero
Ghadir Ghadimi, Mohammad Akbari Tootkaboni
https://arxiv.org/abs/2508.08675 https://arxiv.o…

Polynomial extension of Van der Waerden's Theorem near zero
Let $S$ be a dense subring of the real numbers. In this paper we prove a polynomial version of Van der Waerden's theorem near zero. In fact, we prove that if $p_1,\ldots,p_m \in \mathbb{Z}[x]$ are polynomials such that $p_i(0) = 0$ and there exists $δ> 0$ such that $p_i(x) > 0$ for every $x \in (0,δ)$ and for every $i=1,\ldots , m$. Then for any finite partition $\mathcal{C}$ of \( S\cap(0,1) \) and every sequence $f:\mathbb{N}\to S\cap(0,1)$ satisfying $\sum_{n=1}^\infty f(n)<\infty$, there …

Axisymmetric second order perturbations of rotating main sequence stars
Umin Lee
https://arxiv.org/abs/2507.07383 https://arxiv.org/p…

Axisymmetric second order perturbations of rotating main sequence stars
We calculate the second order perturbations driven by oscillation modes of rotating stars. Assuming that the typical amplitude $a$ of oscillation modes is small, we expand the perturbed quantities as $Q=Q^{(0)}+Q^{(1)}+Q^{(2)}+\cdots$ where $Q^{(0)}$ represents the equilibrium state and $Q^{(1)}$ and $Q^{(2)}$ are the first order and second order perturbations in $a$, respectively. We assume that the first order perturbations are given by non-axisymmetric modes and the second order perturbation…

Dynamic Regret Reduces to Kernelized Static Regret
Andrew Jacobsen, Alessandro Rudi, Francesco Orabona, Nicolo Cesa-Bianchi
https://arxiv.org/abs/2507.05478

Dynamic Regret Reduces to Kernelized Static Regret
We study dynamic regret in online convex optimization, where the objective is to achieve low cumulative loss relative to an arbitrary benchmark sequence. By observing that competing with an arbitrary sequence of comparators $u_{1},\ldots,u_{T}$ in $\mathcal{W}\subseteq\mathbb{R}^{d}$ is equivalent to competing with a fixed comparator function $u:[1,T]\to \mathcal{W}$, we frame dynamic regret minimization as a static regret problem in a function space. By carefully constructing a suitable functi…

Deep Unrolling of Sparsity-Induced RDO for 3D Point Cloud Attribute Coding
Tam Thuc Do, Philip A. Chou, Gene Cheung
https://arxiv.org/abs/2509.08685 https://

Deep Unrolling of Sparsity-Induced RDO for 3D Point Cloud Attribute Coding
Given encoded 3D point cloud geometry available at the decoder, we study the problem of lossy attribute compression in a multi-resolution B-spline projection framework. A target continuous 3D attribute function is first projected onto a sequence of nested subspaces $\mathcal{F}^{(p)}_{l_0} \subseteq \cdots \subseteq \mathcal{F}^{(p)}_{L}$, where $\mathcal{F}^{(p)}_{l}$ is a family of functions spanned by a B-spline basis function of order $p$ at a chosen scale and its integer shifts. The projec…

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

Training chord recognition models on artificially generated audio
Martyna Majchrzak, Jacek Ma\'ndziuk
https://arxiv.org/abs/2508.05878 https://arxiv.or…

Training chord recognition models on artificially generated audio
One of the challenging problems in Music Information Retrieval is the acquisition of enough non-copyrighted audio recordings for model training and evaluation. This study compares two Transformer-based neural network models for chord sequence recognition in audio recordings and examines the effectiveness of using an artificially generated dataset for this purpose. The models are trained on various combinations of Artificial Audio Multitracks (AAM), Schubert's Winterreise Dataset, and the McGill…

High-resolution simulations of disc tearing in the GW Orionis triple system
Alison K. Young
https://arxiv.org/abs/2509.09317 https://arxiv.org/pdf/2509.093…

High-resolution simulations of disc tearing in the GW Orionis triple system
The disc around the pre-main-sequence triple star system GW Orionis is known from observations to be warped and broken. Theoretical modelling has produced conflicting results regarding the mechanism responsible for breaking the disc. Analytical predictions for the measured parameters of GW Ori suggest the disc is only marginally stable to tearing. We present new high-resolution simulations of GW Ori that replicate the wavelike regime expected in thick, low-turbulence protoplanetary discs for th…

Revealing Unresolved White Dwarf-Main Sequence Binaries using Gaia DR3 and GALEX I. A Volume limited study of 100 pc
Prasanta K. Nayak
https://arxiv.org/abs/2509.06910 https://

Revealing Unresolved White Dwarf-Main Sequence Binaries using Gaia DR3 and GALEX I. A Volume limited study of 100 pc
Context. Understanding the demographics of white dwarf - main sequence (WDMS) binaries is key to uncovering the formation of various stellar exotica and refining the details of binary stellar evolution. Despite several dedicated efforts to identify unresolved WDMS binaries, their population remains incomplete, even within a 100 pc volume-limited sample. Aims. This study aims to identify WDMS binaries hidden within the main sequence of the optical color-magnitude diagram (CMD), improving the com…

Spatial-Temporal-Spectral Mamba with Sparse Deformable Token Sequence for Enhanced MODIS Time Series Classification
Zack Dewis, Zhengsen Xu, Yimin Zhu, Motasem Alkayid, Mabel Heffring, Lincoln Linlin Xu
https://arxiv.org/abs/2508.02839

Spatial-Temporal-Spectral Mamba with Sparse Deformable Token Sequence for Enhanced MODIS Time Series Classification
Although MODIS time series data are critical for supporting dynamic, large-scale land cover land use classification, it is a challenging task to capture the subtle class signature information due to key MODIS difficulties, e.g., high temporal dimensionality, mixed pixels, and spatial-temporal-spectral coupling effect. This paper presents a novel spatial-temporal-spectral Mamba (STSMamba) with deformable token sequence for enhanced MODIS time series classification, with the following key contrib…

Decoder-Hybrid-Decoder Architecture for Efficient Reasoning with Long Generation
Liliang Ren, Congcong Chen, Haoran Xu, Young Jin Kim, Adam Atkinson, Zheng Zhan, Jiankai Sun, Baolin Peng, Liyuan Liu, Shuohang Wang, Hao Cheng, Jianfeng Gao, Weizhu Chen, Yelong Shen
https://arxiv.org/abs/2507.06607…

Decoder-Hybrid-Decoder Architecture for Efficient Reasoning with Long Generation
Recent advances in language modeling have demonstrated the effectiveness of State Space Models (SSMs) for efficient sequence modeling. While hybrid architectures such as Samba and the decoder-decoder architecture, YOCO, have shown promising performance gains over Transformers, prior works have not investigated the efficiency potential of representation sharing between SSM layers. In this paper, we introduce the Gated Memory Unit (GMU), a simple yet effective mechanism for efficient memory shari…

Solar magnetic flux rope eruptions caused by inverse flux feeding processes
Quanhao Zhang, Shangbin Yang, Rui Liu, Min Zhang, Dong Wang, Ake Zhao, Shaoyu Lyu, Anchuan Song, Yuming Wang
https://arxiv.org/abs/2508.08766

Solar magnetic flux rope eruptions caused by inverse flux feeding processes
Large-scale solar eruptions are generally accepted to have coronal magnetic flux ropes as their core structures. Recent studies found that the solar eruptions could be initiated by a sequence of flux feeding processes, during with chromospheric fibrils rise and merge with the pre-existing coronal flux rope. Further theoretical analyses have demonstrated that the normal flux feeding, i.e. the axial magnetic flux within the fibril is in the same direction as that in the flux rope, results in the …

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

Dynamic Chunking for End-to-End Hierarchical Sequence Modeling
Sukjun Hwang, Brandon Wang, Albert Gu
https://arxiv.org/abs/2507.07955 https://arxiv.org/pdf/2507.07955 https://arxiv.org/html/2507.07955
arXiv:2507.07955v1 Announce Type: new
Abstract: Despite incredible progress in language models (LMs) in recent years, largely resulting from moving away from specialized models designed for specific tasks to general models based on powerful architectures (e.g. the Transformer) that learn everything from raw data, pre-processing steps such as tokenization remain a barrier to true end-to-end foundation models. We introduce a collection of new techniques that enable a dynamic chunking mechanism which automatically learns content -- and context -- dependent segmentation strategies learned jointly with the rest of the model. Incorporating this into an explicit hierarchical network (H-Net) allows replacing the (implicitly hierarchical) tokenization-LM-detokenization pipeline with a single model learned fully end-to-end. When compute- and data- matched, an H-Net with one stage of hierarchy operating at the byte level outperforms a strong Transformer language model operating over BPE tokens. Iterating the hierarchy to multiple stages further increases its performance by modeling multiple levels of abstraction, demonstrating significantly better scaling with data and matching a token-based Transformer of twice its size. H-Nets pretrained on English show significantly increased character-level robustness, and qualitatively learn meaningful data-dependent chunking strategies without any heuristics or explicit supervision. Finally, the H-Net's improvement over tokenized pipelines is further increased in languages and modalities with weaker tokenization heuristics, such as Chinese and code, or DNA sequences (nearly 4x improvement in data efficiency over baselines), showing the potential of true end-to-end models that learn and scale better from unprocessed data.
toXiv_bot_toot

Testing the Role of Merging Binaries in the Formation of the Split Main Sequence in Young Clusters
Nate Bastian, Sebastian Kamann, Florian Niederhofer, Sara Saracino
https://arxiv.org/abs/2509.07708

Testing the Role of Merging Binaries in the Formation of the Split Main Sequence in Young Clusters
A number of theories have been put forward to explain the bi-modal stellar rotational distribution observed in young massive clusters. These include stellar mergers and interactions induced in binary systems, and the role of angular momentum transfer between a star and its circumstellar disk in its early evolution. Each theory predicts unique rotation distributions in various locations of the colour-magnitude diagram. Specifically, the stellar merger hypothesis posits that the upper end of the …

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 6301 nodes and 20777 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

A Systematic Search for Main-Sequence Dipper Stars Using the Zwicky Transient Facility
Anastasios Tzanidakis, James R. A. Davenport, Neven Caplar, Eric C. Bellm, Wilson Beebe, Doug Branton, Sandro Campos, Andrew J. Connolly, Melissa DeLucchi, Konstantin Malanchev, Sean McGuire
https://arxiv.org/abs/2508.03964…

A Systematic Search for Main-Sequence Dipper Stars Using the Zwicky Transient Facility
Main-sequence dipper stars, characterized by irregular and often aperiodic luminosity dimming events, offer a unique opportunity to explore the variability of circumstellar material and its potential links to planet formation, debris disks, and broadly star-planet interactions. The advent of all-sky time-domain surveys has enabled the rapid discovery of these unique systems. We present the results of a large systematic search for main-sequence dipper stars, conducted across a sample of 63 milli…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 25696 nodes and 105332 edges.
Tags: Technological, Communication, Unweighted, Temporal

3D hydrodynamic simulations of massive main-sequence stars -- IV. Internal gravity waves matter for SLF variability
Praneet Pathak, Simon Blouin, Falk Herwig, Paul R. Woodward
https://arxiv.org/abs/2508.03893

3D hydrodynamic simulations of massive main-sequence stars -- IV. Internal gravity waves matter for SLF variability
The power spectrum of light curves from satellites like CoRoT and TESS of massive main-sequence stars have shown stochastic low-frequency (SLF) variability or excess power in the low frequency regime. To investigate the origin of this phenomenon, we conducted high-resolution 3D hydrodynamic \texttt{PPMstar} simulations of a non-rotating $25 \mathrm{M_\odot}$ zero-age main sequence star, modeling 95\% of the stellar structure with both core and thin outer envelope convection zones. The thin oute…

Probing accretion and stellar properties in the Orion Nebula with VLT/X-Shooter
L. Piscarreta, G. Beccari, R. A. B. Claes, C. F. Manara, H. M. J. Boffin, T. Jerabkova, B. Ercolano, A. Natta, S. E. van Terwisga
https://arxiv.org/abs/2509.08784

Probing accretion and stellar properties in the Orion Nebula with VLT/X-Shooter
Multiple photometric studies have reported the presence of seemingly older accreting pre-main sequence stars (PMS) in optical colour-magnitude diagrams (CMDs). We investigate this phenomenon in the Orion Nebula, which harbors a subset of stars that show infrared excess detected by Spitzer and Halpha excess emission, yet display significantly older isochronal ages (>10 Myr) compared to the bulk population (~1-3 Myr) in the r, (r-i) CMD. We perform a detailed spectroscopic analysis of 40 Orion Ne…

Evidence for synchronisation of Gaia eclipsing binaries from their stellar rotational velocity
E. Hadad, T. Mazeh, S. Faigler
https://arxiv.org/abs/2508.05774 https://

Evidence for synchronisation of Gaia eclipsing binaries from their stellar rotational velocity
The Gaia DR3 catalogue includes line-broadening (vbroad) measurements for 10,387 eclipsing binaries. In this study, we focus on a subset of 977 short-period main-sequence systems with primary radii between 1.25 and 3 solar radii, effective temperatures from 5600 to 8000 K, orbital periods between 0.3 and 3 days, vbroad values from 30 to 300 km/s, eclipse depth ratios below 0.7, and eccentricity indicators |e cos(omega)| less than 0.1. We find a clear inverse correlation between vbroad…

Spectroscopic ages for 4 million main-sequence dwarf stars from LAMOST DR10 estimated with data-driven approach
Jia-Hui Wang, Maosheng Xiang, Meng Zhang, Jiwei Xie, Jian Ge, Jinghua Zhang, Lanya Mou, Jifeng Liu
https://arxiv.org/abs/2508.03019

Spectroscopic ages for 4 million main-sequence dwarf stars from LAMOST DR10 estimated with data-driven approach
Stellar age determination for large samples of stars opens new avenues for a broad range of astronomical sciences. While precise stellar ages for evolved stars have been derived from large ground- and space-based stellar surveys, reliable age determination for cool main-sequence dwarf stars remains a challenge. In this work, we set out to estimate the age of dwarf stars from the LAMOST spectra with a data-driven approach. We build a training set by using wide binaries that the primary component…