Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
This paper considers the design of optimal fixed-step first-order methods for high-dimensional minimization of $L$-smooth convex functions. For optimizing worst-case performance measured via suboptimality of the final function value (relative to the initial squared distance to a minimizer), we provide an algebraic proof of the optimality of the optimized gradient method (OGM) and establish its uniqueness among all fixed-step first-order methods. For the alternative measure of final squared gradient norm (relative to initial suboptimality), we prove the OGM-G method is optimal and uniquely so among fixed-step first-order methods. Finally, for the setting measuring the final squared gradient norm (relative to the initial squared distance to a minimizer), we show the recently proposed Lemniscate method is optimal and uniquely so. Our proofs rely on algebraic reductions for lower bound arguments rather than traditional information-theoretic bounds, which were previously only able to establish OGM's optimality but not uniqueness.
Computer Vision
Harnessing CLIP and DINO: An Uncertainty-Aware Cascaded Fusion Network for Generalizable Deepfake Image Detection
The growing realism and accessibility of manipulated and generated faces threaten the trustworthiness of digital media. To detect such forgeries, deepfake detectors based on vision foundation models have shown promising performance, but they typically rely on a single pretrained representation and are prone to overfitting to particular training distributions. To improve generalization to unseen forgeries, we propose UCF-Net, an uncertainty-aware cascaded fusion network that harnesses CLIP's language-aligned semantic priors and DINO's self-supervised visual-structure priors. UCF-Net extracts hierarchical features across Transformer depths, uses layer-wise expert aggregation to adaptively combine each encoder's multi-level cues, and performs weighted fusion of the resulting representations based on entropy-derived uncertainty. We further consolidate public deepfake datasets into a unified benchmark of approximately 4M images and construct a separate cross-generator evaluation set with over 8K face images from eight recent generators. On the unified benchmark, UCF-Net achieves the best mean AUC among the evaluated methods in both in-domain and cross-domain evaluations. On the cross-generator set, it adapts effectively with limited target-domain data, although zero-shot transfer remains challenging.
Read the full abstract
Analysis of PDEs
Well-posedness and a sign-graph limit for an active Cahn–Hilliard equation on Riemannian manifolds
We establish a weak solution theory and a singular constitutive limit for a non variational Cahn Hilliard evolution on compact Riemannian manifolds, possibly with boundary. The model combines the classical double well chemical potential with an active correction concentrated in diffuse transition layers and sensitive to the sign of the Laplace Beltrami operator, together with a monotone anchoring mechanism toward a prescribed reference state. The active correction breaks the passive gradient flow structure and introduces a nonlinear dependence on second derivatives not identified by the natural weak compactness estimates. For square integrable initial data and sufficiently integrable reference data, we construct weak solutions in arbitrary dimension. A Galerkin level one sided comparison argument, using monotonicity of the classifier and anchoring law together with biharmonic coercivity, yields strong convergence of the approximate Laplacians and hence strong second order compactness. This identifies the nonlinear active term in an ordinary weak formulation, without a second derivative defect. In two dimensions we prove uniqueness and continuous dependence. The estimates depend only on the bound and monotonicity of the classifier, not on its slope, and are therefore uniform for increasingly steep arctangent classifiers. Their singular limit is governed by the maximal monotone sign graph acting on the Laplace Beltrami operator. In arbitrary dimension we obtain subsequential strong second order convergence to a weak solution of the resulting differential inclusion. In two dimensions the limiting state is unique, so the entire steep classifier family converges; uniqueness of the constitutive multiplier on the zero Laplacian set is not asserted. This is a constitutive steepness limit at fixed diffuse interface thickness, rather than a sharp interface limit.
Read the full abstract
Algebraic Geometry
Chow Quotient Moduli Space of Dynamical Systems on the Projective Line and Rescaling Limits
We study Chow-quotient compactifications of the moduli space of degree-$d$ rational self-maps of the projective line. We compute the degree of every three-dimensional orbit cycle in the Clebsch–Gordan compactification in terms of the main component and the hole depths. As consequences, we obtain the generic orbit class and a rational map on Chow quotients induced by iteration. We also introduce a marked Chow quotient designed to record collections of rescaling limits, describe it by decorated trees, and extend the fixed-point multiplier map to the normalization of the unmarked Chow quotient.
Read the full abstract
Programming Languages
A monadic interpreter and type-and-effect checker
We present a concrete implementation in Haskell of a monadic framework that includes both a small-step interpreter and a type-and-effect checker for the corresponding language. Our approach separates the language syntax from the semantics of its effects. This design allows the interpreter to remain parametric over the underlying monad, while the static checker approximates effects independently of their concrete implementation. The theoretical foundation of this framework-applied to a call-by-value lambda calculus with generic effects represented by operations that produce monadic values and are managed through handlers-was introduced in previous work, where the focus was on proving the soundness of the approach. In contrast, the present work leverages Haskell's support for modular programming and monads to demonstrate that the framework is practically implementable and usable. We illustrate the approach with examples using the monad of exceptions and the one of nondeterminism and expressions both with and without handlers.
Read the full abstract
Machine Learning
MpSub: A Momentum $p$-Dimensional Subspace Trust-Region Method for Derivative-Free Fine-Tuning of Large Language Models
Full-parameter fine-tuning of large language models has substantial memory costs because backpropagation stores activations and gradients. Zeroth-order optimization avoids this by estimating update directions from loss evaluations, but existing methods require tuning a sensitive learning rate for each model and task. We propose the momentum $p$-dimensional subspace trust-region method (MpSub). At each iteration, MpSub searches within a $p$-dimensional subspace: one direction preserves historical momentum from the most recent accepted step, while the remaining directions explore via fresh random sampling. The subspace gradient is estimated by central differences, a trial step is computed from a linear trust-region model, and the trust-region radius adapts according to the agreement between predicted and observed loss reduction, eliminating the learning rate. For LLM fine-tuning, evaluations within an iteration share a minibatch, and directions are regenerated in place from seeds, using forward passes alone. For smooth deterministic objectives under unorthogonalized Gaussian directions, we bound the finite-difference error, quantify gradient energy captured by the subspace, and prove that $\lim_{k\to\infty} \|\nabla f(x_k)\|_2 = 0$ almost surely under a safeguarded radius update. Under a matched budget of 8,400 training-objective forward passes, we fine-tune OPT-125M and OPT-350M on CommitmentBank. With the same preset parameters at both model sizes, MpSub attains mean test accuracies of 0.673 and 0.690 over three seeds, matching tuned MeZO (0.685) without any learning-rate search.
Read the full abstract
Fluid Dynamics
Propeller-wing interactions of a lift + cruise eVTOL configuration during transition
The wakes of a lift + cruise aircraft's vertical lift propellers interact with the wing during the transition from hover to forward flight. This study investigates how variations in axial and longitudinal separations between the vertical lift propellers and the wing affect aerodynamic performance during this critical phase. Axial variations were introduced by orienting the motors either upright or inverted at two longitudinal positions relative to the wing. Wind tunnel tests were conducted on the resulting lift + cruise wing configurations over a Reynolds number range of 52,000 to 377,000, using tufts, pressure taps, and load cells to capture aerodynamic behaviour. Results show that the early transition phase (front propeller advance ratios between 0 and 0.25) is particularly sensitive to configuration changes. Rear motor orientation had a pronounced effect: when oriented upright at the shortest longitudinal separation, the active lift propellers increased the lift-drag ratio of the design by approximately 4 units, whereas in the rear motor inverted case the design suffered a 4-point reduction in the lift-drag ratio. Decreasing the longitudinal separation amplified both the beneficial lift contribution of the rear propeller and the generally adverse effects of the front propeller. However, placing the front propeller closer to the wing in the upright orientation enhanced performance at advance ratios between 0.11 and 0.25, due to favourable interactions between the wing and the front propeller's trailing vortices.
Read the full abstract
Machine Learning
Accuracy is Not Enough: A Divergence-Based Approach to Evaluate Fidelity Loss in Quantized LLMs
Deployment of Large Language Models (LLMs) on memory-constrained edge devices relies heavily on aggressive post-training quantization. However, evaluating these models is largely based on zero-shot task accuracy, which depends solely on argmax predictions and is insensitive to changes in the underlying predictive distribution. Consequently, accuracy can exhibit unstable, non-monotonic behavior under progressive quantization, masking substantial fidelity loss relative to the BFloat16 (BF16) uncompressed base model and providing misleading deployment signals. We introduce a distribution-sensitive evaluation framework quantifying information loss in quantized LLMs as the divergence between full-vocabulary predictive distributions at the token decision boundary. We compute statistical distances, including Jensen-Shannon Divergence and Total Variation Distance, between outputs of full-precision and quantized models, enabling a fine-grained analysis of distributional shift. Using this framework, we quantify probability mass displacement and distributional drift relative to the BF16 reference, capturing predictive distribution changes not reflected in top-1 accuracy. We conduct a 120-run experimental matrix across five foundation architectures and four reasoning benchmarks under progressive quantization regimes, from uncompressed BF16 to Q2_K, providing a systematic fidelity analysis. Our results show divergence metrics generally increase under stronger quantization, complementing task accuracy with a fidelity signal. Across tested llama-cpp schemes, mixed-precision Q4_K generally yields lower divergence than uniform Q4_0 at similar memory footprints. These findings motivate distribution-aware evaluation as a practical diagnostic complement to task accuracy; they do not directly establish correctness, calibration, safety, or user-perceived quality.
Read the full abstract
Information Retrieval
Noēsis: Deterministic-First Retrieval with Two-Tier Context Hydration for Factuality-Critical Queries on Small Local Models
A wrong number is worse than no answer. Across factuality-critical domains – audience metrics, scheduling and rights in media; dosages and lab values in healthcare; figures and citations in finance and legal – a confident but fabricated value is more damaging than an honest admission of uncertainty. Yet this is the dominant failure mode we observe on small local language models: even when correct evidence is present in context, models fabricate plausible numbers and timestamps. Recent work characterizes a real limit of this regime: below 7B parameters, the bottleneck of retrieval-augmented generation (RAG) is not retrieval quality but context utilization. We present Noesis, the deterministic-first query plane of the Noesis architecture, which makes every deterministic judgment before generation. Its mechanisms follow from the ingestion architecture (subject of a separate patent application): (a) a producer-side fact layer rendering precomputed metric facts verbatim without ranking; (b) positional addressing with deterministic cross-source alignment, resolved ahead of query time at zero LLM cost; (c) provenance scoping as an attribution constraint with multi-tier named-reference routing; and (d) two-tier context with model-triggered verbatim hydration. Across four ablations, a 2B model reaches parity with a 35B model on factual integrity (exact values in all runs; zero confabulated numbers on absent-entity traps); structured retrieval beats flat RAG by +11.4 points at 2B; skeleton-only context preserves quantitative answers at 20-30% smaller prompts; and hydration recovers verbatim narrative in ~8s versus ~29s. Two properties matter for regulated domains: each query resolves in a single generation call, and every reported value is traceable to its exact source and position by construction.
Read the full abstract
Computation and Language
How AI Models Manage Epistemic Authority: A Taxonomy and Comparative Analysis of Responses to User Disagreement
Large language models are increasingly used as sources of advice and information, including in high-stakes settings, yet little is known about how they respond to user disagreement. We study how a model manages its epistemic authority, referring here to its claim to knowledge, competence, or the right to advise, once a user challenges its answer. Building on Conversation Analysis, we introduce a taxonomy of six challenge types and a four-layer framework for analysing each response: whether the original claim is maintained or changed, where authority is located, how the disagreement is socially managed, and what kind of evidential support is offered. We construct a new dataset of 2,310 controlled challenge scenarios and 32,340 corresponding responses from 14 models, and analyse them using our framework with an LLM-as-judge pipeline, providing a vocabulary which future evaluation and benchmark design can build on. We find that models show conflicting behaviour: they validate users in 85% of responses but maintain their original claim in 65%. They explicitly apologise in 33% of responses, yet 59% of those apologies accompany maintenance of the original claim. They transfer authority most often in advice tasks, doing so in 28% of responses and reaching 57% in health advice and 49% in legal advice, compared with 6% in fact and 3% in explanation tasks. Abandonment of the original claim ranges from 0.8% for GPT-5.2 to 40% for DeepSeek 7B, while complete replacement of the original claim is rare overall at 1.5%.
Read the full abstract
High Energy Physics (Phenomenology)
Gravitational Wave in an $A_4 \otimes Z_4$ Neutrino Model with Generalised CP
We extend the Standard Model with an $A_4 \times Z_4$ flavor symmetry and generalized CP (GCP) symmetry, realized through two flavon triplets that spontaneously break $A_4$ and generate the observed lepton mixing pattern. A new $A_4$-singlet flavon couples to one of these triplets through a complex quartic interaction that breaks GCP and fixes the reactor mixing angle; this same coupling biases the domain walls formed when that triplet breaks $A_4$. A global fit to oscillation data reproduces all mixing angles and mass splittings, predicting a maximal Dirac CP phase of $270^\circ$ and an effective Majorana mass near $15\text{ meV}$, testable by upcoming neutrinoless double-beta-decay ($0\nu\beta\beta$) experiments. The same coupling generates a stochastic gravitational-wave background peaking in the pulsar-timing-array and LISA bands, with peak frequency and amplitude predicted to scale as $\sin\theta_{13}$ and $\sin^{-4}\theta_{13}$, a falsifiable link between neutrino oscillation and gravitational-wave (GW) observations.
Read the full abstract
Statistical Computation
Thermodynamic Cyclic Processes with Markov Samplers in Bayesian Inference
The concept of Markov chain Monte Carlo (MCMC) cycles, an analogy to cyclic processes in heat engines, is presented in order to examine Bayesian inference problems. In this effort, we develop adaptive ensemble schedulers that allow the tuning of external parameters of a Bayesian canonical ensemble during an MCMC run, realising the MCMC cycles in practice. We run these cycles on different statistical models. As a fundamental insight, we find (both theoretically and in practice) that such systems can produce a non-zero net work output if and only if the considered model is non-Gaussian. As such, they may serve as a measure of non-Gaussianity in Bayesian inference, which we test on an example from supernova cosmology.
Read the full abstract
Numerical Analysis
A numerical method for two-dimensional Boussinesq-Full Dispersion systems modelling internal wave propagation
The paper is concerned with the numerical approximation of some two-dimensional asymptotic models for the propagation of internal waves in a two-layer system in the form of pde's for the interfacial deviation and the velocity. After the study of well-posedness of the periodic initial-value problem, the convergence of a semidiscrete approximation based on a spectral Fourier-Galerkin method is analyzed. The resulting semidiscrete system is then integrated numerically in time with the implicit midpoint rule. Some properties of the fully discrete scheme are described and its performance is illustrated with some numerical experiments.
Read the full abstract
General Relativity and Quantum Cosmology
The generalized second law for Kerr-Taub-NUT black holes perturbed by test field
We evaluate the variations in the area and the entropy of Kerr-Taub-NUT black holes perturbed by bosonic and fermionic test fields. We demonstrate that the critical frequency for a test field at which the variation of the area vanishes is strictly larger than the superradiance limit for Kerr-Taub-NUT black holes. Therefore both bosonic fields in the relevant range and fermionic fields which do not exhibit superradiant scattering can induce a decrease in the area of a Kerr-Taub-NUT black hole. However, the entropy is not directly proportional to the area for Kerr-Taub-NUT black holes. Only fermionic fields with frequencies below the superradiance limit can induce an entropy decrease. The simultaneous loss of entropy by the black hole and the environment identifies a generic violation of the Generalized Second Law (GSL) for fermionic perturbations that fail to satisfy the Null Energy Condition (NEC). For bosonic perturbations that satisfy the NEC, we evaluate the limiting case, where a nearly extremal black hole is perturbed by a scalar field with frequency slightly above the superradiance limit. Our analysis reveals that the minimum increase in the black hole entropy compensates for the entropy loss of the environment, when one assigns Von Neumann entropy to the test field. The GSL remains valid for perturbations satisfying the NEC.
Read the full abstract
Differential Geometry
Classification of Solutions to a Critical Fourth-Order Equation on Complete Non-compact Manifolds
We study the critical biharmonic equation \[ \Delta^2 u=u^{\frac{n+4}{n-4}}, \] on a complete, connected, and non-compact Riemannian manifold \((M^n,g)\) of dimension \(n\geq 5\) with non-negative Ricci curvature. We establish an optimal pointwise second-order derivative estimate by Bernstein's method and the continuity method. Using invariant tensors, we derive a differential inequality that yields a rigidity result. More precisely, if there exists a positive finite energy solution, then the manifold is isometric to the Euclidean space \(\mathbb{R}^n\), and the solution is given by \[ u(x)= \frac{ \left[\lambda^2 n(n-4)(n^2-4)\right]^{\frac{n-4}{8}} } {\left(1+\lambda |x-x_0|^2\right)^{\frac{n-4}{2}}}, \qquad \lambda>0,\quad x_0\in\mathbb{R}^n . \]
Read the full abstract
Optics
Non-Hermitian reconstruction of hybridized hyperbolic shear polaritons
Hyperbolic shear polaritons (HShPs) represent a distinctive class of anisotropic polaritonic states that enable directional subwavelength light manipulation through asymmetric momentum-space dispersion, while their control in twisted systems has so far relied mainly on geometric and spectral parameters. Here, we introduce non-Hermitian dissipation as an additional degree of freedom for tuning HShPs in twisted van der Waals heterostructures. In twisted {\alpha}-MoO3/{\alpha}-V2O5 heterostructures with closely matched isofrequency contours but distinct dielectric losses, dissipation modifies the complex hybrid polaritonic states and thereby tunes the resulting momentum-space and real-space asymmetry. Near-field infrared imaging combined with analytical modeling and full-wave simulations reveals the evolution of the shear response with twist angle, excitation frequency, layer thickness, and substrate dielectric environment. The interplay between material dissipation and dielectric screening enables continuous regulation of the shear degree and reversible switching between shear-off and shear-on states. Furthermore, we demonstrate a proof-of-concept binary-state encoding scheme based on dissipation-controlled shear-state switching. Our work identifies non-Hermitian dissipation as an additional control parameter in twisted polaritonic systems, expanding the available design space for reconfigurable mid-infrared nanophotonics.
Read the full abstract
Machine Learning
Online Surrogate Repair: Decoupling High-Fidelity Feedback from Search Length in Closed-Loop Discovery
Closed-loop AI scientists can generate candidate designs at low marginal computational cost, whereas reliable feedback may require wet-lab synthesis, characterization, or high-fidelity computation. Addressing this imbalance through custom laboratory automation remains infrastructure-intensive and costly, while replacing new experiments with a fixed surrogate leaves persistent model errors that can be amplified by optimization. We propose online surrogate repair (OSR), a closed-loop algorithm that uses sparse high-fidelity evaluations to update the surrogate throughout a longer agent search conducted primarily with inexpensive surrogate feedback. An acquisition rule selects which designs from the agent's accumulated proposals receive high-fidelity evaluation, and the resulting labels update the surrogate used in subsequent episodes. Across controlled synthetic environments, we demonstrate that improving global surrogate fit does not necessarily reduce maximum regret, whereas Q90-UCB and expected improvement (EI) substantially reduce regret by directing evaluations toward regions that determine the optimizer's decisions. \osradded{Across LLM and Chemeleon workflows, Online EI reduces the amount of oracle queries required by 84.3–90.3% for matching discovery counts and by 77.9–81.6% for matching the quality of the best material found.} Online surrogate repair introduces a third feedback regime between fixed-surrogate operation and high-fidelity feedback after every episode, separating the frequency of high-fidelity evaluation from the duration of the agent's search.
Read the full abstract
Cryptography and Security
ZK-eSIM: A Privacy-Centric Zero-Knowledge Approach for eSIM Provisioning
GSMA Remote SIM Provisioning (RSP) enables over-the-air delivery of eSIM profiles, but it exposes long-lived identifiers during profile ordering and download. In particular, stable device identifiers (e.g., EID), profile identifiers, and long-lived certificate material enable mobile operators and profile-delivery infrastructure to link provisioning events to the same eUICC and, when combined with account records, to the same subscriber. This undermines subscriber anonymity and enables cross-session tracking. We present ZK-eSIM, a privacy-preserving redesign that achieves subscriber anonymity and provisioning-session unlinkability while retaining accountable traceability by exception. ZK-eSIM (i) replaces direct disclosure of device identifiers with a zero-knowledge proof of device validity and eligibility; (ii) enforces session unlinkability through short-lived, one-time pseudonymous credentials and per-session identifiers to prevent cross-session tracking; and (iii) provides privacy-preserving accountable traceability through a jointly authorised escrow mechanism, so that no single entity can unilaterally deanonymise a user. We formalise a multi-entity, honest-but-curious threat model and prove subscriber anonymity and the unlinkability of provisioning sessions under standard cryptographic assumptions. We implement a Java Card applet on a test eUICC to evaluate performance on commodity hardware with a modified LPA and SM-DP+ server. Our experiments quantify end-to-end cryptographic overhead relative to conventional RSP, confirming that ZK-eSIM adds only practical overhead, closing a critical privacy gap while preserving deployability within existing GSMA roles and interfaces.
Read the full abstract
Quantum Physics
Microwave-Free $^{13}$C Hyperpolarization of Diamond Particles Enabled by Magic Angle Spinning and NV Centers
Nuclear hyperpolarization from optically pumped color centers in solids offers an alternative to conventional microwave-driven dynamic nuclear polarization (DNP). Diamond can host the nitrogen vacancy (NV) center, whose ground spin state can be readily polarized by light at room temperature, making diamond a candidate platform for nuclear hyperpolarization. We report $^{13}{\rm C}$ nuclear hyperpolarization in randomly oriented diamond particles with sizes ranging from 0.2 to 2 $\mu$m, both at natural $^{13}{\rm C}$ abundance (1.1 %) and at 20 % isotopic enrichment, at magnetic fields of 7.1 T and 9.4 T. The protocol combines optical illumination with magic angle spinning (MAS) and does not require microwave irradiation. By investigating the nuclear polarization as a function of the MAS frequency between 0 and 6 kHz at the magnetic field of 7.1 T, we find maximum light-induced polarization enhancements of $280$-fold for the isotopically enriched sample and $411$-fold for the natural abundance sample. Under continuous illumination, steady-state absolute $^{13}{\rm C}$ polarization levels above 0.1 % are reached. A model involving optical pumping of NV centers and spin dynamics near level anticrossings (LACs) in three-spin clusters formed by NV, a substitutional nitrogen (P1) and $^{13}{\rm C}$ is used to describe these findings. The protocol strongly mitigates the effect of the anisotropy of the NV spin Hamiltonian, allowing more than $99.9\%$ of NV orientations to participate in the polarization transfer process. These results represent a first step toward transferring nuclear polarization from diamond particles to external nuclei, with potential applications in sensitive and high-resolution NMR at room temperature.
Read the full abstract
Software Engineering
RefVerifier: Semi-Automated Reference Claim Verification for Scientific Manuscripts
As software engineering research submission counts surge, peer reviewers face severe time constraints, making systematic verification of citation-supported claims prohibitively expensive. Consequently, unsubstantiated claims and semantic drift can propagate undetected across scientific literature. Existing approaches such as fact-checking and retrieval-augmented generation tools operate on open-domain web data or evaluate claims in isolation without processing complete manuscripts. To address this gap, we present RefVerifier, a semi-automated, citation-bounded reference verification prototype designed to support in academic peer review. RefVerifier extracts citation-bearing sentences from manuscripts, checks bibliography metadata against scholarly databases, resolves references to full-text open-access PDFs, localizes relevant evidence passages, and generates verdicts with natural language explanations. Evaluating RefVerifier on public benchmarks shows claim detection at an F1 score of 0.990, open-access resolution of 57.6% of references, and evidence localization with a hit rate of 98% on abstracts and 68% on complete cited papers. In an end-to-end test with eight manuscripts, RefVerifier achieves a verdict accuracy of 71%. By automating document retrieval and evidence localization while preserving reviewer oversight, RefVerifier provides first indicators for the feasibility of semi-automated integrity checks in scholarly publishing.
Read the full abstract
Computation and Language
Syntactic Patterns and Stylistic Functions in Narrative Prose: A Rule-Based and Machine-Learning Approach
This paper presents a small-scale quantitative experiment that links syntactic structure to stylistic functions in narrative prose. Starting from a dependency-parsed corpus of 3,300 sentences, we derive sentence-level stylistic labels across five categories — descriptive, introspective, causal, ideological, and neutral — using a transparent rule-based procedure that inspects lemmas, universal part-of-speech tags, and syntactic relations. For each sentence we construct a compact representation of its syntactic profile as a sequence of linearised triples combining lemma, POS tag, and dependency relation. These patterns serve as input to standard machine-learning classifiers trained to predict sentence-level style. The best-performing model achieves a macro-F1 of 0.948 under 10-fold cross-validation. The experiment is implemented entirely in Python using open-source tools. Our goal is not to propose a fully fledged stylistic theory, but to offer a reproducible and extensible workflow for exploring how grammatical structure contributes to narrative interpretation.
Read the full abstract
Systems and Control
A unified power-grid representation for reuse across network structures and computational tasks
Data-driven power-system models are typically developed for specific grids and computational tasks, but their performance can deteriorate markedly or even fail when network structures or analytical objectives change. This paper develops a unified grid representation that separates physical-grid description from downstream computation. A self-supervised encoder represents each grid as a variable number of fixed-dimensional node, branch and global vectors under a common latent description. Although pretrained only on systems with at most 270 buses, the frozen encoder transfers without adaptation to a 70,000-bus network, more than 250 times larger in bus count, while preserving 0.7919 bus-correspondence accuracy. The same representation supports four independently trained downstream tasks: power-flow calculation, reactive-power adjustment, operating-condition generation and transient-stability assessment. On the previously unseen 70,000-bus grid, power-flow calculation achieves mean errors of 0.108$^{\circ}$ in phase angle and 3.8$\times$10\textsuperscript{-6} p.u. in voltage magnitude. Reactive-power adjustment achieved a 75% PSASP-verified correction rate on the previously unseen 70,000-bus grid, while operating-condition generation delivered at least one PSASP-verified feasible state for 82.2% of requests on previously unseen 400–1,000-bus grid families. For transient-stability assessment, the frozen encoder achieves accuracy within 0.8 percentage points of full encoder adaptation under matched training conditions. These results demonstrate that a unified power-grid representation can be learned once and reused unchanged across structurally different power systems and heterogeneous computational tasks.
Read the full abstract
Solar and Stellar Astrophysics
R-matrix calculations for opacities: V. Temperature-density dependence of photoabsorption cross sections and opacity spectra of oxygen ions O VI and O VII
We present R-matrix photoabsorption cross sections for Li-like oxygen O VI and He-like oxygen O VII and examine how plasma broadening modifies them as a function of temperature and density in astrophysical and laboratory high-energy-density (HED) plasma sources. All atomic systems are subject to plasma environment effects, and the propagation of radiation depends on photoabsorption via bound-bound transitions as spectral lines and autoionizing resonances in bound-free photoionization cross sections. We identify and illustrate low and high temperature-density limits for the onset of plasma broadening in O VI and O VII, demonstrating general features and methodology applicable across a broad range of plasma conditions. Calculations are presented along two representative isotherms corresponding to the solar base of convection zone (BCZ) at $T = 1 \times 10^6$ and $2 \times 10^6$ K, and electron densities $N_e = 10^{18}$-$10^{23}$ cm$^{-3}$. Autoionizing resonances progressively dissolve into the continuum with increasing electron density at each isotherm, flattening and merging into the background cross sections at BCZ conditions, at much lower densities than bound-bound line features require. Illustrative examples are given for energy regions containing Rydberg resonance series, including large photoexcitation-of-core (PEC) resonances. Comparisons with previous Opacity Project results reveal that (i) the R-matrix photoionization cross sections cover a much higher energy range where a significantly richer spectrum of autoionizing resonances are present that are not included in OP, and (ii) the corresponding monochromatic opacities show significant quantitative differences. This work is generally applicable to modeling HED plasmas in astrophysics, and to the analysis of transmission spectra in laboratory experiments on inertial confinement fusion (ICF) devices.
Read the full abstract
Optics
A 0.35 mm Silicon Carbide Diffractive Waveguide with Dual Parameter Apodization for Full Color Augmented Reality
Augmented reality eyewear offers a transformative interface poised to reshape human information interaction. In this context, silicon carbide (SiC) offers unique advantages for diffractive waveguides with its high refractive index and excellent thermal conductivity. However, in single-layer full-color displays, existing SiC waveguides generally remain thicker than 0.5 mm to reduce the bounce count of total internal reflection, thereby avoiding severe spatial variations in luminance and color. Here, we demonstrate a 0.35 mm SiC diffractive waveguide with an ultra-lightweight of only 1.98 g. The challenge of spatial non-uniformity is addressed by dual-parameter apodized gratings with continuously varying depth and duty cycle, enabling fine spatial control over local diffraction efficiency. To realize high-throughput production, a parallel gradient transfer method compatible with nanoimprint lithography is introduced, enabling wafer-scale patterning of four lens pairs per 8-inch SiC wafer. Furthermore, magnesium fluoride planarization suppresses grating visibility and achieves a high see-through transmittance of 92%. Optical simulations confirm that this architecture achieves balanced full-color transmission across a 30-degree field of view. This strategy provides a scalable route toward ultra-light and visually unobtrusive glasses, opening new opportunities for practical consumer-grade wearable displays.
Read the full abstract
High Energy Astrophysical Phenomena
Interior Magnetic Fields in Magnetars and Radio Pulsars
Magnetic fields are fundamental for neutron star physics and play a central role in powering the extreme phenomenology of magnetars, including Soft Gamma Repeaters and Anomalous X-ray Pulsars. However, the structure and stability of their internal magnetic fields remain largely unconstrained, as they cannot be directly probed by electromagnetic observations. Using 3D general-relativistic magnetohydrodynamics simulations across a range of rotation rates and magnetic field strengths, we identify two distinct evolutionary regimes leading towards dynamically stable magnetic configurations. In rapidly rotating stars, the Alfvén crossing timescale exceeds the rotation period, allowing differential winding to amplify a strong toroidal magnetic component before the onset of instabilities, leading to long-lived, stable configurations. In contrast, in magnetically dominated stars, instabilities in the poloidal field drive rapid field decay, leaving only a comparatively weak toroidal component. These results imply that the internal magnetic structure of neutron stars depends sensitively on their rotational state: rotation-dominated stars like radio pulsars develop strong toroidal fields, while magnetars are characterized by predominantly poloidal configurations. Our findings therefore show that a neutron star's rotational history shapes its internal magnetic structure, providing a unifying physical picture that connects the observed diversity of neutron star classes to their hidden field configurations.
Read the full abstract
Number Theory
Sharp Diameter Bounds for Nonnegative Cyclotomic Multiples
Let \(N\ge2\) and let \(p\) be its least prime divisor. We prove that every nonzero polynomial with nonnegative real coefficients divisible by \(\Phi_N\) has support diameter at least \((p-1)N/p\). Equality holds precisely for positive scalar multiples of monomial shifts of the \(p\)-term geometric sum \(\sum_{j=0}^{p-1} X^{jN/p}\), thereby proving a conjecture of Steinberger. The proof turns cyclotomic divisibility into the vanishing of the first \(p-1\) Fourier moments of a positive measure on the circle and then applies a classical extremal trigonometric polynomial. As a consequence, we establish the Coven–Meyerowitz diameter bound under their tiling conditions and determine its equality cases. Longer initial intervals of vanishing Fourier coefficients yield stronger diameter bounds, including an explicit refinement in terms of the prime-power divisor sets. The extremal trigonometric polynomial also yields a quantitative concentration estimate for measures and cyclotomic multiples with near-minimal support diameter.
Read the full abstract
Quantum Physics
Geometric inflation of deviations challenges neural quantum states in dynamics of quantum Ising models
Neural quantum states (NQS) have emerged as a powerful framework for simulating non-equilibrium dynamics in strongly correlated quantum systems, offering scalable variational representations of highly entangled states. Yet, accurate NQS simulations have been found to be surprisingly challenging in some physical regimes of limited complexity. Here, we address paradigmatic quench dynamics of a one-dimensional quantum Ising model as a controlled benchmark. Through supervised state reconstruction we establish substantially tighter empirical upper bounds on the required parameter count than previous estimates, ruling out representational limitations as the key obstruction. Instead, we uncover a geometric inflation of small deviations as a hitherto overlooked challenge for accurate solutions of the infinitesimal time-dependent variational principle (TDVP): the dynamical rotation of the kernel of the quantum geometric tensor (QGT) can suddenly lend physical significance to previously irrelevant parameter deviations. The stability of matrix product state solutions of the same TDVP suggests that the non-linearity of the neural network ansatz is the origin of the sensitivity. These results identify QGT-null-space rotation as a geometric diagnostic of sensitive NQS dynamics and as a concrete target for improving TDVP algorithms.
Read the full abstract
Algebraic Geometry
Wedderburn decomposition of Twisted skew abelian group algebra
We compute the Wedderburn decomposition of a finite twisted skew group algebra over a finite abelian group $G$ and a finite field $K$. To do so, we prove that this twisted skew group algebra is a homomorphic image of a finite group algebra. We then characterise its Shoda pairs, as well as propose an algorithm for computing a complete set of them.
Read the full abstract
Quantum Physics
Analog-to-digital conversion in the quantum regime
Digital signal processing has become essential in quantum optics, particularly for continuous-variable (CV) information encoding, enabling coherent detection schemes and mitigation of linear impairments. While linear signal processing in double homodyne detection has been studied under the assumption that all post-measurement processing can be backpropagated in the optical domain, a rigorous treatment of the digitization chain, spanning optical, electronic, and sampling stages, is still lacking. In this work, we consider the continuous mode description of double homodyne detection to fully capture the maximum mode-matching coefficient achievable as a function of electronic noise, signal bandwidth, receiver electronics bandwidth, and sampling rate, that is the entry point of digital signal processing. We establish a dimensioning rule that generalizes the Nyquist-Shannon criterion to account for quantum fluctuations of the measured signal, not merely its bandwidth. Analyzing the case of additive white electronic noise, we find numerically that optimal signal-to-noise ratio is achieved when the electronic bandwidth is large enough to pass the signal yet narrower than the sampling rate in order to mitigate noise amplification, yielding a concrete design criterion for coherent detection.
Read the full abstract
Analysis of PDEs
Solutions of Duhamel's formula with a sum of mappings
Semilinear evolution equations are solved by means of the variation of constants formula under the action of smoothing linear operators and a finite number of nonlinearities operating between chosen Banach spaces of a given family. Admissible spaces of initial conditions are determined for the existence and uniqueness of a suitable notion of solution. Its maximal time of existence, short time and blow up time profiles, global extendibility and regularity are analyzed. For extrapolated fractional power scale of Banach spaces the fulfillment of the corresponding Cauchy problem is shown. Chosen applications to the modified viscous Cahn-Hilliard equation in R^N, the evolution of cell population of varying genotype and the semilinear Schrödinger equation are presented.