Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Wednesday 9 September

Functional Analysis

Explicit Full-Spark Gabor Windows with Quantitative Phase Retrieval

We construct explicit algebraic finite Gabor windows that are simultaneously full spark and phase retrievable, with quantitative control of the self-ambiguity function. In every cyclic dimension, a constant–Chu window has an exactly computable ambiguity minimum of order $N^{-3/2}$; for $N\ge25$, a two-site Chu repair has margin comparable to $dN^{-3/2}$ for every divisor $d\le\sqrt N$. A quantitative algebraic regularization, based on the high-degree specialization principle used in explicit full-spark Gabor constructions, imposes full spark while retaining a fixed proportion of a seed's ambiguity margin. These ingredients give explicit simultaneous constructions in every cyclic dimension and a factor-sensitive improvement when $N$ has a divisor near $\sqrt N$. Further consequences include exact Chinese-remainder tensorization, optimal-order squarefree families, near-SIC prime regularization, lifted stability, and a finite cyclic Schrödinger construction.
Read the full abstract

General Relativity and Quantum Cosmology

Probing quantum chaos near a wormhole throat with a circular string

We investigate whether quantum fluctuations of a circular probe string develop a quantum-chaotic response while traversing a wormhole throat. The classical circular-string embedding is periodic and radially stable, but its two physical transverse polarizations experience time-dependent tidal potentials. Expanding the world-sheet action to quadratic order, we canonically quantize these modes and construct out-of-time-ordered correlator(OTOC) amplitudes from their unequal-time commutators. For the Ellis–Bronnikov wormhole, both polarizations exhibit finite intervals of approximately exponential OTOC growth associated with the first throat passage. The corresponding dimensionless rate measured with respect to physical time is positive over the parameter range studied and generally decreases as the probe energy is increased relative to the throat scale. In the global-monopole extension, increasing the solid-angle deficit narrows the band of locally amplifiable modes and suppresses the extracted rates; a sufficiently strong defect can nearly quench the radial signal, while the angular channel retains a polarization-dependent non-monotonic structure when the energy-to-throat-scale ratio is small. These quantities characterize finite-time dynamical sensitivity in the Gaussian fluctuation sector and should not be identified with asymptotic many-body chaos or a thermodynamic phase transition. Although the numerical analysis uses two representative wormhole geometries, the construction depends only on covariant world-sheet fluctuations and real-time commutators. It therefore provides a transferable, non-holographic framework for applying quantum-chaos diagnostics directly to quantum probes in curved spacetimes.
Read the full abstract

Robotics

MuJoCable: Reduced-Order Surface-Routed Cable Transmission for Tendon-Driven Robots

Tendon transmissions reduce distal inertia and add compliance, yet routing, slack, and friction govern motion and force transfer. Mainstream rigid-body robotics simulators such as MuJoCo do not jointly resolve moving noncircular contact, unilateral tension, and segment friction. We present MuJoCable, which adds a reduced-order, configuration-dependent cable transmission to MuJoCo. Its routing algorithm jointly optimizes an ordered path across moving analytic and mesh surfaces. A unilateral axial law, directional Capstan propagation, and nodal virtual work map this path to segment tensions and body forces. The warm-started engine plugin applies these forces during simulation and exposes route and load states for design. Pulley benchmarks recover analytical transmission relations with a Capstan-ratio error below 0.5%. On the underactuated 18-joint SpiRobs, MuJoCable reveals friction-driven load growth and proximal redistribution of joint rotation that the native tendon does not represent. Hardware tests on SpiRobs and a tendon-route-coupled finger reproduce observed motion sequences. By making physical threading executable, MuJoCable brings transmission sources of the simulation-to-reality gap into route, cable, and actuator design before fabrication.
Read the full abstract

All authors Yi Zhang, Qi Shao, Yicong Lin, Muyuan Ma, Tao Sun, Yue Xie

Materials Science

Twist and strain identification in moiré heterostructures

The geometrical and electronic properties of moiré materials are highly sensitive to the twist and strain in the samples due to the moiré magnifying effect. Accurate identification of twist and strain in moiré materials is therefore essential. In this work, we establish a general framework to extract the twist and strain configurations from moiré images with either atomic or moiré scale resolution. With only moiré-wavelength information, we show that there is a continuous family of possible twist and strain configurations, each one accounting for different orientations of the moiré pattern. To estimate the most likely twist-strain configuration, we discuss additional constraints and methods involving the minimum elastic energy and the electronic spectra. The minimum elastic energy, in particular, reflects that shear configurations become much more favorable as the strain increases. As an example of the developed methodology, we discuss the formation and identification of strained triangular moiré patterns. Our framework provides a comprehensive approach to identify the twist and strain configurations in systems with moiré-scale resolution.
Read the full abstract

All authors Zhen Zhan, Federico Escudero, Dong Wang, Yiwen Liu, Ambikesh Gupta, Pierre A. Pantaleón, Francisco Guinea

Computer Vision

Marker-free eye-gaze estimation using a single image and depth from defocus

This paper presents a marker-free eye-gaze estimation approach using a single 2D camera, such as an integrated laptop webcam. The gaze-related features are estimated from iris localization and head pose estimated by using depth from defocus. A variational Bayesian multinomial logistic regression framework is used as mapping from the estimated features to the position of regard, based on an 8-dimensional feature vector of head-pose and iris-displacement parameters. No external marker is needed. Experiments were conducted by estimating the gaze of people watching a computer screen at different distances and compared against five existing methods. The obtained scores demonstrate the effectiveness of the proposed approach.
Read the full abstract

All authors David Hurtubise-Martin, Feriel Fass, Djemel Ziou, Marie-Flavie Auclair-Fortier

Computers and Society

What Personal Information Improves LLM-Based Next-Location Prediction?

Large language models (LLMs) are increasingly used for individual next-location prediction, with personal information easily added to prompts alongside mobility history. Yet the incremental predictive value of such information remains unclear. Using linked sociodemographic records and mobility traces from 5,000 Shenzhen residents, this study separates model responsiveness from predictive value. GPT-5 is the primary model, with GPT-5.5 and Claude Opus 4.6 used for replication. In 1,000 paired prediction instances, models rank 100 candidate destinations with and without age, gender, occupation and income while all other inputs are held fixed. Behavioural history raises top-1 accuracy from 5.6% to 18.5% as prior history increases from zero to six days. By contrast, sociodemographic attributes produce no detectable overall gain, although replacing correct attributes with those of another person reduces accuracy by 5.4 percentage points. Candidate construction also matters, removing distance raises accuracy by 7.7 points under proximity sampling but lowers it by 22.3 points under popularity sampling, with the reversal reproduced across all three LLMs. These findings identify behavioural history as the clearest source of incremental value and show that personal information should be evaluated under matched, explicitly specified conditions before its privacy and governance costs are justified.
Read the full abstract

All authors Xin Wang, Paraic Carroll, Kerry Nice, Sachith Seneviratne, Li Zhang

Quantum Physics

Convex-Gaussianity of fermionic Gibbs states in perturbation theory

We study the structure of Gibbs states in weakly perturbed interacting fermionic systems. First, for a sparse Hamiltonian $H=H_0+V$ with a quadratic term $H_0$ and a non-quadratic perturbation $V$ of scale $\epsilon$, we show that the Gibbs state $\rho_{\beta}$ decomposes into a convex combination of Gaussian states whenever the inverse temperature satisfies $\beta \le O(\log(1/\epsilon))$. Moreover, we prove that this bound is asymptotically tight by establishing that $\beta \le \Theta(\log(1/\epsilon))$ is necessary for certain sparse Hamiltonians. This general framework applies directly to the weak-coupling (small-$\vert{}U\vert{}$) regime of the Fermi–Hubbard model with hopping $t$ and on-site interaction $U$ on any graph of maximum degree $D$. Complementarily, in the strong-coupling (small-$\vert{}t\vert{}$) regime, we show that the Gibbs state remains convex-Gaussian up to $\beta \le O\big(\vert{}U\vert{}^{-1}\log(\vert{}U\vert{}/(D\vert{}t\vert{}))\big)$, revealing a mechanism for convex-Gaussianity distinct from the weak-coupling setting.
Read the full abstract

Physics and Society

Energy pathway variety and the progress of the energy transition in European countries

The integration of new energy forms into existing energy infrastructure has emerged as a critical challenge in the context of the pursuit of a sustainable energy transition. One of the main challenges is understanding how this integration takes place not only from the introduction, but also as energy follows existing paths or creates new ones through which it is transformed and used by different activities. Here we introduce techniques from network science to analyse this process for the case of 29 European countries between 1992 and 2021. We study how new energy forms increase or decrease the variety (heterogeneity) of paths through the system of each country by establishing new ones and replacing or phasing out existing ones. We find that the transition to systems based on renewable energy is characterised by an initial increase in the variety of paths while the heterogeneity of paths decreases at the end of the transition, when the proportion of non-renewables in the system tends to zero. We then demonstrate that greater heterogeneity (complexity) is associated with larger annual fluctuations in the proportion of non-renewable sources in the system, establishing a direct relationship between the progress of the transition and the complexity of the energy system in which it occurs. This contributes to the understanding of general properties of the dynamics of the energy transition and effects that accelerate or deter it.
Read the full abstract

All authors Noam Abadi, Rossana Mastrandrea, Franco Ruzzenenti, Andrea Diaz

Computer Vision

RouteBridge: Reliability-Routed Bidirectional Distillation Between Neural Radiance Fields and 3D Gaussian Splatting

Neural radiance fields (NeRFs) and 3D Gaussian Splatting (3DGS) encode a scene with complementary inductive biases, but existing cross-representation distillation typically fixes one representation as teacher for the entire scene. A globally fixed teacher can propagate local reconstruction errors. We present RouteBridge, a bidirectional framework that selects the teaching direction for each ray. Its reliability estimator combines photometric residuals with representation-specific geometric evidence and routes supervision from NeRF to 3DGS, from 3DGS to NeRF, or abstains. A renderer-independent interface transfers color, opacity, and normalized depth without shared features or point correspondence. On mip-NeRF 360, the NeRF and 3DGS exports reach 28.56 and 28.77 dB, respectively. The 3DGS export improves over 3DGS by 1.56 dB and over NeRF-GS by 0.45 dB while reducing LPIPS to 0.207. On static three-view DTU, RouteBridge obtains 21.12 dB. Ablations show that both adaptive routing and geometric ray targets contribute to the improvement.
Read the full abstract

Materials Science

Heteroepitaxial Growth of PbSe on InP Substrates via Lattice-Matched III-V Buffer Layers

Detector cost remains a barrier to the widespread adoption of mid-wave infrared (3-5 micron) technology. PbSe, an inexpensive narrow band gap IV-VI semiconductor that has been used since the early 1940s, delivers high performance for infrared detection despite the abundance of grain boundaries in polycrystalline films. Epitaxial growth, however, could provide superior crystalline quality and interfaces, but suitable substrates remain limited for PbSe. Recent PbSe heteroepitaxy has focused primarily on III-V, II-VI and group-IV substrates that each offer a comparatively narrow range of lattice-matched alloys for heterostructure engineering. Here we show that InP-based heteroepitaxy provides access to a broader materials platform while limiting the lattice mismatch with PbSe to approximately 4%. We grow 150-nm thick PbSe films by molecular beam epitaxy on 200-nm thick In0.53Ga0.47As and In0.52Al0.48As buffers on (001) InP substrates. Reflection high-energy electron diffraction and X-ray diffraction show (001)-oriented rock-salt PbSe with an out-of-plane lattice constant of 6.12 Angstrom on both buffers. Photoluminescence (PL) is observed from room-temperature down to 12 K and the peak wavelength red-shifts from 3.7 to 5.0 microns. Under identical measurement conditions, the room-temperature peak PL intensities from films on In0.53Ga0.47As and In0.52Al0.48As are approximately 1.9x and 1.3x that of a PbSe on GaAs substrate reference, respectively. These results establish an InP-compatible platform for integrating narrow band-gap PbSe with a broad range of ternary and quaternary III-V alloys, including, for example, structures in which In0.53Ga0.47As serves as both a short-wave infrared absorber and a template for PbSe growth.
Read the full abstract

All authors Biridiana Rodriguez, Mark Martino, Brody Yeung, Benjamin Sprenger, Leland Nordin

Computers and Society

Watermarks Without Verification: AI Text Watermarking After the EU AI Act

On August 2, 2026, the obligations of Article 50 of the EU AI Act took effect, requiring generative AI providers to mark the content their systems produce and ensure it can be detected as AI-generated. Days later, Anthropic disclosed that every Claude model released after that date embeds a watermark based on SynthID-Text in all generated text, enabled by default with no user opt-out; Google has deployed SynthID-Text in Gemini since 2024. Users objected that the watermark degrades quality, particularly for code, that it secretly encodes identifying information, and, in mutual contradiction, that it is easily removable and inescapable; the vendor answered with assurances of unchanged quality, no identifying information, and robustness to light editing. In this work, we argue that neither the objections nor the assurances can currently be verified and that this unverifiability, rather than watermarking itself, is the substantive governance failure. We sort the contested assertions by what it would take to settle each and evaluate the open-source SynthID-Text implementation on two open-weight models, because no public tool can test the deployed systems. On prose, the measured effect of the watermark does not exceed that of changing the sampling seed. On code, the cost is three points of correctness on one model and below measurement on the other, while detection remains near chance, a limitation of detectability rather than quality. The remaining gaps trace to withheld access or missing institutions and we map each to a requirement: release of matched outputs, configuration disclosure, accredited audits, a shared evaluation protocol, and interoperable detection.
Read the full abstract

Metric Geometry

Tile sets consisting of two types of concave polygons derived from periodic tilings corresponding to non-periodic tilings with hat and turtle tiles

Using a convex pentagonal monotile belonging to the Type 5 family, we investigate the relationships among the hat tile, turtle tile, and Tile$(1, 1)$. By applying Sugimoto's Perspective and Amfirifma's Perspective, we obtain four types of concave polygons, AH-tile, BH-tile, AT-tile, and BT-tile, each having Heesch number 1 under the conditions considered. We show that these polygons correspond to clusters used to generate the non-periodic tilings $\mathscr{T}_h$ and $\mathscr{T}_s$. We further discuss the possibility that tile sets consisting of pairs selected from these polygons may correspond to $\textit{ASPmr}\{\text{A-tile}, \text{B-tile}\}$.
Read the full abstract

Optimization and Control

The Car Resequencing Problem with Makespan Minimization

Problem definition: The car resequencing problem involves rearranging the sequence of cars between two adjacent production shops via an intermediate buffer. This study explores a new variant that aims to minimize the resequencing makespan when the buffer features several forward lanes and a return lane (RL). Both types of lanes follow first-in-first-out rules, but operate in opposite directions. Through the RL, cars can circulate between forward lanes, thereby increasing resequencing flexibility and complexity. The goal is to position cars over time to complete the target sequence change in the shortest possible time. Methodology/results: We prove the problem is NP-complete and develop an exact two-stage branch-and-price approach integrated with constraint programming (BP-CP). Three versions of the master problem (MP) are proposed for the first stage, each paired with a subproblem defined on a specific graph. Using partial integer solutions from branching, a constraint-programming model built in the second stage yields either a feasible solution to the problem or a feasibility cut added to the MP. Experimental results indicate that BP-CP greatly increases the scale of solvable instances for a production batch, especially with a moderately relaxed MP. A comparative analysis shows that the RL markedly enhances resequencing flexibility, enabling smaller buffers to attain makespans comparable to those of larger buffers without the RL across varying resequencing complexities. Managerial implications: Expanding lane capacity alone yields limited gains in resequencing performance and may even reduce efficiency. The RL acts as several forward lanes, supporting a smaller and cost-effective buffer design while maintaining efficient just-in-time operations.
Read the full abstract

Rings and Algebras

Deriving Newton's Canonical Forms of Cubic Curves via the Center of Polynomials

Existing classifications of real plane cubic curves rely on sophisticated tools and require a lengthy exposition. This paper provides a concise yet elementary treatment of this classical topic. Using the centers of polynomials, we establish a correspondence between the algebraic structure of these centers and geometric properties of binary cubic polynomials, which yields a novel approach to Newton's canonical forms.
Read the full abstract

All authors Hua-Lin Huang, Lili Liao, Yu Ye, Ziqi Yuan

Statistical Methodology

Sliced $L^p$ Distributional Balancing

A popular class of causal inference methods addresses confounding through weighting, which reweights treated and control groups to balance their covariate distributions without using outcome information, thereby preserving a design-based perspective. In this paper, we propose sliced $L^p$ distributional balancing (SLDB), a family indexed by $p\in[1,\infty)$ that measures imbalance by averaging squared $L^p$ distances between the cumulative distribution functions of one-dimensional linear projections. The Cramér–Wold device ensures that this criterion identifies equality of multivariate distributions, while projection reduces its computation to sorting-based one-dimensional operations. Because our method lies outside the maximum mean discrepancy (MMD) framework underlying many existing distributional balancing methods, their theoretical and computational tools do not directly apply. We therefore develop a computationally efficient projected subgradient descent algorithm for estimating balancing weights, offering improved computational complexity over MMD-based methods. Furthermore, we establish a novel theoretical framework for SLDB-based causal effect estimation and prove, under suitable conditions, root-n consistency and asymptotic normality, with the asymptotic variance attaining the semiparametric efficiency bound. Finally, we develop inferential procedures that do not require augmentation with an outcome model, thereby retaining the design-based principle. Simulation studies and a real-world application demonstrate that SLDB performs competitively with existing methods.
Read the full abstract

Quantum Physics

Information-geometric bounds on nonequilibrium relaxation in quantum Markov dynamics

In this paper, we study the quantum information-geometric structure underlying short-time nonequilibrium relaxation in quantum Markov dynamics, and derive bounds on the nonequilibrium correction to the short-time relaxation curvature. These bounds generalize the information-geometric structure underlying Auconi's classical nonequilibrium relaxation inequality to quantum Markov dynamics. We consider the von Neumann relative entropy as quantum divergence, and parametrize perturbations through the Kubo-Mori map, which converts the second-order expansion of the relative entropy into the Bogoliubov-Kubo-Mori (BKM) inner product at all temperatures. For a quantum Markov semigroup with full-rank stationary state, the induced tangent-space generator admits a canonical decomposition into a BKM-symmetric and a BKM-antisymmetric part, and the leading nonequilibrium curvature correction takes the exact form of the expectation of the commutator between the dissipative and the transport part of the generator. This correction is bounded by the product of a BKM-symmetric dissipative activity and a transport-sector activity. The bound is verified on a noncommuting qubit model and a driven-dissipative qutrit, and the full chain is confirmed numerically on a two-dimensional Fokker-Planck steady state. In the high-temperature and overdamped limit the quantum formula reduces to the position-space Fokker-Planck expression and reproduces Auconi's entropy-production bound with the correct temperature factor.
Read the full abstract

Materials Science

An encoded asymmetric ligand for metal-selective topological assembly of two-dimensional metal-organic frameworks

Two-dimensional metal-organic frameworks (2D MOFs), with diverse topological architectures, provide a powerful platform for exploring unconventional electronic and lattice-dynamical responses. Yet their structural diversity remains fundamentally constrained by the fixed geometry of high-symmetry ligands. Here, we introduce an encoded asymmetric ligand, benzo[b]triphenylene-2,3,6,7,11,12-hexaol (BTH), for metal-selective topological assembly. By integrating multi-site coordination fields with sterically differentiated environments, BTH exhibits distinct topological programmability: different divalent metal ions direct divergent framework architectures. Specifically, coordination of BTH with divalent Cu(II) and Zn(II) ions assembles Cu-BTH-MOF with a dual-mode hexagonal pore topology and Zn-BTH-MOF with uniform hexagonal channels, respectively, as supported by PXRD Pawley refinement, structural simulations, and pore-size distribution analysis. Furthermore, this topological divergence is accompanied by a significant divergence in charge-transport properties, with Cu-BTH-MOF reaching an electrical conductivity of 1.186 x 10-3 S cm-1, more than six orders of magnitude higher than that of Zn-BTH-MOF (3.38 x 10-10 S cm-1). This work establishes ligand desymmetrization as a programmable strategy for metal-selective topological diversification in 2D MOFs.
Read the full abstract

All authors Huimin Qi, Jinkun Guo, Xinyan Wu, Weishan Li, Tongyang Zhao, Ze-Fan Yao, Hao Chen, Ling Zhang, Bin Jiang, Yi Liu, Haoyang Zhang, Yunlong Fan, Tianyang Chen, Qingqing Ji, Jin-Hu Dou

Robotics

Compact Visuotactile World Models for Lifting: Prediction, Reward Alignment, and Force Constraints

Accurate tactile forecasts need not improve force-constrained control. We study a 652,157-parameter action-conditioned visuotactile world model with matched behavior cloning, policy learning in imagination, independent reactive implicit Q-learning, and model-assisted force feedback. A fixed protocol executes 34 policies on 120 fresh MuJoCo environments spanning geometry and physical-parameter shifts, plus 324 independently replayed action branches on 12 additional ID environments. Visuotactile dynamics reduce force action-effect MAE from 0.413 N for persistence to 0.338 N. Model-assisted feedback raises ID force-budgeted success from 73.3% to 93.3%, with paired difference +20.0 [+6.7,+33.4] percentage points (95% CI), with the difference occurring during scripted lowering. Its pooled difference is +3.9 [-4.5,+11.7] points. Imagined RL achieves 11.9% pooled joint success versus 25.0% for reactive IQL. An empirical tactile-residual stress test adds 330 executions. The evidence concerns rigid-box lifting after a common approach, without physical-robot transfer or a closed-loop safety guarantee.
Read the full abstract

Algebraic Geometry

Ulrich bundles on intersections of two quadrics

We construct Ulrich bundles on smooth intersections of two quadrics. We determine all possible ranks and prove the existence of indecomposable Ulrich bundles of every allowable rank. To our knowledge, this gives the first such construction for a family of nonhomogeneous varieties of arbitrarily large dimension. We also study the moduli spaces of these bundles and relate them to moduli spaces of vector bundles on curves. For intersections of two even-dimensional quadrics, our results prove a conjecture of Eisenbud and Schreyer.
Read the full abstract

Machine Learning

Teacher Geometry Shapes Learnability in Teacher-Student Networks

Teacher-student systems, in which a teacher neural network generates training labels so that a student neural network can learn to implement the same function, are widely used as an abstract setting to study learning. However, the structure of the teachers is often overlooked by assuming randomly-generated, normally-distributed parameters. This hides substantial variation in how learnable different teachers are. We formalize learnability as the success rate of converging to the global minimum, as a function of overparameterization, learning algorithm, student initialization distribution, and teacher geometry. We both identify an easy distribution that maximizes node dissimilarity and a hard distribution that minimizes it, and show that these two distributions induce markedly different success rates across a large range of settings and for different activation functions. To explain the gap, we study the loss landscape of small neural networks that contain two distinct kinds of suboptimal local minima, out-of-bounds (OOB) minima at the edge of the data distribution and interior minima within. Assuming infinite data and a fast readout layer, we analytically reduce the loss landscape of small networks to two dimensions, showing that the region of attraction of interior minima changes as a function of teacher structure. In larger networks, maximally dissimilar teachers induce more interior minima, while minimally dissimilar teachers induce more OOB minima. Motivated by these analyses, we show that differentially increasing the learning rate of the readout layer and decreasing the learning rate of the inner biases increases success rates. These findings provide an important step in narrowing the gap between the study of teacher-student networks and more structured functions that arise in practice.
Read the full abstract

All authors Kai J. Sandbrink, Flavio Martinelli, Alexander van Meegen, Wulfram Gerstner, Johanni Brea

Soft Condensed Matter

Coarse-graining to create minimalist models for dynamic, end-linked star-polymer networks

Although minimalist models for patchy attractive particles have revealed powerful design rules for how particle valence directs colloidal assembly, less work has focused on comparably simple models of reversible, network-forming star polymers. Here, we use relative-entropy coarse-graining and simulation results from finer-resolution bead–spring star polymers to generate 5-bead models of dynamic, end-associating four-armed poly(ethylene glycol) macromers. Our results comparing structural correlations, network connectivity, and phase behavior of the coarse- and fine-grained models provide insight into how the accuracy and transferability of the coarse-grained models depend on the state point chosen for coarse-graining. The results also reveal intrinsic trade-offs between reducing degrees of freedom and expanding the range of effective interactions in coarse-graining that impact the total number of pairwise interactions in the resulting model, with implications for its computational efficiency.
Read the full abstract

All authors Tyla R. Holoman, C. Levi Petix, Michael P. Howard, Thomas M. Truskett

Statistical Mechanics

Energy Transport Structure and Fluctuation Theorem in Nonreciprocal Harmonic Chains

Nonreciprocal interactions fundamentally alter energy transport by breaking the symmetry between forward and backward responses. Here, we uncover an exact transport structure for a one-dimensional harmonic chain with asymmetric nearest-neighbor couplings. Using a Green-function approach, we demonstrate that the direction of heat transport is determined not solely by the temperature bias, but by its competition with an effective directional asymmetry. This competition can reverse the direction of heat flow, enabling cold-to-hot transport. We further show that nonreciprocity introduces an additional power channel associated with the antisymmetric sector of the interaction, leading to a generalized steady-state energy balance involving two reservoir heat currents and a nonreciprocal power current. At the fluctuation level, the heat exchanges with the two reservoirs constitute correlated yet distinct stochastic currents, whose joint scaled cumulant generating function obeys an exact Gallavotti-Cohen symmetry. Together, these results establish a unified energetic and fluctuation framework for nonreciprocal heat transport and demonstrate that directional interactions can serve as an active resource for controlling nonequilibrium energy flows.
Read the full abstract

Numerical Analysis

An intrinsic finite element framework for scalar- and vector-valued partial differential equations on general manifolds

We present an intrinsic finite element framework for the numerical approximation of scalar- and vector-valued partial differential equations on general manifolds described by atlases of charts. Weak formulations and their discretisation are expressed exclusively in the flat parametric space of the manifold, where the exact geometry enters only through the metric tensor that is evaluated at quadrature points. Conforming finite element spaces of arbitrary order for the whole de Rham complex are obtained on multi-chart atlases through purely topological inter-chart gluing. We develop a nodal change of basis construction for vector-valued spaces on multi-chart atlases, where nodal degrees of freedom couple charts with incompatible coordinate systems through transmission maps. Inter-chart continuity holds at the nodes with jumps of the order of the approximation error, and the resulting discrete field is exactly tangent to the manifold. Optimal convergence rates for this method are observed numerically for the surface Stokes problem; no a priori error analysis is provided. Numerical experiments on the cubed sphere manifold in two and three dimensions for the Hodge Laplacian problems demonstrate the intrinsic framework is free of the geometric consistency errors for a sufficient quadrature degree, and that intrinsic assembly is substantially cheaper than its extrinsic counterpart. Further considering the rotating shallow water equations that include orography as a perturbation of the geometry demonstrates that mass is conserved exactly, and energy is conserved up to the time discretisation error.
Read the full abstract

All authors Tamara A. Tambyah, Alberto F. Martín, David Lee, Santiago Badia

Signal Processing

Modality-Decoupled Federated Learning for Privacy-Preserving Embodied Intelligence in 6G

Sixth-generation (6G) wireless networks are expected to provide a key infrastructure for large-scale embodied intelligence, where heterogeneous robots collaborate through low-latency connectivity, edge intelligence, and distributed sensing. Vision-language-action (VLA) models offer a foundation by integrating visual perception, language understanding, and action generation into a unified closed-loop policy. However, training and adapting VLA models to distributed robotic agents introduce challenges in privacy protection, communication efficiency, and model heterogeneity. Existing federated learning (FL) methods overlook the intrinsic differences among vision, language, and action pathways in parameter scale, privacy exposure, update dynamics, and tolerance to compression or perturbation. To address this issue, this article proposes FedMVLA, a modality-decoupled FL framework for privacy-preserving embodied intelligence in 6G networks. FedMVLA incorporates three mechanisms: modality-aware federated aggregation (MAFA), modality-aware privacy allocation (MAPA), and modality-aware communication compression (MACO), together with a modality-sliced transport design that routes the precision-critical action stream through a protected ultra-reliable low-latency slice. A case study on federated robotic manipulation over the Third Generation Partnership Project (3GPP)-based wireless substrate, covering fading, co-channel interference, and malicious jamming, shows that FedMVLA achieves an 84.8% task success rate, exceeds FedAvg by 22.2 percentage points, sustains a widening margin when scaling to 128 clients across eight cells, and reduces the schedule-averaged per-client uplink model-update payload by 95.6% (approximately 96%), while keeping the 95th percentile (p95) of the round-critical uplink completion time near 1.5s.
Read the full abstract

All authors Zhuodong Liu, Xiangyu Li, Chunhong Yuan, Hongyang Du, Bodong Shang, Qingqing Wu, Tony Q. S. Quek, Mohsen Guizani

High Energy Physics (Phenomenology)

Inclusive productions of $J/\psi+\eta_c$ in $e^{+}e^{-}$ annihilation at Belle

We study $e^{+}e^{-} \to J/\psi+\eta_c+X$ at next-to-leading order (NLO) in $\alpha_s$ within the nonrelativistic QCD (NRQCD) framework to assess the color-octet (CO) mechanism at low energies. QCD corrections significantly enhance both color-singlet (CS) and CO leading-order results, with non-negligible QED-diagram contributions to the CS channel. At $\Upsilon(4S)$, CO terms increase the inclusive cross section by $20\%$–$30\%$, and the enhancement grows rapidly with $\sqrt{s}$, yielding an energy dependence distinct from CS predictions and providing a sensitive test of NRQCD. For the central LDME choice, including $\psi(2S)$ feed-down further amplifies the NRQCD prediction by about $40\%$ at $\Upsilon(4S)$. With Belle's reconstruction of $J/\psi \to \mu^+\mu^-$ and six $\eta_c$ decay channels, the process shows promising potential for observation.
Read the full abstract

Artificial Intelligence

A Function-Space Approach to the Statistical Mechanics of Learning Dynamics

In the kernel regime, neural-network learning inherits its preferences from a frozen spectrum. During feature learning, this spectrum evolves, yet networks retain systematic biases toward simple, smooth directions. We develop a function-space statistical framework explaining the origin of these preferences, treating functions and their learning operators as macroscopic variables, with parameterization entering through the multiplicity of parameter configurations realizing each function. For mean-squared loss, error relaxes exactly under the evolving learning operator $M=JJ^\ast$. Training stochasticity induces a Gaussian weight over function-space states, while parameter multiplicity contributes an entropic operator $B$, defined by the curvature of its log multiplicity. A local Laplace expansion yields the fluctuation free energy $\Phi_{\mathrm{fluc}}(M;B)=\frac{\sigma_\xi^2}{2}\log\det(M^{-1}+B)+\mathrm{const}$, analogous to an Occam factor. Under mild statistical conditions, this free energy is rotationally stationary exactly when $[M,B]=0$, is minimized by pairing large eigenvalues of $M$ with small eigenvalues of $B$, and generates a local restoring force against mismatch. Learning is therefore biased toward faster relaxation along entropically cheaper directions. This preference strengthens with training noise and vanishes in the deterministic limit, beyond gradient-flow accounts of operator alignment. For ReLU networks, we relate entropic curvature to the minimal rearrangement of activation boundaries required for a functional change and bound this structural cost by directional smoothness. Consequently, smooth directions are preferentially learned faster, in a data-adaptive manner, even as the learning operator evolves.
Read the full abstract

All authors Yizhou Zhang, Weichen Wu, Lun Du, Zhengjie Miao

Statistics Theory

Signal Correlation, IC, and PnL Dependence

Signal correlation and PnL correlation are correlations over different index sets - across assets at each date versus across dates for scalar payoffs - and practitioners often treat the first as a proxy for the second. We give an exact decomposition that shows what that proxy sees and what it discards. We recall that at each date a normalized signal's projection onto the realized demeaned return direction is its realized cross-sectional Pearson IC, so that fixed-signal PnL is return dispersion times IC (Qian and Hua, 2004), and we identify the normalized similarity of two signals in the orthogonal complement as their partial correlation controlling for realized returns; the residual rotational freedom is an orthogonal gauge whose invariants are the transverse Gram matrix. Signal correlation therefore equals an uncentered IC cross-moment plus transverse similarity, while Pearson PnL correlation centers and dispersion-weights the IC series alone. Our main result is a non-identifiability theorem: absent constraints on transverse geometry, neither correlation bounds or orders the other, which sharpens the simulation finding of Sorensen, Qian, Schoen, and Hua (2004) into an exact statement. For normalized ensembles the transverse Gram matrix re-enters through the normalization denominator; the ex post optimal combination under Euclidean and general covariance-risk metrics is the classical multiple-correlation bound, and we show that the two rules agree for every longitudinal exposure if and only if the risk metric is isotropic on the signal span. The classical exact null law of partial correlation under isotropy, a synthetic mechanism illustration at weak-IC scales, and inference guidance under temporal dependence complete the treatment.
Read the full abstract

Statistical Methodology

A binary factor model

The orthogonal factor model has been a very useful tool in uncovering covariance structures in a set of variables through a smaller set of underlying factors. This old model is suitable for continuous variables with unbounded support, since the most common assumption for the observables and the factors is multivariate normality. In this work, we propose a factor model for binary data. Factors are negative dependent, so they avoid each other. We study the theoretical properties of the model and carry out a full Bayesian inference. We illustrate the performance of our proposal with simulated and real data sets and compare with the traditional benchmark.
Read the full abstract

Machine Learning (Statistics)

Distillation of Synthetic Data for Time Series Foundation Models

Time series foundation models (TSFMs) are increasingly pre-trained on synthetically generated time series trajectories, where the data generating process is known. Current pre-training recipes are based on loss objectives which compare TSFM outputs to realized future values of each trajectory. We instead propose loss objectives which compare TSFM outputs to the conditional forecast distribution of each trajectory, a procedure we call synthetic data distillation (SDD). SDD corresponds to a Rao-Blackwellization of the training objective, in that it leaves the expectation of stochastic gradients unchanged while provably reducing the covariance of the stochastic gradient under the Loewner partial ordering. We empirically validate SDD on a TSFM model family of sizes from $4$M to $2.5$B parameters, and observe faster convergence of validation loss at every model size: on Gaussian Process data, SDD attains or improves upon the Status Quo loss whilst requiring $10\%-40\%$ less training iterations.
Read the full abstract

Information Theory

Characterizing Multi-Cell Pinching-Antenna Transmission: Revealing the Other Side of the Coin

Using pinching antennas to enhance a user's connection to its own base station (BS) is intuitive and has been well investigated in the literature. This letter focuses on a less intuitive advantage of pinching antennas from the interference-suppression perspective. In particular, using pinching antennas ensures that all BSs serve their users with low transmit power, i.e., BSs can “whisper", rather than “shout", to their users. As a result, by experiencing less interference, a user's data rate can still be improved with pinching antennas, even if its link quality to its own BS remains unchanged. A stochastic geometric study is carried out in the letter, where BSs employ fractional power control. Analytical and numerical results are presented to reveal the significant impact of this interference-suppression capability offered by pinching antennas.
Read the full abstract