Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Fluid Dynamics

A priori Assessment of Tensor-Network Encoding for Isotropic Turbulent Flows

Tensor networks (TNs), originally developed for simulating many-body quantum systems, provide a systematic framework for approximating high-dimensional fields. This is achieved by factorizing the field into interconnected tensors with small bond dimensions, thereby restricting the correlations captured across field bipartitions. Belonging to the family of TNs, the matrix product state (MPS) ansatz is utilized here as a reduced-order modeling framework to construct truncated representations of isotropic turbulent flow data. Two direct numerical simulation (DNS) datasets are considered: the hydrodynamic field of an incompressible three-dimensional flow, and a conserved Fickian scalar in a similar flow. Each field is encoded as an MPS through a sequence of singular value decompositions (SVDs) in which small singular values are discarded. The truncated representation is contracted back to the full grid, and the resulting reconstructed field is compared against DNS. An interleaved ordering of the spatial tensor indices of the transport variables is applied prior to decomposition in order to localize the dominant inter-tensor correlations. Velocity reconstructions achieve $99.8\%$ fidelity using only $5\%$ of the original DNS memory, while the scalar field reaches the same fidelity at $15\%$ memory usage. A wide range of lower- and higher-order statistics, including velocity gradients, dissipation, and structure functions, are systematically examined. At these compression levels, the total kinetic energy and the scalar energy are both recovered within $0.2\%$ relative error, while the mean dissipation and mean scalar dissipation remain within approximately $10\%$ of the DNS generated values. These findings support the suitability of MPS for scalable reduced-order analysis of complex turbulent datasets and motivate further exploration of TN-based methods in computational turbulence.
Read the full abstract

All authors Massen Esmaeili, Hirad Alipanah, Robert Pinkston, Peyman Givi, Daniel Livescu, Andrew J. Daley, Dieter Jaksch, Juan José Mendoza-Arenas

Rings and Algebras

The ozone groups of the algebras $B_q(f)$

Let $q$ be a primitive $n$-th root of unity, $n>1$, and let $f$ be a nonzero polynomial such that $n\nmid(j+1)$ for every $j\in\supp(f)$. Set $e=\gcd(n,\{j+1:j\in\supp(f)\})$. We show that $\Oz(B_q(f))\cong\mu_e\times\mu_e$: the defining relations are homogeneous for a $\mathbb{Z}/e\times\mathbb{Z}/e$ grading, the center sits in degree zero, and the ozone group is the character group of that grading. The determination of the ozone group only requires the central elements $u^n$, $v^n$, and $\Omega$. The regular normal elements modulo the center form the same group, generated by $u^{n/e}$ and $v^{n/e}$, so every normal element is central exactly when $e=1$. For $f=t^2$ we recover a computation of Chan, Gaddis, Won and Zhang, and for $e>1$ we obtain an infinite family of Calabi–Yau algebras with nontrivial ozone group.
Read the full abstract

Statistics Theory

Max-Stable Survival Copulas under Dependent Censoring: Sharp Identification and Efficient Inference

We study dependent censoring within a generalized Cox first-hitting-time. framework based on compensator reductions. In the genuinely dependent case, we show that max-stability of the associated survival copula is equivalent to a common operational clock, leading to a nonparametric Marshall Olkin family. We establish sharp identification results under complete and binary observation schemes. Under binary observations, the common clock and event loading are point identified, whereas the censoring loading and the associated latent survival and dependence structures are only partially identified. We develop nonparametric estimation and inference for the identifiable components, derive an efficient restricted estimator, and propose an observable test of max-stable compatibility. Simulations and a real-data application illustrate the practical implications of the identification and efficiency results.
Read the full abstract

Theoretical Economics

Scrutiny and Conservatism

We study a setting in which an agent receives private information before choosing from a menu and anticipates hindsight scrutiny. Such scrutiny creates a motive for conservatism toward menu expansions. Our key axiom, conservatism, is a direct weakening of preference for flexibility: Adding an option is weakly beneficial whenever it leaves the menu's hindsight benchmark unchanged. Together with standard axioms, conservatism characterizes a scrutiny representation of preferences over menus in which the agent behaves as if she evaluates each menu by subtracting anticipated scrutiny from the material value of informed choice. Menu preference identifies a unique minimum pair of private information and scrutiny intensity, while incorporating subsequent stochastic-choice data pins down the actual pair. Applications to medical liability and corporate innovation illustrate the implications of our model for accountability design.
Read the full abstract

Networking

Uncertainty-Aware Multi-Task Learning for Joint Modulation Recognition and SINR Estimation

Joint modulation recognition and signal-to-interference-plus-noise ratio (SINR) estimation can reduce duplicated processing in intelligent receivers, but the two tasks have different uncertainty characteristics. This letter proposes an uncertainty-aware multi-task model that transforms each short normalized in-phase/quadrature window into 36 deterministic, label-free statistics, learns a shared representation, and uses task-specific adapters for modulation classification and heteroscedastic SINR regression. A joint uncertainty score combines classification entropy and predicted regression variance to support selective inference. Simulations cover QPSK, 8PSK, 16QAM, and 64QAM under matched additive white Gaussian noise/Rayleigh channels and an unseen frequency-selective Rician channel. Over five independent seeds, the proposed model improves matched and unseen-channel accuracy over conventional multi-task learning by 14.86 and 8.61 percentage points, respectively, while reducing SINR mean absolute error by 1.60 and 1.61 dB. Confidence-based rejection further lowers modulation error under channel mismatch.
Read the full abstract

Signal Processing

OHL-Assisted All-Optical Regenerative Relaying for Pointing-Impaired M-PAM Inter-Satellite Links

Rapid inter-satellite traffic growth in LEO constellations demands spectrally efficient, low-latency optical relaying. While amplify and forward (AF) relays are latency-efficient, they propagate noise; conversely, decode and forward (DF) relays suppress noise but incur significant complexity via O/E/O conversion. This paper proposes an all-optical regenerative relay for M-ary pulse amplitude modulation (M-PAM) multi-hop links under pointing errors. A parallel optical hard-limiter (OHL) bank performs symbol-level discrimination, regenerating signal levels directly in the optical domain. A variable gain EDFA is employed to stabilize power and define the threshold-stable region. By incorporating pointing-induced fading, various noise sources including ASE-ASE and signal-ASE beat noise and implementation-dependent decision noise, we derive closed-form per-hop symbol error rate (SER) expressions. These are extended to end-to-end performance using a Markov transition-matrix model for arbitrary modulation order and hop count. Analysis of beamwidth, pointing accuracy, and threshold scaling demonstrates reliable multi-hop operation, avoiding both AF noise accumulation and DF O/E/O processing overhead. Verified by Monte Carlo simulations and numerical integration, this framework provides a design benchmark for low-latency, pointing-aware all-optical regenerative relaying.
Read the full abstract

All authors Meysam Ghanbari, Mohammad Taghi Dabiri, Zain Ali, Rula Ammuri, Mazen Hasna, Iman Tavakkolnia, Khalid Qaraqe

Rings and Algebras

Spaces of triangularizable matrices (III): Perfect non-quadratically closed fields with characteristic 2

Given a field $\mathbb{F}$ and an integer $n \geq 2$, denote by $t_n(\mathbb{F})$ the greatest possible dimension for a vector space of $n$-by-$n$ matrices over $\mathbb{F}$ in which every element is triangularizable. It was recently proved that $t_n(\mathbb{F})=\frac{n(n+1)}{2}$ if and only if $\mathbb{F}$ is not quadratically closed, with the possible exception of finite fields with characteristic $2$ and less than $n-1$ elements. In this article, we prove that the equality $t_n(\mathbb{F})=\frac{n(n+1)}{2}$ holds for all perfect non-quadratically closed fields with characteristic $2$ – with the possible exception of fields with cardinality $2$ – and for these fields we obtain a key result for a future analysis of the spaces that have the critical dimension $t_n(\mathbb{F})$.
Read the full abstract

Quantum Gases

Regularization of Vortex Core Size in Photon BECs due to Harmonic Trap: An Analytical Approach

Quantized vortices are a hallmark of superfluidity. However, in a photon Bose–Einstein condensate, the photon-photon interaction is so weak that in a homogeneous system the healing length exceeds the experimentally achievable size of the condensate itself. Here we show that a harmonic confinement regularizes the vortex size to experimentally achievable scales. Moreover, such an external confinement closely resembles the standard experimental setup of a pumped dye-filled microcavity. We model the condensate via a complex Gross–Pitaevskii equation and obtain an approximate dynamical single-vortex solution by applying the recently proposed projection optimization method. The latter generalizes the variational approach of closed systems to open-dissipative systems without assuming a specific form for the condensate phase. The radial photon flow, which is characteristic for driven-dissipative systems, yields a definition of the vortex core size based on the competition of gain and loss. However, this condition reproduces the heuristic closed system definition now based on physical grounds. A subsequent linear stability analysis shows that interaction, as well as pumping and loss can drive the system to an unstable regime. In this way one can fundamentally distinguish between closed and open-dissipative systems.
Read the full abstract

All authors Joshua Krauß, Tabitha Bates, Francisco Ednilson Alves dos Santos, Axel Pelster

Materials Science

Engineering Excitons through Polymorphism and Dimensional Confinement in Low-Dimensional Tellurium

The interplay between dimensionality, band-edge electronic structure, and electron-hole interactions governs the optical response of low-dimensional tellurium, yet the microscopic origin of its excitonic behavior remains largely unexplored. Here, we investigate the quasiparticle, excitonic, and optical properties of two-dimensional tellurium polymorphs and one-dimensional helical nanowires using many-body GW and the Bethe–Salpeter equation. Our results reveal a strong dependence of the excitonic response on band-edge dispersion, crystal symmetry, and dimensional confinement. $\alpha$-tellurene exhibits comparatively weak and spatially extended electron-hole correlations, whereas the SOC-induced quasi-flat band-edge states of $\beta$-tellurene give rise to a strongly bound and anisotropic near-infrared exciton. Momentum-resolved BSE eigenvectors and real-space exciton wave functions directly reveal the contrasting localization and anisotropy of these excitonic states. Remarkably, hydrogen-passivated hexagonal tellurene, previously identified as a quantum spin Hall phase with $Z_2=1$, supports an even larger direct exciton binding energy of 0.51 eV together with a compact and nearly isotropic in-plane excitonic distribution. This demonstrates that strong electron-hole correlations are fully compatible with nontrivial band topology, while the binding strength and spatial character of the exciton remain strongly dependent on the underlying band-edge electronic structure and crystal symmetry. The one-dimensional helical nanowire represents the strong-confinement limit, exhibiting a direct high exciton binding energy and a pronounced shift of the optical response toward the ultraviolet.
Read the full abstract

Computation and Language

Latent-Space Intervention for Cross-Lingual Factual Consistency: Consistency Improvements without Accuracy Drops

Large Language Models (LLMs) often answer the same factual question differently across languages. We study whether cross-lingual latent-space intervention can reduce this inconsistency. We train layer-specific autoencoders on parallel multilingual representations and apply inference-time corrections to factual QA prompts. We find that latent intervention improves geometric alignment between languages, and that this improvement translates into consistent gains in cross-lingual consistency with English across both open-ended and multiple-choice QA formats, without degrading factual accuracy. In open-ended QA, Spearman's rank correlation between English and non-English languages improves substantially, with gains of 0.16 for English-Arabic and 0.20 for English-Russian pairs. In multiple-choice QA, answer agreement with English improves consistently across both KLAR and mParaRel. Ablations show that AE reconstruction yields consistent gains at no accuracy cost, while PCA projection contributes marginally, and mean-shift produces substantially larger consistency gains in open-ended QA at the cost of some accuracy.
Read the full abstract

All authors Faeze Ghorbanpour, Constanza Fierro, Alexander Fraser, Anders Søgaard

Machine Learning

The Halt Vector: Internalizing a Causal Steering Intervention for Efficient Reasoning

Reasoning models do not stop when they know the answer. On DeepSeek-R1-Distill-Qwen-7B the chain of thought runs about twice as long as the model's own answer probability takes to settle, and how much of that excess is removable varies from problem to problem, so a global length penalty cannot take it out. We take it out by internalizing a causal interpretability finding into the weights. The mechanism is a halt vector: a difference-of-means direction at layer 18 of this model whose steering strength controls how long it thinks, while a replicated value axis does nothing. Installing that intervention in the weights is harder than it looks. Maximizing the scalar projection onto the direction corrupts the off-axis dimensions a frozen downstream reader depends on, and generation gets longer instead of shorter; what works is reconstructing the whole steered activation with those dimensions pinned to their natural values. Fit from 24 problems and no reinforcement learning, the halt removes about a quarter of the thinking at held accuracy across five unseen benchmarks, and the cut tracks each problem's own removable slack at 0.70. It also closes a non-termination pathology that grows with difficulty and that a decoding-time confidence hook makes worse. We do not claim to beat a well-tuned length penalty or decoding-time early exit on the raw trade-off; the contribution is how the halt is obtained.
Read the full abstract

Instrumentation and Methods for Astrophysics

96 kHz on-sky imaging on an adaptive optics system with a single-photon avalanche diode

Astronomical observations requiring extremely high angular resolution necessitate advanced adaptive optics (AO) systems to overcome blurring caused by the atmosphere. In addition to obtaining much sharper point-spread functions (PSFs) with these systems, it is beneficial to be able to characterize the behaviour of the resulting PSF across time and wavelength. We have installed a commercially-available Single-photon avalanche diode (SPAD) array on the focal plane of the REVOLT AO testbench at the Dominion Astrophysical Observatory, allowing us to observe the visible PSF of the system at rates up to 96 kHz. This provides a time-resolved view of the PSF at $\sim$100 times the frequency of the AO system itself. We use this detector to analyze the high-frequency behaviour of the PSF of the AO system, including residual tip/tilt and deformable mirror response. We also explore the performance of AO-assisted lucky imaging, in which we average together only the frames which result in the best image quality. We find that high-framerate imaging can significantly improve the PSF beyond the native capabilities of the AO system.
Read the full abstract

All authors Theodore A. Grosson, Maaike A. M. van Kooten, Kathryn Jackson, Jean-Pierre Veran, Simon Carrier

Instrumentation and Methods for Astrophysics

Exploring the trade-space of distributed aperture telescopes for faint-object spectroscopy

Scientific programs targeting the faintest objects push modern telescopes to increasingly large sizes, high costs and complex designs. Obtaining spectra of low surface brightness galaxies, for example, requires hours of observations on state-of-the art instruments. Increasing telescope diameters beyond 40 m raises potentially insurmountable challenges for design and funding. An innovative strategy for combating these costs is to use many small telescopes in place of a single large aperture. For observations in which high angular resolution is not necessary, this can be equivalent to a large diameter telescope in terms of sensitivity, while diffraction limited by the individual aperture. Improvements in commercial off-the-shelf (COTS) components have made this concept a possibility, as demonstrated by instruments such as the Dragonfly Telephoto Array, the Huntsman Telescope, and the Argus Array. In this work, we discuss the merits of "distributed aperture telescopes" as applied to the use case of spectroscopic observations of ultra-diffuse galaxies (UDGs). We compare the cost and simulated scientific performance of different configurations of apertures, detectors, and other components for this purpose, finding that an array of half-metre telescopes can obtain comparable observations to large telescopes for a fraction of the cost. Finally, we discuss the path to prototyping an array which will enable a spectroscopic survey of UDGs.
Read the full abstract

Commutative Algebra

Homological dimensions of derived Hom complexes

Let R be a commutative noetherian local ring and M and N be R-complexes with finitely generated homology. We prove that formulas for the homological dimensions of the derived Hom complex RHom(M,N), in terms of the homological dimensions of M and N, hold without the a priori assumptions on the dimensions of M or N present in classic results.
Read the full abstract

Superconductivity

Superconductivity and Magnetism in Bi-Ni System: From Bulk to Heterostructures

Unconventional superconductivity with ingredients of magnetism such as time reversal breaking, triplet pairing and proximity effects has been a long time pursued topic in physics and material science as a new source of innovative phenomena and effects to drive further scientific advances and technologies. The Bi-Ni system has emerged as a convenient candidate for the investigation of such phenomenology. Strictly speaking, the term Bi-Ni system refers to two different schemes, first to the NiBi$_{3}$ intermetallic compound, a 4 K superconductor in which a complex magnetism seems to govern electrical properties in the normal phase, but without implication in the superconducting properties. The second Bi-Ni system is not quite a material but a heterostructure formed by a bilayer of Bi and Ni. Here the superconducting phase has to steal the spotlight by showing strong evidence of time-reversal breaking and triplet pairing featuring a complex unconventional state. The ease of preparing the samples, compared to other candidates for such unconventionality, usually Uranium-based compounds, has accelerated the research in this system. Here, we went through a detailed review of the main results about the electronic properties of these two systems as well as a discussion of the main open questions to be solved in order to reach the complete understanding in this topic.
Read the full abstract

Systems and Control

Designing, Deployment and Field Testing of C2Stack for Networked Intelligent Software-Defined UAVs

Unmanned Aerial Vehicles (UAVs) are emerging as critical enablers of next-generation wireless networking and autonomous systems. Despite their potential, deploying and testing networked UAV systems in real-world environments remains challenging, largely due to the absence of well-developed, end-to-end, ready-to-use protocol stacks. To fill this gap, we present C2Stack, a configurable protocol stack and experimental framework designed for real-time control, evaluation, and optimization of UAV networks. C2Stack incorporates a modular control plane, referred to as the~C2Stack Network Operating System (CNOS), alongside a programmable data plane that exposes APIs for cross-layer algorithm development, digital twin integration, and autonomous swarm control. In this article, we share our experience with the deployment and testing of C2Stack. We implemented C2Stack on a custom UAV swarm platform that integrates multiprocessor system-on-chip (MPSoC) radios with Intel NUC computing modules, enabling interoperability with various RF front ends. Field trials were conducted in both netted environments and large-scale outdoor test ranges, focusing on two representative use cases: (i) network utility maximization through online reinforcement learning, and (ii) collaborative interference source localization. The experiments demonstrate the feasibility of real-time, data-driven optimization in dynamic aerial environments, while also revealing practical challenges in field deployments of networked UAV systems, including power constraints, sensing limitations, and deployment logistics. We have made C2Stack source code available to the community under the MIT License, with the goal of establishing it as a foundational framework for experimental research on intelligent networked aerial systems.
Read the full abstract

All authors Maxwell McManus, Zhaoxi Zhang, Sidharth Santhi Nivas, Yuqing Cui, Prem Sagar Pattanshetty Vasanth Kumar, Chenzhi Zhao, Nicholas Mastronarde, George Sklivanitis, Dimitris Pados, Elizabeth Serena Bentley, Zhangyu Guan

Machine Learning

Equivariant Sheaf Neural Networks: Learning Geometric Transport on Graphs

Equivariant graph neural networks provide a principled way to model geometric systems, but efficient first-order architectures remain limited in how vector information can be transformed as it moves across a graph. We introduce ESNN, an Equivariant Sheaf Neural Network that enriches this interaction by learning directed, matrix-valued transport between neighboring vector features while preserving exact Euclidean equivariance. Rather than increasing the order of the representation, ESNN keeps scalar and vector features first-order and places the additional geometric flexibility in the edge transport itself. We characterize this transport theoretically, showing that when relative displacement is the only covariant geometric input, every linear $O(n)$-equivariant map decomposes into independent radial and tangential components, while learned covariant features enable richer feature-conditioned transformations. We also introduce controlled symmetry relaxation for systems with a preferred ambient direction, which may be prescribed or inferred from data while recovering full $E(n)$-equivariance when the directional pathway is inactive. Across particle dynamics, mesh-based simulation, point-cloud classification, and molecular property prediction, ESNN improves dynamics prediction, recovers the gravity axis when symmetry is broken, yields substantial gains on selected mesh tasks and long-horizon rollouts, and remains robust to unseen rotations. These results show that learning how geometric information is transported across edges offers a complementary route to expressive equivariant message passing without requiring higher-order representations.
Read the full abstract

All authors Alessio Borgi, Mario Severino, Fabrizio Silvestri, Pietro Liò

Statistical Methodology

A penalized logistic generalized regression estimator

Under a model-assisted framework, a penalized logistic generalized regression estimator is developed to estimate a finite population proportion from complex survey data and auxiliary data. The proposed estimator controls the impact of unnecessary auxiliary variables through a lasso or ridge penalty. A central limit theorem is derived for the penalized regression coefficients and for the penalized logistic generalized regression estimator. Through simulations, it is shown that including the penalty increases the efficiency of the estimator when the true model is sparse. An example using United States Forest Service data demonstrates the applicability of the estimator for surveys with many available auxiliary variables.
Read the full abstract

Sound

Evoking Harmony via Convolution

I show how to evoke the pitch-class content of a chord from an arbitrary source sound by convolving the source with an impulse response whose grains are one windowed sinusoid per pitch-class, across each octave of hearing range; while, at the same time, minimizing artifacts. A Csound user-defined opcode, chord_convolver, mixes a dry Dirac component into that response, and applies partitioned convolution once. I contrast the effect with a linear-frequency comb filter and with a generic constant-Q resonator bank, and I demonstrate musical use on a twilight field recording alongside the ruins of Chateau de Lagarde.
Read the full abstract

General Relativity and Quantum Cosmology

Stationary Rotating Geometries Associated with Nonsingular Pulsating Collapse

Since the first exact solutions of General Relativity (GR) were obtained, it became clear that the theory predicts a new class of compact objects: black holes. The Hawking–Penrose singularity theorems show that, under appropriate assumptions, gravitational collapse in GR leads to singular behavior. Motivated by the expectation that such regimes require physics beyond classical GR, effective approaches inspired by Loop Quantum Cosmology (LQC) and braneworld scenarios introduce high-density corrections. In this work we consider the static exterior geometry introduced by Gao, Lu, Shen, and Faraoni, associated with a comoving interior model in which the singularity is avoided through a sequence of collapse and bounce phases. Using the Newman–Janis algorithm in the Azreg-Aïnou formulation, we construct a stationary rotating exterior extension of this geometry. The resulting line element describes a stationary axisymmetric rotating spacetime whose horizon geometry, angular velocity, surface gravity, and Hawking temperature recover the Kerr and Schwarzschild limits when the quantum/braneworld correction becomes negligible ($l\to 0$). We further analyze the thermal response at fixed rotational state-space parameter, identify Davies-type singular points, and formulate an extended thermodynamic state-space relation.
Read the full abstract

Genomics

Confounder-Aware Feature Correction for Single-Cell Batch Integration

Batch integration is a central preprocessing step in single-cell genomics, where datasets collected across experiments, donors, and protocols must be combined despite pervasive technical batch effects. The leading integration methods produce a shared low-dimensional embedding, which discards the corrected gene-expression values that downstream differential-expression, biomarker, and other analyses depend on. The feature-space (expression-correcting) methods that do preserve genes typically align the marginal expression distributions of batches and thereby risk erasing genuine biological variation whenever cell-type composition differs across batches, i.e. whenever batch effect and biological signal are confounded. We recast single-cell batch integration as confounded domain adaptation and apply ConDo, a method that matches conditional expression distributions given the cell-type annotation rather than marginal distributions. To extend ConDo's pairwise source-to-target adapter to the many-batch setting, we introduce an agglomerative compatibility-graph integrator: batches are nodes connected when they share a cell type, and we greedily merge each best-scoring neighbor into a growing reference by fitting one ConDo adapter. On the Open Problems Batch Integration Benchmark, ConDo is the strongest feature-space integrator, ranking first among feature methods on five of six datasets. Furthermore, it is competitive with or better than deep embedding methods on the overall score, ranking first across all methods on four of six datasets while returning corrected expression rather than an opaque embedding.
Read the full abstract

Superconductivity

Direct Evidence of Unconventional Superconductivity in Doped Kagome system RV$_3$Sb$_5$

The superconducting pairing symmetry of kagome metals remains a central unresolved question largely because phase-sensitive experiments capable of distinguishing between different possible order parameters have been difficult to implement. The spatial and energetic characteristics of impurity bound states measured by spectroscopic-imaging scanning tunneling microscopy encode information on the superconducting order parameter. Here, we use impurity-bound state spectroscopy to investigate optimally doped RbV$_3$Sb$_{5}$ where the charge-density wave instability is fully suppressed. We find that the superconducting state is fully gapped and exhibits two distinct energy scales, consistent with a multiband order parameter. Atomic-scale spectroscopy around nonmagnetic defects reveals pronounced particle-hole asymmetric bound states. Comparison with theoretical calculations demonstrates that these bound states are incompatible with conventional $s$-wave and sign-changing $s^{\pm}$ pairing. Our calculations also show that the data are fully consistent with a chiral order parameter. Our results establish impurity-bound-state spectroscopy as a powerful phase-sensitive probe of superconductivity in kagome materials and provide strong evidence that optimally doped RbV$_3$Sb$_{5}$ realizes a fully gapped chiral superconducting state.
Read the full abstract

All authors Avior Almoalem, Yuqing Xing, Iksu Jang, Daniel J. Schultz, Grgur Palle, Andrea N. Capa Salinas, Stephen D. Wilson, Rafael M. Fernandes, Jörg Schmalian, Vidya Madhavan

Medical Physics

A Reconfigurable Pipelined-SAR ADC with Embedded Compression for Temporal Compressed-Sensing Ultrasound Imaging

Compact ultrasound imaging systems are increasingly constrained by receiver-side sampling, conversion, memory, and data-transfer requirements. This work presents a compressed-sensing pipelined successive-approximation-register analog-to-digital converter (CS-SAR ADC) for acquisition-side temporal compression of pre-beamformed medical ultrasound radio-frequency (RF) data. Pseudo-random polarity modulation and charge-domain accumulation are embedded in the SAR sampling network so that multiple consecutive RF samples are encoded into one measurement before quantization, supporting temporal compression ratios of $N_{cT}=1$, 2, and 4. The compressed outputs are recovered off chip using a probe-specific pulse-dictionary RF model and then processed with conventional ultrasound beamforming. A 65-nm CMOS prototype was measured with a 1.2-V supply and 50-MHz master clock. In the non-compressed mode, it operates at 10 MS/s, consumes 964.49~$\mu$W, and achieves 44.12-dB SNDR and 56.40-dB SFDR for a 7.7-kHz input. The ADC output rates decrease to 5 MS/s and 2.5 MS/s for $N_{cT}=2$ and 4. Across all evaluated RF traces, median NCC values were 0.981 and 0.932, with median NRMSE values of 0.36 and 0.56, respectively. Wire-phantom localization error remained below 0.04 mm with no appreciable FWHM degradation. In the speckle-rich cyst phantom, SSIM remained 0.94 and 0.87, while CNR decreased from 3.534 in the reference to 2.047 and 1.379. These results demonstrate a hardware-realistic tradeoff in which temporal compression substantially reduces ADC conversion count and output data rate while preserving point-target geometry, whereas low-contrast cyst conspicuity is more compression-sensitive.
Read the full abstract

All authors Reza Pakdaman Zangabad, Xitie Zhang, Levent Degertekin, Shaolan Li

Computation and Language

A rigor-matched audit of periodic-step layer skipping for efficient llm inference: conflayers versus swift, with a supplemental analysis of trained routing alternatives

Layer-skipping methods for efficient LLM inference decide, at some granularity, which transformer layers to execute for a given input. We present a rigor-matched, three-seed audit of two periodic-step, search-based methods that make this decision online at inference time and re-evaluate it every few generation steps: a confidence-gated early-exit baseline (ConfLayers) and genuine self-speculative decoding (SWIFT, Xia et al. 2024), together with vanilla autoregressive decoding, across Qwen2.5-0.5B and Qwen2.5-1.5B (Yang et al. 2024) on GSM8K (Cobbe et al. 2021) and CNN/DailyMail (Nallapati et al. 2016; See et al. 2017). SWIFT is strongest on accuracy in three of four cells, while ConfLayers is dominated everywhere, with particularly large deficits on GSM8K at 1.5B. Separating online-search overhead from pure inference cost, we find that SWIFT's true inference speed is faster than ConfLayers's in all four cells (5-21%), reversing the naive wall-clock ranking in three; ConfLayers's search overhead is small and stable (1-2% of cost), whereas SWIFT's is larger and more variable across seeds (up to 28.7%). We additionally examine two trained routing methods, LayerRoute (Sikdar, 2026), a per-sequence, input-conditioned hard gate, and LayerDrop (Fan et al. 2020), a fixed, input-independent pruning pattern, as a supplemental analysis rather than a head-to-head comparison because both operate at a coarser decision granularity. Under a verified protocol with genuine per-input gating, a genuine full-model baseline, and genuine inference-time compute skipping, both show modest real speedups (1.08-1.33x) but accuracy well below the periodic-step methods, including near-total LayerRoute collapse on GSM8K at 1.5B (0.003 mean exact-match across three seeds). We release the full audit protocol as a template for rigor-matched efficiency comparisons.
Read the full abstract

Dynamical Systems

Shadowing and inverse shadowing in spaces retractable onto graphs

In this paper, we show that shadowing and inverse shadowing are generic properties for spaces in which there exists an $\varepsilon$-retraction onto a graph for any $\varepsilon>0$.

Human-Computer Interaction

Toward Postural State Classification in Immersive VR with Multimodal Data and Explainability Analysis

Ensuring a safe virtual reality (VR) experience requires systems that can predict and respond when users lose their balance. Although prior work has examined fall prediction and motion sickness, many approaches are regression-based and postural state classification remains less explored. This study compares machine learning (ML) and deep learning (DL) models for classifying postural states in VR under visual perturbations. We used a multimodal dataset containing kinematic, electromyographic (EMG), and electrodermal activity (EDA) signals. The data were prepared for a binary task to distinguish balanced from imbalanced postural states, and participant-wise downsampling addressed class imbalance. All models were evaluated with Leave-One-Participant-Out (LOPO) cross-validation to test generalization to unseen participants. Among the models, the Mamba-inspired CNN (MI-CNN) achieved the highest accuracy of 96.76%. SHapley Additive exPlanations (SHAP) analysis improved interpretability and identified the most influential classification factors. The SHAP results showed that kinematic features were dominant, indicating that body-motion patterns are informative for detecting imbalance in VR. We also evaluated MI-CNN using only the top two-thirds of features ranked by SHAP importance. Despite a 33% reduction in input dimensionality, the model maintained performance, achieving 0.957 accuracy and 0.957 F1-score, with about a 1% decrease compared with the full-feature model. These findings suggest that multimodal sensing, temporal deep learning, and explainable AI can support reliable classification of balance-related instability in VR. Accurate recognition of imbalanced postural states may raise awareness of fall risk and guide safer, adaptive VR systems that respond to instability while improving user safety and experience. Code is available at: https://github.com/NipaAnjum/MI-CNN.
Read the full abstract

All authors Nipa Anjum, Md Irfan Pavel, Robert Gonzalez Jr, Kevin Desai, Alberto Cordova, M. Rasel Mahmud, John Quarles

Machine Learning

Curvature Cryptanalysis of Smooth Transformer Feed-Forward Networks

We show that smooth two-layer feed-forward networks (FFNs) expose an additional structural model extraction channel under a chosen-input raw-output oracle at the FFN branch; consider transformer FFN branches with GELU or SiLU activations under chosen-input raw-output access, without access to parameters, gradients, or internal activations; exploit a second-order leakage channel in which projected input Hessians form different mixtures of the same hidden symmetric rank-one factors induced by the FFN input weights. We formalize resulting Hessian collection as a partially symmetric decomposition to establish conditions for local identifiability and stability to exploit vector-output stencil reuse to reduce the structural query cost by a factor of 16. On independently trained CIFAR-10 vision transformers, only 16 projected Hessians, corresponding to 8193 black-box queries, recover the hidden FFN directions with average absolute cosine alignment above 0.91, with 86.7.1 % of GELU and 91.1 % of SiLU directions exceeding 0.90 alignment. Recovery remains high across independently trained models, repeated extraction runs, and all transformer blocks. The recovered structure supports functional extraction too. Keeping the recovered directions fixed and fitting only the remaining FFN parameters yields high-fidelity substitutes with more than 92 % top-1 agreement, while test accuracy remains within 1.24% and 0.57% of the GELU and SiLU targets. Output rounding and Gaussian noise substantially reduce recovery under a fixed attack configuration, but adapting the finite-difference step restores average alignment to 0.9188 and 0.9081. This is an end-to-end path from black-box second-order observations to hidden FFN-structure recovery and functional replacement. Under the stated oracle model, smooth FFN curvature exposes internal parameter geometry that behavioral fidelity alone cannot reveal.
Read the full abstract

Quantum Physics

Quantum Preconditioning For Constrained Optimization Problems

We study the effect of quantum preconditioning on constrained combinatorial optimization problems, focusing on balanced graph bi-partitioning. The proposed approach uses two-point correlations between decision variables derived from the Quantum Approximate Optimization Algorithm (QAOA) to construct a modified objective function that is subsequently provided to mixed-integer programming (MIP) solvers. The preconditioned MIP formulation retains the original hard constraint, and all incumbent solutions are evaluated under the original objective. Computational experiments on dense, weighted complete-graph instances show that the preconditioned problem instances reach near-optimal solutions faster, with most of the benefit already realized at the shallowest QAOA depth tested. Solver callback trajectories show this arises from earlier discovery of high-quality incumbents during the solution search. These results support a hybrid optimization framework in which quantum algorithms provide problem-specific information to guide classical exact MIP solvers.
Read the full abstract

All authors Anurag Ramesh, Bhuvanesh Sundar, Maxime Dupont, David E. Bernal Neira

Atomic Physics

Estimating the ground-state hyperfine shifts of group-1 atoms due to long-range collisions, static electric fields, and nearby surfaces

Many interactions perturb (or shift) the hyperfine coupling in group-1 atoms between their nuclear spin and single valence electron. Previous work provided an approach to estimate this shift for non-reactive collisions with other atoms or molecules at long range, and extended it to estimate the shift from static electric fields. We further extend this approach to estimate the shift due to a nearby conductive surface, and improve all these estimates by numerically computing updated values for the characteristic energies they use. We investigate how to estimate these energies by scaling arguments, and suggest how to adapt the approach to other applications. The results are relevant to pressure shifts in vapor cells, Stark shifts, and wall shifts in nanoscale devices.
Read the full abstract

All authors B. H. McGuyer, K. Choksi, N. VonHeeder, B. A. Olsen

Machine Learning

Unsupervised Latent Space Alignment with Hyperspherical Geodesic Matching

Independently trained neural networks tend to encode the same data with similar latent geometries. These latent geometries are not directly compatible, yet they can be nearly the same up to some class of transformations. While there exists many methods for alignment between different latent spaces, it is typically done using a set of shared sample correspondences, known as anchors. This leaves a fundamental question: are the geometric signatures of different latent spaces representing similar data sufficient to recover an alignment between them? To that end, we introduce HGA (Hyperspherical Gaussian Alignment), a method that directly optimizes a transformation between two latent spaces by maximizing a geometric measure of "fit" between them. Since it is driven by the geometry of the latent spaces rather than paired data, HGA can operate in both an unsupervised and weakly supervised regime. On tasks such as model stitching or multilingual word embedding correspondence recovery, HGA manages to match supervised results with minimal or no supervision.
Read the full abstract

All authors Cameron Ryan, Vivek Sivaraman Narayanaswamy, Kowshik Thopalli, Shusen Liu