Peer Revenue Equity in science

Papers

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

All of arXiv

Saturday 29 August

Complex Variables

Degree-Three Rational Sphere Maps: Sharp Denominator Region and Gram Normal Forms

We study degree-three rational sphere maps in two complex variables. After a standard normalization, the denominator of such a map takes the form \[ g_\sigma(z)=1+\sigma_1 z_1^2+\sigma_2 z_2^2, \qquad \sigma_1,\sigma_2\geq 0. \] A basic question is: which pairs $(\sigma_1,\sigma_2)$ can actually occur as the denominator of a degree-three rational sphere map? The first main result of the paper gives a complete answer: such a denominator occurs if and only if \[ 0\leq \sigma_1,\sigma_2<1, \qquad \sqrt{1-\sigma_1^2}+\sqrt{1-\sigma_2^2}>1. \] Our approach converts the sphere-mapping condition into a finite-dimensional Gram-matrix positivity problem. Furthermore, for each admissible parameter $ \sigma=(\sigma_1,\sigma_2), $ we determine all possible minimal target dimensions in which the corresponding denominator $g_\sigma$ can be realized. We also give a Gram-matrix normal form for maps with a fixed denominator and compute, for each admissible $\sigma$, the dimension of the moduli space of equivalence classes of rational sphere maps realizing $g_\sigma$. Finally, we extend the Gram-matrix method to arbitrary source dimension and obtain a general sufficient condition for the existence of degree-three rational sphere maps.
Read the full abstract

All authors Eden Danielsen-Jensen, Dusty Grundmeier, Abdullah Al Helal, Valentin D. Kunz, Jiri Lebl, Ming Xiao, Weixia Zhu

High Energy Physics (Experiment)

First Measurement of Solar Neutrinos through Elastic Neutrino-Electron Scattering at the keV Scale

We report on the first measurement of low-energy solar neutrinos through elastic neutrino-electron scattering in a dark matter experiment, establishing the lowest energy threshold for any neutrino detection to date. The measurement utilizes data from the first two science runs of XENONnT, corresponding to an exposure of 2.46 t $\cdot$ y, and covers electron recoil energies between 1 keV and 140 keV, providing sensitivity to solar neutrinos with energies down to 17 keV. We reject the background-only hypothesis with a statistical significance of $5.0\sigma$ and measure a solar $pp$ neutrino flux of $(10.2 \pm 2.0) \times 10^{10}$ cm$^{-2}$ s$^{-1}$. The result is larger, but statistically consistent with the previous measurement by Borexino at $1.9\sigma$. Together with recent observations of coherent elastic neutrino-nucleus scattering of $^8$B solar neutrinos in XENONnT and other liquid-xenon time projection chambers, these results demonstrate the growing potential of liquid xenon detectors for neutrino physics down to the keV-scale and represent an important milestone towards a next-generation multipurpose observatory.
Read the full abstract

All authors XENON Collaboration: E. Aprile, J. Aalbers, K. Abe, M. Abu Rmilah, M. Adrover, S. Ahmed Maouloud, L. Althueser, B. Andrieu, E. Angelino, D. Antón Martin, S. R. Armbruster, F. Arneodo, L. Baudis, M. Bazyk, V. Beligotti, L. Bellagamba, R. Biondi, K. Boese, R. M. Braun, G. Bruni, R. Budnik, C. Cai, C. Capelli, J. M. R. Cardoso, A. P. Cimental Chávez, A. P. Colijn, J. Conrad, J. J. Cuenca-García, H. Dai, V. D'Andrea, L. C. Daniel Garcia, M. P. Decowski, A. Deisting, C. Di Donato, P. Di Gangi, S. Diglio, K. Eitel, S. el Morabit, R. Elleboro, A. Elykov, A. D. Ferella, C. Ferrari, H. Fischer, T. Flehmke, M. Flierman, R. Frankel, D. Fuchs, W. Fulgione, C. Fuselli, F. Gao, R. Giacomobono, R. Glade-Beucke, L. Grandi, J. Grigat, M. Guida, P. Gyorgy, R. Hammann, C. Hils, L. Hoetzsch, N. F. Hood, A. Hurhina, M. Iacovacci, Y. Itow, J. Jakob, F. Joerg, Y. Kaminaga, S. Kazama, P. Kharbanda, M. Kobayashi, D. Koke, K. Kooshkjalali, A. Kopec, E Kozlova, H. Landsman, L. Levinson, A. Li, H. Li, I. Li, S. Li, Z. Liang, Y.-T. Lin, S. Lindemann, M. Lindner, K. Liu, M. Liu, F. Lombardi, J. A. M. Lopes, G. M. Lucchetti, T. Luce, Y. Ma, C. Macolino, G. C. Madduri, J. Mahlstedt, F. Marignetti, T. Marrodán Undagoitia, K. Martens, J. Masbou, S. Mastroianni, V. Mazza, J. Merz, M. Messina, A. Michel, K. Miuchi, R. Miyata, A. Molinario, S. Moriyama, M. Murra, J. Müller, K. Ni, C. T. Oba Ishikawa, U. Oberlack, K. Otsuzuki, S. Ouahada, B. Paetsch, Y. Pan, Q. Pellegrini, J. Pienaar, M. Pierre, G. Plante, T. R. Pollmann, F. Pompa, A. Prajapati, L. Principe, J. Qin, A. Ravindran, A. Razeto, L. Sanchez, J. M. F. dos Santos, I. Sarnoff, G. Sartorelli, M. T. Schiller, P. Schulte, H. Schulze Eißing, M. Schumann, L. Scotto Lavina, M. Selvi, F. Semeria, F. N. Semler, P. Shagin, X. Shen, S. Shi, H. Simgen, Z. Song, A. Stevens, C. Szyszka, A. Takeda, Y. Takeuchi, P.-L. Tan, D. Thers, G. Trinchero, C. D. Tunnell, K. Valerius, S. Vecchi, S. Vetter, G. Volta, B. von Krosigk, C. Weinheimer, D. Wenz, C. Wittweg, V. H. S. Wu, Y. Xing, D. Xu, Z. Xu, M. Yamashita, J. Yang, L. Yang, J. Ye, M. Yoshida, G. Zavattini, Y. Zhao, M. Zhong, T. Zhu

Probability

Vocabulary Growth Fundamentals: Bernstein Functions and Hausdorff Sequences

We survey the theory of vocabulary growth founded in the setting of stochastic processes. In particular, we model the expected number of types through Bernstein functions and Hausdorff sequences. These classes of mathematical objects, defined by alternating signs of their derivatives or differences, can be related to continuous-time Poisson point processes and discrete-time IID processes, respectively. Building on previous accounts of the vocabulary growth, we integrate the broader theories of Bernstein functions and Hausdorff sequences and connect them with recently developed hapax rate models. In particular, we prove that the logistic hapax rate model has a non-negative spectrum and hence it defines a Bernstein function, thereby solving an earlier posed problem. We also analyze the limitations of the Bernstein–Hausdorff theory of the vocabulary growth by considering its generalizations under stationary and Weibull renewal processes.
Read the full abstract

Machine Learning

SS-ESOAP: Self-Scaled Adaptive Preconditioning for Physics-Informed Learning

Physics-informed neural networks (PINNs) often face ill-conditioned objectives that limit high-accuracy training. Dense quasi-Newton methods improve local conditioning but require expensive optimizer state, while Kronecker-factored methods such as SOAP scale to larger networks but rely on periodic basis updates. We introduce \method, which augments SOAP-style preconditioning with a scalar secant-energy correction adapted to Kronecker geometry and an adaptive basis update followed by variance-state downscaling. We characterize the directional secant matching induced by the scalar correction and give a bound on variance-state mismatch across basis changes. Across eight PDE benchmarks, \method attains the lowest final residual on six, including Burgers and Boussinesq, while SOAP-family baselines perform better on Gray-Scott and Ginzburg-Landau. On Boussinesq, \method reaches a residual of $10^{-5}$ in 4.1 hours with 9.2 GB peak VRAM, while Adam does not reach this target within 14 hours. Three-seed $L^2$ and $H^1$ errors on four representative PDEs support the link between lower residuals and improved solution accuracy. These results position \method as a scalable option for stiff, high-accuracy physics-informed training, rather than a uniform replacement for existing optimizers.
Read the full abstract

All authors Guangyuan Wang, Mads Toftrup, Sebastian Loeschcke, Yixuan Wang, Anima Anandkumar

Materials Science

Vibrational Origin of the Barocaloric Effect in the Spin-Crossover Complex Fe(pap-5NO2)2: A Combined DFT and Mean-Field Study

Despite the barocaloric performance recently reported for the spin-crossover complex Fe(pap-5NO2)2, the microscopic origin of its pressure-induced entropy change remains poorly understood. In particular, the relative contributions of vibrational, configurational, and spin degrees of freedom to the barocaloric response have not yet been quantitatively established. Here, we develop a theoretical framework that combines density functional theory (DFT) calculations with an effective mean field Hamiltonian to investigate the barocaloric effect in this spin-crossover complex. Vibrational frequencies of the low-spin (S = 0) and high-spin (S = 2) states obtained from first-principles calculations are incorporated into a thermodynamic model that explicitly accounts for configurational, spin, and lattice entropy contributions. By establishing a correspondence between the vibrational spectra of both spin states through displacement-vector overlap analysis, we identify low and mid frequency metal-ligand vibrations as the primary microscopic origin of the vibrational entropy change. The proposed model quantitatively reproduces the experimentally reported barocaloric entropy change for a pressure variation of 2 kbar, corresponding to a maximum reversible entropy change of approximately 70 J kg-1 K-1, and predicts a spin-crossover temperature of T_1/2 = 313 K under ambient pressure, in excellent agreement with the experimental value of 308 K. Analysis of the entropy components reveals that lattice entropy associated with molecular vibrations accounts for approximately 84% of the total barocaloric response, whereas configurational and spin contributions are comparatively small.
Read the full abstract

All authors Alan de Souza, Antonio M. dos Santos, Yongqiang Cheng, Vinícius S. R. de Sousa, Mario Reis

Computation and Language

Whose Assessment of Distress? Community Perspectives and LLM Alignment on Well-Being Posts

Judgments about psychological distress are socially situated: what counts as concerning hinges on community norms around emotional expression, vulnerability, and help-seeking. Yet large language models (LLMs) used for distress detection are typically aligned to a single, undifferentiated standard. How well do these models capture the perspectives of the communities whose language they assess? We address this question through a perspectivist annotation study in which 321 participants provided 9,587 judgments on 1,198 Reddit posts spanning six identity-based communities, yielding community-specific labels. Raters in the contextualized in-group condition show a modest tendency to agree more with their community than uncontextualized out-group raters (OR = 1.18), an effect varying significantly across communities. We then evaluate nine open-weight LLM configurations and four frontier configurations against these labels. Open-weight LLMs systematically over-estimate distress: when communities perceive none-to-mild distress, these models achieve only 31-44% accuracy, predominantly producing false positives. GPT-5 and Gemini 2.5 Pro show the same none-to-mild inflation even when their full-sample over/under rates are mixed, while Claude Opus 4 is more conservative. This pattern does not simply mirror an outsider reading position: uncontextualized out-group human aggregates were nearly symmetric, with 18% over-estimation versus 19% under-estimation. Instead, the models that inflate none-to-mild cases exhibit a distress prior that exceeds both contextualized in-group and uncontextualized out-group human judgments. These findings have implications for equitable AI deployment in mental health contexts, where miscalibrated distress detection may unevenly affect the communities being assessed.
Read the full abstract

Commutative Algebra

The arithmetic rank of nullcones of classical invariant rings

We compute the arithmetic rank of nullcone ideals arising from natural actions of the special linear, orthogonal, and symplectic groups on direct sums of copies of their standard and dual representations. Over an infinite field of characteristic different from two, we show that the arithmetic rank equals the Krull dimension of the invariant ring, and compute this dimension. In positive characteristic, the required lower bounds are not detected by local cohomology, and are obtained using étale cohomology.
Read the full abstract

Networking

RL-based Network Slice Embedding over Space Division Multiplexed Elastic Optical Networks

Network slicing over space-division-multiplexed elastic optical networks (SDM-EONs) requires jointly managing spectrum, spatial cores, and compute resources, a coupling that many existing studies ignore by treating compute placement independently from routing and spectrum decisions. This disconnect can cause the spectrum to be allocated along a path, only for the request to fail due to insufficient compute resources along the path, or may result in compute resources being allocated without consideration for spectrum resource availability on the path between compute nodes. We propose a path-constrained reinforcement learning framework that addresses compute node selection and RMCSA, being aware of both resources, restricting the RL agent's action space to nodes along $k$-shortest paths between request endpoints. Training incorporates reward shaping to improve robustness under high load. We propose PPO-Full (Proximal Policy Optimization-Full), which jointly selects compute nodes and routing paths via a multi-dimensional action space, against distance-based heuristics, a greedy baseline, and a decoupled VONE-DRL baseline on a 24-node USNET topology under hotspot traffic conditions. Results demonstrate consistent improvements in acceptance rate over all baselines at high load, with gains becoming more pronounced as traffic intensity increases.
Read the full abstract

All authors Divya Khanure, Riti Gour{\dag}, Congzhou Li, Jason P. Jue

Functional Analysis

Optimality in a Multilinear Extension of Kwapień's Theorem

Bayart, Pellegrino, and Rueda obtained diagonal absolute summability exponents for continuous \(m\)-linear operators from \((\ell_1)^m\) into \(\ell_p\). Their optimality was known for \(2\le p\le\infty\), whereas the case \(1\le p<2\) remained open. We settle the latter case by means of finite Walsh test operators, and consequently obtain the optimal exponent for every \(1\le p\le\infty\). The same argument, combined with the corresponding interpolation and embedding results, also yields optimal Kwapień-type statements for several related range spaces.
Read the full abstract

Classical Analysis and ODEs

An Ellipse Criterion for Exact Nonuniqueness in the Planar Interior Radon Problem

We characterize exact nonuniqueness in the planar interior Radon problem for arbitrary pairs of open convex sets. There exists a nonzero smooth function compactly supported in the first set whose integral over every line meeting the second set vanishes if and only if an ellipse contains the closure of the second set and is compactly contained in the first set. The same criterion holds for a nonzero $L^1$ function whose essential support is compactly contained in the first set and whose Radon transform vanishes almost everywhere on those lines. For concentric open squares, the criterion gives the sharp threshold $1/\sqrt2$ for the inner-to-outer half-side ratio. This yields counterexamples to Conjecture 1.2 of Boman (2021) and to Theorem 40.1 of Boman (2025).
Read the full abstract

Computational Complexity

It's Hard to PArcK

We show that Partizan Arc Kayles (PArcK), a generalization of Domineering to graphs, is PSPACE-complete via a reduction from Positive CNF and with recently-discovered techniques for creating PArcK positions with high temperature. The reduction uses only red and blue edges.

Group Theory

Decidability of the Orbit Problem Over $\mathbb{Q}(X)$

The orbit problem is the problem of whether, given $x, y\in \mathbb{Q}^n$ and an $n\times n$ matrix $A$, there exists an $i\in\mathbb{N}$ such that $A^ix = y$. In 1980, Kannan and Lipton proved that the orbit problem is decidable. We show that a generalization of the orbit problem, where the field is $\mathbb{Q}(X)$ for $X$ a countable set of transcendentals, is also decidable. We define the orbit power problem for an arbitrary group $G$ to be the problem of when, given $x, y\in G$, there exists an $n\in\mathbb{Z}$ such that $x^n = y$. We then use the main result to show that the power orbit problem is decidable for an assortment of groups, including the braid groups and $\operatorname{Aut}(F_2)$.
Read the full abstract

Number Theory

The Shimura Lift and Hilbert Modular Forms

After recalling basic formulas concerning modular forms of half-integral weight, Gegenbauer polynomials, and Rankin–Cohen brackets, we give four versions of the Shimura lift and several applications to Hilbert modular forms associated to real quadratic fields. We claim no originality, but wanted to collect all the formulas in a single paper.
Read the full abstract

Quantum Physics

The resource cost of magic in a code block

We bound the magic of a post-selected logical measurement by the resource that produced it. The setting is one code block with one logical qubit and an adaptive protocol that measures, feeds forward and accepts. The witness reads the accepted effect against the free set of the resource theory of magic, outcome by outcome and not on the averaged channel, since a channel can be free while one of its outcomes measures the magic axis. Our first bound is unconditional. The accepted magic is at most a constant times the summed distance of the cells from the free set. The second is the main result. When the resource cells sit inside a bounded-spread exact-recovery skeleton, the recovery puts every insertion history below a threshold onto a single free branch, transcript by transcript, so only connected clusters reaching the threshold contribute and an exact-component expansion controls their weight. With a threshold linear in the code distance, polynomially many cells of bounded insertion degree and per-cell dilation amplitude $O(1/d)$, the accepted magic times the acceptance probability is at most $\exp[-\Omega(d\log d)]$. Post-selection is disposed of before accepted transcripts are summed, so a branch of vanishing probability cannot be amplified into a magic effect. The threshold is certified from a circuit, and we run it on one exact round of stabilizer measurement followed by a split readout, which measures logical $X$ on the accepted fibre and logical $Z$ on the rejected ones. That certifies a threshold equal to the code distance for every single-layer pattern of weak $Z$-rotations, one per data qubit, so the hypotheses are met by a family and not one design. A member carries magic only if its support contains a logical $Z$ string. One member attains the exponent, again at the level of the accepted effect. Suppression is set by the threshold and not by the topology of the block.
Read the full abstract

Solar and Stellar Astrophysics

MEGARA Stellar Spectral Library. Second Release

We present the second release of the MEGARA spectral library, MEGASTAR, which now includes all spectra collected during ten observing semesters at the Gran Telescopio CANARIAS. This new release supersedes our first release and incorporates a substantial number of additional observations (2000 new spectra), obtained at high spectral resolution, R(FWHM)$\sim$20000, in two wavelength ranges centred on H${\alpha}$ (6420 - 6790 A) and on the CaII triplet (8370 - 8885 A). The aim of this paper is to introduce MEGASTAR DR2 to the community as its high-resolution spectra can serve as a valuable resource for numerous types of research. In particular, we will use MEGASTAR spectra to construct SSP blocks within the HR-PyPopStar evolutionary synthesis models. The stars were observed using the integral field spectroscopy mode of the instrument. We process the data in a uniform way with the MEGARA data reduction pipeline. We estimate the stellar flux by adding the spectra from 37 spaxels, centred on the spaxel with the highest flux in the IFU reconstructed image. This approach guarantees that the effective slit width, and therefore the spectral resolution, are the same for all spectra. The second MEGASTAR release consists of 2838 spectra corresponding to 1408 stars, providing a better coverage of the stellar parameter space than the first release. The spectra were acquired with an average continuum S/N of about 215. This second release meets the standards of a modern empirical library: it offers reliable calibrations, data free from slit effects, observations of a large number of stars, and provides high spectral resolution to model both individual stellar clusters and entire galaxies observed with MEGARA.
Read the full abstract

All authors E. Carrasco, M. Lira-Franco, M.L. García-Vargas, M. Mollá, N. Cardiel, A. Gil de Paz, P. Gómez-Alvarez, S. R. Berlanas, I. Millán-Irigoyen

Functional Analysis

On Topological Numerical Transitivity, C*-Transitivity and generalizations

Motivated by the concept of numerical hypercyclicity, in this paper, we introduce three new notions in linear dynamics: topological numerical transitivity, generalized numerical transitivity, C*-transitivity. The first notion is defined for operators on general Banach spaces, whereas the latter two are formulated in the setting of operators on Banach algebras. The concept of C*-transitivity is also applicable to operators on the space of Hilbert-Schmidt operators. We prove that these new notions are mutually different, and we also show that they differ from the standard notions in dynamics. In particular, while topological numerical transitivity implies numerical hypercyclicity, as we argue in the paper, we provide examples of numerically hypercyclic and strongly numerically hypercyclic operators that are not topologically numerically transitive. Also, we construct nonsupercyclic C* transitive and generalized numerically transitive operators on the C*-algebra of compact operators on a separable Hilbert space, as well as C*-transitive nonsupercyclic operators on the standard Hilbert C*-module. In addition, we study diagonal operators on finite-dimensional and separable Hilbert spaces, and we obtain complete characterizations of both numerical hypercyclicity and topological numerical transitivity in terms of coefficient-simplex criteria. Further, we provide some sufficient conditions for diagonal operators on the standard Hilbert C*-module to be C*-transitive. All these results are illustrated with concrete examples. At the end of the paper, we compare topological numerical transitivity and C*-transitivity with numerous standard notions in linear dynamics, and we prove that topological numerical transitivity and C*-transitivity genuinely differ from all these standard concepts in dynamics.
Read the full abstract

Quantum Physics

Parametric amplification in a Kerr Oscillator based on Ne FIB Nanobridges

Superconducting circuits play a crucial role in the advancement of quantum computing and quantum sensing. Typically such circuits require the presence of a non-linear element, where the engineered anharmonicity (Kerr factor) and resonant linewidth determine the potential applications of the circuit. In this work we have fabricated Nb-based CPW resonators embedded with a DC SQUID incorporating Nb nanobridges as the weak links. We use two-tone spectroscopy to study the non-linear behaviour of the device at 15 mK up to a field of 2.48 mT. Under the application of a blue-detuned pump, the device shows a decrease in the resonant frequency which is used to estimate the Kerr factor. We further apply a red-detuned pump to go beyond the bifurcation threshold and observe the appearance of an additional idler mode with net gain. The gain of the device was maximized by further decreasing the pump frequency, showing a maximum amplification of 15 dB. Finally, we show agreement between the Kerr non-linear oscillator model and the measured transmission spectrum, and highlight further design modifications to improve the gain and bandwidth of such devices.
Read the full abstract

All authors Parth Bhandari, Laith Meti, Gemma Chapman, Edward Romans, John Gallop, Ling Hao

Machine Learning

Does Latent Planning Survive Point Clouds? Action-Conditioned JEPA World Models for Geometric Observations and Goals

Latent action world models let agents plan new behaviors at test time by predicting how actions change the environment, and joint-embedding predictive architectures (JEPAs) do so by forecasting future latent states rather than pixels. Yet nearly all such models see the world through a camera, even though robotic manipulation is fundamentally geometric: in robotics goals for manipulation are traditionally specified by target object poses, not by images of the object once placed. We ask whether latent planning survives a shift from appearance to geometry, on the observation side as well as on the goal specifications side. To answer this, we extend the stable-worldmodel evaluation platform with simulated LiDAR-style raycast point clouds as a new sensor modality, and adapt three JEPA designs to point clouds: a frozen-encoder model built on Utonia features, a distribution-prior model based on LeWM, and an action-sensitive model based on Delta-JEPA. We further introduce a goal-encoding mechanism that constructs the goal latent from the current latent and a 3D target pose, removing the need for goal images or goal point clouds. A comparative evaluation of the different anti-collapse mechanisms shows that point-cloud world models can match their image-based counterparts, demonstrating that the modality shift from appearance to geometry is achievable. All models are released as open weights with open-source training and inference code, to make world-model planning accessible for LiDAR-driven and pose-directed robotic tasks.
Read the full abstract

Computer Vision

Calibration and Comparative Analysis of Forward-Looking Sonar and 3D Sonar for Enhanced Underwater Object Recognition

Sonars generate a significant amount of noise. With the advent of new technology capable of producing full 3D point clouds, the noise is amplified in sparse point clouds, making it challenging to recognize features for navigation, recognition, or reconstruction. To address this challenge, we propose using two different sonar modalities: one that produces a 2D intensity image and another that generates a 3D point cloud. By implementing auto-calibration, we can filter out noisy features between the modalities to enhance feature extraction. Experiments demonstrate that auto-calibration improves performance over manual calibration by 5% and that filtering enhances feature extraction by more than 40% relative to the raw point cloud. Code and datasets are given at https://theaprilab.org/fls-3d-calibrator
Read the full abstract

All authors Aditya Penumarti, Khanh Dong, Zi-Hao Zhang, Yongkyoon Park, Zhenqi Wu, Trung Dong, Shahriar Negahdaripour, Xiaomin Lin, Jane Shin

Robotics

SMILE: Smooth Motion for Improved Long-Horizon VLA Execution

Vision-Language-Action (VLA) models reduce inference cost by executing multiple actions per call, but longer horizons often degrade accuracy because raw chunks contain jitter and outliers. We introduce SMILE, an architecture-preserving interface that predicts B-spline coefficients and decodes them into smooth action sequences. SMILE changes only the action representation, enabling longer fixed horizons while retaining each baseline's backbone and model scale. We apply SMILE to SmolVLA, Evo1, VPP, and DAWN, improving accuracy and amortized inference efficiency across LIBERO, CALVIN, and real-world experiments. SMILE-Evo1 reaches 98.0% with a 1.1x speedup on LIBERO, while SMILE-VPP reaches an average length of 4.42 with a 1.5x speedup on CALVIN. At a matched execution horizon of 10, SMILE-SmolVLA reduces non-boundary acceleration by 78.6% and velocity sign-change rate by 42.3%. Real-world xArm tests show higher success, fewer drops, and fewer contacts. These results establish smooth coefficient-space generation as a route to accurate, efficient long-horizon VLA execution. Project page: jongwoopark7978.github.io/smilevla
Read the full abstract

All authors Jongwoo Park, E-Ro Nguyen, Kanchana Ranasinghe, Cristina Mata, Xiang Li, Michael S Ryoo

Computation and Language

Evaluating the Semantic Specificity of Representation Steering in Language Models

Localized Representation Steering (LRS) is widely used to correct reasoning pathologies in large language models. However, standard benchmark evaluations can easily be fooled by superficial label overrides, creating a false impression of reasoning circuit repairs. In this work, we propose Cross-Rule Transfer (CRT), a diagnostic framework that audits representational interventions by evaluating them on rule families where the model is natively competent. Evaluating late-layer LRS for a widespread logical failure, contradiction blindness, reveals that the intervention merely injects a global label bias: applying the steering vector to rules the model already handles correctly (99.6% baseline) degrades performance to 40.4% by forcing false contradiction predictions. We support this diagnosis with four complementary controls (direct logit bias equivalence, control vector label-flipping, cross-model grafting, and early-layer steering checks), providing a rigorous methodology to distinguish genuine reasoning repairs from superficial label overrides.
Read the full abstract

Information Retrieval

Content Exploration Beyond the Feed: Creator Supply and the Shared Corpus

Industrial recommenders give new content initial views through budgeted exploration, then use early performance to decide further delivery. On many short-video platforms, exploration is the primary way new videos reach viewers. Viewer-side tests measure consumption; the published budget objectives we review omit creator response. We analyze four experiments on a major short-video platform. An eight-month creator ablation finds production exploration raises videos posted per creator by 8.55% and creators posting at least once by 7.10% relative to a minimal floor. A budget-matched reallocation raises creator participation with no detectable short-run viewer-side change. A year-long viewer ablation finds 1.74% more video views but 2.13% less view time. A delivered view creates immediate feed value, can trigger organic take-up, and can induce creator supply. Take-up and supply replenish a shared corpus, creating two measurement limits. Viewer-side A/B tests cancel the corpus effect when both arms consume the same corpus. Giving each arm its own corpus avoids cancellation, but turnover still controls the horizon. If the corpus turns over at rate w per posting cycle, a t-cycle experiment expresses at most wt of the eventual corpus effect. More users reduce noise but do not speed turnover. Before the corpus path visibly bends, data cannot distinguish a modest fast effect from an arbitrarily large slow one, so a valid confidence interval may lack a finite upper endpoint. As predicted, the three-week co-diverted experiment cannot determine the sign of the eventual corpus effect. Within the window, it identifies the direct feed effect, and an exploratory cohort analysis detects organic lift after exploration ends. The experiments establish a positive creator response, measure the gross corpus flow visible within three weeks, and show the design and duration needed to identify total value.
Read the full abstract

All authors Yuanyuan Shen, Yiren Yan, Wenjie Li, Chunhui Zhu

Quantum Physics

Quantum optomechanics with arbitrary mirror displacement: nonlinear Langevin equation with non-Markovian back-action noises

Quantum optomechanics (QOM) explores the interaction between a quantum field, often confined in a cavity, and the quantum motion of mirrors, membranes or material media, usually assumed slow enough with negligible particle production, which is the central concern of dynamical Casimir effects, and a drive laser field for effective control. This rapidly developing field has a wide range of applications, from quantum sensing to the detection of gravitational waves. Because the opto-mechanical coupling is nonlinear, most theoretical investigations assume that the amplitude of mirror motion $x$ remains small. Recent years saw several papers treating $x^2, x^3$ orders in the mirror displacement. In our work we take a different route, deploying the functional perturbative method presented in [1] and enriched in [2], applicable for sufficiently weak opto-mechanical couplings. With this we can treat arbitrary displacement of the mirror, not just at a higher order in a power series expansion in $x$. We first derive the influence action of the quantum field and its non-Markovian noises back-reacting on the moving mirror with self-consistency. From it we derive a nonlinear Langevin equation driven by these back-action noises from the quantum field. We then show how results from our general modeling and treatment can be linked with the models and the Langevin equations presented in the literature, starting with the popular radiation pressure $Nx$ coupling, with $N$ the photon number, up to the recent $x^3$ order results. We hope this new approach and the results presented here can provide useful theoretical support for high precision QOM experimentation in the future.
Read the full abstract

Machine Learning

Behavioral Latency as Weak Event-Time Supervision for EEG Reaction-Time Decoding

Single-trial EEG analyses are often organized around events and latencies, yet EEG-based reaction-time (RT) prediction is posed as scalar regression on a fixed stimulus-locked window. RT is treated as a window-level label rather than timing evidence about response-relevant dynamics. Here we reformulate trial-wise RT decoding as event-time posterior modeling. Instead of predicting RT directly, the model estimates a posterior over response-relevant event times, $p(t_{\mathrm{event}}\mid X)$, and uses its mean as the RT estimate. This treats behavioral latency as a weak observation of latent response-relevant timing. We evaluate this formulation on the Healthy Brain Network contrast change detection EEG task under a subject-disjoint, release-separated protocol. Across five seeds, distributional event-time supervision consistently improves held-out RT prediction relative to scalar regression and temporal-readout controls. Controlled objective comparisons isolate supervision of the event-time distribution, rather than expectation-based readout alone, as the source of this gain. Architecture controls show that the effect persists across four temporal backbones and is not explained by model scale. Beyond point prediction, posterior geometry characterizes concentration, target alignment, and interval behavior, while observation-noise calibration separates latent concentration from predictive uncertainty over RT. Shifted-crop inference probes shortcut use versus temporal localization. Matched shift-jitter improves robustness, increases mean sensitivity, and moves predictions more often in the expected crop-relative direction. Sensitivity remains below ideal crop-relative localization, leaving a clear equivariance gap. Together, these results establish event-time posterior modeling as a probabilistic and interpretable formulation for linking single-trial EEG dynamics to behavioral timing.
Read the full abstract

All authors Anuar Aimoldin, Ayana Mussabayeva, Yedige Mussabayev, Xue Liu, Kun Zhang

Differential Geometry

Positive mass and rigidity for asymptotically flat tangent bundles

Let $(M,g)$ be an asymptotically flat manifold such that its tangent bundle $TM$ is diffeomorphically asymptotically Euclidean. We prove a positive mass theorem and a positive mass rigidity theorem for a natural class of asymptotically flat metrics $\widetilde g$ on $TM$ exhibiting slow asymptotic decay. These metrics are constructed by interpolating, along the horizontal distribution of $TM$, between the Euclidean metric and the base metric $g$ near infinity. The main difficulty is that the induced metrics on $TM$ decay below the standard threshold for the ADM mass in dimension $2n$; nevertheless, we show that their asymptotic mass is well-defined in a generalized sense and is determined by geometric data on the underlying manifold $M$.
Read the full abstract

Computer Vision

Polis: 3D Self-Supervision at City Scale

Reliable semantic representations derived from city-scale 3D models are increasingly important for urban analysis, infrastructure monitoring, autonomous systems, and heritage conservation. However, urban scenes of large spatial extent captured through aerial surveying differ substantially from the indoor, object-level, and self-driving LiDAR data used to pretrain most 3D self-supervised models. We introduce Polis, to our knowledge the first application of Sketched Isotropic Gaussian Regularization (SIGReg) as an objective for a native point cloud encoder, and evaluate it through a frozen-feature benchmark spanning fourteen city- and building-scale corpora. Polis combines geometrically matched cosine invariance, SIGReg, and VICReg-style anti-collapse terms with a 12.8k-scene outdoor pretraining mixture and gravity-preserving spatial view sampling. Controlled ablations show that this objective outperforms student–teacher architecture alternatives, as well as Polis versions without anti-collapse terms, on the same representative outdoor corpus. On three pretraining-disjoint city datasets, Polis reaches $23.8\%$ mean mIoU versus $16.3\%$ for the next-best encoder under high-capacity frozen probing, and $17.3\%$ versus $16.1\%$ at a matched point and voxel budget. The same city-scale lead holds on datasets whose training sets were seen in pretraining. On localized terrestrial captures with fine-grained facade and streetscape labels, the ranking reverses. Our results show that distributionally-regularized joint embedding architectures can be successful on challenging city-scale 3D scenes, and that transfer improves when self-supervision is designed for the capture geometry and spatial context of this domain while also revealing the limits of this specialization.
Read the full abstract

All authors Alexander Rusnak, Sophia Kovalenko, Jingru Wang, Ismail Moudden, Xiru Wang, Frédéric Kaplan

Number Theory

Analogue of Cardy's formula on the 60-degree parallelogram: a modular approach

The Cardy-Smirnov function of a four-marked planar domain encodes the conjectural scaling limit of the crossing probability for critical percolation. Cardy predicted a closed formula for this limit on the rectangle in the cases of both site and bond percolation, and Smirnov proved the formula together with conformal invariance for critical site percolation on the triangular lattice. Kleban and Zagier later showed that on the rectangle the function admits a modular interpretation: it is determined by a modular functional equation together with a mild analytic ansatz. We carry out the analogue on the $\pi/3$ parallelogram. We derive a closed conformal-map formula for the Cardy-Smirnov function as an incomplete beta integral, prove a closed modular formula realizing it as an integral of the modular form $\eta(\tau)^2\eta(3\tau)^2$, and establish a uniqueness theorem showing that a single functional equation, together with a $q$-expansion ansatz and a nondegeneracy condition, determines the function uniquely.
Read the full abstract

Information Theory

Transmissive RIS-Assisted Vehicular Direct-to-Satellite Communications: Opportunities, Limitations, and Comparison with Phased Arrays

This article studies transmissive reconfigurable intelligent surface (RIS)-assisted architectures. It compares them with electronically steered phased arrays for the deployment of vehicular direct-to-satellite (D2S) communications in future satellite networks. Rather than treating RIS as a direct replacement for phased arrays, we clarify the operating regimes in which RIS can serve as a low-power wavefront-shaping aperture and those in which phased arrays remain preferable because of their high gain and mature beam-tracking capability. Moreover, phased arrays can support multi-beam operation, which is particularly beneficial for dual connectivity and seamless handover. We distinguish analog, digital, and hybrid phased arrays, discuss the relationship between transmissive RIS and reconfigurable transmitarrays, and highlight practical profile, tracking, and link-budget constraints for mobile terminals. The comparison shows that passive RIS offers attractive power efficiency and aperture scalability, active RIS can partially improve the link budget, and phased arrays remain preferable for high-throughput.
Read the full abstract

All authors Wali Ullah Khan, Abdullah Abdullah, Juan Andres Vazquez-Peralvo, Eva Lagunas

Computational Finance

Improving Swaption Calibration in Factor HJM Stochastic Volatility Models: A First-Order Correction to Frozen Swap-Rate Loadings

The factor HJM stochastic volatility model introduced by Sepp and Rakhmonov (2025) obtains tractable swaption pricing by freezing the nonlinear swap-rate loading along a deterministic expected-state path. This removes the dependence of conditional swap-rate variance on the current yield-curve state. We introduce a first-order Taylor correction to the loading that adds no calibration parameters. Conditional on retaining the frozen annuity-measure drift, we show that the first variation of the swap-rate transform is affine in the centered rate states and reduces to one-dimensional equations in volatility. For quadratic-drift lognormal stochastic volatility, these equations yield a finite-dimensional ODE representation and a direct log-volatility formulation. Calibrations to independently generated nonlinear-model prices show substantially lower stochastic volatility parameter bias and held-out pricing error, with only modest changes in local calibration identifiability.
Read the full abstract

Quantum Physics

The ZZ feature map induces a signless Laplacian metric: a closed-form classical surrogate for quantum kernel regression

Bandwidth-tuned quantum kernels have been shown to lose their advantage over classical kernels and to resemble radial basis function kernels, but the analytical support for that observation rests on separable encoding circuits and captures entangling circuits only qualitatively. We close this gap for the ZZ feature map. We prove that in the small-bandwidth regime the induced kernel has, to leading order, the anisotropic Mahalanobis geometry defined by M = I + pi^2 Q, where Q is the signless Laplacian of the entanglement graph, and that it admits a parameter-free Gaussian surrogate matching it through second order. The quadratic structure persists at any fixed depth as a pullback of the Fubini-Study metric. The anisotropy depends entirely on a phase convention: under the unshifted convention the metric is the identity irrespective of entanglement, which accounts analytically for the isotropic resemblance previously reported. The derivation is verified against direct simulation for path, cycle and complete graphs, with relative error below 10^-3. The corresponding classical kernel requires no fitted parameters and no quantum simulation. Compared with the quantum kernel on two near-infrared spectroscopic benchmarks, across four targets, five preprocessing pipelines and 100 resampled splits per cell, the paired 95% bootstrap interval contains zero in 18 of 20 cells, the typical relative difference in test error is 2.7%, and the two families select the same preprocessing pipeline in 96% of splits. The regime in which the reduction fails adds no robust predictive value: restricting the grid to the classical regime improves mean test error by 3.8%, a gain that an equally large random restriction does not reproduce.
Read the full abstract