Solar and Stellar Astrophysics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 9 November
The H$\alpha$ line probes the solar chromosphere, but its scattering polarization is difficult to interpret because of magnetic fields, plasma motions, and atmospheric 3D inhomogeneities. We investigate its intensity and linear polarization in a 3D magnetohydrodynamic solar-atmosphere model including nonequilibrium hydrogen ionization. Using PORTA, we solve the full 3D non-LTE polarized radiative transfer problem for a multilevel hydrogen atom, accounting for atomic polarization, Hanle depolarization, horizontal radiative transfer, and macroscopic velocities. We degrade synthetic Stokes profiles to the spatial, spectral, and polarimetric resolution of ZIMPOL observations for direct comparison. The modeled center-to-limb variation follows the observed trend, with comparable polarization amplitudes. The profiles show large spatial variability from symmetry breaking by horizontal inhomogeneities and atmospheric dynamics, as well as diverse line-core asymmetries. Classifying $Q/I$ profiles by asymmetry reveals a statistical correlation between profile morphology and magnetic-field strength in the H$\alpha$ formation region, consistent with Hanle depolarization: multi-peaked profiles favor stronger fields, whereas asymmetric single-peaked profiles favor weaker fields with smaller vertical strength variations. Thus, H$\alpha$ scattering polarization reflects the interplay of magnetic fields, velocity gradients, and 3D radiative transfer. Our results highlight the need for 3D modeling to interpret H$\alpha$ spectropolarimetry and its potential to diagnose chromospheric magnetism and dynamics.
Cryptography and Security
Reconfiguring System-Level Protection Through Bounded Delegation in RISC-V MCUs
MCU-based embedded and cyber-physical systems increasingly require protection policies to change at runtime as resources, software, and system composition evolve. Yet widely used COTS MCU protection mechanisms are still largely designed around statically established policies. While they can restrict which domains modify protection primitives, they generally do not constrain what policy an authorized domain may create. As a result, domains may expand protection rules beyond their intended scope or interfere with boundaries established by other domains. We identify bounded configuration authority as a missing primitive for secure dynamic policy evolution and introduce an ownership-aware model in which explicit ownership and rule containment bound both configuration authority and recursive delegation. Changes to active protection-rule ranges are validated before commit, preserving protection boundaries without extending the normal access-checking datapath. We implement the model in an open-source RISC-V World Checker integrated into a CVA6-based SoC. Our FPGA evaluation shows no degradation in access latency or operating frequency, with 7.1% LUT and 1.2% FF overhead for eight rules. In an OTA update case study, direct reconfiguration under delegated authority reduces policy-transition latency by 89.5% over hypervisor mediation and 94.6% over trusted firmware mediation, while preserving established authority boundaries. All artifacts will be open-sourced to support the evolution of RISC-V specifications and system-level protection designs.
Read the full abstract
Systems and Control
Reshaping Checkpoint-Induced Power Variations Through Inference Workload Scheduling
Synchronous checkpoints in large language model training cause rapid power variations that challenge frequency regulation in islanded data-center microgrids. This paper proposes a checkpoint-aware two-layer framework that schedules flexible inference workloads to compensate for checkpoint-induced disturbances. Using measured GPU power profiles and anticipated checkpoint power deficits, the upper layer coordinates heterogeneous task selection and launch times, while the lower layer adjusts the batch sizes of newly launched tasks online to correct power-tracking errors. Early launching (EL) and staged retirement (SR) further smooth power transitions at checkpoint onset and recovery, respectively. PSCAD/EMTDC simulations with reference checkpoint drops of 1-3 MW demonstrate reductions of 41.6-61.6% in maximum absolute frequency deviation and 68.5-89.6% in mean absolute frequency deviation relative to no scheduling. Battery energy storage system (BESS) peak charging power and charging energy decrease by 65.1-100% and 89.7-100%, respectively. These benefits exceed those of greedy scheduling when GPU resources are relatively abundant.
Read the full abstract
Networking
Reducing Cold-Start Latency on the WebAssembly Edge via Locality and Network-Aware Scheduling
Edge computing places computation closer to users and data sources, but introduces heterogeneous hardware, limited resources, and variable network conditions. WebAssembly (Wasm) is increasingly considered for these environments because modules are compact, portable, and quick to start. However, cold-start latency remains a challenge: when a worker node does not yet hold the required artifact, it must fetch it before execution, adding transfer overhead that directly increases the end-to-end (E2E) latency, especially for large artifacts or slow network links. At the same time, the geographical distance between the requester and the assigned worker independently contributes to latency through network routing overhead. Together, artifact locality and network proximity do not always point to the same placement decision, and naive scheduling strategies fail to account for either. This work extends a Wasm-native edge orchestrator with state-aware scheduling strategies that jointly optimize for both objectives. Evaluation on a Raspberry Pi testbed with emulated regional network latency shows that a hybrid scheduler combining cache-state and network-proximity signals reduces mean E2E latency by up to 40.8% compared to a default round-robin baseline. Artifact locality-aware placement is most effective when artifacts are large or repeatedly requested, while network-aware placement dominates when artifacts are small and routing latency has a larger relative effect, but combining both objectives consistently yields the lowest E2E latency across diverse edge workloads.
Read the full abstract
Data Structures and Algorithms
Better Bounds For Graph Reconstruction
The goal in graph reconstruction problems is to learn an initially unknown graph using only a few queries of a specific type. Possibly the most natural query type is retrieving the distance between any two vertices of a connected, undirected, and unweighted graph. For a bounded-degree graph on $n$ vertices, Kannan, Mathieu, and Zhou [TALG 2018] showed a randomized algorithm that uses only $\tilde{\mathcal{O}}(n^{3/2})$ such queries. On the lower bound side, it is only known that any randomized algorithm needs $\Omega(n\log n)$ queries. We make a significant step forward to bridging these bounds by designing a randomized algorithm that uses $n^{4/3+o(1)}$ queries. This requires extending the original approach based on Voronoi diagrams into a recursive procedure that partitions a cell into smaller cells. While such a recursive approach has been used in the related graph verification problem, in the more general graph reconstruction problem we need to operate without knowing the graph, which requires a new (and more technical) approach.
Read the full abstract
Computational Complexity
Type-logical grammars and formal languages
We show that type-logical grammars with the standard rules for product, associativity, extraction and infixation have an NP-complete fixed recognition problem, adapting a construction for first-order linear logic from Pshenitsyn (2025), who already showed that grammars in first-order linear logic are closed under intersection and therefore not semilinear and not mildly context-sensitive. We strengthen these results and shown that grammars in first-order linear logic can simulate the quasi-linear grammars of Book & Greibach (1970), the grammars recognised in non-deterministic linear time (NSPACE(n) or. NLIN). I argue that NLIN is an interesting class of formal languages as well, and a useful upper bound on the time complexity of formalisms used for natural language, just like LOGCFL is a useful upper bound on the space complexity. Taken together this means that first-order linear logic can be seen as the logic of non-deterministic linear-time string languages, graph languages and automata.
Read the full abstract
Chemical Physics
Analytic $GW$-Bethe–Salpeter Gradients with Quasiparticle Response in the Resolution of the Identity
Analytic nuclear gradients for excited states from the Bethe$-$Salpeter equation (BSE) in the static screening approximation are presented within this work. The response of the screened interaction to nuclear displacements is treated within the resolution-of-the-identity (RI) approximation, in close analogy to RI random phase approximation gradients, and is folded into the Lagrangian formalism of time-dependent density functional theory gradients. Quasiparticle gradients enter via the full analytic derivative of the corrections for RI contour-deformation $G_0W_0$ and ev$GW$, also taking into account that incomplete quasiparticle spectra are typically supplied. Comparisons to earlier approaches using a geometry-independent fixed quasiparticle correction are made. For the latter, the orbital-rotation terms are derived exactly, too. The implemented gradient scales as $\mathcal{O}(N^4)$, and the three-index integrals are processed in batches with a memory demand of $\mathcal{O}(N_\mathrm{aux}^2 + N_\mathrm{occ}^2 N_\mathrm{aux})$. Excited-state geometries of a set of small molecules are compared to EOM-CCSD references and to TD-DFT. It is shown that the full quasiparticle gradient removes most of the systematic underestimation of the bond lengths in singlet excited states. A comparison along the C$-$C stretch of acetylene shows that the neglected derivative of the quasiparticle corrections is modest, but becomes erratic for $G_0W_0$ near poles of the self-energy, which ev$GW$ avoids.
Read the full abstract
Materials Science
GibbScope: interactive calculation and visualization of phase diagrams in the browser
Phase diagrams are a constant work in progress as Gibbs-energy models are fitted, revised, and disputed in the light of an endless stream of experimental and computational data. Yet, phase diagrams are still largely communicated as static figures, in much the same way as a century ago. We present GibbScope, a web-based framework for interactive calculation and visualization of binary phase diagrams. Written in Rust and compiled to WebAssembly, the new CALPHAD engine recomputes a complete phase diagram in the browser in a fraction of a second with zero installation on the user or server side. The high speed allows new ways of interacting with phase diagrams and underlying assessments. Validation against well-established CALPHAD software shows agreement to within 0.01 K for invariant temperatures and within 1e-6 for tie-line compositions for most databases. GibbScope offers interactive CALPHAD parameter adjustments, overlays of different assessments and point-by-point misfit to experimental data, which makes the diagram a live, working object. In addition, GibbScope provides convenient access to 2745 thermodynamic databases from the SGTE collection (Hallstedt, 2025) and their live adjustment. For over 1200 of these databases, all phases are modeled in full with the current implementation.
Read the full abstract
Statistics Applications
Bias in Method-of-Moments Heritability Estimation Under Model Misspecification
Method-of-Moments (MoM) based approaches for estimation of variance components — heritability and beyond — are central in computational genetics due to their flexibility in addressing diverse and complex models while minimizing assumptions, and ease of computation and approximation in biobank-scale data. MoM are closely related to other important methods in this area like LD-score regression. A fundamental, highly debated question relates to the bias inherent in MoM estimates of variance components when the fitted model is misspecified: since the true underlying model is unknown, the fitted model may be missing some of the components from the true model or contain superfluous ones. We offer a general mathematical formulation of this bias and investigate its properties. This leads to novel insights about the sign and the magnitude of the bias in settings of interest and allows extensions and re-interpretation of previous MoM results in the literature. One case study we pursue is in estimating gene-environment interaction variance components (GxE). We prove that when omitting environment-specific noise components (NxE), the resulting GxE estimates are strictly upward biased, even when no true interaction exists. In another case study, we consider heritability estimation, when the genetic variance components are incorrectly partitioned (such as using a single genome-wide component instead of chromosome-specific components). We derive explicit expressions for the bias in the estimate of genome-wide heritability and its dependence on LD scores within and between components. For example, if all components have the same average LD score, the misspecified heritability estimate is still unbiased.
Read the full abstract
Atmospheric and Oceanic Physics
A Dual-Frequency-Constrained Structure-Function Kirchhoff Model for Near-Nadir Ocean Backscatter – Part I: Theoretical Framework
Most operational near-nadir geophysical model functions (GMFs) are empirical and fitted one radar band at a time, and do not explain the difference between Ku and Ka band. This paper derives a backscatter model in which one local description of the sea surface serves both bands. The near-nadir Kirchhoff integral is written in terms of the elevation difference between two surface points separated by a horizontal lag. The surface then enters through the structure functions of that difference, and the scattering kernel selects the lags each band samples, about 2.5-1.4 cm at Ku and 1.0-0.5 cm at Ka band. Gaussian, isotropic geometric optics is recovered for a quadratic structure function, without a spectral cutoff. With a logarithmic second-order structure function, one wind-dependent log-slope sets both the incidence shape and the Ku-Ka shape difference, and band transfer reduces to evaluating one curve at a second lag. Same-footprint dual-frequency radar data show that one band alone does not determine this transfer. The log-slope is the level of the short-wave saturation range and grows about as the square of the wind speed; a physical short-wave spectrum reproduces this growth but overestimates the level. Dual-frequency radars thus measure the centimetre-scale roughness level, although they do not separate a scale-dependent structure function from non-Gaussian surface statistics. A companion paper delivers and evaluates the resulting GMF, KuKa-Mod.
Read the full abstract
Combinatorics
Budan–Fourier theorem for circuit polynomial systems
We prove a Budan–Fourier theorem for linear combinations of analytic functions whose successive Wronskians are positive: the number of zeros of $g=\sum_{k=1}^s c_kh_k$ in an interval $(a,b]$, counted with multiplicities, is bounded by the drop of the number of sign changes of the sequence of Wronskians $W(h_1,\ldots,h_{k-1},g)$ between $a$ and $b$, and the difference is even. This refines the bound $s-1$ of Koiran, Portier and Tavenas, and we show that it applies, after a suitable renumbering, to any sequence of functions satisfying Descartes' rule of signs. We then study the functions arising from polynomial systems supported on circuits, that is, systems of $n$ equations in $n$ variables with $n+2$ monomials. For these functions, we show that the Budan–Fourier bound never exceeds Descartes' bound, and we compute it at the endpoints of the interval of definition. As an application, we obtain a refinement of the optimal Descartes' rule of signs for circuits of Bihan, Dickenstein and Forsgård: we bound the number of positive solutions whose logarithm lies in explicit polytopes, these bounds add up to at most the bound of Bihan, Dickenstein and Forsgård, and they determine the parity of the number of positive solutions.
Read the full abstract
Statistical Methodology
Graph-Guided Bayesian Factor Analysis: A Fast Integrated EFA-CFA Approach for High-Dimensional Data
Factor analysis has been central to the analysis of high-dimensional biomedical data. However, existing exploratory and confirmatory factor analysis methods face several limitations: less interpretable factor findings, difficulty in identifying which variables can and cannot be represented by low-dimensional factors, challenges in estimating the covariance among factors, and maximum-likelihood fits that break down when variables outnumber subjects. We propose graph-guided Bayesian factor analysis (gg-BFA) to address these gaps. We first use a Bayesian model to explore and learn the latent graph structure, identifying which variables can and cannot be represented by low-dimensional factors and how many factors are needed. A dense-subgraph search proposes partitions of the variables into communities, each defining one factor, and a forward stepwise search compares their fractional variational posteriors and stops when the evidence lower bound first decreases. We show that this search recovers the true communities even when the number of variables grows much faster than the sample size. We then develop a confirmatory Bayesian model whose variational posterior of the covariance contracts at the parametric rate up to a logarithmic factor, yielding posterior inference for the factors and their covariance, as well as predictions of missing values. Its four members range from a community mask to several cross-loadings per variable. In five biomedical panels, the complete analysis took under ten minutes each on one GPU, and cross-loadings improved held-out covariance and the prediction of masked measurements. In TCGA Kidney, six of the first eight factors were enriched for known pathways, and 190 of the 210 factor correlations had 95% credible intervals excluding zero. Overall, gg-BFA is computationally fast and provides interpretable factor analysis findings and reliable inference results.
Read the full abstract
Game Theory
Learning Global Equilibria in Non-Concave Prospect Theoretic Games
Human agents in non cooperative games often exhibit non rational behaviour. Prospect theory provides a behavioural framework to capture how agents perceive gains and losses under risk, but, its incorporation into games typically leads to non concave and non convex utility functions, making equilibrium computation challenging. In such cases, it is difficult to obtain algorithms that have global convergence behaviour. This paper proposes a learning algorithm which uses minorization-maximization (MM). Under a proximal Polyak-Lojasiewicz (PL) condition on the potential function, we establish global convergence of the algorithm to a potential-maximizing Nash equilibrium. We further show how the structure of the MM minorizer can be used to enable a distributed implementation of the algorithm. With additional noise injection, the individual updates of the agents can be obscured, while still ensuring global convergence.
Read the full abstract
Optimization and Control
FEALPy.OPT: A Multi-Backend Tensor Computing Framework for Metaheuristic Optimization on CPU and GPU Platforms
Metaheuristic algorithms (MAs) are widely used to solve complex optimization problems, but their computational costs can become substantial as population size and problem dimensionality increase. This paper presents FEALPy.OPT, an open-source Python framework for metaheuristic optimization built on the FEALPy computational infrastructure. It integrates a unified optimizer abstraction with multi-backend tensor computation, supporting NumPy and PyTorch backends on CPU and GPU platforms. To evaluate its computational performance, five metaheuristic algorithms are tested on ten benchmark functions under three problem scales, with population sizes ranging from 100 to 10,000 and dimensions from 30 to 100. The results show that NumPy/CPU achieves the shortest average runtime for small-scale problems, whereas PyTorch/GPU becomes increasingly advantageous as the problem scale grows. For large-scale problems, PyTorch/GPU is approximately 9.50 times faster than PyTorch/CPU and 32.96 times faster than NumPy/CPU. These findings demonstrate the value of multi-backend and multi-platform support for improving the computational flexibility and efficiency of metaheuristic optimization.
Read the full abstract
Quantum Physics
Effective Time Advance of Quantum Clocks under Postselection
In the familiar twin paradox, the traveling twin ages less than the one who stays behind as a consequence of relativistic time dilation. Here, we show that quantum postselection can effectively reverse this outcome. Using an analytically solvable quantum clock model, we demonstrate that postselection of the center-of-mass motion produces an effective time advance through anomalous weak values, even though every individual motional branch undergoes ordinary time dilation. We extend this analysis to a weak gravitational field and show that an effective time advance can arise even for simple coherent states of the quantum clock motion. We further illustrate this effect using a hydrogen-like atom, revealing how it manifests itself in the atomic wavefunction. Our results demonstrate that quantum interference and postselection can produce an effective time advance beyond conventional relativistic time dilation.
Read the full abstract
Algebraic Geometry
On the Cohomological Amplitude of the Locally Analytic Jacquet–Langlands Functor
We prove a local cohomological bound $R\Gamma_{\mathrm{pro\acute et}}(X,\mathcal F)\in D^{[0,\dim X]}$ for a pro-étale sheaf with a derived $p$-complete integral lattice whose modulo $p^m$ reductions are filtered colimits of finite local systems on an affinoid topologically of finite type over $C$. For $G=\mathrm{GL}_n(F)$, with $n\geq2$ and $F/\mathbb Q_p$ finite, we apply these local bounds to variants of Scholze's Jacquet–Langlands functor $\mathrm{JL}_\mathscr{B}(\Pi):= R\Gamma_{\mathrm{pro\acute et}}(\mathbb{P}^{n-1}_C,\mathcal{F}_{\Pi}\otimes^{L, \square}_{\mathbb{Q}_p}\mathscr{B})$ for $\mathscr{B}\in\{\mathbb{Q}_p, \widehat{\mathscr{O}}, \mathbb{B}_J\}$ and Banach or compact-type LB representations $\Pi$ of $G$, obtaining $\mathrm{JL}_{\mathscr{B}}(\Pi)\in D^{[0,2(n-1)]}$ for each choice of $\mathscr{B}$. We also prove that for arbitrary continuous principal series $I(\eta)=(\mathrm{Ind}_B^G\eta)^{\mathrm{cont}}$, we have $\mathrm{JL}(\mathrm{Ind}_B^G\eta)\in D^{[0, n]}$, while $\mathrm{JL}_{\widehat{\mathscr{O}}}(I(\eta)),\mathrm{JL}_{\mathbb{B}_J}(I(\eta))\in D^{[0, n-1]}$.
Read the full abstract
Dynamical Systems
Diophantine conditions for absolute continuity of projections for self-similar measures
We prove that every projection of a planar self-similar measure $\mu$ is equivalent to Lebesgue measure on its support if the rotations satisfy a simultaneous Diophantine condition with exponent $\tau$ and $\mu$ has finite $s$-energy for some $1+2\tau\le s<2$. Under strong separation, we prove the fibre measures have exact dimension $\dim_H\mu-1$. For self-similar sets $E$ with $\dim_H E>1+2\tau$, the same rotation condition implies uniformly positive projection lengths and fibres of dimension $\dim_H E-1$ at Lebesgue-almost every point of each image without separation assumptions. The absolute continuity and fibre dimension theorems extend to non-coordinate projections of products under a joint Diophantine condition with exponent $\tau$ on the logarithmic contraction ratios. These imply for all self-similar sets $K,L\subset\mathbb R$ satisfying this condition and $\dim_HK+\dim_HL>1+2\tau$, every sum $uK+L$, $u\ne 0$, has positive length, and $\dim_H(L\cap(y-uK))=\dim_HK+\dim_HL-1$ for Leb. a.e. $y\in uK+L$. The proof combines the $L^1$ Gaussian smoothing approach used in the higher dimensional case with averaging at random stopping scales with a Brownian martingale bound using Itô calculus.
Read the full abstract
Combinatorics
Permutation symmetries and characteristic polynomials
We compute certain multilinear functionals of permutation-invariant random matrices, following the work of Marcus and Geneson. As an application, we derive formulae for the average characteristic polynomial of the sum and the product of permutation-invariant random matrices.
Human-Computer Interaction
Creative Intent as an Evolving Shared State: Supporting Cross-Stage Human-AI Video Co-Creation
As generative AI becomes increasingly involved in video creation, creators face challenges in expanding, translating, and negotiating creative intent across stages. We therefore view creative intent as an evolving shared state throughout human-AI co-creation. A multi-stage design was employed: semi-structured interviews with 12 creators informed 3 design goals, followed by expert co-design and the development of VideoMaker. VideoMaker organizes creation into a six-stage workflow that progressively translates creative intent. At key stages, creators negotiate with AI through the Seed Panel, explicitly confirming, revising, and updating intent. A shared AI Agent, supported by the Multi-style Script Library and Cinematic Language Knowledge Base, enables differentiated expansion of initial intent and faithful translation. A within-subjects study with 30 participants showed that VideoMaker effectively supported the expansion and cross-stage translation of creative intent, with stronger intent preservation, while negotiated boundaries between creator-confirmed intent and AI initiative remained difficult to sustain.
Read the full abstract
Cryptography and Security
Double Blind Evals: Resolving the Dual Confidentiality Dilemma in AI Safety Auditing
AI safety evaluations often involve sensitive prompts and proprietary models. Evaluators want to keep their evaluation prompts secret from model owners to prevent purposeful or incidental data leakage, ensuring longer usefulness of their benchmark. Model owners in turn wish to keep their proprietary model weights and inference code within their own secure infrastructure to protect their IP. We present a way forward for "double-blind evals", which provide cryptographic guarantees that an evaluator's prompts are not shared with the model owner, while simultaneously maintaining the confidentiality of the model weights and inference code. To accomplish this, we use secure enclaves that encrypt data in RAM at the hardware level. In a world-first pilot, we test this approach by evaluating a proprietary Google DeepMind model (Gemini 2.5 Flash Lite) against a selection of the private AILuminate benchmark corpus, using an NVIDIA H100 secure enclave on Google Cloud Platform, and using OpenMined's PySyft to maintain data and model privacy. We believe this effort marks the first use of this technology to provide mutual secrecy for one organization's frontier-class proprietary model weights and another organization's closed benchmark.
Read the full abstract
Sound
Direct Conditioning of Audio Diffusion Transformers on fMRI Reveals Cortical Contributions to Sound Reconstruction
Reconstructing audio from brain activity remains challenging. Existing brain-to-audio pipelines typically map neural responses to predefined stimulus representations before synthesis. While recent work in the visual domain has explored direct conditioning on brain activity, this approach has not yet been extended to audio diffusion models. We introduce MAAS (Multi-Area Auditory Synthesis), an end-to-end framework that conditions a pretrained audio diffusion transformer on ROI-wise fMRI responses without first supervising a decoder to predict an external stimulus representation. MAAS uses region-specific projections and learned brain tokens to condition Stable Audio through a dedicated cross-attention pathway. On a 7T fMRI dataset, we demonstrate consistent improvements over baselines, including two-stage fMRI-to-latent conditioning, across both acoustic and semantic evaluation metrics. In addition, we introduce a fidelity metric grounded in a computational model of auditory neural processing, which allows us to quantify the contribution of individual auditory cortical regions to reconstructed audio representations.
Read the full abstract
Probability
The Paley–Wiener excess and a local law for the ${\rm Sine}_\beta$ process
The main result of this paper is the proof that the Paley–Wiener excess of the ${\rm Sine}_\beta$ process almost surely equals $\lfloor \sqrt{2/\beta}\rfloor$ for all $\beta>0$. We also derive the loop equations for the resolvent of the ${\rm Sine}_\beta$ point process and use them to obtain accurate bounds on the moments of the associated Stieltjes transform.
Read the full abstract
Optimization and Control
Converse Lyapunov theorem for input-to-state stability of infinite-dimensional systems
We prove converse Lyapunov theorems for input-to-state stability (ISS) of a broad class of infinite-dimensional systems applicable to evolution equations in Banach spaces, boundary control systems, and delay systems. To this end, we employ a novel method that does not require constructing auxiliary closed-loop systems. We start by showing that ISS of a control system implies uniform global asymptotic stability of the same system with respect to trajectory-dominated inputs. Then, under an additional regularity requirement, we prove that an ISS Lyapunov function can be constructed. Based on our general result, we prove that for linear systems with unbounded $\infty$-admissible operators, ISS is equivalent to the existence of a Lipschitz continuous coercive ISS Lyapunov function.
Read the full abstract
Quantum Physics
Reducing Provers in Distributed Quantum Verification
In the distributed quantum Merlin-Arthur ($\mathsf{dQMA}$) model introduced by Fraigniaud, Le Gall, Nishimura, and Paz (ITCS 2021), a network of quantum computers verifies a global property with the aid of a quantum proof supplied by an untrusted prover. While the nodes are computationally unbounded, the challenge is to limit proof size and the communication required for verification. In this paper, we consider the model of Hasegawa, Kundu, and Nishimura (PODC 2024), where the proof must be unentangled across nodes, and define its extension to $k$ unentangled provers, denoted by $\mathsf{dQMAS}(k)$. In this setting, we investigate the proof size per node and the communication costs of reducing the number of provers. Our first result reduces the number of provers from $k$ to two, doubling the proof size without additional communication. Moreover, with four additional rounds, we can reduce the number of provers from $k$ to one, using at most three times the original local proof size plus a logarithmic term in the number of nodes. Finally, we establish amplification for perfectly complete protocols. In this regime, a single prover suffices with a constant-factor overhead in our reductions, yielding $\mathsf{dQMAS} = \mathsf{dQMAS}(k)$.
Read the full abstract
Computational Physics
Consistent Mapping for Fluid Structure Interaction with Geometrically Nonlinear Isogeometric Beams
Isogeometric beam formulations provide an efficient reduced-dimensional representation of slender structures, combining accurate geometry and high-order continuity with few structural degrees of freedom. Their application to fluid–structure interaction (FSI) requires transferring motion and loads between the one-dimensional beam centerline and the surrounding fluid interface. While mapping strategies exist for conventional finite element beams, geometrically nonlinear isogeometric formulations require operators consistent with their spline-based kinematics and distinct descriptions of cross-sectional rotation. This work develops consistent beam-to-surface mappings for geometrically nonlinear isogeometric Bernoulli and Timoshenko beams in partitioned FSI. Fluid-interface points are attached to the beam in the reference configuration and reconstructed using the nonlinear kinematics of each formulation. Consistent linearization yields a configuration-dependent mapping operator whose transpose ensures work-conjugate load transfer. The formulations are verified through analytical deformation tests, convergence studies, and virtual-work checks, and evaluated in beam-based adaptations of the Mok and Turek–Hron benchmarks and the Goland wing flutter benchmark. The results confirm accurate interface reconstruction and work-conjugate load transfer under large deformations, while demonstrating the applicability of both beam formulations to coupled FSI problems.
Read the full abstract
Materials Science
Harmonic origin of local symmetry breaking in PbTe revealed using machine-learned potentials
We use machine-learned interatomic potentials combined with higher-order interatomic force constant models to show that finite-range polar correlations in PbTe are driven by long-range harmonic interactions rather than lattice anharmonicity. Our molecular dynamics simulations reveal a spatial polar correlation range exceeding 50 Å at low temperatures and decreasing with increasing temperature. Selective interatomic force constant mapping demonstrates that crystal anharmonicity usually associated with the formation of polar nanoregions suppresses polar correlations. Instead, long-range harmonic interactions extending to 13 Å are necessary to reproduce the spatial coherence of local dipoles. In reciprocal space, these extended harmonic interactions correspond to high curvature of the transverse optical (TO) phonon branch at the $\Gamma$ point. Comparison with isostructural NaCl connects these extended interactions to local underscreening of predominantly Coulombic forces. Our results provide a key microscopic description of finite-range polar correlations and a framework for understanding local symmetry breaking in centrosymmetric materials.
Read the full abstract
Computation and Language
Unmasking Four Knapsack Problems in the Traveling Thief Benchmark
The traveling thief problem (TTP) asks a thief to choose a tour and a packing together, and the benchmark of 9,720 instances of Polyakovskiy et al. (2014) is the standard test set for comparing TTP heuristics. We show that four of these instances are not TTP instances at all. Their files give a renting rate of 0.00, so the tour has no effect on the objective and each instance reduces to a 0-1 knapsack problem. One of them belongs to the 60 categorized instances on which new methods are usually compared, and on it five of nine published methods report exactly the same value. The cause is the format of the files, which keep the renting rate with two decimals, while the rule of the generator gives a rate close to 0.003 on these instances. The same rounding may shift the rate of 949 other instances by more than 1%. Since the tour and the packing used by the generator were not published, the original rates cannot be recovered. We therefore define new rates with the same rule, applied to a fully specified reference solution that we publish, and we show with a published heuristic that the corrected instances behave as TTP instances again. We also give reference results on the corrected instances and recommendations for future studies. Finally, we present ttplib, a new open-source Python library that loads any of the 9,720 instances, including the corrected ones, without downloading the whole benchmark.
Read the full abstract
Optimization and Control
R-Function Representation and Composition for Flexibility Analysis and Robust Design Spaces
Explicit multiparametric solutions provide analytical feasibility and design-space descriptions after elimination of adjustable variables. R-functions convert these descriptions into fields whose nonnegative regions represent feasible or robust designs. The principal contribution is the analytical composition of independently derived design spaces through union, intersection with engineering restrictions, and exclusion of prohibited regions, without repeating the underlying multiparametric elimination. A support-function construction supplies the robust design fields used in this composition. A two-parameter example demonstrates how alternative configurations, a manufacturing restriction and an exclusion combine into one admissible field. The resulting representations also support geometric interrogation of external boundaries, internal interfaces and limiting uncertainty contact, illustrated by a four-parameter heat-exchanger network. Explicit MPC offers a potential further application.
Read the full abstract
High Energy Astrophysical Phenomena
The Edge of the Warm Corona in Active Galactic Nuclei
A model of warm, dissipative corona on top of an accretion disk is investigated, to explain the soft X-ray excess (SXE) emission observed in active galactic nuclei (AGN). The final ray-traced spectrum, computed through photoionization code with Comptonization, accounts for both: emitted and reflected components. As a result, the strength of the SXE depends on the radial extend of the warm corona, i.e., its outer edge. We show that the radial transition from warm corona to disk atmosphere is governed by line cooling. By moving away from a central black hole Compton cooling is gradually replaced by line cooling, and the temperature drops sharply in vertical direction at a narrow iron ionization front, where iron ions Fe xxv–Fe xxvi recombine to Fe xvii. Notably, this transition takes place at a particular value of internal heating $\approx 1.6 \times 10^{-23}$ erg cm$^{3}$ s$^{-1}$, regardless of the Eddington ratio. We show, that at the given metal abundance, the SXE emitting area is larger for a higher accretion rate, in agreement with recent findings in changing look AGN. The overall emission spectrum from a warm corona is featureless, and the only iron K$_{\alpha}$ line comes from a reflection. The line is stronger and more gravitationally distorted for a lower accretion rate, which is a direct result of the size of the warm corona. Furthermore, by increasing the iron abundance, the iron ionization front moves closer towards black hole, and a stronger iron line complex is emitted locally.
Read the full abstract
Solar and Stellar Astrophysics
Investigating the timescales traced by dynamical ages in young stellar systems
Stars form in clustered environments, and then the stars may congregate into star clusters. The timescale on which individual stars form is not necessarily the same as the timescale on which star clusters assemble. Therefore, developing methods to probe these different timescales is a crucial part of understanding star cluster assembly and early evolution. Dynamical ages can be constructed from the kinematics of individual stars in clusters in the solar neighborhood using Gaia data. Using a star formation simulation, we test five different dynamical age methods. We divide dynamical ages into two approaches: methods which trace the size evolution of the cluster, and methods which trace the trajectories of individual stars. We confirm that size methods cannot accurately derive ages in bound clusters whereas methods tracing individual stars can be applied to both bound and unbound systems. We find that different dynamical age methods trace different epochs of star cluster formation and assembly: The method using stars with the oldest traceback ages provides an upper limit on stellar ages and the method using the median traceback ages is the best proxy for isochronal ages. Methods which trace the size evolution of the cluster best trace the onset of cluster expansion. Our work suggests that the median traceback time of stars moving away from the cluster provides the most reliable proxy for isochronal age, and that this method can be applied to any expanding system.