Peer Revenue Publish or profit

Papers

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

All of arXiv

Friday 4 September

High Energy Physics (Phenomenology)

Minimal spontaneous baryogenesis from flavor

In its minimal realization, the Froggatt-Nielsen (FN) mechanism addresses the Standard Model (SM) flavor puzzle via the spontaneous breaking of a horizontal $U(1)_H$ symmetry. If $U(1)_H$ is global and broken before the end of inflation, it gives rise to a pseudo-Nambu-Goldstone boson (axion-like particle) with a homogeneous initial misalignment, whose subsequent coherent evolution sources spontaneous $CPT$ violation in the SM sector. We show that in the presence of $B-L$-violating processes $-$ parametrized here model-independently via the dimension-five Weinberg operator responsible for light neutrino masses $-$ the minimal FN setup can generate the baryon asymmetry of the Universe (BAU), linking the origin of flavor directly to the BAU and neutrino masses. Solving a complete set of evolution equations for SM asymmetries, we demonstrate that this mechanism can readily yield a baryon asymmetry comparable to the observed value, or even exceeding it by several orders of magnitude. Accounting for baryonic isocurvature and entropy dilution from axion decays, we find that the observed BAU is successfully reproduced for axion oscillation temperatures above $10^{11}$ GeV and axion decay constants ranging from $10^{13\cdots 14}$ GeV to above $10^{17}$ GeV. Finally, while we focus on a global $U(1)_H$ symmetry and axion motion from standard misalignment, our framework is readily extendable to other global horizontal symmetries and arbitrary axion motion.
Read the full abstract

Solar and Stellar Astrophysics

Evidence for Enhanced Helium Enrichment from Asteroseismology

The helium abundance of a star has a dramatic effect on luminosity, internal structure, and evolutionary timescales, yet direct helium measurements are unavailable for most stars. In this work, we infer stellar helium abundances by comparing observed and predicted luminosities for a sample of subgiants with asteroseismic masses from the APOKASC sample and spectroscopic parameters from recent survey compilations. Stellar luminosities are predicted using grids of theoretical stellar evolution models and offsets are attributed to helium differences from the assumed model value. From this analysis, we see clear evidence of helium enrichment correlated with metallicity, $\Delta Y/\Delta Z = 1.959 \pm 0.061$, with the dominant error source being systematic differences in stellar fundamental parameters. Our inferred enrichment slope exceeds the value implied by a solar-calibrated helium enrichment relation, suggesting that commonly adopted assumptions regarding helium enrichment may underestimate stellar helium abundances at high metallicity. We further show that adopting the revised enrichment law can alter predicted main-sequence lifetimes by up to $\sim$ 1 Gyr and, in some cases, modify stellar structure through changes in convective core development. These results demonstrate that uncertainties in helium enrichment propagate directly into stellar age determinations and highlight the importance of empirical helium constraints for stellar evolution models.
Read the full abstract

All authors Miqaela K. Weller, Marc H. Pinsonneault, Jennifer A. Johnson, Charles Shunyu Yao

Superconductivity

Pair density wave order from non-symmorphic momentum symmetry

We develop a class of microscopic lattice models in which pair density wave order emerges in the asymptotically exact weak coupling limit. The underlying mechanism is due to non-symmorphic momentum symmetry implied by the models' projective space group representation of electrons. Our mechanism suggests moiré systems and extended s-wave altermagnets as potential hosts for pair density wave order.
Read the full abstract

All authors Matteo Dürrnagel, C. Alexander Baum, Michael Klett, Lennart Klebl, Ronny Thomale

Instrumentation and Methods for Astrophysics

The information content of optical intensity interferometry

Optical intensity interferometry (II) can in principle resolve structure on angular scales $\theta\sim \lambda/B$, but it measures only the squared visibility $|{\cal V}|^2$, discarding Fourier phase. We quantify what information can actually be recovered from phase-less $|{\cal V}|^2$ measurements as a function of the aggregate signal-to-noise ratio and array configuration, using score-based diffusion models as non-parametric image priors. We construct an image reconstruction pipeline, and validate it by reconstructing a variety of images, including GRMHD simulations of black hole accretion disks and actual SDO/HMI continuum images of the Sun, from phase-less Fourier amplitudes. Using simulated data, we map the reconstruction fidelity of Sun-like stellar surfaces as a function of noise level, number of $(u,v)$ samples, and maximum baseline $B_{\rm max}$, for surface maps spanning a range of activity levels. We find that fidelity depends on the data only through the total signal to noise ratio (SNR) of the surface features of interest, provided that the $(u,v)$ plane is sampled sufficiently densely. These results show that the SNR levels achieved by next-generation intensity interferometers observing realistic sources are sufficient to image highly complicated stellar surfaces.
Read the full abstract

General Relativity and Quantum Cosmology

A compact time-frequency representation for gravitational-wave data analysis

Time-frequency (wavelet) domain analyses are seeing greater use for gravitational-wave data analysis due to the advantages they have in handling non-stationary noise. A popular choice is the Wilson-Daubechies-Meyer (WDM) wavelet transform, which uses a window function that is very compact in frequency, but more spread out in time. In this work, we consider an alternative window function that is built from a sum of phase-shifted Gaussians. This "Gaussian" window is more symmetric in time-frequency, and consequently more compact. We examine the properties of this window function and the implications it has for gravitational-wave analyses. We calculate the window's time-frequency variance product analytically and verify it numerically. For the symmetric case, where the window has the same form in time and frequency, the construction comes within $\sim2.4\%$ of saturating the Heisenberg-Gabor uncertainty limit. We conjecture that this Gaussian window achieves the minimum time-frequency area of any WD wavelet window.
Read the full abstract

All authors Noah Pearson, Mesut Çal{\i}şkan, Sophie Bini, Neil J. Cornish

Astrophysics of Galaxies

Baryon-Accelerated Core Collapse in SIDM Halos and its Imprint on Galactic Disks

The gravitational coupling between dark matter (DM) halos and the baryonic structures they host is one of the most powerful windows into the particle nature of DM. Self-interacting dark matter (SIDM) presents a minimal, well-motivated extension to the dark sector with dramatic consequences for the structure of galaxies and their halos. However, the impact of baryons on SIDM halo evolution and the resulting galactic structure has been underexplored in Milky Way (MW)-size galaxies. In this paper, we demonstrate that the inclusion of a baryonic component in a MW-size galaxy causes accelerated core collapse to begin within the MW's lifetime for a cross section as low as $\sigma/m = 1 \, \rm{cm}^2/\rm{g}$. We present a suite of $N$-body simulations of cold dark matter and SIDM MW-size galaxies with and without a baryonic component for cross sections $\sigma/m =[1.0, 2.5, 5.0]$ cm$^2$/g. We find numerically, and semi-analytically, that the presence of a stellar disk and bulge shortens the predicted core collapse timescales from the DM only simulations by a factor of $\sim 40$. Further, as the core collapse begins within the lifetime of the galaxy, the subsequent density increase strengthens the mid-plane restoring force exerted on stellar disk orbits, leading the disk to flare. This work quantifies both directions of the baryon–SIDM coupling: baryons accelerate core collapse in MW-sized halos, and the resulting halo evolution reshapes the disk through thinning and flaring. Both processes open new observational windows into DM.
Read the full abstract

All authors Zeineb Mezghanni, Elliot Y. Davies, Adriana Dropulic, Gonzalo Herrera, Abdelaziz Hussein, Lina Necib

Earth and Planetary Astrophysics

POSTELLAR: Posterior Stellar Spectrum Sampling - An Alternative to Approximate Stellar Spectra for Exoplanetary Analysis

We present a novel approach to perform posterior sampling of the underlying stellar spectrum in high-resolution spectroscopic observations. Our method, postellar, coherently combines information from empirical observations and physics-based models, enabling more accurate spectral recovery while providing uncertainties that can be propagated into downstream analyses. This is accomplished by treating the intrinsic stellar spectrum as a latent variable and performing posterior sampling under a Gaussian likelihood with an informative prior constructed using a score-based diffusion model trained on PHOENIX stellar models. We validate the framework on synthetic SPIRou radial velocity (RV) observations generated from the empirical spectra of Barnard's Star and Proxima Centauri. Spectra inferred with postellar more accurately recover the ground truth than standard empirical templates. For medium signal-to-noise observations, postellar improves RV accuracy by up to a factor of three, while RVs derived from empirical templates tend to be biased. This method performs particularly well in low signal-to-noise and low-cadence regimes. The postellar framework is broadly applicable to other high-resolution spectroscopy science cases including stellar abundance analyses and exoplanet atmospheric characterization.
Read the full abstract

All authors Dhvani Doshi, Nicolas B. Cowan, Yashar Hezaveh, Gabriel Missael Barco, Étienne Artigau

Quantum Physics

Matrix Product Belief Propagation

We introduce "matrix product belief propagation" (MP-BP) as a controlled method for the approximate contraction of two-dimensional tensor networks and graphical models, which generically leads to a quadratic reduction of errors relative to existing methods: at similar computational effort, the number of accurate digits is asymptotically doubled. For infinite systems, MP-BP can be understood as a practical implementation of Baxter's corner-transfer-matrix method; for reflection-symmetric networks, it further coincides with the boundary matrix-product-state and corner-transfer-matrix renormalization group algorithms as conventionally implemented. In the limit of unit matrix-product rank, MP-BP is equivalent to belief propagation, and more generally, can be understood as a generalization of BP in which the "messages" live on surfaces and are assumed to have a matrix-product factorization. We further extend the quadratic improvement to the computation of expectation values, and numerically demonstrate the qualitatively improved convergence for a variety of classical and quantum 2D tensor network problems.
Read the full abstract

All authors Gabriel Woolls, Shahin Jahanbani, Adarsh Pashikanti, Matthew T. Fishman, Joseph Tindall, Michael P. Zaletel

Cosmology and Nongalactic Astrophysics

Exploring the dark sector through galaxy dynamics in clusters

Galaxy clusters are among the most powerful laboratories to probe fundamental physics, from the formation of cosmic structures to the nature of dark matter, dark energy, and gravity. Realizing their full potential requires accurate and unbiased determinations of their mass profiles, a longstanding challenge in cluster cosmology. In this context, the kinematics of member galaxies in clusters has become a key tool to reconstruct the mass distribution and to investigate the dynamical properties of clusters. The advent of large spectroscopic datasets has enabled the application of increasingly sophisticated models and robust techniques, which make kinematic analyses competitive with other probes of cluster dynamics. In this review, we provide a comprehensive overview of cluster kinematics, covering the main methods to infer dynamical masses and mass profiles, their physical assumptions, and the impact of systematics such as deviation from dynamical equilibrium, triaxiality, and substructures. We discuss the complementarity with other techniques to investigate the structure of clusters and highlight recent applications to tests cosmological models. We focus in particular on the role of kinematical studies in constraining the dark sector (dark matter and dark energy) and in providing novel insights into the behavior of gravity at Mpc scales. Finally, we outline current limitations and future prospects, emphasizing that the combination of improved modeling and forthcoming spectroscopic surveys will establish cluster kinematics as a fundamental probe in the era of precision cosmology.
Read the full abstract

Computer Vision

Time-Aware Assistive Navigation

Can interactive vision-and-language agents learn not just what to say but also \textbf{when} to say it? Current language models rarely plan over whether and when to realize a real-time response to a user. However, providing accurate and timely support for human decision-making, such as when guiding visually impaired individuals through urban environments, requires careful real-time responsiveness–poorly timed responses can distract users or add unnecessary cognitive load. As a machine intelligence challenge for Multimodal Large Language Model (MLLM)-based agents, we introduce a large-scale multimodal benchmark for an egocentric, assistive navigation task in complex outdoor environments. Using this benchmark, we uncover a fundamental limitation of off-the-shelf MLLMs in delivering safe and time-sensitive navigation instructions, even with model fine-tuning on substantial amounts of data. We then demonstrate that a simple yet effective modification of the model, including direct supervision to predict the underlying reason for each instruction, yields significant performance gains across open-loop, closed-loop, and sim-to-real generalization settings. However, our analysis highlights persistent challenges in temporal reasoning, safety-critical object awareness, and relational and distance understanding. To advance the development of scalable assistive agents, we will release our simulation, benchmark, and code (available at the project website: https://timeli-icra.github.io/).
Read the full abstract

General Relativity and Quantum Cosmology

End state of the experimental black-hole bomb

Rotating black holes can amplify incident waves through superradiant scattering. When these waves are confined, repeated amplification gives rise to the black-hole bomb instability, whose nonlinear evolution remains poorly understood despite its central role in models of bosonic clouds around astrophysical black holes. Here, we reproduce the black-hole bomb mechanism in a laboratory setting using a gravity simulator based on a draining vortex in superfluid helium. Surface waves propagating on the superfluid interface experience an effective rotating spacetime and undergo repeated superradiant amplification within a cylindrical cavity. By tuning the temperature and flow parameters, we achieve exponential growth of a low-frequency resonant mode, followed by the arrest of the instability and the formation of a long-lived non-equilibrium steady state. Using spatially and temporally resolved measurements, we identify nonlinear frequency shifts, harmonic generation, and coherent three- and four-wave mixing that redistribute energy among interacting modes. This novel end state of the experimental black-hole bomb highlights the role of nonlinear wave interactions in quenching the runaway growth expected from linear theory and governing the system's late-time dynamics. Our results establish a laboratory framework for investigating the nonlinear evolution of black-hole bombs, with implications for analogous phenomena involving ultralight bosonic fields around rotating black holes.
Read the full abstract

All authors Patrik Švančara, Leonardo Solidoro, Pietro Smaniotto, Sam Patrick, Silvia Schiattarella, Maciej T. Jarema, Sean M. D. Gregory, Vitor S. Barroso, Maurício Richartz, Anastasios Avgoustidis, Carlo F. Barenghi, Ruth Gregory, Silke Weinfurtner

Computer Vision

SceneMosaic: Efficient and Diverse Simulation-Ready Scene Generation via Hybrid Agentic Layout Evolution

Diverse and simulation-ready indoor scenes are essential for interactive entertainment and embodied AI, yet their scalable generation remains challenging. Recent agentic text-to-3D scene pipelines that rely on vision-language models (VLMs) can generate scenes of high fidelity but require costly iterative object placement and refinement. Another mainstream paradigm, parametric image-to-3D scene models, produces scenes efficiently from strong priors learned from 2D images but often leads to imprecise and physically invalid scenes. More importantly, both paradigms struggle to output diverse scenes for a single input, making it hard for them to reflect the dynamically changing nature of real scenes. In this paper we propose SceneMosaic, a framework that combines the merits of both paradigms. It obtains the initial candidate from the learned image-based prior, and subsequently evolves the result through VLM agents, ensuring both efficiency and physical validity. Within the evolution process, SceneMosaic exploits the locality of natural scenes and decomposes a scene into independent local units, allowing separate evolution within each unit before composing the global scene via Cartesian product. On SceneEval-100, SceneMosaic matches the strongest agentic baseline in semantic layout quality with a 24x speedup, substantially reduces physical violations, and receives the highest human ratings. Our code is publicly available at https://github.com/rxjfighting/SceneMosaic.
Read the full abstract

All authors Xingjian Ran, Xiaoye Mo, Sihao Liu, Jianyu Zhang, Li Luo, Bo Dai

Robotics

Adaptive Cost-Sensitive Machine Learning for Autonomous Robot Navigation Failure Prediction: When Not All Errors Are Equal

Autonomous robot navigation failures differ not only in categorical severity but also in the physical context in which they occur. A near-miss at low speed under reliable sensing is not equivalent to the same event during rapid motion, close obstacle approach or degraded perception. This paper reframes navigation failure prediction as consequence-sensitive forecasting. We first establish a fixed baseline in which training weights are modulated by categorical severity, then introduce an adaptive extension defining a state-dependent consequence function combining severity with normalised velocity, obstacle proximity and sensing uncertainty, together with a risk-sensitivity term that rises as conditions deteriorate. We evaluate on 2,000 simulated differential-drive episodes (~1,000,000 timesteps) using episode-level GroupKFold, with external validation on the UCI SCITOS G5 dataset. Fixed weighting raises Logistic Regression high-severity recall from 0.851 to 0.985 and reduces missed consequence cost from 1,940 to 313; the adaptive extension reaches 0.998 and 82. Under matched false-positive conditions, however, the discriminative advantage is modest (0.986 versus 0.984), so most of the gain reflects a more conservative operating point rather than better ranking. The effect is consistent across all five folds and stable across a threefold span of context coefficients. Because the primary simulation produced no collisions, we add a controlled extension in which 108 of 600 episodes terminate in contact: collision recall rises from 0.850 to 0.966 (fixed) and 0.984 (adaptive), with missed collision cost falling from 1,000 to 105, at false-positive rates of 0.413 and 0.799, respectively. Context-dependent consequence modelling thus provides a principled mechanism for allocating conservatism by physical risk.
Read the full abstract

Sound

What Did I Just Say? Self-Listening for Full-Duplex Speech Models

Full-duplex spoken language models can listen and speak simultaneously, enabling them to handle interruptions and backchannels in human conversation. However, text generation, speech synthesis, and audio playback proceed asynchronously. As a result, what a model believes it has said may not match what has actually been played to the user. We refer to the problem of recovering from an interruption while remaining aware of the model's realized speech as anchor interruption. To address this problem, we propose Self-Listening, a full-duplex modeling approach that interleaves user speech, model text, and the model's played speech. By feeding the realized speech output back to the model as an input stream, self-listening grounds interruption recovery in what the user has actually heard. We further introduce AnchorSpeech, a collection with homogeneous training and test splits for tracking which items of structured ordered responses have actually been spoken. AnchorSpeech-test evaluates whether a model can respond consistently with the last completed item before an interruption. Experiments show that, compared with full-duplex baselines, models equipped with self-listening mechanism achieve better anchoring performance.
Read the full abstract

All authors Xuanning Zhou, Junyi Ao, Xiaotong Liu, Tom Ko, Benyou Wang, Haizhou Li

Physics and Society

WolfSociety: Understanding Collective Risk from Harmful-Agent Scaling in Financial Agent Societies

Safety evaluations typically focus on individual agents, but interacting agents can spread harmful information and influence the environment in which later decisions are made. We study how collective failure changes with harmful-agent fraction and society size in a controlled financial agent society, where agents communicate over a social network and trade in a shared market. In the primary financial scenario, collective failure requires broad harmful diffusion together with severe price dislocation or liquidity stress. Across all tested society sizes, failure remains rare at low harmful fractions but rises sharply over a narrow range. As society size grows from N=100 to N=2000, the harmful fraction associated with a 50% failure probability decreases from 4.7% to 2.2%, while the corresponding number of harmful agents increases from approximately 5 to 44. In contrast, when the number of harmful agents is held fixed, their impact becomes weaker as the society grows. Controlled interventions further show that broader network reach shifts the collapse boundary toward lower harmful fractions, whereas stronger conformity alone has little effect. To characterize these effects, we introduce Agent Society Dynamics, a finite-size framework for relating harmful-agent fraction, society size, and interaction structure to collective failure. Overall, our results reveal a nonlinear, size-dependent collapse transition in financial agent societies, showing that collective failure depends not only on the prevalence of harmful agents but also on the size and interaction structure of the surrounding society. Code is available at https://github.com/SAIL-Research-Lab/WolfSociety.
Read the full abstract

All authors Lejun Zhang, Sarah Lu-Liang, Xin Jiang, Muning Wen, Weinan Zhang, Shangding Gu

Data Structures and Algorithms

Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths

We give a deterministic algorithm for single-source shortest paths in directed graphs with integral edge weights at least $-W$ that runs in time $$O((m+n\log\log n)\log^2 n \log(nW)).$$ This improves the previous fastest deterministic bound of Li by a factor of $\log n$.

Quantum Gases

Quantum Quenches across the Bose-glass Transition

Due to their intrinsic interplay between long-range order and quasi-disorder, quasicrystalline systems provide a rich platform for investigating novel quantum phenomena. Here we study the non-equilibrium dynamics following quantum quenches across the superfluid to Bose-glass transition using ultracold bosons in an optical quasicrystal. Fast quenches into the Bose glass regime induce a quantum walk in momentum space that spreads over increasingly higher momentum orders. Conversely, quenches into the superfluid regime initiate a real-space quantum walk of initially localized atoms, forming a light-cone-like structure bounded by Lieb-Robinson limits. Characteristic timescales reveal strong links to the underlying Hamiltonian and are governed primarily by quasi-disorder strength in the Bose glass phase, and by tunneling strength in the superfluid phase. Finally, we analyze slower quenches into deeper lattices and observe the decay of coherence across the phase transition.
Read the full abstract

All authors Bo Song, Shaurya Bhave, Emmanuel Gottlob, Leanne Reeve, Ulrich Schneider

Robotics

GE-Act 2.0: Pretraining and Scaling a World-Action Model for Robotic Manipulation

World-action models (WAM) predict future states to guide robot actions, enabling learning from both action-free video and action-labeled interaction. Most inherit pretrained video generators, leaving WAM pretraining and scaling underexplored. We introduce Genie Envisioner Act 2.0 (GE-Act 2.0), a world-action model whose trainable generative and action components are all initialized from scratch on manipulation data. It combines a control-oriented autoencoder (CoAE), a single-step visual planner (SVP), and an inverse dynamics model (IDM). CoAE retains action- and instruction-relevant information under aggressive compression, while SVP produces a complete future state in one differentiable pass, so visual planning and inverse dynamics can be pretrained separately on complementary data. The components are then jointly trained with knowledge-aligned selective optimization (KASO), which reduces mismatched supervision by selecting only predicted futures judged behaviorally compatible with the recorded action. We evaluate pretrained checkpoints directly, without per-task fine-tuning, on 100 tasks across 20 manipulation skill groups with held-out scenes, backgrounds, lighting, and object instances. Scaling co-training data from 300 to 30,000 hours raises success from 17.1% to 44.1% on G1-OP and from 13.4% to 31.1% on G2-90D; despite comprising less than 2% of the co-training data, G2-90D improves by 17.7 points, suggesting cross-embodiment transfer. Gains span 19/20 and 18/20 skill groups, and skill-specific coverage strongly correlates with zero-shot out-of-distribution (OOD) success (Pearson r=0.80; Spearman rho=0.85). Under the same protocol, the model grounds object, color, shape, and position references in at least 90% of trials and follows explicit instructions even when they conflict with an already-committed behavior or a conventional scene association.
Read the full abstract

All authors Renhang Liu, Wenzhi Zhao, Zhuo Yang, Liliang Chen, Pengfei Zhou, Shengcong Chen, Guanghui Ren, Youlun Peng, Rongjun Jin, Nan Wang, Sukai Wang, Xindong He, Jinyuan Feng, Ziyu Xiong, Linqing Zhong, Yifei Wei, Feng Han, Long Zhang, Da Huang, Nanshu Zhao, Chenghao Yin, Mo Wu, Zhaodong Yan, Kongtao Hu, Yuxiang Yan, Aogelijiang Niyazi, Yu Fang, Jia Zeng, Lizhu Meng, Daizhen Lv, Haoyu Cao, Zhiwen Hou, Lianjin Ye, Yuehan Niu, Zhikai Cai, Xuan Hu, Hui Min, Xiongfeng Cai, Yue Liao, Jing Wu, Soujanya Poria, Ye Li, Sanping Zhou, Maoqing Yao, AgiBot Research Team

Artificial Intelligence

Agents' Overreliance on Unreliable Tools

LLM agents use tools to access information and perform computations beyond their parametric knowledge. Existing tool-use benchmarks evaluate whether agents select and call the right tools, assuming that tool returns are reliable. However, tools can return plausible but incorrect outputs. We evaluate 14 models with three tools (web search, an LLM sub-agent, and a code executor), corrupting their returns to examine whether agents overrely on unreliable tools. Agents adopt corrupted returns at high rates, with mean adoption exceeding one third for every tool and reaching 68.0% for web search. Corrupted returns also frequently override correct answers that agents give without tools, and this reliance persists in more complex tasks and in tasks that combine multiple tools. Agents often make more tool calls under corrupted returns, and reasoning traces show them questioning a return and even stating the correct answer. Nevertheless, they still pass the corrupted content to users, rarely warning them of the conflict. We further test interventions spanning prompts, tool metadata, post-training, and activation steering. Verification prompts reduce adoption across all three tools while largely preserving accuracy with correct returns, and reliability labels provide partial mitigation in web search. The tested post-training methods offer limited gains, and the effect of activation steering depends on the model and intervention strength. Overall, our findings provide a basis for diagnosing tool overreliance and for developing agents that assess tool returns rather than assuming their reliability.
Read the full abstract

All authors Hoyeol Yang, Woojung Song, Taewon Kim, Jonghyun Song, Seoyeon Park, Yohan Jo

Probability

Extremal persistence probabilities of exchangeable sign-invariant random variables

Let $(X_1,\ldots,X_n)$ be a random variable in $(\mathbb{R}\setminus\{0\})^n$ that is both exchangeable and sign-invariant. For every $k\in[n]$, let $S_k=\sum_{i=1}^kX_i$. Define the weak persistence probability as $\mathbb{P}(S_1,\ldots,S_n\geq0)$, and the strong persistence probability as $\mathbb{P}(S_1,\ldots,S_n>0)$. From previous results, the optimal lower bound for $\mathbb{P}(S_1,\ldots,S_n\geq0)$ and the optimal upper bound for $\mathbb{P}(S_1,\ldots,S_n>0)$ are known. We complete the picture by determining the optimal upper bound for $\mathbb{P}(S_1,\ldots,S_n\geq0)$ and the optimal lower bound for $\mathbb{P}(S_1,\ldots,S_n>0)$ as follows. \[\frac{1}{2^n}\binom{n-1}{\lfloor (n-1)/2\rfloor}\leq\mathbb{P}(S_1,\ldots,S_n>0)\leq\frac{1}{4^n}\binom{2n}{n}\leq\mathbb{P}(S_1,\ldots,S_n\geq0)\leq\frac{1}{2^n}\binom{n}{\lfloor n/2\rfloor}.\] In particular, this implies that the weak and strong persistence probabilities of every exchangeable and sign-invariant random variable $(X_1,\ldots,X_n)$ in $(\mathbb{R}\setminus\{0\})^n$ are of the order $n^{-1/2}$. We also obtain some related results, one in the deterministic setting, and one when the random variables are allowed to take the value 0.
Read the full abstract

Robotics

Benchmarking Dexterity of Multifingered Robot Hands: A Review and Perspective

Robot hands are a key interface between AI and the physical world, making advances in robotic dexterity essential to realizing the vision of physical AI. While impressive dexterity has been demonstrated with simple grippers, multifingered hands offer the potential for substantially greater versatility, precision, and adaptability in manipulation. In this review, we survey the state of the art in benchmarking the dexterity of multifingered robot hands. Recognizing dexterity as a complex and multifaceted concept, we present the perspective of the U.S. National Science Foundation HAND Engineering Research Center, with a particular focus on fine in-hand manipulation. We introduce a framework consisting of three benchmark levels that correspond to increasing system complexity, review representative benchmarks at each level, and propose new benchmarks and metrics to address limitations in the literature. More information can be found at https://hand-erc.github.io/benchmarking/.
Read the full abstract

All authors Anthony Shilati, Anunth Ramaswami, Luke Batteas, Sylvia Tan, Anthony Barcio, Sairam Umakanth, Preksha Rao, David McDougall, Landry Graves, Ahmet A. Ozkan, Yunsoo Yoon, Arushi Pradhan, Michael G. Henry, Rohan Kota, Damian Gonzalez, Gray C. Thomas, Gary K. Fedder, J. Edward Colgate, Kevin M. Lynch

Physics and Society

New rules, old habits: across seven team sports, each league keeps its own way of using the rules

Studies of a rule change usually report one average effect, for one league or several combined. We asked whether a rule change reorders leagues, in 101 leagues of seven sports. When the substitution limit rose from three to five, the leagues already ranked from most substitutions to fewest, as known for the biggest leagues. In their first season under five, the fourteen top leagues kept that order (rank correlation 0.89; one means the same order, zero unrelated orders). That is about as firmly as from one ordinary season to the next. A prediction for twelve second tiers, written before their records were read, held (0.73). They ranked like their country's top league. Across rule changes in other sports, leagues kept their order in four of eight tests. In every sport measured, a league stayed near its place among its sport's leagues from season to season. Under five, clubs inside a league differed more within a season than the leagues did, but their differences lasted less. Rule-makers should judge a change league by league, against each league's own seasons.
Read the full abstract

Computer Vision

An overview of 3D Vision-Language Models

Vision-Language Models (VLMs) are reshaping computer vision by aligning visual and textual embeddings, allowing models to recognize visual concepts and reason about them using natural language. Traditional 3D deep-learning models, however, are typically trained for specific tasks, such as classification, segmentation, or detection, and do not naturally support cross-modal retrieval from their embedding spaces using text or images as queries. To address this issue, Contrastive Language-Image Pretraining (CLIP)-based methods align 3D embeddings with pretrained image and text representations, giving rise to 3D Vision-Language Models (3D VLMs) that support zero-shot classification, cross-modal retrieval, and open-vocabulary recognition of 3D shapes. This tutorial provides an overview of 3D VLMs, ranging from basic definitions of 3D representations and their encoding into embeddings to cross-modal contrastive alignment, modern multimodal frameworks, and 3D Vision-Large Language Models (3D VLLMs). We present the main definitions of contrastive learning for multimodal embedding alignment and highlight recent advances in language-guided 3D Gaussian splatting, 3D shape generation, and embodied AI for robotics.
Read the full abstract

All authors Márcus Lobo, Vitor Matias, Afonso Paiva, Jeová Farias, Tiago Novello, Moacir Ponti

Machine Learning

HB-PVI: A Hierarchical Bayesian Personalization and Value-of-Information Framework for Complex Activity Recognition

Personalization can improve activity-recognition performance, but participant-specific gains are heterogeneous, and every additional calibration label has an acquisition cost. This study presents HB-PVI, a hierarchical Bayesian personalization and value-of-information framework jointly modeling participant heterogeneity, the benefit and harm of four personalization mechanisms, and the economic value of an additional label, for the 47-participant MUSIC-CAR complex-activity cohort. A leakage-safe, leave-one-participant-out evaluation combines a sequential-Monte-Carlo participant-effect updater with a Student-$t$ hierarchical gain model and a one-step expected-value-of-sample-information (EVSI) stopping rule. Adapter personalization produced small positive mean F1 gains, growing from 0.00099 at one label to 0.00198 at ten, while adapter-plus-head and prototype-residual personalization were negative on average. Under the primary practical-benefit threshold ($\Delta_{\min}=0.01$) and cost setting, one-step EVSI was zero at every decision state, so the policy purchased no labels and retained population inference for all 47 participants, matching always-stop exactly (region-of-practical-equivalence probability $=1$). Relative to fixed ten-shot adapter personalization, this reduced labeling by 100% while keeping the posterior mean F1 loss at 0.00217 (95% credible interval, 0.00048 to 0.00389), with posterior probability 0.9992 of remaining below the 0.005 tolerance. HB-PVI was utility-optimal in 199 of 216 cost-threshold settings and in every setting at or above the primary label cost. These results argue for a population-first deployment policy whenever personalization gains are small relative to labeling, computation, and harm costs, and show that value-of-information reasoning, not raw predictive accuracy, should drive personalization decisions in health-sensing applications.
Read the full abstract

Combinatorics

Random Permutation Matrices Form a Basis with High Probability

Let $d=(n-1)^2+1$, the dimension of the real linear span of the $n\times n$ permutation matrices. We prove that $d$ independent uniformly random permutation matrices fail to form a basis with probability $(1+o(1))n^2(1-1/n)^d=(e^{3/2}+o(1))n^2e^{-n}$. The same asymptotic holds for a uniformly random $d$-element subset, confirming a conjecture of Kushwaha and Tripathi and identifying the leading obstruction: a matrix position avoided by every sample. More generally, for any fixed number of additional samples, we determine the first three exponential orders of the failure probability. To prove these results, we develop support estimates valid over arbitrary fields, derive Fourier bounds from permanental minors, and introduce a counting argument for concentrated assignment functionals over large prime fields. We also give a sparse lifting argument showing that real rank deficiency without an annihilating functional of small support has probability $o(e^{-Cn})$ for every fixed $C>0$.
Read the full abstract

Distributed Computing

Sharpedo: Dual-Mode Uncertified DAG-Based Consensus Protocol

Mysticeti and Mahi-Mahi represent leading approaches to consensus protocols, leveraging a novel uncertified Directed Acyclic Graph data structure to achieve substantial performance benefits compared to prior work. Mysticeti and Mahi-Mahi differ in their underlying network assumptions, where the former makes assumptions about timing bounds for communication while the latter does not. Mysticeti trades robustness for lower levels of latency in ideal conditions, whereas Mahi-Mahi favours increased latency in order to ensure stronger progress guarantees in asynchronous settings. Although dual-mode protocols exist (i.e., protocols that can adapt do different network assumptions), none have been implemented to take full advantage of the novel data structure seen in the aforementioned protocols. Thus, our research project aims to trace the progression of consensus protocols, analyse how they address network assumptions constraints, and explore dual-mode protocols. Then, we present Sharpedo, the first dual-mode uncertified Directed Acyclic Graph consensus protocols which aims to achieve the best of both worlds: the high-performance of partially-synchronous protocols, while providing guarantees of progress even in asynchronous settings. Furthermore, Sharpedo integrates a novel dynamic scheduling mechanism resulting in improved system efficiency and performance optimization.
Read the full abstract

Computer Vision

ViT3Flow: A Test-Time Training Transformer MeanFlow for Postoperative Radiograph Synthesis in Scoliosis

Predicting postoperative spinal morphology from preoperative radiographs could provide valuable support for scoliosis surgical planning, but remains challenging because surgical correction induces large spatial changes while anatomical structures must be faithfully retained. We formulate this problem as postoperative scoliosis radiograph synthesis and construct ScoliSurg, the first paired dataset for this task, comprising 632 preoperative–postoperative whole-spine radiograph pairs with structured morphology information. We further propose ViT$^{3}$Flow, a single-NFE conditional MeanFlow framework for efficient postoperative radiograph synthesis. ViT$^{3}$Flow models surgical correction as finite-interval generative transport and replaces conventional self-attention with test-time-training token mixers that perform sample-specific inner adaptation to the anatomy and deformity pattern of each case. In addition, a Spinal Morphology Extraction Agent extracts distributions of dominant-curve region and direction from the preoperative radiograph. These distributions guide Diagnosis-Routed Interval Cross-Attention (DRICA), which performs interval-dependent vertical, horizontal, joint, and global retrieval from a separate preoperative token stream. This design enables the evolving postoperative representation to incorporate spatially corresponding anatomical evidence throughout the transport process. Extensive experiments on ScoliSurg demonstrate that ViT$^{3}$Flow achieves the best performance among the compared methods in perceptual image quality, anatomical fidelity, and clinically relevant geometric accuracy, while requiring only a single network evaluation. These results highlight the potential of ViT$^{3}$Flow for efficient and anatomically faithful postoperative radiograph synthesis in scoliosis surgical planning.
Read the full abstract

All authors Rui Tang, Sicheng Yang, Moxin Zhao, Hongqiu Wang, Guankun Wang, Lei Zhu, Hongliang Ren, Menglin Cong, Nan Meng

Artificial Intelligence

Planning and Scheduling Business Processes under Control-Flow Uncertainty: Extended Version

Scheduling activities in business processes can improve efficiency (e.g., reduce makespan), but is challenging because the exact sequence of activities required to complete a case is often uncertain due to decisions based on data that emerges during execution. Nevertheless, probabilistic information regarding such decisions can often be estimated or derived from historical execution logs, and can help anticipate which execution paths are likely to lead to successful completion. Planning with particular execution paths affects feasibility, i.e., the probability of successful completion, and the expected number of superfluous activities that are planned but never executed. We frame the problem as a chance-constrained optimization problem and present two formulations: A decomposed approach with two stages, a planning stage that minimizes the expected number of superfluous activities subject to a feasibility constraint, and a scheduling stage that minimizes the makespan over the planned activities; and an integrated approach that combines planning and scheduling into a single formulation. Evaluation on two real-world and one synthetic dataset shows that the integrated approach yields superior makespans but is intractable at scale, while the decomposed approach scales to large settings.
Read the full abstract

Combinatorics

All doubly stochastic solutions to $AXA = XAX$ when $A$ is a permutation matrix

In this paper we obtain all doubly-stochastic solutions to the Yang-Baxter-like matrix equation $AXA = XAX$ when $A$ is a permutation matrix. We characterize the permutation solutions, proper doubly stochastic solutions, and we accompany our results with suitable examples.

Artificial Intelligence

EnvCraft: Synthesizing Executable Environments in Agentic RL for Claw-like Agent

The paradigm of LLMs has rapidly shifted from passive language interfaces to autonomous Claw-like agents that execute long-horizon tasks across stateful workspaces. While Agentic Reinforcement Learning (Agentic RL) provides a promising path to optimize these agents, its scaling is heavily bottlenecked by the severe scarcity of interactive training environments. Existing synthetic environments are strictly limited to tool-calling endpoints, rendering them insufficient for accommodating the end-to-end real-world demands of claw-like agents. To bridge this gap, we introduce EnvCraft, an automated framework for synthesizing executable environments and scalable training data. Specifically, EnvCraft employs an environment synthesis engine to build sandbox-isolated workspaces, alongside a topology-aware data generation engine to produce coherent task trajectories. Overall, we synthesize 139 interactive environments comprising approximately 20K complex tasks for Agentic RL training. Experiments on Qwen3/3.5 models (8B-32B) show that our method yields gains of up to +11.9% on Claw-style benchmarks and +8.0% on general tool-use benchmarks, with concurrent reductions in inference token cost. The results confirm that synthesized executable environments provide robust and generalizable learning signals for training.
Read the full abstract

All authors Yirong Zeng, Shen You, Jinhang Feng, Yufei Liu, Xiao Ding, Yutai Hou, Hao Cong, Yuxian Wang, Wu Ning, Wang Xu, Bibo Cai