Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

High Energy Astrophysical Phenomena

One Precessing Jet Pair, Diverse Core-Collapse Supernova Remnant Morphologies

We produce a diverse set of observed core-collapse supernova (CCSN)-type morphologies using a precessing pair of opposite jets within the jittering-jets explosion mechanism (JJEM) framework. We conduct a three-dimensional hydrodynamical simulation of a precessing pair of jets that explode a massive star, and find that a single precessing pair of opposite jets can generate S-shaped structures, pipe-spout-blowout features as observed in the Cygnus Loop, multiple apparent pairs of opposite protrusions similar to some morphological features in S147, and H-shaped structures with a prominent bar, similar to the one observed in the 3C 397 remnant. At small scales, the jets form clumps and filaments, resulting from instabilities and vortices that the jets induce in the ejecta as they interact with the stellar material. We did not aim the simulation to reproduce any particular CCSN remnant, but rather to explore the resulting morphological features. Our finding of simulated features similar to observed ones supports the role of jets in exploding CCSNe and, in turn, supports the claim that the JJEM is the primary explosion mechanism of CCSNe.
Read the full abstract

Plasma Physics

Physics-Informed Neural Networks to Infer the Perpendicular Energy Conductivity in the Scrape-Off Layer of Stellarator Devices

In this work, we develop an inverse Physics-Informed Neural Network (PINN) framework to infer the dependence of the scrape-off layer (SOL) perpendicular heat conductivity on plasma density and temperature, $\kappa_\perp(n,T)$. The method combines radial profile measurements of electron density and temperature with the residual of a reduced one-dimensional SOL transport equation, so that the inferred conductivity is constrained by both the measurements and the underlying transport model. Three neural networks are trained simultaneously: two reconstruct the temperature and density profiles as functions of the radial coordinate and transported power, while a third represents the effective conductivity as a function of the local density and temperature. The framework is first validated using synthetic data generated from a prescribed conductivity function, allowing the inferred $\kappa_\perp(n,T)$ to be compared directly with the ground truth. The model recovers the imposed functional dependence with errors below $10~\%$ in the data-constrained region. Bootstrap resampling is shown to provide a practical indicator of prediction reliability and consistency. A scan in the number of plasma profiles used for training and the number of radial measurement positions per profile identifies a practical trade-off between reconstruction accuracy and data availability. Finally, the method is applied to an experimental dataset from the TJ-II stellarator obtained with the helium-beam diagnostic. This exploratory application provides an initial estimate of the effective SOL conductivity and illustrates the potential of inverse PINNs for extracting transport information from plasma edge measurements.
Read the full abstract

All authors J. Gallego, P. Protopapas, A. Bustos, A. Alonso, S. Barquero, A. Baciero, I. Rivera, J. A. Moríñigo, R. Mayo-García

Dynamical Systems

Bounded vertical deviations and irrational circle factors in Dehn Twist classes

We prove that a homeomorphism of the two-torus in a Dehn twist homotopy class is a topological extension of an irrational circle rotation if and only if its vertical rotation set reduces to a single irrational number and the homeomorphism exhibits uniformly bounded rotational deviations in the vertical direction. This result has been previously obtained by the second author under an additional hypothesis about the geometry of the non-wandering set. We show that this hypothesis can be entirely dropped: the large-scale shear intrinsic to a Dehn twist eliminates the obstructions coming from the wandering set, which cannot be removed in the homotopy class of the identity. Finally, we prove that the factor is unique up to a circle rotation and is locally constant on the wandering set. Consequently, every connected component of the wandering set is contained in a single fiber, is itself a wandering domain and is either inessential or annular.
Read the full abstract

Analysis of PDEs

Solvability of the \(\mathrm L^2\) Dirichlet problem for parabolic operators with spatially periodic coefficients

We prove global reverse Hölder estimates in \(\mathrm L^2\) for the Poisson kernel of scalar divergence-form parabolic operators in the upper half-space. The coefficient matrix is real, symmetric, and periodic in every spatial variable \(X=(\lambda,x)\), while no periodicity in time is assumed. If its boundary trace \(A^0=A^0(x,t)\) has a quantitative uniform modulus of continuity in time and its convergence to \(A^0\) in the transverse variable is controlled by a square-Dini modulus, then the Poisson kernel satisfies a uniform \(\mathrm{RH}_2\) estimate at scales below the period. Full spatial periodicity is then used to propagate this estimate to every scale. The main new ingredient in the large-scale argument is a positive adjoint height coordinate \(\Phi^*=\lambda+O(1)\). Boundary comparison with \(\Phi^*\) yields the required large-scale decay of the Green function and hence the global \(\mathrm{RH}_2\) estimate. Consequently, the \(\mathrm L^2\) Dirichlet problem is uniquely solvable among weak solutions \(u\) satisfying \(N_\ast u\in\mathrm L^2\). We also establish, for fully spatially periodic coefficients, a nonsymmetric \(A_\infty\) theorem under square-Dini convergence to a transverse-independent boundary trace, with no temporal regularity beyond measurability. We explain how the results transfer to time-independent Lipschitz graph domains under the stated coefficient and periodicity-compatibility hypotheses, and we derive scale-uniform boundary estimates for the periodic homogenization families considered below. The condition \(D_t^{1/2}A^0\in\mathrm L^\infty_x(\mathrm{BMO}_t)\) provides a natural sufficient criterion for the temporal continuity required in the symmetric theorem.
Read the full abstract

Differential Geometry

Spectral complexes and currents on the Engel group

We study the spectral complexes arising from the de Rham complex on the Engel group $G$ viewed as a truncated multicomplex. We describe the two resulting complexes, analyse their compactly supported counterparts, and define the corresponding spectral currents by duality. We prove that the smooth spectral complexes embed naturally into the current complexes. Finally, we show that the Pansu pullback of a $W_{\mathrm{loc}}^{1,q}$ map $\varphi\colon G\to G$ with $q>7$ induces a morphism into the corresponding complexes of spectral currents.
Read the full abstract

Statistical Methodology

Random Projection Tests via Cauchy Combination for Two-Sample Mean

High-dimensional two-sample mean testing is challenging when the dimension exceeds the sample size. The random projection method proposed by Lopes et al. (2011) addresses this difficulty by mapping the data to a lower dimension space where Hotelling's $T^2$ statistic can be applied, while retaining useful covariance information and gaining power when the variables exhibit non-negligible covariance structure. However, single projection tests may be sensitive to the realized projection matrix, whereas existing multiple projection procedures often rely on resampling or simulation for calibration, with limited theoretical understanding. Moreover, projection-based Hotelling tests may be less sensitive to sparse mean differences. To address these limitations, we propose a Cauchy-combined random projection test (CRPT), which applies Hotelling's $T^2$ test after multiple independent random projections and combines the projected $p$-values through the Cauchy transformation. The proposed method retains the ability of random projection methods to incorporate covariance information while reducing reliance on any single projection. Under the Gaussian assumption, we establish the null tail behavior of the proposed statistic and further investigate its asymptotic power under suitable alternatives. To improve sensitivity to sparse alternatives, we further develop a power-enhanced version of CRPT. Simulation studies and real data analysis are conducted to examine the performance and practical applicability of the proposed procedures.
Read the full abstract

All authors Yanyan Ouyang, Ruoxi Peng, Wangli Xu, Tao Qiu

Networking

Comparative Performance Analysis of OTFS and OFDM Modulations for Mobile Wireless Communications

This paper provides a quantitative performance comparison between Orthogonal Time Frequency Space (OTFS) and Orthogonal Frequency-Division Multiplexing (OFDM) modulation schemes, focusing on mobile wireless communication scenarios. We evaluate and compare both schemes based on critical communication scenarios and configurations such as mobility levels, modulation orders, multipath environments, and equalizers. The study systematically identifies conditions where OTFS and OFDM each exhibit optimal performance. Results from simulations demonstrate that OTFS outperforms OFDM consistently for high mobility scenarios and multipath environments. Depending on the modulation order, the performance gap between OTFS and OFDM might be very close or many orders of magnitude. Moreover, at low and mid values of SNR, the non-linear equalizer performs better than traditional linear equalizers for OTFS.
Read the full abstract

All authors J. Marcos Leal B. Filho, Danilo de S. Pena, Marília C. Muniz, Álvaro A. M. de Medeiros, Vicente A. de Sousa Jr

Quantum Algebra

Normalized quadratic extensions of pointed Hopf algebras

Let $L$ be a finite-dimensional pointed Hopf algebra over an algebraically closed field. We establish an intrinsic characterization of index-two extensions: every Hopf algebra $H$ containing $L$ as a Hopf subalgebra and satisfying $H_0=L_0$ and $\dim H=2\dim L$ is a normalized quadratic extension of $L$. For a fixed support $(g,h)$, such extensions are described by a coalgebra Hochschild $2$-cocycle together with Ore-type data $(\sigma,\delta,u,v)$ satisfying explicit compatibility conditions. Their isomorphism classes are parameterized by the orbits of gauge transformations and Hopf automorphisms of $L$. As an application, we classify non-connected pointed Hopf algebras of dimension $16$ in characteristic $2$ with one-dimensional infinitesimal braiding whose diagram is not a Nichols algebra.
Read the full abstract

Data Structures and Algorithms

A Reusable Framework for Robust Approximation Algorithms in the Interval Uncertainty Model

Robust optimization under interval uncertainty aims to compute solutions that perform well on a range of scenarios that are described by interval-constrained costs. In this paper, we revisit a framework introduced by Ganesh, Maggs and Panigrahi in 2020 to study the robust optimization of NP-hard problems under interval uncertainty. We start by generalizing a result in the $\ell=0$ case, which transforms a category of approximation algorithms into a robust approximation algorithm. Furthermore, in the general case, we provide a theorem that turns any local search-based approximation algorithm into a robust approximation algorithm under three newly formalized conditions over the moves of the local search algorithm. We then use this result to present the first robust approximation algorithm for Weighted $k$-Set Cover, the third NP-hard problem known to admit a robust approximation, and the first since the publication of Ganesh, Maggs and Panigrahi's paper.
Read the full abstract

Computation and Language

A Training-Free, Alignment-Free Approach to Corporate Intelligence: Application to SEC Filings

High-dimensional dense text embeddings and large language models face real obstacles in financial-disclosure analysis: context-window limits, hallucination risk, high computational cost, and the arbitrary rotation of vector spaces across independently trained models. We present a training-free, alignment-free framework for corporate intelligence built on deterministic sparse seed vectors. Hashing word strings into a fixed high-dimensional basis places all documents and all temporal epochs in a common coordinate system by construction, removing any need for training or alignment. Accumulating these seed vectors across sentence contexts yields corpus-specific semantic signatures that compose linearly, supporting sub-second document comparison, issuer fingerprinting, tracking of how an issuer's vocabulary shifts between filings, and thematic sentence extraction, all on ordinary CPU hardware. Demonstrating the approach on a multi-year corpus of SEC filings (10-K, 10-Q, 8-K), we show how material corporate events, among them Boeing's 737 MAX crisis, Intel's supply-chain disruptions, and Bunge's acquisition of Viterra, emerge as distinct, interpretable semantic profiles, each traceable to the exact source sentences that produced it, with no domain-specific training and no LLM inference.
Read the full abstract

Number Theory

Sharp unconditional moment bounds for products of L-functions

We investigate the mixed moments of products of irreducible $\mathrm{GL}(1)$ and $\mathrm{GL}(2)$ $L$-functions on the critical line, and establish sharp moment bounds for these quantities. In particular this establishes the order of these mixed moments in certain ranges. This determines unconditionally, for the first time, the order of magnitude of the first moment of cubic Dedekind zeta functions with negative discriminant. The proof of the lower bound introduces a new method for computing mixed moments, that is a mix of the classical method of Heath–Brown with the modern machinery of Harper, Heap, Radziwill, and Soundararajan.
Read the full abstract

Quantum Physics

Quantum models of interaction Hamiltonians and their paradoxes

In quantum physics it is commonplace to model the interaction of remote systems with a many-body Hamiltonian. Taking such an action-at-a-distance description à la lettre leads to various paradoxes related to faster-than-light communication and apparent inconsistencies in local energy accounting. It also neglects residual effects, such as entanglement between the remote systems and the mediator that implements the interaction, or the decoherence that arises when the remote systems undergo local evolution. We study simple microscopic quantum models that respect the light cone by design and reproduce two-body Hamiltonians. For these models we quantitatively analyze the residual effects of the microscopic mediator on the remote systems, including dressing of stationary states, and decoherence in the presence of fast local control. We show how the models resolve the paradoxes.
Read the full abstract

All authors Nicolas Gisin, Serge Massar, Jef Pauwels, Pavel Sekatski

High Energy Physics (Experiment)

Projected Sensitivity to Slow Muonphilic Dark Matter with Accelerator Muon Beams

The nature of dark matter (DM) remains one of the most enduring open questions in modern physics, and muonphilic DM has emerged as a promising scenario that complements traditional DM candidates. Following the recently established cosmic-ray muon scattering approach, we investigate the sensitivity for probing slow muonphilic DM with accelerator muon beams. A Geant4-based simulation framework is developed, incorporating the detector geometry from the PKMu muon tomography system and a dedicated elastic $\mu$-DM scattering process. The projected sensitivity is found to be largely insensitive to both the beam energy and the transverse beam size when the beam is fully contained within the detector acceptance. For a benchmark beam intensity of $10^5/\rm{s}$, the simulated pure-muon beam surpasses the existing cosmic-ray limit of $1.61\times10^{-17}$ cm$^2$ at $m_{\rm DM}=1$ GeV within approximately 11 seconds. A realistic muon beam phase-space distribution based on simulations for the High Intensity heavy-ion Accelerator Facility (HIAF) is also implemented, yielding projected limits that improve upon the cosmic-ray results by nearly two orders of magnitude in a one-day exposure. These results demonstrate that a beam-muon scattering experiment offers a robust and promising route toward significantly improved sensitivity to slow muonphilic DM.
Read the full abstract

All authors Rongfeng Zhang, Cheng-en Liu, Ruihu Zhu, Yu Xu, Zijian Wang, Leyun Gao, Xueheng Zhang, Qite Li, Liangwen Chen, Chen Zhou, Qiang Li, Zhiyu Sun

Computer Vision

LangStreet: Persistent Language Fields for Anchor-Decoded Street Gaussians

Language Gaussian fields implicitly assume that the primitive carrying semantics remains identifiable across views. This assumption breaks in scalable anchor-decoded representations, where persistent anchors generate view-conditioned child Gaussians whose geometry and appearance vary with the camera. We introduce Ours, a persistent language field for such structured Gaussian scenes. Our key idea is semantic ownership: transient children route observations, while persistent decoder slots and their parent anchors own the language field. We use alpha-compositing responsibilities to accumulate additive directional evidence at slots; these statistics marginalize exactly to anchors. We then complete weakly supported slots with anchor-aligned evidence while preserving the anchor direction, and represent slot detail through low-rank residuals in anchor-relative semantic coordinates. Our primary model, Ours (base), stores anchor features together with compact slot residuals. Ours (light) retains only anchor features, whereas Ours (max) stores the full-dimensional completed slot features explicitly. Without scene-specific semantic optimization, Ours (base) nearly matches Ours (max) across KITTI, Virtual KITTI, and Waymo. On KITTI, it achieves 34.19 2D mIoU with a 2.72 GiB effective feature footprint, compared with 34.20 mIoU and 12.90 GiB for Ours (max). The same accuracy-storage trend holds on Virtual KITTI and Waymo. These results show that language fields on view-conditioned splats require persistent semantic ownership, conserved evidence, and a hierarchy that balances stability, detail, and representation cost. Our code, checkpoints, and benchmark suite will be publicly available.
Read the full abstract

All authors Runyi Yang, Deheng Zhang, Xiaoye Wang, Mengjiao Ma, Lei Sun, Kanzhi Wu, Ajad Chhatkuli, Luc Van Gool, Danda Pani Paudel

Artificial Intelligence

Distributed Optimization of Modular Production Systems using Model-based Reinforcement Learning with Inverse Models

This paper presents a novel approach for data-driven self-learning control of highly flexible, modular manufacturing systems. Specifically, we employ a novel framework for model-based reinforcement learning which introduces approximate inverse process models within the training of reinforcement policies. This approach disentangles the learning of actuation dynamics and the dynamics in state space, resulting in RL-based training solely within the task space. We propose a lightweight feedforward architecture for approximate inverse models and integrate them within the policy network of standard RL algorithms. We apply the approach to a laboratory modular production testbed with heterogeneous production modules. The results underline the efficiency improvements for modular manufacturing units in terms of both performance and training speed, particularly for off-policy algorithms.
Read the full abstract

All authors Andreas Schwung, Steve Yuwono, Sofiene Lassoued, Dorothea Schwung

Trading and Market Microstructure

Deep Learning of Robust Market Making under Regime-Switching Order Flow

Classical market-making strategies based on stochastic control, such as the Avellaneda–Stoikov and the Guéant–Lehalle–Fernandez-Tapia (GLFT) extension, provide closed-form quoting approximations, but rest on assumptions that break down at realistic microstructure timescales. One of them is that order flow is stationary, while empirical evidence points to the existence of regimes, possibly associated with algorithmic execution of metaorders. In our experiments, persistent directional flow makes stationary controllers unprofitable. In this paper, we develop a deep reinforcement-learning market maker (RLMM)—a Rainbow-style distributional deep Q-network which is calibrated and tested in a zero-intelligence limit order book. We find that, in the stationary setting, RLMM outperforms GLFT at comparable levels of profit and loss (PnL) dispersion. The stationarily trained RLMM is more robust to flow asymmetry than GLFT, but still suffers inventory saturation and large drawdowns under persistent directional flow. Training a separate RLMM under regime-switching flow, with a Bayesian flow-belief signal and a queue-adjusted quote exposure signal, restores positive mean PnL in our experiments. A final scenario-bandit step prioritizes low-return scenarios and improves performance under varying regime persistence and directional correlation.
Read the full abstract

Cryptography and Security

PHAT: PHotonic Accelerator for TFHE

Fully Homomorphic Encryption (FHE) enables secure computation on encrypted data, making it a promising solution for privacy-preserving applications in the cloud. Among various FHE schemes, FHE over the Torus (TFHE) stands out due to its support for arbitrary operations. However, its high computation and communication overhead, particularly in the Fast Fourier Transform (FFT) operations required during bootstrapping, limits its practicality for real-world applications. Conventional electronic accelerators struggle to achieve sufficient throughput due to the limitations of technology scaling and the memory-wall problem. To address these challenges, we propose PHAT, a PHotonic Accelerator for TFHE leveraging Optically-addressed Phase-Change Memory (OPCM). OPCM-based processing-in-memory systems offer high computation and communication throughput, making them well-suited for accelerating FFT operations in TFHE. However, directly mapping FFT to OPCM presents challenges such as high-precision analog computation and the high latency and energy cost of programming OPCM cells. To overcome these challenges, we introduce a novel electro-photonic accelerator architecture optimized for TFHE, featuring OPCM-based FFT units, a twiddle-stationary dataflow tailored for OPCM, and a scheduling mechanism to maximize the utilization of the FFT units. PHAT delivers $2.14\times$–$5.10\times$ speedup across four real-world TFHE workloads against the state-of-the-art ASIC accelerator. Our approach significantly enhances the performance of TFHE applications, paving the way for practical and efficient homomorphic encryption in cloud computing.
Read the full abstract

All authors Guowei Yang, Farbin Fayza, Beren Aydoğan, Carlos A. Ríos Ocampo, Ayse K. Coskun, Ajay Joshi

Complex Variables

Analytic Construction of Rational Curves on Fano Manifolds

Inspired by constructions of entire curves in Oka geometry, we construct rational curves on complex Fano manifolds analytically, by alternately deforming a holomorphic disk to reduce its area and enlarging its source. Positive Ricci curvature yields an area-decreasing deformation, while an affine-lift perturbation enlarges the source at a controlled area cost. The two operations change the area and the weighted derivative by amounts we estimate explicitly, and analytic compactness passes from the resulting disks to a holomorphic sphere. The main result produces a sphere that meets a prescribed compact fiber without being contained in it, with an explicit area bound.
Read the full abstract

Computers and Society

Who Bears the Risk When Generative AI Enters Transport? A Distributional Sociotechnical Audit of Algorithmic Equity, Synthetic-Data Validity, and Public Trust

Generative artificial intelligence is entering transportation through traveler-facing advisories, synthetic crash-record generation, and policy decision support. Existing governance frameworks lack transport-specific statistical tools to measure distributional risks across heterogeneous populations. We develop a Distributional Sociotechnical Audit (DSA) that integrates algorithmic equity, synthetic-data validity, and public-attitude heterogeneity into one empirical pipeline. The audit analyzes 5,760 persona-controlled queries to four LLM families across 12 demographic cues and four transport topics, uses two cross-family judges and a Wasserstein-2 Equity Dispersion Index, tests three FARS crash-record generators with conditional projected maximum mean discrepancy (cpMMD), fits a Bayesian ordered-logit model to Pew American Trends Panel Wave 152 (N = 4,538), and combines the signals into a continuous Sociotechnical Risk Index. Congestion-pricing advice has the highest persona-based dispersion (mean EDI = 1.96; highest direct EDI = 2.20). CART synthetic crash records fail all conditional tests (p < 0.001), while the Gaussian copula has borderline conditional stress (p = 0.105) despite passing marginal checks. Attitudes to AI vary across demographic strata. Distributional audits and continuous risk indices with sensitivity reporting offer a more defensible basis for transport GenAI governance than categorical approval tiers, which show a 75% assignment flip rate under weight perturbation.
Read the full abstract

Signal Processing

Multi-Threshold Sampling: Signal Space, Sampling Operators, and First Recorded Crossing-Time Distributions

Multi-threshold (MT) sampling records crossing times for parameter estimation and waveform reconstruction. We develop signal and observation spaces and stochastic crossing, timing, and selection operators with associated Markov kernels. Finite point measures accommodate variable crossing counts and preserve multiplicity after quantization. For nonhomogeneous Poisson photon arrivals with shared threshold noise, shared timing jitter before quantization, and identity selection, we derive exact first recorded crossing-time distributions. A Poisson series covers general admissible paths with a time-uniform truncation bound. For continuous paths, interval extrema give the exact cumulative distribution function (CDF) and a Fourier representation with contact corrections. A biexponential arrival-intensity and response model admits a two-dimensional first-crossing integral equation on arbitrary finite observation windows, with a unique bounded measurable solution and a Poisson-tail approximation bound. For continuous causal responses with finitely many analytic pieces and bounded first and second branch derivatives, we prove a conditional standard-deviation (SD) limit at first mean crossings with positive slope under relative threshold-noise and fine timing scales. For the biexponential model, its coefficient increases strictly on a parameter-uniform interval and, under a shape condition, up to the first mean peak. Scintillation experiments compare the calculated CDF and conditional SDs with independent waveform simulations on a window extending beyond the single-photon response peak.
Read the full abstract

High Energy Astrophysical Phenomena

Probing the details of relativistic electrons with multifrequency observations of M87 black hole

Beginning in March 2026, the Event Horizon Telescope (EHT) conducted a two-month observing campaign aimed at obtaining the first time-resolved sequence of images of the black hole M87* at the center of the Virgo A galaxy. The primary scientific objectives of this campaign are to constrain the black hole spin and to investigate the temporal variability of the magnetic field and plasma properties within the horizon-scale jet-launching region. In this work, we present theoretical predictions for the spectral index maps expected from these observations. Our predictions are based on Magnetically Arrested Disk simulations performed with the EBHLIGHT code and post-processed using the IPOLE general relativistic ray-tracing code. We investigate the temporal evolution of the spectral index for a range of electron distribution models and five different black hole spin values. The analysis includes both frequency bands currently present within the EHT and neighboring frequencies proposed for future extensions of the EHT array. In addition to extending previous studies to a broader range of observing frequencies, our work systematically investigates the time variability of the predicted spectral index maps. In purely thermal electron models, the temporal variability of the spectral index maps closely traces variations in the magnetic field strength and electron temperature in the immediate vicinity of the event horizon. By contrast, models incorporating a non-thermal electron population exhibit substantially weaker spectral index variability, owing to the contribution of a power-law component with a fixed spectral slope. Our numerical results are consistent with theoretical expectations. Finally, a comparison with the recently measured integrated spectral index of the M87* enables us to place preliminary constraints on the model parameters.
Read the full abstract

Statistics Theory

Dynamical Clustering and its Limiting Differential Equations

A novel, non-parametric clustering algorithm is developed, based on flows in the space of soft assignments $P_k^i$, representing the probability that point $x^i$ belongs to class $k$. These flows have two drivers: a nonlinear reaction component that relaxes $P$ to an evolving Bayesian-like posterior, and a diffusive component that relaxes $P$ to its local average, with a diffusivity $\nu$ that adapts dynamically so as to balance the two components. The methodology extends to semi-supervised classification, where a subset of the labels are known. In the limit of infinitely many observations, it yields a set of non-standard reaction-diffusion equations, which produces sharp boundaries between species that separate spontaneously into well-balanced domains. Including more than one diffusive network opens the way to a broader class of applications, including the detection of regime changes in time series and a clustering procedure based on numerous features that defeats the curse of dimensionality. In the continuous limit, this extension results in a novel, non-local class of diffusive operators.
Read the full abstract

Artificial Intelligence

Making Alternative Data Work: Context-Augmented LLMs for Financial Forecasting

When forecasting a firm's future financial performance, alternative data - data collected from non-traditional sources such as consumer transactions, web traffic, and prediction markets - can provide timely signals about firms' operating activities and broader market conditions. These signals may reveal information that is not captured by traditional public sources and can therefore provide complementary information for forecasting firms' future financial performance. However, firm-level alternative data often have limited historical coverage, are relevant only to specific prediction targets or subsets of firms, and are distributed across numerous heterogeneous channels, making them difficult to incorporate flexibly into conventional forecasting approaches. Meanwhile, large language models (LLMs) can interpret instructions, learn from in-context examples, and generate predictions by combining heterogeneous information without task-specific parameter updates. Motivated by this potential flexibility, we investigate whether an LLM can forecast firm performance by integrating alternative data with other financial information through in-context learning. We propose a two-agent framework that first identifies the firms for which each alternative data channel is likely to be informative and then predicts revenue using firm- and channel-specific context. We evaluate the framework across four commercial alternative data channels. In our experiments, adding alternative data in context alongside other financial information improves the LLM's forecasting relative to either source alone, and these forecasts are more accurate than those of standard forecasting baselines. These findings suggest that LLMs provide a flexible and practical approach to integrating alternative data with heterogeneous financial information.
Read the full abstract

All authors Jihoon Kwon, Lawrence Liu, Daekyung Park, Sumin Kim, Haverty Jack, Hoyoung Lee, Katherine Bjorkman, Josh McKenney, Peter Laurelli, Nicole Kagan, Zach Golkhou, Thorsten Neumann, Edward Tong, Pete Petersen, Yoon Kim, Alejandro Lopez-Lira, Yongjae Lee, Chanyeol Choi

Machine Learning (Statistics)

Identifiability of Nonnegative Tensor Decompositions via Positive Scattering

Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families. For nonnegative decompositions, however, positivity provides additional information that is not captured by dimension and independence alone: nonnegative terms cannot cancel, and their supports constrain competing decompositions. We introduce a positive scattering term that quantifies this additional source of identifiability and combine it with the dimension budget underlying the Lovitz–Petrov generalization of Kruskal's theorem. For every subset of components, we obtain two sufficient conditions: a threshold of $2|S|-2$ guarantees minimality and nonnegative rank, while the stronger threshold $2|S|-1$ guarantees uniqueness among nonnegative decompositions of the same length. The key result is a positive splitting inequality for irreducible exchanges of nonnegative rank-one tensors, which combines the dimension constraint with support-induced geometric rigidity. Although the scattering term is defined through an optimization over intermediate factor spaces, we show that its mode costs are exactly $0$, $1$, or $+\infty$, yielding an exact activation characterization in terms of graph connectivity. The resulting criterion can strictly certify sparse nonnegative tensor decompositions beyond the reach of Kruskal and Lovitz–Petrov conditions, including examples for which those conditions fail even after reshaping. In the matrix case, the two criteria reduce respectively to full-rank factorization and two-sided separability.
Read the full abstract

Instrumentation and Methods for Astrophysics

An RFSoC-based Backend and Timing System for the Balloon-borne Very Long Baseline Interferometry Experiment

We present the design and performance characterization of the digital backend and precision-timing system for the Balloon-borne Very Long Baseline Interferometry Experiment (BVEX), a pathfinder for high-frequency stratospheric VLBI at 22 GHz. The backend uses one of the four 14-bit analog-to-digital converter inputs on an AMD-Xilinx RFSoC 4x2. Although the converters support sampling rates up to 5 GSPS, the flight configuration digitizes the 2-4 GHz intermediate frequency at 4.096 GSPS. CASPER firmware provides both a high-resolution spectrometer for pointing and receiver verification, and a VLBI acquisition chain with two-bit requantization that records at a rate of about 8.2 Gbps. The timestamped data packets are sent over 100 Gigabit Ethernet (GbE) to a 16 TB NVMe array in a storage computer that draws approximately 70-80 W. The timing chain uses a Rakon oven-controlled crystal oscillator as a timing reference while a time-interval counter measures its drift relative to a GPS reference with approximately 60 ps resolution. This is the first deployment of an RFSoC-based VLBI backend and precision-timing system on a stratospheric balloon. Ground tests validated the backend, spectrometer, and timing chain. The August 2025 CSA STRATOS flight ended before reaching the target float altitude because of a balloon failure, and as a result no science observations were obtained. For the planned 2027 reflight, we are developing a conduction-cooled data storage computer with 24 TB of NVMe capacity and a direct data path from the 100 GbE interface to the NVMe array.
Read the full abstract

All authors Mayukh Bagchi, Felix M. Thiel, Laura M. Fissel, Maggie Oxford, Lindy Blackburn, Rafael Costa, Vincent L. Fish, Daryl Haggard, Michael D. Johnson, Dominic W. Pesce, Ganesh Rajagopalan, Javier L. Romualdez, Aarchi Shah, Adrian K. Sinclair, Stephanie St-Jean, Terry Yang

High Energy Physics (Phenomenology)

Collinear fragmentation of pseudoscalar quarkonia from NLO NRQCD

We discuss a new family of publicly available collinear fragmentation functions (FFs) for pseudoscalar quarkonia, the NRFF1.0 set. It builds upon the Heavy-Flavor Non-Relativistic evolution (HF-NRevo) scheme, designed to describe heavy-hadron formation through leading-power fragmentation at moderate and large transverse momentum. Heavy-quarkonium production naturally involves both perturbative and non-perturbative QCD dynamics, from the production of the heavy $Q\bar{Q}$ pair to its formation into a physical bound state. Within NRFF1.0, Non-Relativistic Quantum Chromodynamics (NRQCD) provides the theoretical framework for calculating the FF inputs at the initial scale, which are subsequently evolved through the HF-NRevo scheme. This setup provides a precision baseline for investigating the underlying partonic hierarchy and jet structure across the moderate- to high-transverse-momentum regime. The explicit treatment of partonic channels and heavy-flavor thresholds makes this framework particularly suitable for exploring quarkonium-in-jet fragmentation, jet-quenching sensitivity, energy-loss mechanisms, and the emergence of medium-modified fragmentation patterns in the quark-gluon plasma.
Read the full abstract

Mathematical Physics

On asymptotic expansions of the density of states for Poisson distributed random Schrödinger operators

We study a random Schrödinger operator with a potential distributed according to a Poisson process. Asymptotic expansions for traces of resolvents in the limit of small disorder are derived. Explicit estimates for the expansion coefficients are given and we show that their infinite volume limits are finite as the spectral parameter approaches the spectrum of the free Laplacian. As an application we derive bounds on the integrated density of states.
Read the full abstract

Chemical Physics

Breaking Water at Graphene Defects

Water dissociation at solid surfaces underpins processes ranging from corrosion and catalysis to electrochemistry and photovoltaics. Defects often serve as reactive sites for dissociation, yet how solvation influences water dissociation at such sites remains poorly understood. Here, we use state-of-the-art machine-learned interatomic potentials to explore water dissociation at defective graphene-water interfaces. We show that solvation qualitatively changes the reaction mechanism at a graphene single vacancy (SV), opening pathways that are absent for an isolated water molecule. Whereas the gas-phase process proceeds via a single concerted channel, the solvated SV splits water through two competing pathways: a basic route forming SV-H and OH-(aq), and an acidic route forming SV-OH and H3O+(aq). These lower-barrier pathways produce distinct chemisorbed intermediates that enhance graphene-water adsorption. Accordingly, even a simple carbon vacancy gives rise to unexpectedly rich interfacial chemistry, coupling surface chemistry to interfacial charge and wettability, with implications for carbon functionalization and nanofluidic transport.
Read the full abstract

All authors Samuel G. H. Brookes, IniOluwa C. Popoola, Fabian Berger, Kara D. Fong, Angelos Michaelides, Christoph Schran

Computer Vision

MMGait: Benchmarking and Unifying Gait Recognition across Heterogeneous Modalities

Gait recognition is commonly studied using RGB videos or their derived silhouettes and poses. Yet human walking produces heterogeneous photometric, geometric, and motion cues that cannot be systematically examined with RGB-centered benchmarks. We present MMGait, a large-scale multi-sensor benchmark that brings visible, infrared, depth, LiDAR, and radar observations into sequence-level correspondence. It provides diverse modalities spanning appearance, contours, geometry, motion, and body structure. Under a shared impostor-augmented protocol, we evaluate single-modal recognition, cross-modal recognition via directed retrieval, and multi-modal recognition using task-specific experts. Across settings, modality rankings vary with probe conditions, cross-modal alignment remains difficult, and fusion often provides complementary gains. This analysis exposes a scalability problem: individual modalities, modality pairs, and fusion configurations are typically handled by separately trained experts. We formulate Omni-Modal Gait Recognition, which unifies single-modal, cross-modal, and multi-modal recognition within a shared identity space. OmniGait++ uses modality-specific front ends followed by a shared identity encoder to preserve modality-dependent cues while learning comparable identity descriptors. An anchor-guided fusion module aggregates modality subsets of varying size without frame-level synchronization. A jointly trained checkpoint covers all three recognition settings and accommodates modality subsets of different compositions and cardinalities. Experiments show OmniGait++ remains competitive with task-specific experts in many shared settings and extends to higher-cardinality fusion unavailable to fixed-pair models. The results establish MMGait as a common testbed for heterogeneous gait sensing and demonstrate the feasibility of unified recognition under varying modality availability.
Read the full abstract

All authors Saihui Hou, Chenye Wang, Qingyuan Cai, Aoqi Li, Yongzhen Huang

High Energy Physics (Phenomenology)

Cosmic ray boosted dark matter with momentum dependent interactions can explain the LZ 248 keV event

The LZ experiment has recently reported an observation of a single event with characteristics of a nuclear recoil at a high recoil energy of 248 keV, where no background events are expected. We show that such nuclear recoil event could be caused by high velocity dark matter particles originating from interactions with energetic cosmic rays. We analyze the expected recoil spectrum due to cosmic ray boosted dark matter within the non-relativistic effective theory formalism, and show that momentum-dependent operators, such as $\mathcal{O}_6$ and $\mathcal{O}_{10}$, can produce a spectrum that peaks at the observed energy.
Read the full abstract