Classical Analysis and ODEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
We establish ground-state representations and critical Hardy inequalities in the discrete $L^p$ setting. In particular, we construct critical Hardy weights for the discrete Dirichlet Laplacian on the half-line and the discrete fractional Laplacian on the integers for all $p\in(1,\infty)$. Our approach uses Sobolev–Bregman forms, for which the ground-state representations are exact identities and the corresponding Hardy weights are expressed through linear operators acting on powers of positive superharmonic functions.
Artificial Intelligence
GarmentWeaver: Schema-Aware Structured Synthesis for Multimodal Sewing Patterns
Multimodal Sewing pattern generation aims to infer executable sewing patterns from design cues such as sketches and textual descriptions. As an interpretable and simulation-compatible representation, sewing patterns are particularly valuable for digital garment creation. However, existing methods often model garment specifications as flat long sequences, which entangles garment structure with detailed parameters and leads to redundant components, inaccurate local details, and poor simulation compatibility. In this paper, we present GarmentWeaver, a schema-aware framework for multimodal Sewing pattern generation. GarmentWeaver constructs compact hierarchical targets by activating garment-relevant structural branches and predicts executable Sewing patterns in a structured manner. Specifically, we introduce a schema-aware target construction strategy, build the generator on top of a pretrained vision-language model for multimodal garment understanding, and impose feasibility-aware regularization to encourage structurally valid and simulation-compatible outputs. Extensive experiments show that GarmentWeaver produces more accurate and more executable sewing patterns than strong baselines, while also yielding better simulation results. These findings demonstrate the effectiveness of schema-aware structured generation for reliable multimodal Sewing pattern prediction.
Read the full abstract
Functional Analysis
Maximally Spread Out Measures and Implications for Phase Transitions in Approximation Theory
$\newcommand{\X}{\mathbb{X}}\newcommand{\SC}{\mathcal{C}}$ We establish the existence of a "maximally spread out" Borel probability measure on a totally bounded subset $\SC$ of a (quasi)-Banach space $\X$ under two mild conditions: (i) a growth condition on the covering numbers $N(\SC, \epsilon)$ of $\SC$, and (ii) a technical topological condition that is in particular satisfied whenever $\SC\subset\X$ is closed, bounded, and convex. More formally, condition (i) requires that the so-called lower power-exponential Minkowski dimension of $\SC$, i.e., \[s_\ast:=\liminf_{\epsilon\downarrow 0}\frac{\log\log N(\SC,\epsilon)}{\log(1/\epsilon)}\] satisfies $s_\ast>0$. Under these conditions, we construct a Borel probability measure $\mu$ on $\X$ that is critical for $\SC$, or maximally spread out, meaning that the associated outer measure $\mu^\ast$ satisfies $\mu^\ast(\X\setminus\SC)= 0$ and furthermore satisfies for every $0<s<s_\ast$ the small-ball condition \[\mu^\ast(B(x,r))\le\exp\bigl(-c(s)\cdot(1/r)^s\bigr)\quad\text{ for all }x\in\X\text{ and }0<r<r_0(s).\] The existence of such a critical measure in particular implies that the so-called power-exponential Hausdorff dimension of $\SC$ introduced in [J.~Topol.~Anal.~4(2):203–235, 2012] coincides with the lower power-exponential Minkowski dimension. Previous work [Found.~Comput.~Math.~23(1):329–392, 2023] shows that such a critical measure gives rise to a phase transition regarding lossy compression and approximation by quantized neural networks of elements of $\SC$, provided that the $\liminf$ in the definition of $s_\ast$ exists as an actual limit. There, critical measures were constructed for unit balls of certain Besov and Sobolev spaces considered as subsets of $L^2$. In contrast, our construction is completely general. In particular, our results apply to function spaces of dominating mixed smoothness.
Read the full abstract
Analysis of PDEs
Finite speed of propagation and waiting time phenomena for stochastic porous media equations with nonlinear conservative noise
Starting from localized energy estimates, we prove finite speed of propagation for kinetic solutions to stochastic porous media equations with nonlinear conservative noise, the existence and uniqueness of which has recently been established. In particular, we propose a novel iteration technique which allows us to obtain a Stampacchia-type inequality involving one single integral quantity, despite the possibly different scaling behaviors of the porous media and the noise term. This allows us to apply stochastic filtering arguments developed for the case of linear source-type noise. Using related ideas, we identify flatness conditions on initial data which guarantee locally the occurrence of a waiting time phenomenon, i.e., the onset of forward propagation of the solution's support is locally delayed. The condition for the latter matches the one for the deterministic porous media equation up to a logarithmic correction in the case of critical nonlinearity in the noise, but it requires more and more flatness of the initial data as the nonlinearity tends towards linear conservative noise. This is in line with the expected behavior: In the case of linear conservative noise, instantaneous forward motion is possible due to the effects of stochastic transport, no matter how flat the initial profile is.
Read the full abstract
Other Condensed Matter
Temperature Dependence of the Refractive Index for AlAsGaSb
Accurate design and optimization of photonic multilayer structures like distributed Bragg reflectors (DBRs) require precise knowledge of material optical constants, particularly the temperature dependence of the refractive index. While these parameters are well established for widely used semiconductors, for emerging materials such as antimonides they are often limited to room-temperature data, especially for new spectral ranges of interest. Antimonide compounds, in particular GaSb-based alloys, are promising for quantum photonics applications. In this work, we investigated DBRs lattice-matched to GaSb and designed for operation in the third telecommunication window. Reflectivity spectra were measured in the temperature range from 11.5 K to 300 K, and then fitted using the transfer matrix method (TMM), combined with a dedicated recursive numerical fitting algorithm. Initial parameters included layer thicknesses determined by scanning electron microscopy (SEM) and literature values of refractive indices at room temperature. This approach enabled extraction of the temperature-dependent refractive indices of two AlGaAsSb alloys suitable for forming DBR mirrors for 1.5 um wavelengths. The obtained results provide essential input for reliable DBR design, ensuring proper stopband positioning and high reflectivity under cryogenic operating conditions required for efficient quantum emitter performance.
Read the full abstract
Solar and Stellar Astrophysics
Joint Observations of PTPS Targets (JOTA). Combined spectroscopic and photometric analysis of 16 SB1 systems
Context. The Pennsylvania-Toruń Planet Search, which operates on a sample of $\sim$1000 northern-hemisphere stars, has been underway since 2004. Stars with radial velocity (RV) amplitudes exceeding 2 km s$^{-1}$ represent a backup subprogram sample dedicated to monitoring binary stars with multiple instruments. Aims. We used almost 21 years of combined RV measurements to search for Doppler signals consistent with stellar or brown dwarf companions and to produce a catalog of both known and previously unpublished binary stars in our planet-search sample. Methods. We analyzed the combined RV measurements, searching for stellar companions and obtaining orbital solutions for both known and new binary systems. We also searched for periods in available long-term photometric monitoring data from All Sky Automated Survey (ASAS), and applied Gaia astrometric data whenever available. Results. We report the results of long-term RV monitoring of 16 systems: new detections of low-mass companions to 11 stars and updated orbital elements based on combined sets of our new and literature data for five systems. For two objects (TYC 3318-00789-1 and TYC 3318-01538-1), we find evidence of activity or the influence of another unseen companion, possibly due to line-profile variations or unresolved spectral contamination. We present true masses for three systems in our sample: TYC 1931-1040-1, TYC 3451- 1449-1, and TYC 3667-1636-1. We obtained these masses using Gaia DR3 non-single star data.
Read the full abstract
Fluid Dynamics
Evolution of inertial particle clustering in decaying turbulence
Inertial particle dynamics in turbulence are commonly interpreted in terms of the instantaneous particle Stokes number, as supported by studies in statistically stationary homogeneous isotropic turbulence. But in freely decaying turbulence the Kolmogorov time scale evolves continuously, causing the effective Stokes number, St, to vary even though particle properties remain unchanged. Whether preferential concentration remains uniquely determined by this instantaneous St or depends on the flow's previous evolution has remained largely unexplored. We investigate inertial-particle clustering during the decay of homogeneous isotropic turbulence using direct numerical simulations of heavy point particles in the one-way coupling limit. Clustering is quantified through 3D Voronoï tessellations for populations evolving either from statistically stationary clustered states or initially random distributions. We consider both conventionally forced homogeneous isotropic turbulence and velocity fields reconstructed using physics-informed neural networks. We show that preferential concentration cannot be described solely by the instantaneous St. While particle slip velocity follows the classical steady-state dependence on the instantaneous St, clustering statistics retain a measurable history dependence throughout decay. Existing stationary scaling laws remain applicable to cluster-size evolution, but only through history-dependent prefactors. Particle distributions evolving from different initial conditions rapidly converge towards similar large-scale spatial organisation, indicating that the carrier flow determines the geometry of preferential concentration while finer clustering statistics preserve imprints of the previous evolution. These results demonstrate that preferential concentration in non-stationary turbulence is governed jointly by the instantaneous flow state and its initial state.
Read the full abstract
Combinatorics
On high-girth layered graphs of large Turán density in a hypercube
For a graph $H$, let $\operatorname{ex}(Q_n, H)$ be the largest number of edges in a subgraph of the hypercube $Q_n$ of dimension $n$ that contains no subgraph isomorphic to $H$. We define $\pi_\square(H)=\lim_{n\to\infty}\operatorname{ex}(Q_n,H)/|E(Q_n)|$ as the Turán density of $H$ in the hypercube. Although determining $\pi_\square(H)$ for general $H$ remains widely open, Conlon found a large class of graphs with zero Turán density in a hypercube. In this note, we address the case when $\pi_{\square} (H)>0$. If a graph $H$ cannot be embedded in an edge layer of a hypercube, then $\pi_{\square} (H)\geq 1/2$, as can be seen by taking every other edge layer of $Q_n$. Previously known examples of layered graphs of positive Turán density in a hypercube include graphs containing cycles of length $6$ or $10$, as well as examples of girth $8$. Also, to the best of our knowledge, all previously known examples of graphs with Turán densities arbitrarily close to one are not layered. We show that for every $g \geq 3$, there are layered graphs of girth greater than $g$ whose Turán densities in a hypercube are arbitrarily close to one. Moreover, these graphs have an induced embedding into an edge layer of a hypercube.
Read the full abstract
Artificial Intelligence
Designing an Auditable LLM-Supported Workflow for Qualitative Thematic Analysis
Large Language Models (LLMs) offer new possibilities for scaling qualitative analysis, but existing applications often provide limited methodological transparency regarding how qualitative methods are translated into computational procedures. This paper presents an auditable and privacy-preserving computational operationalization of inductive and latent Thematic Analysis (TA). This paper first derives five design principles from the methodological requirements of TA and the conditions introduced by LLM-based inference: preserving interpretative context, maintaining traceable relationships between empirical material and analytical outputs, representing analytical constructs and reasoning explicitly, constraining LLM inference to interpretative tasks, and enabling privacy-preserving local deployment. Second, it presents a proof-of-concept for a two-phase workflow that operationalizes these principles by combining interpretative LLM inference with deterministic procedural control to generate codes, analytical justifications, themes, and theme descriptions while preserving explicit links to the source material. Third, it proposes an evaluation framework combining structural comparison with human-led TA and independent expert assessment of analytical quality. The evaluation is conducted on semi-structured Danish interview transcripts. and the results shows that the workflow produces code-level outputs with coverage broadly comparable to human annotations and highly rated analytical justifications, while generating a more compressed thematic structure characterized by fewer and broader themes. The findings demonstrate the feasibility of auditable LLM-supported TA through a modular workflow designed to scale to larger datasets, accommodate different LLMs, and support transfer across research domains, with domain adaptation primarily requiring adjustments to the prompting strategy.
Read the full abstract
Numerical Analysis
Magnetic Field Conforming Multiscale Formulations for Locally-Confined Nonlinear Eddy Current Problems Using the FE-HMM Method
Magnetic composites used for the conversion of electrical energy often incorporate ferromagnetic inclusions insulated from each other to mitigate eddy current losses. Numerical models for these composites must be robust enough to address potential convergence issues arising from the presence of nonlinear magnetic inclusions and presence of significant confined eddy currents in the cell. This paper introduces an $\mathbf{h}$-conforming multiscale formulation for magnetic composites in a periodic framework. The proposed method uses the Heterogeneous Multiscale Method (HMM) with two mesoscale problems: a magnetoquasistatic problem for upscaling the homogenized magnetic flux density $\mathbf{B}_M$ and a magnetostatic problem for upscaling the macroscale incremental reluctivity $(\partial \mathbf{B}_M/\partial \mathbf{H}_M)$. Additionally, the method uses relaxed Newton–Raphson schemes at both macro and mesoscale levels to mitigate the well-known NR convergence issue linked to nonlinear BH constitutive laws in $\mathbf{h}$-conforming formulations. The accuracy and performance of the formulation are evaluated using 2D and 3D idealized periodic soft magnetic composites with linear and nonlinear BH curves. Furthermore, the paper demonstrates that the magnetoquasistatic mesoscale problem can be replaced by a magnet a
Read the full abstract
Computation and Language
Seeing the Unseen: Visual Similarity for Pixel Language Model Adaptation
Pixel-based language models (LMs) replace traditional tokenizers by processing rendered images of text, making cross-lingual transfer heavily dependent on the visual and structural properties of writing systems. However, the dynamics of adapting these models to low-resource languages with complex morphology and written in unique scripts are not yet explored. Using Tibetan as a case study, we analyze how continued pre-training of pixel-based LMs is influenced by data scale, initial script exposure, and cross-lingual transfer from languages written in other Brahmic scripts. We introduce four rendering-level metrics to quantify visual script similarity. We evaluate downstream performance across three tasks. Our results show that higher orthographic proximity enhances semantic transfer, even under severe data constraints. Additionally, we find a performance asymmetry based on the pre-training starting point: while multilingual pre-training PIXEL-M4 has stronger initial performance, its capacity for subsequent adaptation seems to be constrained, whereas adapting a monolingual model PIXEL with mixed scripts yields more gains on sentence-level tasks. Our metrics and case study offer empirical observations that could help inform data selection and script adaptation choices when working with pixel-based models in similar low-resource settings.
Read the full abstract
Signal Processing
Foundation Models for Wireless Localization: Pretraining, Adaptation, and Utilization
Accurate wireless localization is a key enabler for 6G networks, yet remains challenging under diverse and rapidly changing propagation conditions. Model-based methods degrade when multipath channels are non-resolvable and model mismatches occur, while supervised deep learning demands large labeled datasets and generalizes poorly to new deployments. Inspired by foundation models (FMs) in language and vision, this article presents a unified framework for FM-based wireless localization that learns transferable channel representations from large-scale unlabeled channel state information and adapts to new environments with minimal or even no supervision. We review the fundamentals of FMs, compare the FM paradigm with existing localization approaches, and introduce a three-stage framework spanning large-scale pretraining, localization-oriented fine-tuning, and context-augmented inference, together with the location-aware applications it enables. Ray-tracing-based case studies show improved positioning accuracy and cross-environment generalization. Finally, we present an outlook on key research directions toward AI-native networks for wireless localization.
Read the full abstract
Quantum Gases
Mass-gap functional determinant approach for mobile Fermi polarons
We extend the functional determinant approach (FDA), previously restricted to static impurities, to the case of finite-mass impurities by using the mass-gap description of Fermi polarons [Phys. Rev. Lett. 135, 193401 (2025)]. The quadratic structure of the mass-gap model enables the exact evaluation of many-body spectra and Ramsey dynamics for mobile impurities. We show that this mass-gap FDA smoothly interpolates between the Fermi-edge singularity for infinitely heavy impurities and the emergence of quasiparticle weight for finite impurity mass. Our results demonstrate that the mass-gap FDA provides a transparent and computationally efficient framework to describe the quantum dynamics of mobile impurities.
Read the full abstract
Computational Geometry
Curves of constant width and Lebesgue's covering problem
A universal cover is a convex set in the plane that contains a congruent copy of every planar set of diameter one. Lebesgue asked in 1914 for one of least area, and the value is not known. We prove that every convex universal cover has area at least 0.8344, improving on 0.832, published in 2005, and 0.833, in a 2026 preprint, both of which come from a disc together with an equilateral triangle and a regular pentagon. Our test sets are instead curves of constant width: the disc, the Reuleaux triangle and the Reuleaux pentagon. Each contains the regular polygon it is built on, so the family is strictly larger at the same number of bodies and the same number of placement parameters, and we show that the classical configuration admits an arrangement whose hull has area below 0.8336, so no bound drawn from those three sets by this argument reaches ours. Curves of constant width were proposed for this role, and explored numerically, by Gibbs in 2014; what is added here is a proof. It consists of an analytic reduction followed by one finite computation. The reduction bounds the hull area from below over an entire box of placements at once, by eroding each Reuleaux polygon to a fixed set contained in every placement that box allows. The computation is an exhaustive subdivision of the resulting five-dimensional space, recorded as a certificate of 486,799,600 nodes and checked by a verifier independent of the search, with a rigorous bound on its floating point error some thousands of times smaller than the margin the verification attains.
Read the full abstract
Computer Vision
Minerals in the Wild: A Hyperspectral-XRF Dataset for Elemental Composition Estimation
Rapid mineral characterization is essential for applications ranging from mineral exploration to industrial ore processing. To this end, Hyperspectral Imaging (HSI) has emerged as a promising sensing modality thanks to its fine spectral resolution, enabling mineral discrimination in both close-range and remote sensing settings. However, the scarcity of publicly available datasets with reliable ground-truth labels hinders the development and evaluation of HSI-based mineral identification methods. We release Minerals in the Wild, a multi-purpose dataset comprising 1,132 rock specimens collected across Europe. For each specimen, we provide an HSI acquisition together with an elemental characterization obtained via an XRF sensor. We define the task of elemental characterization on our dataset and propose a pruning mechanism that removes distant signatures from the USGS dictionary prior to a convex optimization approach for matching HSI pixels with USGS spectral signatures. Finally, we empirically show that our approach outperforms simpler baselines.
Read the full abstract
Robotics
Behavior-Skill: A Fine-Grained Benchmark for Evaluating Vision-Language-Action Policies in Long-Horizon Tasks
Reliable execution of long-horizon mobile manipulation tasks remains challenging because overall task success depends on the successful completion of multiple constituent skills. Existing benchmarks, however, still rely primarily on full-task rollouts and aggregate task-level metrics, making intermediate failures difficult to observe and analyze. We present Behavior-Skill, a benchmark that reformulates the learning and evaluation of long-horizon tasks around executable constituent skills. It contains 235,492 skill instances from 10,000 demonstrations across 50 household tasks and 34 semantic skill categories. Each instance pairs a skill instruction with an aligned observation-action segment, and is further associated with a restorable intermediate state and a skill success condition to enable independent evaluation under valid preconditions. We further introduce trajectory-level and skill-level metrics to characterize policy capability beyond aggregate task success. Extensive experiments across representative VLA policies including pi0.5 and GR00T on the complete 50-task benchmark show that failures are highly non-uniform across skills, with contact-rich manipulation skills forming persistent bottlenecks. These results demonstrate that Behavior-Skill complements full-task evaluation by exposing intermediate capability profiles for analyzing and improving long-horizon VLA policies. Behavior-Skill is publicly available at https://github.com/nubot-nudt/Behavior-Skill.
Read the full abstract
Mesoscale and Nanoscale Physics
Exact fluctuation relations in voltage- and temperature-biased Laughlin-edge constrictions
We present a comprehensive analysis of non-equilibrium fluctuation-dissipation relations connect- ing experimentally accessible chiral-current auto- and cross-correlations to the tunneling-current noise and conductance in Laughlin edge states coupled through a quantum point contact (QPC). We examine their validity for two chiral Laughlin edges held at different temperatures and voltages and show that the relations remain exact for arbitrary tunneling strength, voltage bias, and edge- state temperatures. We further generalize them to spatially extended QPCs and to tunneling am- plitudes with an explicit voltage dependence, and discuss the conditions and limitations associated with these generalizations. Our results establish that the local tunneling-current noise generated at the QPC can be reliably reconstructed from experimentally accessible auto- and cross-correlations measured downstream, providing a robust route to characterize non-equilibrium transport in chiral edge states.
Read the full abstract
High Energy Physics (Experiment)
First measurement of the ratio of $\psi(2S)$-to-$J/\psi$ inclusive production in $p\mathrm{Ar}$ and $pp$ collisions at $\sqrt{s_{\mathrm{NN}}} =113\,\mathrm{GeV}$ with SMOG2
A measurement of the $\psi(2S)$-to-$J/\psi$ production cross-section ratio is performed in proton-argon ($p\mathrm{Ar}$) and proton-proton ($pp$) collisions in fixed-target mode at $\sqrt{s_{\mathrm{NN}}}=113\,\mathrm{GeV}$. Data samples were collected by the LHCb experiment during argon and hydrogen gas injections in the SMOG2 storage cell, resulting in $p\mathrm{Ar}$ and $pp$ collisions, respectively. The $\psi(2S)$-to-$J/\psi$ production cross-section ratio is measured as a function of the charmonium transverse momentum, $p_{\mathrm{T}}$, and rapidity in the centre-of-mass system, $y^{*}$. The $\psi(2S)$-to-$J/\psi$ ratio in $p\mathrm{Ar}$ collisions over that in $pp$ collisions is measured to be $0.90 \pm 0.04 \pm 0.02$ for $-2.3<y^{*}<0.0$ and $0<p_{\mathrm{T}}<8\mathrm{GeV}/c$, indicating the emergence of nuclear effects in the $p\mathrm{Ar}$ system. This study acts as a baseline for the interpretation of future measurements with larger systems accessible by the LHCb experiment.
Read the full abstract
High Energy Physics (Theory)
Brane effective actions and their island rule from $T\overline T$ flows
We derive a $2d$ effective action for semi-classical AdS$_3$ gravity with an EOW brane of arbitrary tension by solving the radial Hamiltonian flow in a derivative expansion. Interpreting the radial flow as an RG flow, the effective theory is identified with a $T\bar T$-like deformed CFT. This leads us to propose that the holographic dual for semi-classical AdS$_3$ gravity with Neumann or conformal boundary conditions is obtained by setting the $T\bar T$-like deformed CFT free. We verify our proposal explicitly for saddles corresponding to $(A)dS_2$ branes in empty AdS$_3$. We discuss three useful ways to decompose the effective brane theory into a matter sector ($T\bar T$-deformed, $T\bar T$-like deformed, and undeformed CFT, respectively) and a corresponding braneworld gravity sector. In particular, the split into $T\bar T$-deformed CFT coupled to $T\bar T$-like deformed Liouville gravity directly extends the Liouville description of the integrated Weyl anomaly into the bulk. The effective action is then used to perform an island-rule calculation for a non-asymptotic brane in an AdS/bCFT set-up, finding exact agreement with the Ryu-Takayanagi result. This extends previous holographic checks on the island rule to non-asymptotic regimes of application, as well as provides a Wald entropy interpretation for $T\bar T$ entanglement. Finally, we relate our effective theory and its higher derivative corrections to AdS$_3$ gravity with a fluctuating radial cutoff by explicit calculation of the on-shell action.
Read the full abstract
Artificial Intelligence
DiffPDE: Masked Diffusion Language Models as PDE Solver
Existing approaches for synthesizing Partial Differential Equation (PDE) solvers predominantly rely on autoregressive models, yet their global left-to-right decoding incurs substantial redundancy when addressing inherently localized bugs. In this work, we challenge this inefficient paradigm and propose DiffPDE, a framework leveraging discrete diffusion language models for targeted code repair. By introducing a localized re-masking and infilling strategy, DiffPDE regenerates only erroneous regions while preserving correct context, naturally aligning generation with the sparse nature of PDE errors. Furthermore, to handle coupled bugs requiring sequential interventions, we present Iterative Debugging GRPO (ID-GRPO), a reinforcement learning scheme that enables multi-round debugging within single trajectories via intermediate rewards. Experiments on PDEBench show that DiffPDE achieves competitive accuracy, outperforms same-scale AR models, and significantly accelerates repair.
Read the full abstract
Mesoscale and Nanoscale Physics
Moiré-induced lattice reconstruction at buried atomic interfaces
Atomic reconstruction at twisted two-dimensional interfaces governs many of their emergent optical, electronic, and mechanical properties, including sliding ferroelectricity. Despite recent progress in understanding lattice reconstruction in suspended twisted bilayers, structural changes at van der Waals heterointerfaces between multilayer crystals remain largely unexplored. Here we use multi-slice electron ptychography to non-invasively recover the three-dimensional atomic structure at marginally twisted rhombohedral interfaces between thick transition-metal dichalcogenide crystals. With a position precision of ~3 pm and a depth resolution ~1 nm, we resolve the twist-induced lattice reconstruction field per layer, and the resulting dislocation network at the buried interface. Despite the bulk nature, we observe markedly strong in-plane interfacial reconstruction due to suppression of the out-of-plane bending by outer layers, exceeding predictions from our three-dimensional modelling. Furthermore, we extract the strain tensor evolution during the decay of the reconstruction into the bulk, providing a structural foundation for understanding multi-layer moiré systems.
Read the full abstract
Computation and Language
WebWorld: The Browser as a World Model for Self-Improving Web Code
VLM-driven self-improvement of web code has a structural flaw: the model that proposes the repair is the model that judges it, and visual plausibility under that judge is a poor proxy for whether the page actually works. What the loop is missing is a counterparty the VLM cannot fool, and the browser already is that counterparty: a deterministic, executable simulator of how an HTML artifact behaves under user actions, and in everything but name a world model for web code. We present WebWorld, the interface that lets a VLM prior interact with this browser-as-world-model autonomously and decides which interactions become supervision. Each round, the VLM emits a critique that the planner compiles into a typed interaction contract; the browser re-executes the candidate and issues an acceptance certificate only when both target progress and preservation of every previously verified capability hold; certified transitions accumulate as a quality ratchet that is the only thing the SFT export ever sees. Under matched training, WebWorld-27B improves Raw-27B by 5.3 points on HTMLBench-400 and 14.9 points on MiniAppBench-Val, and reaches the level of strong frontier systems such as Kimi-K2.6 and GPT-5.4 on interactive HTML generation. Equal-size ablations show that browser-backed admission carries the gain: without the certificate, the matched 9B lift nearly disappears.
Read the full abstract
Solar and Stellar Astrophysics
Equilibrium \(\mathrm{H}_2^+/\mathrm{H}^-\) Abundance Ratios in MARCS Atmosphere Models
We investigate the equilibrium abundance ratio of the molecular hydrogen ion \(\mathrm{H}_2^+\) and the negative hydrogen ion \(\mathrm{H}^-\) in stellar atmospheres using compact Saha-type equilibrium expressions and layer-by-layer partial pressures from MARCS model atmospheres. The analysis distinguishes the temperature-dependent coefficient ratio \(K_{\mathrm{H}_2^+}(T)/K_{\mathrm{H}^-}(T)\) from the full abundance ratio, which also depends on the local ionisation factor \(N_{\mathrm{H}^+}/N_e\). The internal partition function \(Z_{\mathrm{H}_2^+}(T)\) is included in the \(\mathrm{H}_2^+\) equilibrium coefficient. We processed \(51{,}994\) MARCS models, corresponding to \(2{,}911{,}664\) atmospheric layers, and computed \(N(\mathrm{H}_2^+)/N(\mathrm{H}^-)\) directly from the tabulated equilibrium partial pressures, constructing the first systematic map of this ratio across the MARCS grid. \(\mathrm{H}_2^+\) exceeds \(\mathrm{H}^-\) in \(827{,}350\) layers, corresponding to \(F=0.284\), or \(28.4\%\) of all analysed layers. Although \(\mathrm{H}^-\) remains dominant in the global logarithmic mean, with \(\langle \log_{10}[N(\mathrm{H}_2^+)/N(\mathrm{H}^-)] \rangle=-4.229\), \(\mathrm{H}_2^+\) becomes comparable to or more abundant than \(\mathrm{H}^-\) in a substantial subset of layers. Its relative significance increases toward higher \(T_{\mathrm{eff}}\), lower \([\mathrm{Fe}/\mathrm{H}]\), and deeper layers. The balance is therefore controlled by the combined local thermodynamic and ionisation structure, not by temperature alone. These ratios are equilibrium abundance diagnostics and do not imply opacity dominance; assessing opacity requires wavelength-dependent cross-sections and radiative-transfer calculations.
Read the full abstract
Machine Learning
PAC: Progress-Augmented Advantage Curriculum for Multi-Task Reinforcement Learning of LLMs
Reinforcement learning (RL) is used to improve the reasoning abilities of LLMs, while training data span heterogeneous tasks. However, most RL post-training pipelines rely on fixed or manually designed task mixtures, even though task usefulness changes as training progresses. Online curriculum methods often define learnability by update magnitude, ignoring whether the update translates into reward gains, which can misallocate rollout budget toward tasks with large but ineffective updates. We propose PAC, a Progress-Augmented Advantage Curriculum for multi-task RL of LLMs that combines two task-level signals: advantage-derived learnability, which measures the magnitude of the policy update a task can induce, and recent reward gains, which show whether those updates have improved task performance. A Bayesian Thompson Sampling controller uses these signals to allocate rollouts across tasks during GRPO training. We evaluate PAC under two settings: a multi-level reasoning setting and a multi-domain reasoning setting. PAC improves sample efficiency and final performance: it reaches comparable validation scores with fewer rollout steps and achieves higher final averages than random sampling and advantage-based curriculum baselines in both settings. These results show that jointly tracking advantage signals and actual reward gains yields an effective online curriculum for LLM post-training.
Read the full abstract
Software Engineering
Developer Attitudes and Practices Towards Optimizing Software Energy Consumption
Context: Software significantly influences the efficiency with which hardware resources are utilized, yet software energy consumption is seldom treated as a first-class concern in day-to-day development practice. Objective: This study investigates professional developers' attitudes, decision-making, and development practices related to software energy consumption, with particular emphasis on how energy considerations are recognized, assessed, and acted upon during software development. Method: To this end, we conduct an online survey with 134 software developers. Our study combines quantitative analyses with a qualitative open-card sorting of free-text responses to characterize perceptions, practices, and reasoning patterns around energy consumption. Findings: Energy consumption is explicitly considered in only a minority of projects. More commonly, developers influence energy use indirectly by optimizing proxy properties such as execution time and CPU utilization. Responses to scenario-based questions reveal systematic blind spots in this mental model, including cases in which performance improvements increase energy consumption or exhibit no correlation. We also identify organizational disincentives, limited tooling, and educational gaps as major barriers to adoption. Implications: (1) Institutionalize energy-aware approaches through visible flagship deployments that demonstrate value, (2) expand research and education on energy-performance trade-offs, and (3) develop practical, developer-oriented measurement and feedback tools that lower adoption barriers.
Read the full abstract
Human-Computer Interaction
User Experience in Human-Machine Interaction: Insights from Field Studies in Autonomous Mobility
Autonomous vehicles (AVs) promise safer, cleaner, and more inclusive mobility, yet large-scale adoption is hindered by user acceptance rather than by technical challenges. Prior studies on acceptance and user experience largely rely on surveys, simulators or Wizard-of-Oz setups, often over-representing technologically enthusiastic participants and focusing on drivers instead of passengers. We address this gap with real-world field studies with AVs in real traffic, totaling 144 participants. Using multi-modal sensing, we evaluated EGG, heartbeat, breathing, camera and voice signals for affect inference in combination with vehicle data. Our results show that breathing, camera and voice measurements are reliable and pratical in naturalistic passenger contexts. We further contribute a validated study protocol, a self-assessment app for real-time assessment during human-machine interaction, and a tailored questionnaire to capture participant attitudes towards AVs. By grounding UX evaluation in real-world contexts, this work lays a foundation for user-centered design of autonomous mobility systems and robotics in general. Our work bridges the gap between affective computing and technical implementation of autonomous vehicles.
Read the full abstract
Information Retrieval
Local-to-Global Sentence-Level Graph Reranking for Scientific Synthesis
Retrieval-augmented scientific synthesis aims to answer complex research questions by integrating information from multiple papers into comprehensive and well-grounded responses. Since the generator can only synthesize the information selected and organized by the reranker, the quality of the generated synthesis depends critically on the reranked results. However, most rerankers operate at the passage level, which leaves key methodological, empirical, and comparative information buried in long and flat contexts, weakening the grounding of generated claims. Moreover, existing rerankers mainly rely on independent query-candidate scoring which overlooks complementary, contextual, and contrasting relations across scientific candidates, limiting information coverage and the comprehensiveness of the resulting synthesis. To address these limitations, we propose LoG-Reranker, a local-to-global sentence-level graph reranking framework for scientific synthesis. LoG-Reranker performs role-aware local scoring to identify fine-grained, query-relevant sentences and then models their relations on a sentence graph across the candidate set to globally refine sentence rankings. Top-ranked sentences and their connected neighbors are organized into a structured input context for generator to produce more grounded and comprehensive synthesis. Extensive experiments on scientific synthesis and reranking benchmarks show that LoG-Reranker consistently outperforms competitive rerankers, yielding more reliable rankings and improving the quality of generated synthesis.
Read the full abstract
Signal Processing
Beamforming Design Via GNN in mmWave Cell-Free Massive MIMO Using Sub-6 GHz CSI
Beamforming methods in millimeter-wave (mmWave) cell-free massive multiple-input multiple-output (CFmMIMO) systems require accurate channel state information (CSI), whose acquisition entails significant training overhead. This paper shows that fully digital cell-free mmWave beamforming can be effectively learned from sub-6 GHz CSI using a graph neural network (GNN). Specifically, we represent a CFmMIMO system as a wireless graph, and the GNN is trained to approximate beamformers that maximize the downlink sum-rate based on the available sub-6 GHz CSI. A message-passing mechanism is proposed to capture inter-user interference and inter-base-station cooperation across different network topologies. Simulation results demonstrate that the proposed sub-6 GHz-assisted GNN-based beamformer achieves competitive and often superior sum-rate performance compared to classical baselines that rely on full mmWave CSI.
Read the full abstract
Materials Science
Chemically Resolved Topological Coordinates Link Structural Dynamics and Configurational Thermodynamics
Atomic coordinates specify a structure, but they do not reveal how chemical connectivity across several length scales relates to atomic motion and configurational energy ordering. We formulate chemically directed persistent homology at four resolutions—complete networks, individual sites, spatial fields, and substitutional arrangements—while retaining the chemical identity and length scale of each connectivity feature. In ab initio molecular dynamics (AIMD) trajectories of $\delta$- and $\gamma$-CsPbI$_3$ at five temperatures spanning 500–700 K, the corner-sharing $\gamma$ network has a lower Pb–I restoring stiffness and permits larger iodide excursions, yet iodide positional correlations decay 2.27 times more slowly and Pb-network topology retains memory 1.63 times longer than in the edge-sharing $\delta$ phase. Local softness and loss of network memory are therefore distinct. At individual sites, rare $\gamma$-phase Pb environments with a $\delta$-like Cs-cage connectivity precede 0.17 $\mathring{\mathrm{A}}$ greater Pb displacement over the subsequent 0.5 ps. The same Pb-network coordinate resolves disruption of corner-sharing connectivity across a 2560-atom $\delta|\gamma$ boundary. In substituted CsPbI$_3$, compact dopant arrangements undergo greater cooperative host relaxation and lie lower in density-functional-theory (DFT) energy than dispersed arrangements of the same composition. SchNet and Allegro model families with comparable energy errors encode opposite ordering along this coordinate, and 61 of 247 supplied models with errors below 1 meV atom$^{-1}$ on separate test structures reverse the DFT relation. Because relative configurational energies set Boltzmann populations, chemical network topology links structure to physical response and tests whether learned energy models preserve DFT configurational ordering even when their average errors are small.
Read the full abstract
General Economics
Tariff Threats, Macroeconomic Expectations, and Policy Communication Strategies: Experiments Based on a Multi-Agent System
Tariff threats can move household beliefs before policy is enacted, yet their rapidly changing language is difficult to study with conventional surveys. We build a multi-agent system that turns 300 households from the Michigan Surveys of Consumers into persistent large-language-model agents exposed to social-media information over several simulated months. Calibrated agents reproduce some distributional and demographic patterns in human survey data collected after the announcement of Liberation Day tariffs. Simulated experiments indicate that immediacy, rate salience, semantic progression, message complexity, narrative, and sender identity jointly shape inflation and unemployment expectations and their dispersion. Open-ended responses trace these effects to attention, ambiguity, credibility, and causal narratives. A second experiment finds that central-bank explanations can coordinate beliefs, although their effects on average expectations depend on message content. The framework supports disciplined exploration of policy communication, subject to human validation rather than as a substitute for it.