Statistical Mechanics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
The trilayered (A-B-A type) anisotropic (single site) XY magnetic model is considered with the intra-plane ferromagnetic and the inter-plane antiferromagnetic interactions. The equilibrium properties of such trilayered anisotropic XY system has been studied by Monte Carlo simulation with Metropolis single spin (randomly chosen) update algorithm. In a given range of interaction parameters, the system has been found to exhibit the high temperature critical (vanishing sublattice magnetisations and total magnetisation) and low temperature compensation (vanishing total magnetisation even for non-vanishing sublattice magnetisations) behaviours. The compensation temperature and the critical temperature both are found to increase with the increase of single site anisotropy. The comprehensive phase diagram is drawn. The finite size study reveals the growth of correlations near the critical temperature.
Sound
MusGU+: Toward a Musician-Centered Evaluation Framework and Discovery Tool for Generative Music AI
Generative music systems are increasingly presented as tools that democratize music creation, yet their practical suitability for musicians remains underexplored. Prior work includes openness-focused evaluation frameworks, such as MusGO (Music-Generative Open AI), as well as qualitative studies of musicians' experiences with generative systems. However, these approaches do not support systematic comparison or early-stage discovery of models for creative use. Motivated by such limitations, we introduce MusGU+, a musician-centered evaluation framework organized around three dimensions: Adaptability, Usability, and Controllability. Together, these capture whether a model can be feasibly trained or fine-tuned on personal data, integrated into real-world music workflows, and controlled in musically meaningful ways. We evaluate 10 representative generative music systems and present an interactive discovery tool that enables musicians to explore and filter models according to these criteria. While MusGO remains valuable for promoting responsible research practices, MusGU+ supports informed selection and practical adoption of generative systems by musicians.
Read the full abstract
Computational Engineering
Finite Element Model Updating-based Load Rating of Bridges with Incomplete As-Built Information
Load rating is the engineering process of determining the safe load-carrying capacity of an existing bridge structure often through analysis of its load-bearing members and their cross sections. However, when structural drawings and details of the structure are missing or insufficient for such calculations, alternative solutions must be used to infer the capacity. This study proposes a rational and consistent engineering solution for capacity inference based on structural identification (St-Id). The proposed approach uses finite element model updating (FEMU) to estimate the unknown characteristics of structures for use in an analytical load rating, which requires the development of an initial model developed in ABAQUS that can be updated based on experimental test data. ABAQUS allowed for the development of an interface with MATLAB, which facilitated the integration of an automatic iterative parameter optimization algorithm. The optimization algorithm developed in this investigation incorporated the features of a genetic algorithm (GA) and a gradient-based scheme to iterate on the unknown parameters. The proposed approach was evaluated on four in-service highway bridges including two concrete slab and two T-beam structures in varying deterioration condition states, which had sufficient plans available but were treated as having varying degrees of unknown details. The results illustrated that the finite element (FE) model updating approach generated load ratings that were within 0-17% of the target load ratings while alleviating the main challenges of the existing alternatives.
Read the full abstract
Multiagent Systems
Evidence, Logic, and Compliance: Multi-Agent Structured Graph Reasoning with Expert Arbitration for Medical Referral
Medical referral (directing patients to the appropriate hospital department) is a complex decision-making process requiring the synthesis of multimodal data, including patient narratives, laboratory indicators, and radiology imaging. While Large Language Models (LLMs) have advanced medical dialogue systems, they struggle with real-world referral tasks due to two primary limitations: (1) Information Overload, where models fixate on high-frequency disease terms while overlooking subtle but critical urgency indicators; and (2) Unstructured Collaboration, where existing multi-agent frameworks rely on loose dialogue that leads to semantic drift and confirmation bias. To address these challenges, we introduce MASGR (Multi-Agent Structured Graph Reasoning), a framework that treats referral not as a classification task but as a structured graph construction problem. MASGR deploys specialized agents to extract evidence from distinct modalities and coordinates them through a clinical reasoning graph. This graph forces agents to establish explicit logical connections between conflicting evidence. Furthermore, we integrate a knowledge-guided arbitration mechanism that prioritizes patient safety rules over standard diagnostic classification. Extensive experiments on real-world medical records demonstrate that MASGR significantly outperforms state-of-the-art LLMs and existing multi-agent systems, particularly in complex cases requiring the balancing of chronic disease management and emergency intervention. The AI contribution lies in the Multi-Agent Structured Graph Reasoning framework that transforms unstructured multi-agent dialogue into a verifiable logical graph construction. The engineering application is demonstrated through its deployment in a complex healthcare decision-making system to optimize the precision of complex medical referrals.
Read the full abstract
Quantum Physics
Constrained minimax approximation for quantum signal processing
Quantum signal processing (QSP) provides a simple and efficient framework for implementing polynomial transformations using quantum circuits. Its classical design stage leads to a constrained minimax approximation problem: find a polynomial of prescribed parity that approximates a target function uniformly on a fitting set while remaining bounded in magnitude by one on the domain $[0,1]$, which can be viewed as a semi-infinite constraint. Discretization converts the problem into a linear program, but feasibility at a set of finitely many sampled points does not ensure feasibility on the whole domain, especially when an optimal approximant reaches the boundary of the feasible set. We investigate two approaches to address this difficulty. A Remez exchange method combined with active-set constraint enforcement is efficient on many tested instances, but its stability depends on the target and problem geometry. We then introduce nonlinear Fourier retraction, which uses QSP completion and phase synthesis to turn a nearly feasible polynomial into phase factors for a feasible QSP polynomial without increasing the degree. Across representative problems, retraction largely preserves approximation accuracy and remains effective on instances where the Remez heuristic is unstable. The resulting workflow connects classical minimax approximation and semi-infinite optimization with nonlinear Fourier analysis, and is implemented in the qsppack software package.
Read the full abstract
Nuclear Theory
Effects of isospin imbalance on the chiral phase transition within a Chiral Dual Partner Model
The chiral symmetry is a property of the fundamental theory of the strong interaction that is relevant for the hadronic physics. It is expected that at sufficiently high temperature and matter density, this symmetry becomes manifest. Within the Chiral Dual Partner Model the chiral transformation is implemented in such a way that a fermion mass term is allowed if the parity partner of each baryon is included in the framework. This model is used here to study possible manifestations of the chiral symmetry in dense nuclear matter, assuming constant isospin fraction. It is found that the onset of the odd parity baryons is associated with two branches of thermodynamical instabilities, one of them leads to a first order phase transition for temperatures below $T_c\simeq 11$ MeV. An analysis of these instabilities in the phase space is given, and neutron star matter is considered as a special case.
Read the full abstract
Robotics
LightNav-0: Eliciting VLM Spatial Intelligence for Generalist Embodied Navigation
Embodied navigation requires agents to translate heterogeneous goals and visual observations into actions across tasks, environments, and robot embodiments. Modern vision-language models (VLMs) already encode spatial priors for visual grounding, spatial reasoning, and pointing, but these capabilities are rarely elicited directly for robot control. Existing navigation systems instead rely on task- or embodiment-specific components, fragmenting perception, reasoning, and action while offering limited generalization. Here we present LightNav-0, a compact generalist embodied navigation model that elicits the spatial intelligence of a pretrained VLM and aligns it with navigation, without task-specific prediction heads. LightNav-0 represents diverse navigation tasks through a unified token interface: dual-channel pointing expresses task-, scene-, and embodiment-agnostic spatial intent, while a residual vector-quantized action tokenizer maps this intent to precise, embodiment-specific trajectories. Together with temporally aware visual history compression, ER mid-training, supervised fine-tuning, and reinforcement learning, this formulation supports instruction following, open-vocabulary object navigation, and visual tracking within a single model. The navigation training corpus spans 2K+ scenes and 4K+ hours of embodied navigation data. LightNav-ER, the embodied-reasoning checkpoint used to initialize LightNav-0, attains the highest complete-set average across 8 embodied-reasoning benchmarks, while LightNav-0 achieves state-of-the-art monocular success rates across all 10 public navigation simulation settings. Real-world evaluations further demonstrate zero-shot generalization across robot embodiments, diverse scenes, and static and dynamic targets. These results establish compact VLMs as a unified and transferable backbone for generalist embodied navigation.
Read the full abstract
Social and Information Networks
Scaled Null-Adjusted Persistence: A Multiscale Bridge between Modularity and Persistence
Community detection methods must balance two competing objectives: identifying small, cohesive groups while avoiding excessive fragmentation. Modularity, the most widely adopted optimization criterion, typically merges small communities in large networks due to its resolution limit. In contrast, a persistence-based criterion promotes more granular partitions. We introduce Scaled Null-Adjusted Persistence (Scaled-NAP), a parametric family of quality functions that incorporates both these criteria. The definition exploits the exact identity between a cluster's modularity contribution and its Null-Adjusted Persistence (NAP) multiplied by its relative volume. Raising this volume factor to a parameter $\alpha\in[0,1]$ yields NAP at $\alpha=0$ and modularity at $\alpha=1$, while intermediate values control the scale of the detected partition. We derive conditions under which merging two communities improves the objective function and characterize the emergence of scale dependence, including resolution-limit behaviour on Caveman graphs. We develop the Milano algorithm, a multilevel Louvain-style heuristic for optimizing Scaled-NAP on large networks. Experiments on weighted and unweighted Lancichinetti-Fortunato-Radicchi benchmarks show that Scaled-NAP achieves the highest or tied-highest recovery wherever the ground truth structure is detectable, with its advantage increasing under community-size heterogeneity. Tests on three real networks with up to 1.1 million nodes confirm its capability to identify fine-grained ground-truth communities. The Milano algorithm also turned out to be the fastest method evaluated on large networks. These results show that Scaled-NAP provides an effective and scalable bridge between modularity-based and persistence-based community detection methodologies.
Read the full abstract
Optimization and Control
Goldfarb-Idnani Revisited:Invariants, Certificates, and the Limits of Guessing
The dual active-set method of Goldfarb and Idnani solves the strictly convex quadratic program by adding and dropping one constraint at a time, requiring no phase one. Primal–dual active set and block principal pivoting skip the walk altogether: they guess an entire active set at once and repair it from returning signs. For bound constraints the guess is safe. The system solved on a candidate set is a principal submatrix of $G^{-1}$, positive definite regardless of the guess; this $P$-matrix property guarantees finite termination. For $C^\top x \ge b$ that hypothesis fails, which is our central focus. The working-set system is $C_{\mathcal{A}}^\top G^{-1} C_{\mathcal{A}}$, positive definite only when $C_{\mathcal{A}}$ has full column rank, a property of the guess, not the data. The $P$-matrix property is lost and the structural obstruction invalidates the guarantee. Strict convexity keeps the method usable: KKT conditions make candidate sets certified rather than trusted. Over 600 random instances across four constraint families this failure never occurs. However, duplicating columns of $C$ raises failure rates to 93%, dropping certified fraction from 100% to zero. On real long-only portfolio data, the active set reaches 442 of $494 + 1$ constraints.
Read the full abstract
Hardware Architecture
Beacon: LLM Multi-Agent Driven Hardware Design Space Exploration for Heterogeneous Multi-Chiplet Deep Learning Accelerators
Heterogeneous multi-chiplet accelerators allow chiplets to be configured independently to better match different operator characteristics and improve inference efficiency. However, heterogeneity makes simulator evaluation expensive, limiting the number of iterations affordable for hardware design space exploration (HW-DSE). Mainstream data-driven methods rely mainly on final metrics and a few predefined states, and require many search iterations to implicitly learn the relationships between input parameters and optimization objectives, making them less effective in this setting. In practice, evaluators also generate detailed reports on execution timelines, resource utilization, memory accesses, and communication behavior. Large language models (LLMs) can combine domain knowledge with these reports to explicitly identify bottleneck locations, degradation causes, and parameter adjustment directions, thereby improving each design decision under limited iteration budgets. Based on this observation, we propose Beacon, a report-driven LLM multi-agent framework for heterogeneous multi-chiplet HW-DSE. Beacon employs hierarchical agents for bottleneck localization, root-cause diagnosis, and hardware candidate generation, together with an Analysis Toolbox and RAG memory for closed-loop search. Under the same limited iteration budget, Beacon reduces the composite latency-energy-monetary-cost objective by 25.1%–93.5% compared with random search, Bayesian optimization, and reinforcement learning.
Read the full abstract
Materials Science
Stoner contributions to the magnon equation of motion
From linear response theory, we derive the equation of motion for Landau-damped magnon quasi-particles in absence of spin-orbit coupling. The derivation is based on a minimal set of assumptions, namely that the transverse magnetic susceptibility is diagonalized by one collective eigenmode per magnetic atom in the unit cell, and that the spectrum of each collective eigenmode is dominated by a single magnon resonance. The resulting equation of motion leads to a natural definition of the exchange interaction as the restoring force acting on the collective mode magnetization near equilibrium. In addition to magnetic exchange, the magnon equation of motion also contains a damping term and a dispersive quasi-particle mass, both originating from the electron-magnon coupling. The effect of these terms is illustrated for a prototypical itinerant ferromagnet, where they redshift the magnon dispersion and reduce the magnon lifetime as the magnon enters the Stoner continuum. By further assuming wave vector independence of the collective magnon subspace, the magnon equation of motion becomes atomistic with well defined magnetic sites. For real materials, one can approximate the magnon coupling constants using an arbitrary level of band theory for the dynamic transverse magnetic susceptibility.
Read the full abstract
High Energy Physics (Phenomenology)
Medium effect on spin alignment of strange and charm vector mesons
Understanding the spin alignment of vector mesons in relativistic heavy-ion collisions requires a nonperturbative description of their spin-dependent in-medium properties. We investigate this problem within a unified four-flavor soft-wall holographic framework that combines an anisotropic Einstein–Maxwell–dilaton background at finite temperature, baryon chemical potential, and angular velocity. Spin alignment is determined from the medium-induced splitting of the spin-resolved vector-current spectral functions through an instantaneous freeze-out prescription. We systematically study the strange and charm vector mesons $K^{*}$, $\phi$, $D^{*}$, $D_s^{*}$, and $J/\psi$ and the dependence of their spin alignment on transverse momentum, rapidity, temperature, baryon chemical potential, and angular velocity. We find that the heavy charm vector mesons $D^{*}$, $D_s^{*}$, and $J/\psi$ mesons exhibit $\rho_{00}>1/3$ at low transverse momentum, whereas the light strange vector mesons $K^{*}$ and $\phi$ exhibit the opposite low-momentum behavior and angular distributions with $\rho_{00}<1/3$. We trace this flavor-dependent separation to the different locations of the vacuum mass shell relative to the thermally shifted longitudinal and transverse spectral peaks. The results qualitatively reproduce several trends observed at low and intermediate transverse momentum. Spin alignment is insensitive to baryon chemical potential and only weakly affected by angular velocity. These results establish an equilibrium holographic baseline for vector-meson spin alignment across flavor sectors and help delineate the regimes in which additional mechanisms, such as nonequilibrium evolution, fluctuations, and hard production, become important.
Read the full abstract
Computation and Language
Annotated Surrogate Retrieval for Polish Statutory Law
We present a family of retrieval methods for Polish statutory law built on document surrogates: language-model annotations attached to statutory articles at index time. Three designs occupy different points on the cost-quality frontier. ASCR is a surrogate cascade with reranking; ASCR-H fuses a dense list into that cascade; and DTF replaces both language-model stages with three lexical and dense retrievers, weighted reciprocal rank fusion, and a deterministic re-scoring prior, using no model call before generation. We evaluate all three against fourteen lexical, dense, fused and ablated baselines plus four controls, on 300 questions from the 2024 and 2025 Polish bar and legal counsel entrance examinations (264 with their reference article in the corpus), over 82,508 articles from 1,133 acts. On paired McNemar tests, ASCR-H places the reference provision at rank one significantly more often than every other non-oracle configuration except one of its own ablations (eighteen of twenty comparisons significant in its favour at p < 0.005), reaching 72.3% against 61.7% for BM25 and 52.3% for dense retrieval. The advantage is concentrated at the head and does not survive depth: it is significant at cutoffs of one and five, disappears by ten, and by twenty DTF leads on point estimate (86.0% versus 84.5%) at one ninth the latency and less than half the cost. Ablation attributes 27.6 points of rank-one accuracy to the reranking stage alone. We further report that the ranking advantage does not extend to citation accuracy, where DTF matches the oracle ceiling, and three negative results on lemmatisation, pseudo-relevance feedback and query rewriting. Surrogate annotation covers 27.0% of the corpus but every reference provision in the benchmark, an asymmetry we disclose and discuss. Benchmark, per-question outputs and paired significance tests are publicly available.
Read the full abstract
Formal Languages and Automata
Further Remarks on Separating Words
We revisit questions on separating words raised by Demaine, Eisenstat, Shallit, and Wilson, together with Ebrahimnejad's follow-up to their reversal problem. For length-$n$ pairs whose difference word has $d$ runs, we prove an $O(d\log n)$ bound, extending the Hamming-distance theorem of Demaine et al. For conjugate words, we give bounds controlled by the arithmetic of the shift. We resolve Demaine et al.'s Open Problem 2 by showing that the order of two words can change nondeterministic separation by an unbounded factor. Our reversal construction addresses Ebrahimnejad's follow-up to Open Problem 1: forward and reversed deterministic separation can differ by an unbounded factor. Since nondeterministic separation is invariant under reversal, the same construction also improves the lower bound in Open Problem 3.
Read the full abstract
Sound
Stride-k Subsampling: Train-Free Audio Token Reduction for Whisper
Whisper exposes speech through a fixed 1500-token encoder interface, now a default representation for ASR decoders and Whisper-based speech language models (SpeechLMs), yet its redundancy remains largely unexamined. We propose stride-k subsampling, a deterministic indexing operation that retains every k-th token after the convolutional stem or encoder transformer. Across five Whisper scales, k=2 preserves baseline WER at both positions, with CKA attributing this stability to acoustic overlap at the stem and attention-induced redistribution at the encoder output. Applying stride-2 at both positions cuts audio tokens by 75% and total GFLOPs by 52-58%, with small WER costs on most ASR benchmarks and larger costs on harder ones. The same configuration extends to three Whisper-based SpeechLMs, yielding modest accuracy drops on stronger baselines and larger drops on weaker ones, while reducing end-to-end latency by 19.6-27.4%. Requiring no training or auxiliary computation, stride-k subsampling exploits Whisper's preprocessing redundancy, indicating that its audio-token interface carries more capacity than downstream tasks require.
Read the full abstract
Fluid Dynamics
A neural network architecture and training algorithm to predict viscoelastic stresses from vortical data
Numerical simulations of elastic turbulence in parallel shear flows of polymer solutions indicate that the phenomena is associated with the formation and instability of exact coherent states dominated by thin sheets of polymer stress. However, these “arrowhead” structures are yet to be seen directly in experiments, where simultaneous velocity and polymer conformation measurements are challenging to obtain. Motivated by these challenges, we introduce a method for the prediction of the polymer conformation field given a time series of vorticity measurements. Our approach consists of two components: the first is a convolutional neural network architecture which takes vorticity fields and outputs a positive definite conformation tensor. The second is the adaptation of an assimilation-based training algorithm (Zhu & Page, 2026) which does not require a pre-generated `offline' library of reference conformation fields, but is trained only using the vorticity measurements. This is particularly important in viscoelastic problems, where the appropriate model and parameters to compare to the experiments may need to be determined as part of the solution. In training, measurements made on a time-marched network prediction are required to match the saved time series, while the output of the solver and network predictions at later times are required to be self-consistent. We apply these ideas to two-dimensional Kolmogorov flow in a range of regimes, from simple traveling waves to a fully chaotic state. In all cases, our method produces robust predictions of the polymer stretch, while standard, unregularised variational assimilation is ineffective. In the chaotic case we show that our networks generalise to much larger domains – without further optimisation – than the `minimal' units in which they were trained.
Read the full abstract
Geometric Topology
L-space surgeries on (1,1)-knots in $S^1\times S^2$
Computation and Language
TRIPPULSE: Multi-Agent Travel Planning with Review-Grounded Reasoning
Travel itinerary generation requires balancing strict spatio-temporal constraints with human preferences. Existing LLM-based planners mainly rely on structured attributes and pre- defined traveler personas, but real travel deci- sions are often shaped by reviews that reveal experiential factors such as comfort, safety, ser- vice quality, ambiance, crowding, and hidden risks absent from structured databases. Incor- porating such review information is therefore critical to realistic, user-centric itinerary gen- eration. We propose TRIPPULSE1, a multi- agent framework for review-grounded travel planning. Instead of relying on a monolithic planner (and face context and reasoning bot- tlenecks), TRIPPULSE2 decomposes itinerary generation into specialized agents (each op- erating over localized contexts) for accom- modations, transportation, meals, attractions, and events, coordinated through a global or- chestrator with scheduling mechanisms that enforce temporal and budget feasibility. We augment TRIPCRAFT with 100K+ real-world reviews and introduce Review-Grounded Per- sona Alignment (RGPA), an LLM-as-a-Judge metric for evaluating alignment with human- centric travel experiences. Experiments across multiple trip durations and diverse proprietary and open-source models show that TRIPPULSE maintains strong constraint satisfaction while generating more personalized and experien- tially grounded itineraries.
Read the full abstract
Machine Learning
Towards Stream Learning on Embedded Systems: Benchmarking the Memory Consumption of Stream Learning Methods
Stream learning is commonly evaluated through predictive performance and adaptation to concept drift. However, sustained operation of a stream learner also requires predictable and bounded resource usage even on long streams. This requirement becomes even more critical when learning moves from servers to near-sensor embedded systems where memory and processing are scarce resources. In state-of-the-art stream learning, however, we perceive a strong focus on concept drift adaptation, whereas resource usage is often an evaluation byproduct. To close this gap, we benchmark seven representative stream classifiers on 13 real and synthetic streams under model-size budgets from 128\,KiB to approximately 8\,MiB. Our benchmark comprises a total of 6,463 experiments. We measure failure-aware accuracy, peak model size, time to budget exhaustion, and prediction-plus-update latency. The results reveal two distinct resource failure modes. Adaptive ensembles can exceed small budgets almost immediately because of their initial footprint, even when their size remains stable thereafter. Incremental trees can fit initially but grow throughout a long stream, with HoeffdingTrees (HT) and Extremely Fast Decision Trees (EFDT) increasing by median factors of 7.37 and 5.87. Explicitly compact methods remain the only viable option under the smallest budgets, but are usually overtaken as larger budgets make adaptive ensembles competitive. Hence, many state-of-the-art methods are only partially applicable in embedded systems or for long-running systems. We therefore call on the stream-learning community to make bounded resource usage a first-class design objective alongside drift adaptation, and propose concrete steps toward this goal, including an API through which stream learners can explicitly expose and respect resource budgets.
Read the full abstract
Artificial Intelligence
CARVE: Verified Expansion for Variable-Length Generation in Diffusion Language Models
Masked diffusion language models predict tokens from a partially observed response canvas, enabling bidirectional conditioning and parallel token refinement. Yet standard masked-diffusion decoders use a rigid inference interface: the number of masked positions allocated to the answer is fixed before generation begins. Choosing this length is difficult. A short canvas can truncate reasoning or code, while a long canvas wastes computation and can perturb denoising. We introduce CARVE (Counterfactual-Aware Reveal with Verified Expansion), a training-free variable-length algorithm for masked diffusion LMs. Starting from a shorter canvas, CARVE can grow the response during decoding by inserting additional [MASK] positions. Rather than keeping every insertion, CARVE tests a candidate expanded canvas and asks a counterfactual question: would the model make similar predictions for the unresolved positions in the original canvas if the extra masked space were present? The inserted masks are kept only when they induce low Jensen-Shannon (JS) divergence on aligned unresolved positions. This makes length growth a verified stability decision rather than a pure confidence heuristic. CARVE applies without retraining to both full-canvas and blockwise diffusion decoders. Across code generation and mathematical reasoning benchmarks, CARVE consistently improves average performance over fixed-length baselines across all evaluated model families. Crucially, CARVE achieves these accuracy gains while reducing inference cost, reaching half the FLOPs of fixed-length decoding in some settings.
Read the full abstract
Mesoscale and Nanoscale Physics
Breakdown of Charge-Conjugation Symmetry of Disclinations in 2D Crystals
Disclinations are elementary topological defects in two-dimensional (2D) crystalline membranes, yet their elastic properties remain largely unexplored. Using atomistic simulations, we address the energetics, morphology, and interactions of disclinations in free-standing graphene, a prototypical 2D crystal. We find that while disclinations with positive topological charges follow an expected behavior, negative disclinations exhibit sublinear energy scaling with charge as well as equilibrium shape that deviates sharply from the conventional saddle ansatz. This breakdown of charge-conjugation symmetry leads to qualitatively distinct interactions: positive disclinations repel, whereas negative disclinations display a robust long-range attraction. These trends are shown to be further amplified by self-adhesion in folded membranes. Our results uncover a fundamentally different energetic landscape for negative curvature defects and provide a basis for understanding the stability, self-folding behavior, and defect-driven morphology of graphene and other 2D membranes.
Read the full abstract
Number Theory
Counting solutions to quadratic forms in eight prime variables of off-diagonal rank $3$
In this note we count the number of solutions to a non-degenerate quadratic form in eight prime variables of off-diagonal rank $3$. It is a continuation of work by L. Zhao, who counted solutions to forms in at least nine variables, by B. Green, who counted solutions to 'generic' (which implies off-diagonal rank $4$) forms in eight variables, and by J. Dobrowolski, who counted solutions to forms in eight variables of off-diagonal rank at most $2$.
Read the full abstract
Optics
Quantum Dot Colloidosomes as Triggerable Microlasers
Quantum dot (QD) supraparticle lasers are promising platforms for microscale light sources and photonic labeling, yet their optical properties are set during assembly. Here we introduce QD colloidosomes, liquid-core/solid-shell supraparticles that combine whispering-gallery-mode optical feedback with stimulus-triggered structural collapse. Intact QD colloidosomes show cavity-defined lasing with fluence thresholds of ~2.8 mJ/cm2 and linewidths of 2.2-3.7 nm, demonstrating efficient light trapping without a solid core. We identify shell continuity as a critical determinant for whispering-gallery feedback and lasing by exploring a morphological continuum of suprastructures comprising solid supraparticles, colloidosomes, and microporous hollow shells. Intact colloidosomes support narrow cavity modes, whereas porous shells remain broadband even at high pump fluence. We show that colloidosomes can be driven to rupture and release payload through well-defined pathways, including meniscus-driven capillary failure, uniform heating, and localized near-infrared activation, thereby reconfiguring their optical response from cavity-defined lasing to broadband emission. These results establish QD colloidosomes as reconfigurable microlasers that couple optical-state switching and triggered release within a single self-assembled platform.
Read the full abstract
Soft Condensed Matter
Anomalous temperature dependence in phase transitions via ballistic coalescence
We study kinetics of phase transitions within a single component Lennard-Jones model. For low enough particle densities disconnected clusters form that can move ballistically in an inviscid vapor background. The clusters undergo sticky collisions, thereby forming larger aggregates, which can be of fractal nature at ultra cold temperatures. As the temperature is varied, the exponent of the algebraic growth of average cluster mass changes, exhibiting pronounced nonmonotonic character. We capture this anomalous behavior, in two and three space dimensions, within a ballistic aggregation theory. We show that the scope of the theory is much broader than the typically considered case where cluster motions are uncorrelated. An analysis of the theory shows that ballistic aggregation can even occur exponentially fast. This is in sharp contrast with the conventional algebraic picture, regarding passive matter phase transitions. We discuss scenario where such explosive growth can be realized. In addition, our results are widely relevant in understanding structure and growth in aerosols, cosmic dust and other aggregation processes.
Read the full abstract
Signal Processing
Intrinsic Scatterer Representation for Forward Scattering Modeling of Complex Radar Targets
Forward modeling of scattering centers of radar targets is critical for advanced information retrieval of Synthetic Aperture Radar (SAR) images. Existing forward modeling approaches rely on meshing the target and computing scattering via ray-tracing techniques, which not only incur high computational cost but also discard the semantic information of target geometry, thereby limiting the interpretability of SAR imagery. To address these issues, this paper proposes a novel forward scattering modeling framework that directly constructs stable, compact, and physically meaningful scatterers from target geometry. This formulation decouples target representation from specific observation configurations, enabling an intrinsic scatterer description across varying viewing angles. Specifically, an improved Random Sample Consensus (RANSAC) scheme is first developed to robustly extract planes, cylinders, and spheres from target point clouds, yielding single-bounce scatterers. Potential multiple-bounce scatterers are then automatically detected by analyzing inter-primitive relations, and further refined through geometric clipping and parameter alignment to produce unique scattering representations compatible with canonical scattering center models. Finally, radar responses and SAR images can be generated under arbitrary observation configurations based on the constructed scatterers. The proposed method is validated through extensive experiments, including comparisons with electromagnetic simulations and measured data. The results show that it can accurately characterize the scattering behaviors of complex targets, providing an efficient, interpretable, and reliable solution for SAR image modeling and understanding.
Read the full abstract
Machine Learning
Selection-Aware Stress Testing for Interactive Agents
Agent evaluations often use one benchmark to choose a workflow and then search for task types where its advantage weakens, so both conclusions are selected from the same data. We introduce Selection-Aware Semantic Stress Testing (\SASST{}), which learns a task reweighting from pre-execution features on discovery tasks and evaluates the same paired comparison on separate confirmation tasks. The protocol checks support and stability, uses joint bounds for all planned claims, and can return no claim. We prove conditional asymptotic validity under stated cluster assumptions. A forty-cluster audit finds Gaussian undercoverage and conservative Bonferroni $t$ bounds. In one 480-episode $\tau$-bench study, a $3.75$ point discovery gain vanished on confirmation. A second-model study likewise confirmed neither a workflow benefit nor a stable stress rule.
Read the full abstract
Systems and Control
Parameter Estimation of Power Electronic Converters with Differentiable Physics Simulation
This article proposes a differentiable physics simulation (DP simulation)-based parameter estimation method for the condition monitoring of power electronic converters. In the proposed method, the time-domain simulation of converter dynamics is embedded into a differentiable computational graph, directly linking device parameters to observed voltage and current trajectories. By formulating differentiable time-stepping operators, the nonlinear dynamics of the converter across different circuit topologies are simulated in a unified, differentiable manner. A dc-dc buck converter is used as a representative case study. Using sparse transient samples from existing sensing channels, the method enables noninvasive parameter estimation without additional sensing hardware. Comprehensive simulation studies are conducted to evaluate the impacts of time-stepping schemes, regularization constraints, and various uncertainty sources on estimation accuracy and robustness. Subsequently, 30 distinct hardware configurations are experimentally tested for validation. The results show that the proposed method can effectively track the relative variations of health-related parameters across the critical components. This DP simulation framework provides a novel perspective for physics-informed machine learning in power electronic applications.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Measuring peculiar velocity and tomographic redshift dipole with DESI DR1 catalogs
The so-called “cosmic dipole tension” challenges the Cosmological Principle by positing a discrepancy between the Solar System's peculiar velocity inferred from the Cosmic Microwave Background (CMB) dipole and that derived from large-scale structure number-count dipoles. Here we provide a high-precision determination of the kinematic dipole using the redshift-dipole method applied to the first data release (DR1) of the Dark Energy Spectroscopic Instrument (DESI). By exploiting the Doppler-induced modulation of observed redshifts, this estimator is intrinsically less sensitive to imaging systematics and selection-function uncertainties that can bias traditional number-count measurements. We conduct a tomographic analysis of four tracer populations, Bright Galaxy Sample, Luminous Red Galaxies, Emission Line Galaxies, and quasars, spanning $0.1<z<2.1$. Survey geometry and statistical uncertainties are quantified using 1,000 EZmock realizations. We find that the high-redshift QSO sample implies a peculiar velocity of $v = 357.95_{-48.47}^{+55.05}\,\mathrm{km\,s^{-1}}$, in excellent agreement with the CMB-inferred value of $369.82 \pm 0.11\,\mathrm{km\,s^{-1}}$. By contrast, a complementary number-count analysis yields a significantly enhanced dipole amplitude, which we attribute to leakage of large-scale power and to incompleteness within the DESI DR1 footprint. These results indicate that the redshift dipole provides a cleaner and more reliable probe of the kinematic rest frame, offering strong support for the standard kinematic interpretation at high redshift and helping to resolve the apparent dipole anomaly.
Read the full abstract
Sound
Decoupled Latent Flow Matching for Few-Step Joint Vocal-Accompaniment Separation
Generative modeling provides a flexible way to model mixture-conditioned source distributions, but iterative diffusion and flow matching models are costly for long music signals. This paper studies joint vocal-accompaniment separation through latent flow matching, where a pretrained variational autoencoder (VAE) maps mixtures and sources into a compact latent space and a flow matching model generates vocal and accompaniment latents jointly. The proposed framework decouples semantic separation from acoustic velocity prediction through a Separation Encoder and a Velocity Decoder. To reduce sampling cost, we further apply latent adversarial post-training inspired by Flow2GAN for few-step generation. Experiments show that latent adversarial refinement can improve perceptual and separation metrics under a reduced sampling budget.
Read the full abstract
Artificial Intelligence
Responsible Integration of AI in Cancer Genomics: Barriers, Risks, and Pathways to Trustworthy Clinical Translation
Artificial intelligence (AI) and natural language processing (NLP) are increasingly used to extract, integrate, and interpret biomedical knowledge relevant to cancer genomics, yet their translation into routine clinical oncology has been comparatively slow. The central challenge is not computational capability alone, but trustworthy integration into clinical workflows. This review examines how NLP and AI support the cancer genomics pipeline, from literature mining and automated variant interpretation to clinical trial matching, knowledge graph construction, and multimodal data integration. We identify four interrelated translational failure domains: evidence inconsistency, explainability and uncertainty, data governance and reproducibility, and interoperability. Rather than considering these challenges in isolation, we take a systems-level view, focusing on their interaction across the translational pathway. We propose a conceptual framework and roadmap for addressing these domains through rigorous validation, uncertainty-aware methods, interoperable infrastructures, regulatory alignment, and human oversight across the AI lifecycle. Progress toward routine clinical use will depend less on further improving model capability than on systematically addressing these interacting failure domains from development through deployment and post-deployment monitoring.