Materials Science
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 3 September
B-site mixing is a common strategy for tuning properties of halide perovskites. In the lead-free system MAGe1-xSn_xI3, it brings tilting and off-centering into competition. Using large-scale molecular dynamics driven by a machine-learned interatomic potential, we map the structural behavior across the full composition range. MAGeI3 exhibits strong polar B-site off-centering that remains nearly constant up to the cubic transition, together with methylammonium (MA) orientational order that weakens progressively on heating. By contrast, MASnI3 combines octahedral tilting with weaker, predominantly antipolar off-centering. Ge-like behavior persists upon alloying and gives way to Sn-like behavior only beyond roughly 65 % Sn. In the high-temperature phases, the B-site cations remain locally off-centered but directionally disordered. On the Ge-rich side, the distorted inorganic framework biases the soft MA orientational landscape toward a restricted set of preferred directions. This coupling shows how the composition of the inorganic sublattice can tune molecular ordering in lead-free hybrid perovskites.
Fluid Dynamics
A conservative coupling method of sharp-interface and multi-species model for compressible reacting gas-liquid flows with phase change
In this paper, a conservative sharp-interface and diffuse-interface coupling method is developed for compressible two-phase multi-species flows with phase change and chemical reactions. The liquid–gas interface is represented by a sharp-interface model, whereas a diffuse-interface model treats the transport and chemical reactions of gas-phase species. Conservation is enforced by coupling the two phases through interfacial fluxes obtained from a multi-species phase-change Riemann problem. The original single-species four-wave Riemann solver is extended to multi-species gas mixtures by modifying the interfacial energy jump condition. Interfacial mass transfer is restricted to the condensable vapor species. Accordingly, both the interfacial energy jump condition and the gas-mixture energy-exchange flux are constructed using the internal energy of the phase-changing vapor species rather than the mixture internal energy. With this species-selective energy coupling, an approximate multi-species Riemann solver is constructed that retains the four-wave structure while avoiding the multidimensional nonlinear root-finding required by the exact solution. A series of numerical tests, including impulsive evaporation and condensation, reacting aluminum vaporization, shock-droplet interaction, and detonation-droplet interaction, are performed to assess the accuracy and robustness of the method. The numerical results agree well with reference solutions and benchmark data, demonstrating that the present method resolves the effects of phase change and chemical reactions in compressible multi-species multiphase flows while preserving conservative interfacial coupling.
Read the full abstract
Optimization and Control
The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem
The standard semidefinite programming (SDP) relaxation of Max-Cut is exact when its optimum equals the maximum cut value. Delorme and Poljak resolved NP-completeness of recognizing exactness for weighted graphs and left the unweighted case open. We show that recognition is NP-complete even for connected simple unweighted graphs, and hence strongly NP-complete for nonnegative integer edge weights. The reduction provides an explicit SDP optimum and makes the additive integrality gap equal to the minimum number of unsatisfied clauses in the source formula. Recognition remains NP-complete even when an exact rational optimal primal–dual pair is supplied. We also establish strong NP-hardness of recognizing exactness of the Frieze–Jerrum Max-$k$-Cut relaxation for every fixed $k\ge3$, even for connected graphs with nonnegative integer edge weights. An independent bounded-weight construction gives a second proof for Max-Cut. Finally, reductions preserving the additive gap up to explicit factors establish strong NP-completeness of exactness recognition for a basic Max-DiCut SDP and NP-hardness for a Max-Bisection SDP.
Read the full abstract
Machine Learning
LongCounsel-8: A Benchmark Suite for Longitudinal Depression Tracking from Multi-Session Counseling Dialogues
Large language models (LLMs) are increasingly used to assess depression in counseling conversations, where psychology evidence suggests that tracking change across sessions matters more than any single score. However, existing dialogue benchmarks score each session on its own, and an accurate score for every session does not guarantee that a method follows the changes between sessions. We introduce LongCounsel-8, a benchmark for tracking depression across counseling sessions. Its systematic pipeline takes client profiles from real counseling cases, depression scores from real longitudinal data, and turn length and form from real counseling dialogues, yielding 7,749 five-session trajectories from three LLMs. Every session is generated to express a preset score on the PHQ-8, a standard eight-symptom depression questionnaire. Validation shows that the labels are self-consistent and the dialogues close to real counseling. Following clinical research on treatment monitoring, we propose a trend-based evaluation protocol reflecting real-world tracking needs: changes between sessions, crossings of the screening cutoff, trajectory types, and symptom-level changes. Extensive experiments show all five existing methods tested fall short in tracking trends: none estimates changes better than a no-change baseline, at most 40% of cutoff crossings are detected, and adding earlier sessions lowers change error but causes more missed improvements.
Read the full abstract
Functional Analysis
Divergence of decreasing rearranged Fourier series on every infinite compact abelian group
On every infinite compact Hausdorff abelian group there is a complex-valued continuous function whose Fourier sums, taken over coefficients above a decreasing magnitude threshold, are unbounded almost everywhere. In fact, such functions form a dense \(G_\delta\) in the space of continuous functions with its uniform norm. Moreover, a divergent example may be chosen with Fourier support contained in any prescribed infinite subgroup of the dual, while avoiding any prescribed finite set of frequencies. No metrizability or zero-dimensionality is assumed. The proof combines Körner's finite circle and Walsh lemmas with a finite construction on products of odd cyclic groups. A trichotomy for the dual group, exact quotient transfer, and cyclic sampling give finite examples on every group under consideration.
Read the full abstract
Machine Learning
An Adversarial Zero-Shot Learning Approach for Anomaly Detection in Multivariate IoT Traffic Data
Anomaly detection in Internet of Things (IoT) networks presents unique challenges due to the diversity of devices, lack of labeled data, and domain variability across environments. In this paper, we propose a novel framework for multivariate time-series anomaly detection that leverages adversarial learning and contrastive loss within a sequence-based Variational Autoencoder (VAE) architecture. Our method enables zero-shot domain adaptation by jointly optimizing domain-invariant latent representations and semantically structured embedding spaces, without requiring labeled data or raw feature transfer. To address the heterogeneity of IoT deployments, we introduce encoder and decoder adaptor layers that align feature distributions across domains while preserving contextual semantics. Additionally, we propose a destination-based segmentation strategy to better model real-world communication structures in IoT traffic. Our framework is comprehensively evaluated on six distinct datasets spanning industrial, enterprise, general-purpose, smart home, and military automation domains across 44 transfer scenarios. Experimental results demonstrate strong zero-shot generalization in several cross-domain settings and competitive performance against a contrastive domain-adaptation baseline under realistic, heterogeneous, and privacy-constrained IoT conditions.
Read the full abstract
Machine Learning
Restricted Eigenvalues Beyond Gaussian Width: Threshold Occupancy under Heavy Tails
Restricted eigenvalue (RE) bounds govern stable recovery by norm-regularized estimators. For isotropic sub-Gaussian measurements, the benchmark sample size is $1+w(A)^2$, where $w(A)$ is the Gaussian width of the normalized descent cone. The COLT 2015 open-problem note (Banerjee et al., 2015) asked whether the same law follows for heavy-tailed designs from a uniform small-ball condition alone. We give an explicit and systematic negative answer to the general question as formulated there: the proposed law fails in its full dimension-free, arbitrary-set form, and the missing obstruction is simultaneous threshold occupancy. A constant-width polyhedral descent cone with fixed small-ball constants has zero empirical RE on every sample path up to half the ambient dimension. More generally, every finite range space admits exact threshold encoding in an arbitrarily narrow spherical cap and a lift to a full polyhedral descent-cone section. For every fixed threshold VC dimension $d$, as $\beta\downarrow0$, the sharp worst-case sample complexity is $\Theta(\beta^{-1}[d\log(1/\beta)+\log(1/\delta)])$. The separation persists under exact isotropy and all finite moments: on the same constant-width cone, Gaussian measurements succeed with $O(1+\log(1/\delta))$ samples, whereas an isotropic heavy-tailed design fails pathwise for $n\lesssim\sqrt{p/\log p}$. Gaussian smoothing yields an everywhere-positive $C^\infty$ density while retaining arbitrarily poor RE. Under isotropy, a distribution-free fallback governed by affine dimension times squared enclosing radius is sharp on this family.
Read the full abstract
Artificial Intelligence
PPO-STGNN: A Proximal Policy Optimization Approach with Spatio-Temporal Graph Neural Networks for DAG Task Scheduling in Cloud-Edge-End Computing
With the rapid development of the Internet of Things, computation intensive directed acyclic graph (DAG) tasks have become increasingly common in cloud-edge-end collaborative environments. However, cloud, edge, and end nodes are highly heterogeneous in computing capacity, network bandwidth, and energy consumption, which makes the efficient scheduling of tasks with complex dependencies an NP-hard problem. Traditional heuristic algorithms and conventional reinforcement-learning methods often fail to capture the spatio-temporal dynamics of system resources. This paper proposes PPO-STGNN, a DAG task-scheduling algorithm that integrates proximal policy optimization (PPO) with spatio-temporal graph neural networks (STGNNs). The method uses an STGNN to extract features from both the DAG task topology and the physical cloud-edge-end resource graph, and then optimizes the scheduling policy through PPO to minimize makespan and schedule length ratio (SLR) while improving CPU and memory load balancing. To accelerate convergence, a multi-teacher behavior-cloning mechanism is introduced for pretraining. Experimental results show that PPO-STGNN significantly improves load balancing while maintaining a low completion time, making it suitable for dynamic and heterogeneous cloud-edge- end DAG scheduling scenarios.
Read the full abstract
Computation and Language
Building and Evaluating Fixed-Voice Thai TTS from Synthetic Speech
In low-resource settings, deploying TTS typically requires choosing between a large voice-cloning model with costly inference or a compact fixed-voice system that requires a speaker-specific corpus. We study a third route: using a large voice-cloning model as a programmable data source to turn a short voice reference (e.g., 15 seconds) into a compact fixed-voice student trained entirely on synthetic speech. This setting makes pipeline design consequential: teacher errors become training targets, while filtering failed generations can reduce coverage of difficult texts. Thai further introduces challenges from ambiguous word boundaries, lexical tone, names and loanwords, numeric verbalization, and Thai-English code-switching. We study how text preparation, synthetic generation, quality filtering, rejection sampling, and frontend choices affect the resulting student, and where teacher limitations remain. We evaluate CER, Challenge-Set Keyword Accuracy, Prosody Pause Accuracy, speaker similarity, and speaking rate. The resulting 82M-parameter model, Wayu-Paxa-TTS-Edge, enables on-device Thai TTS without reference audio. It achieves 68.2% Challenge-Set Keyword Accuracy (85.5% of Gemini 3.1) and 91.4% pause precision, outperforming its OmniVoice teacher (89.9%) and reaching 94.8% of Gemini 3.1. It also achieves the lowest pause-placement error and intra-word pause rates among the three systems, and 3.7% and 1.1% CER on Thai and English, respectively. We open-source the model and evaluation framework for Thai TTS development.
Read the full abstract
Machine Learning (Statistics)
Towards a Statistical Understanding of Mixture-of-Experts
Mixture-of-experts (MoE) architectures increase model capacity by combining a collection of expert predictors through input-dependent routing, while often activating only a small subset of experts for each input. Despite their growing importance in modern large-scale models, the statistical roles of their design choices, especially routing, sparse activation, and shared experts, remain only partially understood, as existing theory has largely focused on parametric or correctly specified MoE models. In this paper, we view MoE as a form of localized aggregation and show how this localization reshapes the approximation-estimation-computation tradeoff. We derive oracle risk bounds for learning dense and sparse routing with evolving experts, separating approximation, expert-learning, and router-estimation errors, and characterize how sparse Top-K routing can retain the benefits of localized aggregation while controlling per-input computation. We also interpret gating through the geometry of input space, relating routing performance to regions of local expert advantage, and show how shared experts, as adopted in architectures such as DeepSeekMoE, can extract common predictive structure so that routed experts focus on residual local variation. Together, these results provide a unified statistical framework for understanding MoE through input-dependent expert aggregation, in which expert specialization and computational tradeoffs are governed by local predictive structure.
Read the full abstract
Soft Condensed Matter
Exact Scaling Laws and Non-Hermitian Topological Phase Transitions of Active Continuum on Hyperbolic Manifolds
The macroscopic collective motion of active continuum on curved manifolds is conventionally addressed through perturbative dynamic renormalization or finite-element simulations, often obscuring the underlying geometric mechanisms. Here, an exact algebraic framework is established to reformulate the active phase transition on hyperbolic spaces $\mathbb{H}^2$. By rigorously expanding the covariant Navier-Stokes-like equations and applying the Weitzenböck identity, we derive the exact critical threshold $\alpha_c = \frac{5}{4}D\kappa^2$ for macroscopic polarization, which is dictated by the geometric mass gap of the Hodge-de Rham Laplacian. We strictly define the parameter subspace $\alpha = 2D\kappa^2$ where the topological free energy reaches the Bogomolny-Prasad-Sommerfield (BPS) limit. This enables the reduction of the complex velocity field to Blaschke products via Möbius gauge symmetry. The flat-space limit ($\kappa \to 0$) exactly degenerates to the topological phase of the classical O(2) model, demonstrating that the constant negative curvature acts as an un-perturbative infrared regularization for non-linear amplitude saturation. Furthermore, mapping the non-variational active convective modes onto the defect translational zero-modes yields an intrinsically non-reciprocal interaction matrix. By analytically extending the singular integral operator of the dynamically condensed defect ring, we identify a macroscopic second-order exceptional point (EP2) characterized by a strictly algebraic dynamic scaling law $\tau \sim |\Delta \nu|^{-1/2}$. This closed-form theoretical paradigm provides exact solutions for geometric frustration and non-Hermitian topology in soft mechanics.
Read the full abstract
Nuclear Theory
A Practical Partial-Wave Method for Identifying Unstable Light Nucleus Resonances in Heavy-Ion Collisions
The production of light nuclei in relativistic heavy-ion collisions provides valuable insights into the dynamics of the hot and dense matter created in these extreme environments. While stable light nuclei have been extensively studied, unstable light nuclei being short-lived resonance states remain largely unexplored and offer unique opportunities to probe final-state interactions and the freeze-out conditions. In this paper, we propose a partial-wave method, based on the Lednický–Lyuboshitz framework, to extract resonance signals of unstable light nuclei from two-particle correlation functions measured in heavy-ion collisions. By extending the LL model to higher order partial waves and directly incorporating experimental phase-shift data from low-energy nuclear scattering, our approach avoids the need for model-dependent potential parametrizations and enables a clean decomposition of the resonant partial wave from the non-resonant background. As a demonstration, we apply the method to the $p$-$^3$He and $p$-$^4$He systems, corresponding to the $^4$Li and $^5$Li ground-state resonances. Numerical results show that the resonance-induced correlation excess can be effectively isolated, with a peak in the correlation function appearing at $k \approx 72$ MeV/$c$ for $^4$Li and $k \approx 50$ MeV/$c$ for $^5$Li, consistent with the known resonance parameters. The extracted transverse momentum spectra and rapidity distributions are presented using the measured proton and light-nuclei spectra from STAR at $\sqrt{s_{NN}} = 3$ GeV. The proposed method provides a practical tool for the experimental study of unstable light nuclei in relativistic heavy-ion collisions and can be extended to a broader range of resonance states.
Read the full abstract
Multimedia
CAPQ-FAST: Content-Adaptive Perceived Quality Assessment for Faster Audiovisual Playback
Faster playback has become a common feature in modern online audiovisual services, allowing users to consume content in less time while still maintaining a coherent viewing experience. However, different modalities of media content, such as video, audio (including speech and music), and audiovisual, exhibit varying requirements for understandability and information integrity under faster playback. These differences lead to noticeable variations in perceived quality depending on the content type. Nevertheless, users' perceived quality at different playback speeds remains insufficiently investigated. To address this gap, this paper conducts a series of subjective experiments to analyze the relationship between playback speed and perceived quality for video, audio, and audiovisual content. Content-specific intrinsic features are extracted to capture temporal dynamics, including temporal information (TI) for video, words per minute (WPM) for speech, and beats per minute (BPM) for music. Predictive models of perceived quality under faster playback are then developed separately for video, speech, and music. By integrating these models, a unified content-adaptive perceived quality assessment model (CAPQ-FAST) is proposed for faster audiovisual playback. Experimental results demonstrate that the proposed model effectively predicts perceived quality under different playback speeds. This model can help service providers better understand users' viewing intentions and perceptual experiences under faster playback, thereby enabling more adaptive personalized recommendations and playback control to enhance user experience adaptability.
Read the full abstract
Robotics
BRIDGE: An Open-Source Humanoid Platform via Morphology-Control Co-Design for Physical AI
Developing humanoid robots capable of leveraging human behavioral data is essential for general-purpose embodiment, yet conventional development remains bottlenecked by a decoupled paradigm that isolates hardware design from whole-body control. This approach leads to suboptimal systems that compromise human-like fluidity and agility. To bridge this gap, we introduce a data-driven morphology-control co-design framework that optimizes humanoid morphology for human-like movement. To quantify morphological fidelity, we also introduce a novel metric that jointly considers kinematic retargeting fidelity to human motion and dynamic tracking performance. Our framework achieves state-of-the-art (SOTA) performance across all metrics compared to baseline humanoids (Bumi, K1, and Toddlerbot). Finally, we realize this design in Bridge, an open-source, 88cm-tall humanoid platform released alongside its control policy. We demonstrate that Bridge captures human motion data with superior fidelity, exhibiting exceptional performance across foundational locomotion, robust balance, and highly dynamic maneuvers. Videos and open-source materials: https://sites.google.com/view/bridgerobot.
Read the full abstract
Quantum Physics
Topology-Dependent Enhancement of Entanglement Extraction in Repeater Graph States
Quantum repeaters are essential for establishing long-distance quantum communication to overcome the exponential decay of entanglement due to photon loss. Traditional repeater architectures rely on physical quantum memory, which introduces decoherence and poses significant practical implementation challenges. The repeater graph state (RGS) architecture offers a promising memory-less alternative that is inherently resilient to photon losses. A key challenge in implementing RGS lies in the requirement for highly efficient graph state generators and complex qubit measurement. In this work, we aim to investigate the strategies for extracting the maximum number of Bell pairs from the RGS structure via its qubit connection to resolve the well-known bottleneck problem of RGS in which only a single Bell pair can be extracted from a complete bipartite graph state. From simulations, we observe that the maximum number of extracted Bell pairs depends on its connection topology, where the Bell-pair yield tends to be maximal at low to moderate edge densities. As the number of network hops increases, the RGS must be equipped with higher inner-qubit connectivity to maintain a sufficient yield of extractable Bell pairs. Thus, the expected resource requirement shifts toward the use of RGSs with higher inner-qubit connectivity.
Read the full abstract
Machine Learning
Spectral characteristics of autoencoder parameters as a vector representation of data
This paper examines the relationship between the parameters of autoencoder models and the statistical properties of the data on which they are trained. Autoencoders are defined as models with an encoder-decoder architecture, trained to reconstruct input data through a compressed latent representation. It is proposed that the model parameters can be viewed as a dense vector representation of the corresponding sample. To test this hypothesis, a theoretical and experimental study is conducted in which a vector representation is formed based on the spectral characteristics of the autoencoder parameter matrices. Theoretical analysis shows that the singular values of the model parameter matrices are related to the eigenvalues of the covariance matrix of the training data, ensuring the transfer of information between the data space and the parameter space. Experimental results on the CIFAR-10 and FashionMNIST datasets confirm that the resulting vector representations allow for a high degree of accuracy in distinguishing between models trained on different data subsets, without resorting to complex vector generation algorithms or using the original samples. These results suggest that the parameters of trained autoencoders can be viewed as sample representations.
Read the full abstract
Artificial Intelligence
GrowPage: On-Demand KV Budgeting for Efficient LLM Reasoning Serving
Long-output reasoning has made the key–value (KV) cache a critical memory bottleneck for efficient LLM serving. Existing KV compression methods usually rely on a predefined per-request budget and adjust only which KV states are retained, leaving the total capacity fixed throughout decoding. However, reasoning workloads exhibit substantial demand variation: different requests require different KV capacities, and the attention demand of an individual request evolves during generation. We introduce GrowPage, an on-demand KV budgeting framework that treats KV capacity as a runtime resource. GrowPage maintains lightweight dual-timescale query summaries to capture recent and long-term attention behaviors, and uses their relative attention working sets to estimate demand evolution. At each capacity boundary, GrowPage either compresses KV states within the current allocation or acquires an additional physical page when broader demand emerges. By integrating with PagedAttention's page-level memory abstraction, GrowPage preserves continuous batching and prefix caching. Experiments on reasoning benchmarks across multiple models show that GrowPage achieves a superior performance–throughput trade-off over existing approaches.
Read the full abstract
Artificial Intelligence
Making Every Tool Call Count: Necessary Tool-Evidence Path Rewards for Agentic Vision-Language Models
Modern vision-language models (VLMs) can directly answer many image-grounded questions, yet they often struggle with complex queries requiring fine-grained visual details or external knowledge. To acquire this missing evidence, agentic VLMs invoke tools such as image cropping, image search, and text search. However, existing training paradigms primarily evaluate tool-use based on final answer correctness, leaving evidence acquisition and utilization insufficiently supervised. This leads to two critical shortcomings: (i) models frequently issue redundant or off-target tool calls that fail to gather necessary evidence, and (ii) even when appropriate tools are called, models often fail to extract the necessary information from the resulting observations. To address these limitations, we introduce the NTEP (Necessary Tool-Evidence Path), a novel annotation scheme that explicitly specifies the essential external evidence and corresponding tool calls for each query. Building upon this, we propose NTEP-R (NTEP Reward), a supervision mechanism ensuring that each tool invocation strictly advances the reasoning process toward the final solution. Specifically, our approach rewards the agent for aligning its pre-call intent with a necessary evidence-seeking goal, and for ensuring the information summarized from the post-call observation aligns with the necessary evidence. Furthermore, we introduce a non-repeated-goal regularizer to penalize redundant calls that revisit satisfied NTEP goals. Extensive evaluations on seven image-grounded benchmarks demonstrate that our 8B-parameter instantiation, NTEP-8B, significantly improves both search-oriented accuracy and tool-use efficiency within a unified three-tool framework. These results highlight the critical value of fine-grained tool-evidence path supervision for training robust agentic VLMs.
Read the full abstract
Probability
A finite-graph conjecture related to $\theta(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$
We introduce a conjecture for Bernoulli bond percolation on finite graphs. Roughly speaking, it asserts that if each boundary vertex is associated with a highly probable event that is increasing with respect to the percolation configuration, then, conditionally on the origin being connected to the boundary, the origin is likely to be connected to a boundary vertex whose associated event occurs. The conjecture implies a high-probability connectivity statement which is known to imply $\theta(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$, for every $d\geq2$. We prove the conjecture for finite planar graphs when the origin and the boundary vertices lie on the outer-face boundary, with the explicit bound $1-2\sqrt{\varepsilon}$. The proof combines a left-first depth-first exploration with a partial FKG inequality adapted to monotonicity up to a stopping time. A counterexample shows that the connectivity structure is essential: the analogous statement fails when the connectivity events are replaced by arbitrary increasing events.
Read the full abstract
Quantum Physics
Weakly Driven and Finite Detuning Boundary Time Crystals Enabled by Low-Dissipation Dynamical Channels
Spontaneous breaking of continuous time-translation symmetry in driven-dissipative systems gives rise to boundary time crystals (BTCs), characterized by persistent oscillations sustained by coherent driving and collective dissipation. Conventional BTCs, however, typically require strong driving and exact atom-drive resonance, imposing stringent constraints on their realization. Here we consider two atomic ensembles coupled to a common Markovian reservoir and show that shared dissipation organizes dissipation-free and low-dissipation modes into dynamically accessible low-dissipation channels, enabling BTCs under weak driving and finite detuning. Finite detuning further selects a unique stable limit cycle from an initial-state-dependent family of oscillatory trajectories. Our results establish low-dissipation dynamical channels as a route to robust BTCs under relaxed driving and resonance conditions.
Read the full abstract
Audio and Speech Processing
Broadband Acoustic Intensity Direction Estimation with Tight-Frame Cardioid Arrays
This study experimentally investigates source-direction estimation from acoustic intensity using paired cardioid microphones, with particular emphasis on well-balanced arrangements known as tight frames. Impulse responses were measured at 6 or 24 microphone positions, and two opposed-pair spacings were examined. The resulting arrays were evaluated for a single source, coherent interference between waves arriving from two orthogonal directions, and directional tracking in the presence of interfering waves from multiple directions. The results demonstrate broadband acoustic-intensity direction estimation from 50 Hz to 20 kHz, with the 24-microphone arrangement and the shorter spacing generally providing smaller errors.
Read the full abstract
Category Theory
Another counterexample to the Nerves of Steel Conjecture
In [B2] Balmer introduced the homological spectrum of a rigid tensor-triangulated category, and had the “nerves of steel” not to conjecture that it was in bijection with the prime spectrum, despite an “avalanche of examples”. Naturally, the statement came to be known as Balmer's Nerves of Steel Conjecture. More recently, in [NVY] the conjecture was stated explicitly and extended to a more general non-symmetric context. In this paper we provide a counterexample to the original suggestion in [B2], so also to the conjecture from [NVY]. A first counterexample was recently constructed in [BHR].
Read the full abstract
Networking
Indirect Estimation of SINR via SSB and CSI-RS RSRP in 5G NR
Predicting user equipment (UE) performance is essential for proactive network control, resource management, and digital twin sandboxes. However, the inherent flexibility and complexity of beam-based 5G new radio (NR) networks make accurate performance forecasting highly challenging. This paper proposes a data-driven approach to predict the average downlink signal-to-interference-plus-noise ratio (SINR) relying exclusively on standardized reference-signal measurements, namely synchronization signal block (SSB) and channel state information-reference signal (CSI-RS) reference signal received power (RSRP). We formulate this prediction as a supervised learning problem and evaluate various input feature representations using a third generation partnership project (3GPP)-compliant synthetic dataset. Our analysis reveals that filtering measurements based on active CSI-RS beams significantly enhances prediction accuracy while reducing input dimensionality. This activity-aware strategy demonstrates the strong viability of machine learning models for proactive network optimization.
Read the full abstract
Computation and Language
Pattern Over-Generalization of Knowledge Graph Embedding
Knowledge graph embedding (KGE) demonstrates its effectiveness for predicting missing links in knowledge graphs (KGs) by projecting entities and relations into a low-dimensional vector space. It is crucial for KGE models to effectively capture inference patterns (patterns) inherent in KGs, such as symmetry/antisymmetry, inversion and composition. Although recent KGE models exhibit strong capabilities in modeling such diverse patterns, they suffer from inherent limitations stemming from pattern over-generalization, where embeddings learned from only a single pattern instance inevitably generalize that pattern to all related instances, i.e., generalize the pattern universally. To address this issue, we propose PogRE (Pattern Over-Generalization Robust Embedding), a simple but effective method that utilizes dense linear transformations and compound operations for relation representation. Our theoretical analysis demonstrates that a dense linear transformation allows a pattern to become progressively universal as more triples are observed in the pattern. Furthermore, after observing d+1 linearly independent entities (d+1 denotes the dimension of entity), the linear transformation guarantees universal generalization of the pattern across all related instances. Experimental results on three standard benchmark datasets show that PogRE outperforms existing state-of-the-art KGE models in link prediction. Moreover, our empirical results indicate that PogRE effectively addresses the negative impact of over-generalization.
Read the full abstract
Biomolecules
Structural control over equilibrium silicon and oxygen isotopic fractionation: A first-principles density-functional theory study
Isotopic fractionation factors for oxygen and silicon in selected silicates (quartz, enstatite, forsterite, lizardite, kaolinite) have been calculated using first-principles methods. Good agreement between theory and experiment is obtained in the case of oxygen. In the case of silicon, agreement and differences with existing estimates of equilibrium fractionation factors are discussed. The relationships between silicon fractionation factors and oxygen fractionation factors, silicate polymerization degree and chemical composition is studied. The previously stated relationship with the polymerization degree of the mineral is not confirmed. Nevertheless, our calculation suggests that silicon fractionation depends on the cationic content of the mineral, in a way similar to oxygen. Oxygen fractionation properties could thus provide some insights on silicon fractionation behavior.
Read the full abstract
Strongly Correlated Electrons
Such stuff as magic is made on: compact operator algebra, stabilizer polytope and the structure of reduced density matrices in a Kitaev spin liquid
Quantum many-body systems exhibit rich and complex behaviour. Magic has recently emerged as a powerful new diagnostic for probing such systems, complementing other key features such as many-body entanglement. Here, starting from an investigation of the onset of magic within subsystems of a larger many-body quantum system, we show that intricate structures emerge which shed important light on the underlying many-body physics. Focusing on the Kitaev honeycomb model, we first identify the temperature below which local subsystems acquire magic. Remarkably, we find that the optimal magic witnesses active at the onset of magic reveal compact operator spaces that continue to capture the local thermal states throughout their subsequent evolution. For the six-site hexagonal marginal, this connection can be made stronger: the same operator space emerges independently from the symmetries of the local marginal and forms the symmetry-resolved plaquette algebra. When these symmetries are realized exactly, the local state lies entirely within this algebra and the reduced robustness of magic is equal to the full robustness of magic. The same reduced description can also be applied to other local quantum resources, which we illustrate using genuine multipartite entanglement. Furthermore, the operator spaces possess a rich algebraic structure in the form of finite-dimensional Euclidean Jordan algebras, with a natural interpretation in terms of bond and bond-cycle operators. Our general methodology therefore show how the onset of local magic can reveal a compact, physically meaningful operator structure underlying the finite-temperature Kitaev spin liquid, and opens up a new avenue towards reduced descriptions of quantum resources in many-body systems.
Read the full abstract
Signal Processing
Polarization-Aware Rotatable Antennas for RIS-Empowered Symbiotic Radios
This paper investigates a dual-polarized reconfigurable intelligent surface (DP-RIS)-empowered symbiotic radio (SR) system with rotatable antennas (RAs). By reconfiguring antenna orientations, RAs can steer their radiation patterns toward desired directions, thereby effectively mitigating the double-fading effect in RIS-assisted cascaded links. However, antenna rotation not only changes the radiation direction but also alters the local polarization bases, which may result in polarization mismatch and degrade the achievable gain. This motivates a joint spatial-polarization design that simultaneously exploits directional radiation gain and polarization matching. Specifically, we formulate a transmit power minimization problem that jointly optimizes digital beamforming, RA rotations, transceiver polarization states, and DP-RIS phase shifts, subject to the primary and secondary rate requirements as well as interference temperature constraints for non-SR users. To solve this non-convex problem, we develop an alternating optimization algorithm that integrates semidefinite programming, difference-of-convex programming, and Riemannian conjugate gradient methods. Moreover, to reduce hardware and computational complexity for practical deployment, we propose two low-complexity RA designs, namely a subarray-wise shared rotation design and a discrete rotation codebook design. Simulation results show that the proposed polarization-aware RA design significantly reduces the required transmit power compared with fixed-orientation and polarization-unaware benchmark schemes. Moreover, both the proposed low-complexity RA designs achieve comparable performance with reduced rotation complexity.
Read the full abstract
Robotics
Air-Ground Collaborative Vision-and-Language Navigation via Shared Bird's-Eye Maps
Air-ground collaborative Vision-and-Language Navigation (VLN) pairs an unmanned aerial vehicle (UAV) with a global bird's-eye view and an unmanned ground vehicle (UGV) with a local first-person view, yet the setting remains largely unexplored: existing training-free methods solve single-agent tasks but offer no collaboration mechanism, and a recent CARLA-Air evaluation found no stable cooperative behavior across five state-of-the-art VLA models; naive semantic communication or bidirectional coupling even degrades performance. We establish AGC-VLN (Air-Ground Collaborative VLN), the first training-free baseline for air-ground collaborative VLN. The key insight is that training-free methods decompose navigation into VLM-based semantic reasoning and deterministic geometric execution, exposing a collaboration interface: the UAV's global view, over which it renders the UGV's reported pose and the VLM-anchored target as CAR/GOAL markers with distance labels, yielding a shared bird's-eye map. From this map, the UGV acquires global spatial context its first-person view cannot provide, plans a road-following path with a frozen VLM, and executes it under closed-loop control; in parallel, the UAV runs 3D-SPF, a spatial-search upgrade of SPF that localizes the target in the downward view and flies toward it. On 100 closed-loop episodes in CARLA-Air's Town10HD scene, AGC-VLN reaches a 77.0% joint success rate, a collaboration gain of +27.0% over the weaker individual agent (the UAV, 50.0%), and exceeds the strongest published single-agent baseline (Travel UAV, 53.0%) by 24.0 points, stemming from the complementarity of the UAV's global view and the UGV's road-following execution. Project page: https://github.com/ZSN2024/AGC-VLN.
Read the full abstract
Information Retrieval
From Topical Relevance to Answerability: Entailment Distillation for Conversational Retrieval
Existing conversational retrievers commonly treat topical relevance as a proxy for answerability. However, a passage that closely matches the dialogue context is not necessarily the one that supports the correct answer. We identify this mismatch as a systematic answerability gap. To address this issue, we propose CLEAR, a framework that shifts conversational retrieval from topical relevance to answerability. The core of CLEAR is entailment distillation, which transfers answer-passage entailment supervision into a cross-encoder reranker so that the reranker discriminates answer-supporting passages from topical distractors at inference time, without requiring answers. CLEAR is complemented by a passage-centric abductive recall module that brings low-similarity yet answerable passages into the candidate pool by inferring answerable queries from passages with an LLM. Across TopiOCQA, QReCC, and out-of-domain TREC CAsT datasets, CLEAR consistently improves top-ranked precision over strong query-rewriting and dense-retrieval baselines, with the largest gains observed in conversations involving heavier topical noise. Moreover, applying our reranker on top of an LLM-driven query rewriter yields further gains.
Read the full abstract
Signal Processing
Geometric Ceilings on Time-Frequency Masking for Single-Channel Separation
Most single-channel separators estimate a source by applying a real gain to the mixture in each time-frequency bin. The optimum of that format, which the oracle masks used as bounds do not attain, is the orthogonal projection of the source onto the line spanned by the mixture, its residual set by the angle between them. Locating an estimator reduces to the block structure of a real-linear operator on stacked spectra, giving a chain of four nested classes whose three larger terms match three assumptions on the prior: zero means, circularity and absence of inter-frequency coupling. Held fixed the chain is a cascade of four orthogonal projections; refitted per frame it collapses onto its first term, attributing the whole residual to one missing real parameter per bin, the phase. When the phase posterior is symmetric about the mixture direction, the minimum mean-square estimate falls back onto the line, with gain the posterior mean of the oracle gain and excess error its variance. On MUSDB18 a posterior mean under a non-circular Gaussian-mixture prior leaves the class yet stays 11.44 dB under the per-frame ceiling, which four times as many components and 7.5x the data do not close; a closed-form gate attributes some 70% of it, in decibels, to the predicted variance. The widest fixed class stays 6.70 dB under the same ceiling. Leaving the class and minimising squared error are conflicting requests: the barrier lies in the criterion rather than in the prior.