arXiv preprints from January 1, 2026 through September 8, 2026 — 17:57:02 EST
Acquiring dense channel information over many locations and beams incurs considerable pilot and processing overhead. Radio maps and channel knowledge maps (CKMs) reduce this overhead by reusing site-specific channel information, but their contents must be refreshed when new measurements or environmental observations become available....
This work addresses the limitations of CMOS at terahertz (THz) frequencies, where charge transit time and parasitic capacitances restrict the maximum operating frequency, fmax. As transistor dimensions shrink, reduced current handling capabilities further challenge CMOS, necessitating novel circuit design approaches for the THz...
Pinching-antenna systems (PASS) provide a large effective aperture and substantial path-loss reduction at low hardware cost, making them attractive for integrated sensing and communication (ISAC). Under wideband OFDM operation, however, the antennas on each waveguide impose nonlinear, position-dependent group delays on the same...
Upgrading Single-Wire Earth Return (SWER) networks for smart grid capabilities requires a reliable communications technology. Narrowband Power Line Communication (NB-PLC) is a potential low cost solution. Real-world deployment is challenging due to the severe, frequency-dependent attenuation caused by complex earth-return paths and...
Quantum electrodynamics (QED) predicts that the vacuum should behave as a non-linear medium. For many schemes aimed at verifying this fundamental prediction, the signal consists of one or more photons in a certain mode (determined by polarization $σ$ and wave-number $\boldsymbol{k}$) which would be empty in the absence of a QED vacuum...
Recent omni-modal large language models (Omni-LLMs) show great potential as real-time video assistants, which continuously perceive environments and guide users to achieve specific goals. Unlike traditional passive video understanding, interactive assistants should actively combine visual states, user goals, and prior knowledge to...
We develop a new direct accelerated Newton method for minimizing convex functions with Lipschitz continuous Hessian. The algorithm uses only primal variables and performs just one linear solve per iteration. With a simple predetermined choice of parameters, it achieves the global convergence rate of $O(1/k^3)$ in terms of the...
Space resource acquisition and utilization, commonly referred to as Space Mining, represent critical pathways for enabling sustained human exploration and unlocking commercial opportunities in space. These resources mainly include helium-3, water, mineral resources on the Moon and Mars, and abundant mineral deposits on asteroids. Due...
In professional life sciences workflows, scientists routinely interpret visual artifacts (gel blots, microscopy images, plasmid maps, flow cytometry plots, molecular structures, ...) to inform research decisions. We introduce VIALS, a visual question-answering benchmark with 161 such interpretation tasks, spanning the types of...
For sixty years, machine verification has been a major cost overhead, affordable only for exceptional artifacts. Here we report that generative AI inverts this relationship: at AI speed, machine verification is not only economical but essential to productivity --- it is the incorruptible referee that lets one person safely direct...
Recent vision-based action models have demonstrated strong capabilities in complex manipulation, but they rarely leverage explicit object physical properties to adapt their policies. We introduce ViTacPhys, a visual-tactile framework and data acquisition system that estimates object mass and friction-coefficient classes, together with...
Let $f$ be a Steinhaus or Rademacher random multiplicative function. We use methods from the theory of critical chaos to improve on the best known upper bound for partial sums of random multiplicative functions. In particular, our results imply that for any $\varepsilon>0$, almost surely $$ \Big|\sum_{n\le x}f(n)\Big| ...
The quantum memory burden effect can suppress the late-time Hawking evaporation of primordial black holes (PBHs), allowing PBHs below the standard evaporation threshold of approximately $10^{15}\,\mathrm{g}$ to survive until the present epoch and potentially contribute to the dark matter abundance. We investigate primary and secondary...
We develop a reduction and transfer framework for cohomological, variational, and thermodynamic problems in fiber-contracting extensions of local homeomorphisms. Under uniform contraction along the fibers and the existence of a continuous global section, every Hölder potential admits the explicit decomposition \[...
A canon permutation is a $k$-regular word over $[n]$ in which, for each $j$, the $j$-th copies of the letters form the same permutation $σ$. These were introduced by Elizalde as a generalization of nonnesting multipermutations, which are the case $k = 2$. We study classical pattern avoidance in them for arbitrary $k$. We show that...
Velocity-selective Raman transitions are widely used in atom interferometers to prepare atomic ensembles with narrowly defined momentum distributions. However, differential light shifts between atomic energy levels generate velocity distributions that are correlated with the Raman beam intensity, and therefore with the position of the...
Scarce data and tumor heterogeneity limit patient-level cancer treatment-response prediction. Existing approaches predict response from pretreatment molecular profiles and drug representations, without explicitly modeling the molecular changes expected under treatment. We propose PerturbRx, a treatment-conditioned representation...
Calibration requires probabilistic reports to be conditionally unbiased and reliably interpretable as probabilities. A calibration measure assigns numerical error to miscalibrated reports. Haghtalab et al. (2024) proposed an approximately truthful calibration measure for online prediction, leaving open whether exact truthfulness is...
We prove new bounds on complete sums of products of k additively shifted Kloosterman sums to odd high prime power moduli q=p^n, which feature substantially stronger power savings (about q^(-1/ceil(k/2)) in generic configurations) and a novel quantification of the alignment among the shifts. We prove our bounds by developing a method...
For fixed integers $k\ge3$ and $1\le d\le k-1$ and sufficiently large $n\in k\mathbb N$, we establish the sharp minimum $d$-degree thresholds that forces perfect matching in every $n$-vertex $k$-uniform hypergraphs. This was conjectued by Treglown and Zhao, and the $d=1$ case was conjectued by Kühn, Osthus and Treglown.
Self-refinement, typically structured as generation, critique, and revision, is a widely adopted paradigm for improving LLM generation and serves as a core mechanism in many LLM agents. While the three stages involve different cognitive demands, most existing approaches conveniently treat the model size as an implementation detail...
Bottomonium transport is studied in heavy-ion collisions at RHIC and the LHC by implementing a kinetic rate equation into (3+1)D viscous hydrodynamic simulations of an expanding quark-gluon plasma (QGP). The two main transport parameters are the inelastic reaction rates and equilibrium limits for each individual bottomonium state,...
Contextualization is essential for production automatic speech recognition (ASR) systems, where user-provided phrases must be recognized accurately under strict latency constraints. Although many context-biasing methods improve recognition accuracy, they often do not address the practical requirements of modern production ASR systems:...
Virtual distillation is a powerful near-term error-mitigation primitive, but it is also a spectral filter: it amplifies the dominant eigenvector component already present in the noisy density matrix. We show that, for a finite-band variational state, this filtering cannot create new concentration inside a set of accepted measurement...
Natural-language workflows offer a software-like interface for agents: domain experts can write reusable procedures, and agents can execute them as instructions. This promise is not yet reliable. Workflow descriptions often leave data dependencies implicit, so the executor must infer which prior results a step should use; agents can...