Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Tuesday 8 September

Probability

The Ding-Song-Sun inequality for a class of even ferromagnets

Ding-Song-Sun proved the remarkable correlation inequality that the truncated two-point correlation function of ferromagnetic Ising models with arbitrary mixed-sign external field is largest when the field vanishes. This inequality has various important consequences such as log-Sobolev inequalities for Ising and $\varphi^4$ models up to and at the critical point. We extend the DSS inequality to the class of single spin measures satisfying the GHS condition. This is an important ingredient in our proof of the log-Sobolev inequality for the massless sinh-Gordon model on $\mathbb{R}^2$ in a forthcoming article.
Read the full abstract

All authors Omar Abdelghani, Roland Bauerschmidt, Thierry Bodineau, Benoit Dagallier

Earth and Planetary Astrophysics

TEMPUS: Relativistic coordinate time scales for any solar-system body from arbitrary ephemerides

Precise time-scale transformations between solar-system bodies are an essential requirement for deep-space science and solar system navigation. The post-Newtonian relativistic expression relating a body-centered coordinate time TCX to the Barycentric Coordinate Time TCB depends on the gravitational environment and velocity of the target body, and must be evaluated consistently with the chosen planetary ephemerides. So far only INPOP has provided such a solution as part of its ephemerides releases, albeit only for Earth with TCG-TCB. We present TEMPUS, a tool that numerically integrates the IAU 2000 time-transformation for any solar-system body using positions and velocities from an arbitrary ephemerides. We provide a validated, ephemerides-agnostic implementation of TCX-TCB and assess its accuracy against published independent solutions. The rate $d\,\mathrm{TCX}/d\,\mathrm{TCB}$ is integrated with an Adams-Moulton order-12 predictor-corrector. The gravitational potential sum tested here includes the Sun, eight planets, Pluto, up to 343 main-belt asteroids, and 30 trans-Neptunian objects. Outputs can be stored in readable format tables of sampled values or as Chebyshev coefficient files. Comparisons are performed against the TU Dresden Klioner time solutions, the TCG-TCB solution provided with INPOP19a and INPOP21a, and the LTE440 lunar solution. For the planetary bodies TEMPUS agrees with Klioner at the $10^{-21} s\,s^{-1}$ level over 200 yr. Against the INPOP19a released TCG-TCB we also agree to the same level. The main-belt asteroids as well as the trans-Neptunian objects shift the planetary time scales at the $10^{-18} s\,s^{-1}$ level, and the choice of planetary and lunar ephemerides contributes differences on the $10^{-18} s\,s^{-1}$ level as well. TEMPUS provides a validated, ephemeris-agnostic post-Newtonian time-transformation for any solar-system body.
Read the full abstract

Differential Geometry

Degenerations of exotic Calabi-Yau metrics through Atiyah's flop

We construct new families of complete Calabi-Yau metrics with maximal volume growth on the small resolutions of the conifold $\mathcal{Z} = \{z_1^2 + z_2^2 + z_3^2 + z_4^2 = 0\} \subset \mathbb{C}^4$. These metrics have tangent cone $\mathbb{C} \times (\mathbb{C}^2 / \mathbb{Z}_2)$ at infinity and are parametrised by their Kähler class. As the Kähler class degenerates, the metrics converge in the pointed Gromov-Hausdorff sense to a Calabi-Yau metric on $\mathcal{Z}$ with an isolated conical singularity modelled on the Stenzel metric at the ordinary double point and tangent cone at infinity $\mathbb{C} \times (\mathbb{C}^2/\mathbb{Z}_2)$, thereby providing a new metric realisation of the Atiyah flop.
Read the full abstract

Audio and Speech Processing

Multimodal Duplex Interaction Agent

In this work, we present Gander, a native multimodal duplex interaction model that builds on MiniCPM-o 4.5 and is further adapted for realtime interaction with an asynchronous agent loop. In contrast to conventional turn based systems, Gander continuously processes streaming user inputs, enabling full-duplex interaction in both everyday conversations and complex workflow agent scenarios. Users can interrupt an ongoing response, while the model can proactively provide intermediate feedback or ask follow up questions. To natively support these capabilities, Gander adopts two key architectural designs: 1) a Cerebellum-Brain collaborative framework, Cerebellum is responsible for realtime interaction while the Brain handles complex reasoning and higher level agentic tasks. The two components interact continuously through tool calling and the agent orchestration runtime. 2) The Cerebellum is built upon a streaming Thinker-Talker architecture, where user inputs and model outputs are flattened into an ordered token stream at the chunk level. We evaluate Gander across conversational ability, interactive capability, understanding, and tool assisted task execution. Internal human evaluations show that Gander maintains natural and expressive spoken dialogue, while benchmark results demonstrate effective turn taking capability and encouraging results on spoken question answering and related understanding tasks. Gander also supports a range of challenging interaction settings, including background noise interference, multi-party interactions, and backchannel communication. While our current evaluation focuses on tool assisted settings, broader long horizon agent tasks and more diverse deployment conditions remain promising directions for further study. We release Gander together with its models, code, and data to facilitate further research and development in the community.
Read the full abstract

All authors Orantqing, Shengpeng Ji, Junlong Tong, Jialong Zuo, Dongjie Fu, Di Cao, Yangzhuo Li, Shangda Wu, Franz, Evan, Theron Veyra, Changhao Pan, Jingyu Lu, Dongchao Yang, Zhifei Xie, Yang Tan, Xiaoyu Shen, Xiaoda Yang, Wenfu Wang, Teddy Sun, Steve Yves, Zhou Zhao

Materials Science

Water, vacancies, and competing exchange interactions in Prussian blue analogues: a neutron diffraction study of field and dehydration-driven magnetic transitions

We report a neutron diffraction study of the structural and magnetic properties of a family of ferro- and ferrimagnetic Prussian blue analogues (PBAs), $A_4$[Fe(CN)$_6$]$_{2.7}$ ($A$ = Co, Mn, Ni), Rb$_2$Ni$_4$[Fe(CN)$_6$]$_{3.3}$, and Mn$_4$[Cr(CN)$_6$]$_{2.7}$, as a function of temperature (2–450~K) and applied magnetic field. All bimetallic compounds of the Fm$\overline{3}$m family exhibit a broad diffuse feature at low scattering angle, which we identify, through comparison with the cation-stabilized Rb$_2$NiFe framework, as an intrinsic signature of correlated vacancies and their associated interstitial water. High-temperature diffraction reveals a continuous crossover from positive to negative thermal expansion in CoFe and MnFe upon dehydration, while NiFe remains structurally robust up to 450~K. At low temperature, all compounds order in a collinear ferrimagnetic state with propagation vector $\mathbf{k}=(0,0,0)$, except MnFe, which adopts a partially frustrated magnetic structure with $\mathbf{k}=(1,0,0)$. A moderate magnetic field of $B_c = 1.3$~T drives a spin reorientation in MnFe toward the collinear $\mathbf{k}=(0,0,0)$ ferrimagnetic state common to the other compounds; the same transition is independently induced by dehydration. A minimal Heisenberg model shows that this transition results from a near-compensation between antiferromagnetic Mn–Fe coupling and a geometrically frustrated antiferromagnetic Mn–Mn interaction on the face-centered-cubic Mn sublattice, placing MnFe in the vicinity of a magnetic compensation point. These results resolve a longstanding ambiguity in the interpretation of the Fe $K$-edge XMCD response of MnFe-based PBAs, and establish water content as a key parameter controlling both the structural and magnetic stability of this family of materials, with direct relevance to their use as battery electrodes.
Read the full abstract

All authors N. S. Dhami, C. V. Colin, V. Nassif, O. Fabelo, T. Nait, A. Bleuzen, A. Bordage, V. Balédent

Classical Analysis and ODEs

On the Two-Weight Problem for One-Sided Maximal Operators in Higher Dimensions

For the one-sided Hardy–Littlewood maximal operator $M_d^+$ on $\mathbb R^d$, the natural two-weight Muckenhoupt condition was shown by Sawyer in 1986 to characterize the weak $(p,p)$ inequality in dimension one, and by Forzani, Martín-Reyes and Ombrosi in 2011 in dimension two. At the endpoint $p=1$ in dimension three, Ombrosi and Nazarov have recently given negative answers to both the Fefferman–Stein-type question and the related weighted weak-type $(1,1)$ question \cite{OmbrosiNazarov} (personal communication). In this paper, we prove that the two-weight characterization fails for every $d\geq 3$ and $p>1$. More precisely, for every $1<p<\infty$ and every $d\geq 3$, there exist weights $w$ and $v$ such that $$ A_{p,d}^+(w,v)<\infty, \qquad \|M_d^+\|_{L^p(v)\to L^{p,\infty}(w)}=\infty. $$ The proof uses a finite two-dimensional Hardy operator whose weak operator norm is bounded below by $c_p(\log N)^{1/p'}$. This operator is embedded into the three-dimensional lattice maximal operator and then transferred to the continuous setting. A tensor extension yields the same failure in every dimension $d>3$.
Read the full abstract

Dynamical Systems

Limit Sets and Global Bifurcation Structure in Planar Control Models with Large Hysteresis

The present paper addresses a problem that may be of considerable interest to a broad audience since the systems considered here operate according to a switching protocol involving two distinct dynamical regimes. Starting from an initial condition, the evolution follows a first vector field until a selected state variable $y$ reaches a lower threshold $C_1$. At this moment, the dynamics switches to a second vector field. The second regime remains active until the same variable attains an upper threshold $C_2>C_1$, when the first vector field is restored. This alternating procedure is then repeated indefinitely giving rise to a piecewise smooth vector field. A complete characterization of the $\omega$-limit sets is obtained for every admissible combination of parameters and all initial condition. The analysis is carried out by combining explicit solutions of the vector fields with geometric arguments and the first return map. Beyond the classification of limit sets, the paper describes the global bifurcation structure of the family. As the parameters vary, the system undergoes qualitative transitions between distinct asymptotic regimes, including the birth and disappearance of periodic orbits, changes in their stability, the occurrence of continuum of periodic trajectories in degenerate situations, and the replacement of bounded dynamics by monotone zig-zag motions or unbounded trajectories. The corresponding bifurcation diagrams provide a complete qualitative description of the asymptotic dynamics of the model.
Read the full abstract

Quantum Physics

Restart and first detection in a lackadaisical quantum walk with flat-band localization

We study stochastic and sharp restart in a one-dimensional lackadaisical discrete-time quantum walk with self-loop weight $\ell$. In the absence of restart, the dynamics has a flat band responsible for intrinsic localization and two dispersive bands supporting ballistic propagation. We compare two initially localized benchmark states: a flat-band-active state with finite flat-band overlap and a flat-band-dark state with zero flat-band overlap. For geometric stochastic restart with per-step restart probability $q$, the stationary mean-squared displacement scales as $q^{-2}$ as $q\to0$. In the same limit, the restart-site occupation probability approaches the restart-free intrinsic localized value for the flat-band-active state, whereas for the flat-band-dark state it vanishes as $q\ln(1/q)$. For power-law restart, where $p_m\propto m^{-s}$ is the probability that the waiting time to the next restart is $m$ steps, a normalized stationary site-occupation distribution exists only for $s>2$, while the stationary absolute spatial moment of order $p$ is finite only for $s>p+2$. In the regime $1<s\leq2$, at every fixed lattice site, the flat-band-active occupation converges to the intrinsic flat-band profile, while the flat-band-dark occupation tends to zero. We also consider monitored first detection with sharp restart, in which the walk is reinitialized after a fixed number $r$ of consecutive unsuccessful measurements. For fixed $r$, the mean first-detected-passage time of the flat-band-active state exhibits a minimum at an intermediate self-loop weight, whereas the flat-band-dark state approaches a ballistic detection limit as $\ell\to\infty$.
Read the full abstract

Analysis of PDEs

A growth gap for anisotropic minimal graphs

We prove a growth gap for the gradient of entire anisotropic minimal graphs. For each $n\geq2$ and each smooth uniformly elliptic parametric integrand $\Phi$ on $\mathbb{R}^{n+1}$, there is an exponent $\alpha=\alpha(n,\Phi)>0$ such that every smooth nonaffine entire $\Phi$-minimal graph $u:\mathbb{R}^n\to\mathbb{R}$ satisfies $\sup_{B_R^n}|Du|\geq cR^\alpha$ for all $R\geq R_0$, for some constants $c>0$ and $R_0<\infty$ depending on the solution. In particular, gradient growth $o(R^\alpha)$ forces flatness, resolving a conjecture of Mooney and the author. The result holds in every dimension, without any assumption that $\Phi$ is close to the Euclidean area integrand.
Read the full abstract

Cryptography and Security

NERVE Attacks: Breaking AI-Powered Brain-Computer Interfaces

The rapid integration of AI into human-centred systems such as Brain-Computer Interfaces (BCIs) has created a poorly understood attack surface linking neural signals to physical systems. Exploits in this domain threaten cognitive autonomy, mental privacy, and physical safety, from neural data exfiltration to malicious control of BCI-tethered devices. We introduce the NERVE Attacks class, a systematic characterisation of five orthogonal attack dimensions that together span the complete BCI stack: Neuro-mimetic Forgery (N), Evasion via Desynchronization (E), Replay-based Hijacking (R), Vein Tapping (V), and Embedded Backdoors (E). To evaluate this class, we present EEGle, an AI-assisted extensible framework for systematic BCI security analysis. Our evaluation uncovers 17 novel neuro-specific attack instances and reveals a stealth-effectiveness spectrum unique to BCI backdoor design. We also show that generative AI lowers the barrier to entry for non-expert attackers and provide EEGle to the community for building and verifying the security of these deeply personal devices.
Read the full abstract

All authors Zahra Tarkhani, Georgios Akkogiounoglou, Lorena Qendro, Isabel Tscherniak, Anil Madhavapeddy

Machine Learning

GraphFAS: A Distributed System for Automated Graph Feature Generation and Selection in Industrial Transaction Networks

Industrial fraud detection often relies on costly expert-crafted features that overlook graph-structured relational signals, while GNNs often do not meet the interpretability and deployment requirements of financial risk control. We propose GraphFAS (Graph Feature Automated Selection), a distributed feature selection procedure based on Boruta that bridges this gap through: (1) a non-parametric graph feature generation module that constructs explicit, interpretable structural features via multi-hop subgraph extraction and multi-scale aggregation without learned parameters; and (2) an automated distributed feature selection algorithm extending Boruta with median-based aggregation across partitions to robustly identify informative features at scale with minimal domain expertise. Compared with end-to-end GNN pipelines, GraphFAS decouples feature aggregation from model training, enabling direct integration with tabular models and direct compatibility with TreeSHAPbased explanations. Deployed in Alipay, GraphFAS delivers orderof-magnitude improvements in engineering efficiency while showing strong performance against expert-driven and graph-learning baselines on large-scale graphs.
Read the full abstract

All authors Yice Luo, Yun Zhu, Xi Chen, Yongchao Liu, Xintan Zeng, Chengying Huan, Kai Zhang, Jinrui Zhang, Juelu Zhang, Jiajun Zheng

Dynamical Systems

Singular Turing bifurcations and spatial canard solutions in nonlinear reaction-diffusion systems

We study a general class of nonlinear reaction-diffusion equations that model pattern-forming systems. The class includes the Gierer-Meinhardt PDE, Brusselator model, and van der Pol PDE, as well as the Gray-Scott, Klausmeier, Lengyel-Epstein, Schnakenberg PDEs and others of activator-inhibitor type. In the limit in which the activator diffusivity is much smaller than that of the inhibitor, these PDEs exhibit singular Turing bifurcations, which have only recently begun to receive attention. We analytically establish that the spatially-periodic solutions that emerge in both the sub-critical and super-critical cases of singular Turing bifurcations are spatially-periodic canard solutions. These canard patterns are new types of spatially-periodic solutions that –just beyond the Turing point– have fast-slow structure in space, rather than the classical sinusoidal profile. In addition, their amplitude grows more rapidly than the classical square root growth for Turing patterns. Indeed, even for parameter values that differ by one part in a hundred from the Turing point, they can have $\mathcal{O}(1)$ amplitude. We also establish the existence of general spatially-dependent canard solutions with fast-slow structure. Our analysis focuses on the spatial ODEs that govern the time-independent solutions. We show that these ODEs have a reversible folded saddle-node singularity of type II asymptotically close to the singular Turing point, that reversible folded saddles occur for parameters away from it, and that the true and faux canards of these folded singularities are the mechanisms responsible for creating the spatial canard solutions in the general class of PDEs.
Read the full abstract

Cryptography and Security

On APN Functions with Boomerang Uniformity One over $\mathbb F_{3^n}$: Differential and Boomerang Spectra and CCZ-Inequivalence

Let $q=3^n$, where $n>1$ is odd, and let $g:\Fq\to\Fq$ be a perfect nonlinear (PN) function represented by a Dembowski–Ostrom (DO) polynomial. Put $\tau=g(1)$, let $\epsilon$ be the indicator of $\Fthree^*$, and, for $c\in\Fq$, define $\widetilde G_c(x):=g(x+c)+\tau\epsilon(x)$. We prove that every $\widetilde G_c$ is APN and has boomerang uniformity either one or two. More precisely, \[ \beta_{\widetilde G_c}=1 \quad\Longleftrightarrow\quad c\in\mathcal C_g :=\{c\in\Fq\setminus\Fthree:g(c)+\tau\notin g(\Fq)\}, \qquad |\mathcal C_g|=\frac{q-3}{2}, \] whereas $\beta_{\widetilde G_c}=2$ for the remaining $(q+3)/2$ parameters. We determine the common differential spectrum and complete boomerang spectra of all the functions $\widetilde G_c$. Since boomerang uniformity one is the least possible for an APN function over a finite field of odd characteristic, this gives, to the best of our knowledge, the first general construction yielding infinite families of APN functions attaining this optimum. This common differential spectrum rules out CCZ equivalence with every power function and every Ness–Helleseth-type binomial. We also prove that CCZ equivalence between sign-switches of DO PN functions forces EA equivalence between the original PN functions. Using the orders of the nuclei of the associated presemifields, we exhibit, for infinitely many odd $n$, three pairwise CCZ-inequivalent PN functions over $\F_{3^n}$, one from each of the Gold $f_1$, Ding–Yuan $f_3$, and Bierbrauer $f_5$ families. Consequently, over each such field, our construction produces three pairwise CCZ-inequivalent APN functions with boomerang uniformity one. The smallest extension degree obtained in this way is $n=45$.
Read the full abstract

All authors Namhun Koo, Soonhak Kwon, Minwoo Ko, Byunguk Kim

Combinatorics

On $p$-Spread Measures

We study $p$-spread probability measures on the Boolean lattice. We show that if a family of sets $A$ is large under the product Bernoulli-$p$ measure, then no $p$-spread measure can be supported on sets that are not covered by the union of two members of $A$, answering the fractional version of Talagrand's discrete convexity problem. Consequently, we establish a coupling theorem between $p$-spread and product Bernoulli-$p$ measures.
Read the full abstract

Artificial Intelligence

Good Pretraining, Bad SFT: Checkpoint Quality Across the Training Stack

Language-model checkpoints are commonly selected by pretraining loss or benchmark scores, assuming that the highest-scoring checkpoint will remain the best starting point for subsequent training. We show that this assumption can fail in a full 30B mixture-of-experts training pipeline. The checkpoints that perform better after the full downstream training stack also have higher solution density, i.e., retain downstream performance under local weight perturbations.
Read the full abstract

All authors Sohir Maskey, Philipp Scholl, Jonas Knupp, Pit Neitemeier, Sascha Wirges

Artificial Intelligence

PlannerForge: LLM Agents for Scenario-Based Testing of Motion Planners in Autonomous Driving

Ensuring the safety of autonomous driving is a critical challenge. Scenario-based testing is a systematic process used to validate Autonomous Driving Systems (ADSs), but it remains a fragmented modular pipeline in which scenario generation, retrieval, modification, ADS execution, and results analysis are performed by separate tools with little interaction. Large Language Model (LLM) agents have shown promise across ADS sub-systems such as perception, planning, and control. However, no prior work covers the whole scenario-based testing pipeline for ADSs with a unified LLM-agent framework. We present PlannerForge, an LLM-agent framework that extends all scenario-based testing stages (from Scenario Generation to ADS Assessment) and adds two further LLM-enhanced stages: ADS Enhancement and ADS Benchmarking. We evaluate PlannerForge with 10 off-the-shelf LLMs across all tasks (Generation, Selection, Modification, Module Routing, Planner Testing, and Enhancement) under 5 prompt conditions. Best-per-task scores range from 0.88 to 1.00, and open-source 20-35B backends match commercial APIs on most tasks. Open-source models such as Qwen3.6:35B match commercial APIs on three of the five tasks. Chaining the modules end-to-end retains 83% / 78% of seed queries (commercial / open). It outperforms Scenario Factory 2.0 (Finkeldei et al., 2025) on natural-language generation (193 vs. 144 executable of 200) and realises 92-96% of requested city, road and vehicle attributes. It outperforms BM25 (Robertson and Zaragoza, 2009) at rank 1 selection (92.0% vs. 67.5%) and From-Words-to-Collisions (Gao et al., 2025) on physically valid edits (>=94% vs. 31%). At N=400, cost-tuning lifts planner success from 50.4% to 70.2% and cuts collisions from 19.0% to 8.4%, without domain-specific fine-tuning.
Read the full abstract

All authors Yuan Gao, Sebastian Müller, Mattia Piccinini, Marc Kaufeld, Yuchen Zhang, Finn Rasmus Schäfer, Qunying Song, Johannes Betz

General Relativity and Quantum Cosmology

Can the Universe Change Signature When Gravity is Dynamical?

Can a universe undergo a regular Euclidean-Lorentzian signature transition when the gravitational coupling itself is dynamical? We address this question in scalar-tensor gravity with nonminimal coupling $F(\phi)R$. Although the spatially flat Friedmann-Lemaitre-Robertson-Walker (FLRW) sector can be mapped to the Einstein frame for $F>0$ and a nondegenerate scalar redefinition, not all transition properties are frame independent. For a finite, positive, and sufficiently regular conformal factor, the existence and transverse character of the type change are preserved, whereas the extrinsic geometry is not. We therefore use the Einstein frame as a solution-generating representation and impose total geodesy in the physical Jordan frame. We construct two exactly integrable classes of solutions. In the oscillator-ghost-oscillator branch, the scalar field is stationary at the transition and Jordan-frame total geodesy follows under suitable regularity assumptions on the conformal factor. In the critical exponential-potential branch, the scalar is generically nonstationary and total geodesy instead requires \begin{equation*} H_E\big|_\Sigma = \frac12 \left( \frac{d\ln F}{d\psi} \right)_\Sigma \dot\psi_\Sigma . \end{equation*} We also distinguish this condition from the stronger smoothness requirements of a Kossowski-Kriele-type transverse metric. Finally, while the canonical Einstein-frame scalar does not allow effective phantom evolution, the dynamical nonminimal coupling can generate a locally superaccelerating Jordan-frame regime near the transition when $\left(\frac{d\ln F}{d\psi}\right)_\Sigma>0$ for the chosen oscillator branch. Thus signature change persists beyond Einstein gravity, with regularity and effective cosmological behavior remaining intrinsically frame sensitive.
Read the full abstract

Combinatorics

$\Delta$-Y Moves and Partial Steiner Systems

We study graph systems generated by $\Delta$-Y and Y-$\Delta$ moves and prove that, for initial graphs of minimum degree at least $7$, $\Delta$-Y moves alone generate every reachable graph. As a consequence, for $n\ge 8$, the $\Delta$-Y system generated from the complete graph of $n$ vertices is canonically isomorphic as graded directed graphs to the space of partial Steiner systems on $n$ points.
Read the full abstract

Astrophysics of Galaxies

Euclid: Quick Data Release (Q1) – Exploring the detailed visual morphology of galaxies in clusters

Galaxy clusters provide unique laboratories for studying environmental effects on galaxy evolution. The morphology–density ($T$–$\Sigma$) and morphology–cluster-centric radius ($T$–$R$) relations trace how galaxy morphology is influenced by the environment, but previous studies at intermediate redshifts have been limited in both sample size and radial coverage. We use the Euclid Quick Data Release 1 (Q1) visual morphology catalogue to measure the $T$–$\Sigma$ and $T$–$R$ relations for smooth, featured-or-disc, and barred galaxies in known clusters at $0.2\leq z\leq 0.5$, extending this analysis to large cluster-centric distances ($3 R_{500c}$) and studying their dependence on stellar mass. Using photometric redshifts and stellar masses provided by Euclid, we identify 1754 cluster members within $1.5 R_{500c}$, distributed across 71 clusters. We classify the identified galaxies as smooth, featured-or-disc, or barred using the predicted vote fractions provided by the Zoobot deep learning foundation model in the Q1 visual morphology catalogue. We confirm the $T$–$\Sigma$ relation in all the stellar mass ranges studied, with a stronger influence of the cluster environment on galaxy morphology in the densest parts of the cluster and closer to the cluster centre. Beyond $1.5 R_{500c}$, the morphological segregation weakens, with featured-or-disc galaxies overtaking smooth galaxies at the lowest densities, consistent with the growing contribution of field interlopers in the cluster outskirts. For barred galaxies, we find a tentative decline of the bar fraction toward lower densities that is most pronounced for the most massive galaxies. In conclusion, our results show that the cluster environment drives a progressive transformation of galaxy morphology, with the loss of disc structure becoming more pronounced towards the cluster core, where environmental processes act most efficiently.
Read the full abstract

All authors P. Mas-Buitrago, S. Kruk, D. O'Ryan, M. T. Nardone, A. La Marca, P. Awad, M. Baes, M. Fossati, T. Géron, Z. Ghaffari, M. Girardi, C. J. Lintott, J. G. Sorce, B. Altieri, F. Durret, V. Pettorino, B. Y. Irureta-Goyena, B. Simmons, J. Reerink, H. Domínguez Sánchez, J. H. Knapen, F. Shankar, E. Duran-Camacho, J. M. Pérez-Martínez, M. Walmsley, N. Auricchio, C. Baccigalupi, M. Baldi, S. Bardelli, P. Battaglia, A. Biviano, M. Bolzonella, A. Bonchi, E. Branchini, M. Brescia, J. Brinchmann, S. Camera, G. Cañas-Herrera, V. Capobianco, C. Carbone, J. Carretero, M. Castellano, G. Castignani, S. Cavuoti, A. Cimatti, C. Colodro-Conde, G. Congedo, C. J. Conselice, L. Conversi, Y. Copin, A. Costille, F. Courbin, H. M. Courtois, M. Cropper, H. Degaudenzi, G. De Lucia, H. Dole, F. Dubath, X. Dupac, S. Dusini, A. Ealet, M. Fabricius, M. Farina, R. Farinelli, S. Ferriol, P. Fosalba, S. Fotopoulou, M. Frailis, E. Franceschi, M. Fumana, S. Galeotta, K. George, B. Gillis, C. Giocoli, P. Gómez-Alvarez, J. Gracia-Carpio, A. Grazian, F. Grupp, S. Gwyn, W. Holmes, I. M. Hook, F. Hormuth, A. Hornstrup, M. Huertas-Company, K. Jahnke, M. Jhabvala, B. Joachimi, S. Kermiche, A. Kiessling, B. Kubik, M. Kümmel, M. Kunz, H. Kurki-Suonio, A. M. C. Le Brun, S. Ligori, P. B. Lilje, V. Lindholm, I. Lloro, G. Mainetti, O. Mansutti, O. Marggraf, M. Martinelli, N. Martinet, F. Marulli, R. J. Massey, S. Maurogordato, E. Medinaceli, M. Melchior, M. Meneghetti, E. Merlin, G. Meylan, A. Mora, M. Moresco, L. Moscardini, E. Munari, C. Neissner, S.-M. Niemi, J. W. Nightingale, C. Padilla, S. Paltani, F. Pasian, K. Pedersen, W. J. Percival, A. Pezzotta, S. Pires, G. Polenta, M. Poncet, L. A. Popa, L. Pozzetti, F. Raison, A. Renzi, J. Rhodes, G. Riccio, E. Romelli, M. Roncarelli, B. Rusholme, R. Saglia, Z. Sakr, A. G. Sánchez, D. Sapone, B. Sartoris, P. Schneider, T. Schrabback, M. Scodeggio, A. Secroun, E. Sihvola, P. Simon, C. Sirignano, G. Sirri, P. Tallada-Crespí, A. N. Taylor, H. I. Teplitz, I. Tereno, N. Tessore, S. Toft, R. Toledo-Moreo, F. Torradeflot, I. Tutusaus, J. Valiviita, T. Vassallo, G. Verdoes Kleijn, A. Veropalumbo, Y. Wang, J. Weller, A. Zacchei, G. Zamorani, F. M. Zerbi, E. Zucca, J. Macias-Perez, M. Sereno

Logic in Computer Science

Fitting and Learning Basis-Restricted Propositional Formulas

For a finite set $O$ of Boolean functions, we consider the class of propositional formulas built using the functions in $O$ as connectives. We determine, for each possible choice of $O$, the complexity of various fitting and learning problems. These include: finding a formula that fits a given labeled sample, finding a small one (an Occam algorithm), minimizing the number of misclassified examples when the sample is not realizable (empirical risk minimization), and several forms of PAC learning. Our results apply both to formulas (represented as trees) and to circuits. We also briefly discuss the status of the same questions for other kinds of propositional fragments.
Read the full abstract

Earth and Planetary Astrophysics

Interplanetary Dust Ablation Seeds Silicate Clouds in Exoplanet Atmospheres

Interplanetary dust particles (IDPs) are present throughout the Solar System, with Earth experiencing a mass flux of roughly 100 tonnes of IDPs per day. These particles ablate in the upper atmosphere, delivering aerosols that form noctilucent and stratospheric clouds. Since IDPs are present in exoplanet systems as exozodiacal dust disks (exozodis), it is likely that exoplanets experience a constant infall of IDPs as well. In this work, we investigate the effect of IDPs on the cloud structure of gas-giant exoplanets and brown dwarfs, and determine their observability. We apply the microphysical cloud model Nimbus to the Sonora Diamondback model grid to cover a wide range of effective temperatures, surface gravities, atmospheric mixing constants, and IDP mass fluxes. Our results show that IDP infall increases cloud particle number densities, decreases cloud particle radii, and enhances silicate features in transmission and thermal emission spectra. Exoplanets with lower atmospheric mixing rates, effective temperatures, and gravity are more sensitive to IDPs. Most notably, they lead to observable silicate absorption features in colder planets where silicate clouds would otherwise not be observable. WASP-107 b is an example of such an exoplanet with observational evidence of silicate particles. Using Nimbus, we found that a 100 times Earth-like IDP mass flux with a Solar-System-like IDP composition of quartz (SiO2), enstatite (MgSiO3), and iron (Fe) can explain the observations of high altitude silicate particles in WASP-107 b.
Read the full abstract

All authors Sven Kiefer, Gregory J. Gosselin, Caroline V. Morley, Sean P. S. Gulick

Mathematical Finance

The Delta of a Variance Swap

We define the variance swap delta as the sensitivity of the price of variance to a change in underlying price. We use Carr-Madan spanning formulas to analyze this sensitivity when the implied volatility smile curve may depend on the underlying price. We show that the variance swap total delta is zero for the class of smile curves that are pure functions of (log) moneyness, which goes against the empirical observation that variance is up when the market is down. We propose a simple modification of the smile to correct this issue.
Read the full abstract

Robotics

Model Predictive Control of Tensegrity Robots via Contact-Aware Graph Neural Dynamics Model

Tensegrity robots offer lightweight, compliant mobility over challenging terrain but remain difficult to model and control due to complex contact-rich dynamics and partial observability. This work presents a model predictive path integral (MPPI) controller for a three-bar tensegrity robot driven by a learned graph neural network (GNN) dynamics model. This work first extends prior GNN-based models with a differentiable contact detection module. The extension allows the dynamics model to reason over non-horizontal planar terrains, obstacles, as well as self-collisions. Then, the learned dynamics model and the MPPI controller operate in a closed data-collection loop, iteratively improving model accuracy and control performance. This work further introduces a hybrid MPPI strategy that combines MPPI with turning motion primitives to improve maneuverability. Experiments are performed in MuJoCo across five navigation tasks, which include, wall obstacles, inclines, narrow corridors, low-clearance structures, and a composite 3D obstacle course. The experiments demonstrate that the hybrid MPPI controller operating over the learned GNN dynamics model improves predictive accuracy over a flat-ground baseline model and achieves superior navigation performance compared to $A^*$-based re-planning and MPPI-only variants. Results show that the contact-aware learned dynamics combined with the sampling-based model predictive control enable robust tensegrity navigation in complex, contact-rich environments.
Read the full abstract

All authors Nelson Chen, Patrick Meng, Charles Tang, Angelina Degay, Zachary Brei, Rebecca Kramer-Bottiglio, Kostas E. Bekris, Mridul Aanjaneya

Quantum Physics

First fault-tolerant quantum memory demonstration for a generalized superfast encoding

The Generalized Superfast Encoding (GSE) is a fermion-to-qubit mapping that has error-correcting/detecting properties. To this point, all demonstrations have been relegated to error-detection only, as no fault-tolerance under circuit-level noise has been observed. Here, we introduce an even-distance $d$ constant stabilizer-weight GSE where each of $N$ modes is assigned a $d$-qubit block arranged on a ring. The resulting stabilizer generators have constant weight 4 or 6 for any even distance $d$. Furthermore, the full stabilizer set of this construction can always be partitioned into four qubit-wise commuting groups, which enables compact syndrome-extraction scheduling. We simulate quantum memory experiments under circuit-level depolarizing noise for two instances of this code, $[[48,8,6]]$ and $[[64,8,8]]$ and the threshold is observed to be $\approx 4\times10^{-3}$. This is, to our knowledge, the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.
Read the full abstract

Sound

TASTE2: Text-Aligned Speech Modeling and Deployment toward Full-Duplex Voice Interaction

Full-duplex voice interaction requires more than utterance-level conversion. It must process streaming speech, manage turn-taking and interruptions, while preserving pretrained linguistic competence and acoustic paralinguistic cues. We ask whether TASTE (Text-Aligned Speech Tokenization and Embedding) provides a viable path toward this goal. We present TASTE2, which transforms utterance-level TASTE into an incremental dialogue stack. A shared text-token vocabulary removes word-level averaging, while modality-aligned dialogue training predicts one continuous audio latent per text token without interleaving heterogeneous token streams. An incremental Speech Detokenizer enables streaming synthesis through CosyVoice2. After speech and dialogue training, TASTE2 (Merge) reaches 56.3% on LLaMA-Questions against a 57.3% Qwen2.5-7B Instruct text-only reference (98.2% accuracy retention), and TASTE2 (Direct) reaches 53.0% (92.4% retention). We build TASTE2 VoiceBot, which processes user speech incrementally, streams synthesized audio, and stops generation on barge-in. On Full-Duplex-Bench v1.0, TASTE2 and TASTE2 VoiceBot handle interruptions well while maintaining high conversational coherence. Natural conversation remains challenging, and deployed mean time to first audio is 2.701 s on two NVIDIA RTX A6000 after TensorRT acceleration. Finally, to our knowledge, we provide the first systematic characterization of explicit paralinguistic control in a TASTE based model. Fast speaking rate serves as a cross-strategy proof of concept after dialogue SFT, while emotion control is strategy dependent and the remaining attributes stay weak. Together, these results establish TASTE based modeling as a practical route toward full-duplex systems while identifying natural conversation robustness, speech generation latency, and feature general paralinguistic control as open challenges. Explore TASTE2 online.
Read the full abstract

All authors Yi-Chang Chen, Chun Wei Chen, Dien-Ruei Wu, Jie Lin, Yu-Kuan Fu, Yang-Hsien Lin, Eddie TC Huang, Simon See, Hung-yi Lee, Da-Shan Shiu

High Energy Physics (Theory)

Quantum spacetime and gravity from the IKKT matrix model: an invitation

This is a concise and compact introduction to a framework for spacetime, gravity, and fundamental physics based on the IKKT matrix model, focusing on conceptual and structural aspects. The approach rests on nontrivial vacua or matrix backgrounds, which serve as 3+1-dimensional noncommutative spacetime. We discuss a specific class of backgrounds describing expanding homogeneous and isotropic FLRW spacetime, which provide a solution of the one-loop effective action with finitely many dof per volume. Perturbations of the background give rise to fields propagating on spacetime governed by a weakly-coupled gauge theory, as well as a nonstandard description of (quantum) gravity leading to some IR modifications. Maximal supersymmetry of the model is essential to ensure effective locality.
Read the full abstract

Game Theory

PMMS Allocations Need Not Exist for 3 Agents with Additive Valuations

This note gives an instance demonstrating that the pairwise maximin share (PMMS) property cannot be satisfied by any allocation in certain fair division problems with indivisible goods and additive valuations. The instance requires only $n=3$ agents and $m=9$ goods, and is accompanied by a proof that no PMMS allocation exists. A separate instance shows (certified by exhaustive enumeration with a computer) that PMMS cannot be approximated within a ratio above $78/79 \approx 0.987$.
Read the full abstract

Software Engineering

DJPlus: Generating minimal test suites for strong coverage criteria in graph models

Automated test generation from graph models is essential to model-based testing. In this type of testing, graph coverage ensures test suite strength but also results in long test cases that take time to execute on the system under test. We propose a novel optimization-driven method, DJPlus, which generates reduced test suites while satisfying given graph-based test requirements. We implement DJPlus and show the feasibility of edge-pair criterion, a stronger coverage criterion than vertex or edge criteria, on four realistic systems, while prime path criterion poses scalability issues. Our evaluation reveals that the alternative methods generate 2 to 26 times more redundant test steps than DJPlus and DJPlus decreases test execution times by reducing the number of test steps. These results show that DJPlus is a positive step towards tackling the challenges of model-based testing at an industrial scale.
Read the full abstract

All authors Yavuz Köroğlu, Mutlu Beyaz{\i}t, Onur K{\i}l{\i}nççeker, Serge Demeyer, Franz Wotawa

Analysis of PDEs

The Sharp $C^{1,1}$ Target Threshold for Minimizing Constraint Maps

Let $K\subset\R^m$ be the closure of a bounded domain whose boundary is a compact embedded hypersurface, and let \( \overline M=\R^m\setminus\operatorname{int}K \) be the allowed target. We prove that if $\partial K$ is of class $C^{1,1}$, then every $\overline M$-valued local minimizer of the Dirichlet energy $E(u;B):=\int_B|Du|^2\dd x$ is locally $W^{2,\infty}$, and hence locally $C^{1,1}$, on its continuity set. For every $0<\alpha<1$, we also construct a convex body with $C^{1,\alpha}$ boundary and an everywhere continuous global minimizer that is not $C^{1,1}$. Thus $C^{1,1}$ is the sharp target regularity threshold in the Hölder scale.
Read the full abstract

Analysis of PDEs

Stable determination of damping and potential coefficients in a semilinear wave equation

We consider an inverse problem for a semilinear wave equation with time-independent damping, linear potential, and nonlinear potential coefficients in a bounded domain of $\mathbb{R}^n$ for $n\geq 2$. The main objective is to establish stability estimates for the simultaneous recovery of these coefficients from the associated Dirichlet-to-Neumann map. Our approach combines second-order linearization with suitably constructed geometric optics and asymptotic solutions. We establish Hölder-type stability estimates for the recovery of each of the three coefficients appearing in the semilinear wave equation under suitable a priori bounds on these coefficients. To the best of our knowledge, this is the first stability result for simultaneous determination of time-independent damping, linear and nonlinear potentials in a semiliner wave equation.
Read the full abstract