Systems and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
Heating, ventilation, and air conditioning (HVAC) loads, with their rapid response capabilities, can provide considerable intra-hour flexibility on the demand side for reserve provision in order to follow the fast variations of renewables. However, scheduling massive HVACs is challenging due to computation complexity and the uncertainty of outdoor temperature. In this paper, we first introduce a novel continuous-time (CT) aggregation model to reveal the potential intra-hour flexibility of HVACs. For accurate aggregation, a new affine transformation is designed to handle the heterogeneity in high-dimensional feasible region. Further, for reliable aggregation in practical environment, the outdoor temperature uncertainty is constructed by distributionally robust chance constrains and integrated into the aggregation model. Secondly, for the tractable calculation of the proposed CT aggregation model, a cascade of tailored reformulation techniques is proposed, including the Bernstein polynomial spline, polytope projection, and linearization transformation. Thirdly, a customized hierarchical dispatch framework is proposed via incorporating the proposed CT aggregation model into reserve provision in power system dispatch, so as to efficiently schedule massive HVACs to cope with the renewable uncertainty. Case studies verify the effectiveness and scalability of the proposed CT aggregation model in aggregation accuracy, intra-hour flexibility utilization, and uncertainty handling.
K-Theory and Homology
Super $K$-theory and group completion
We develop a spectrum-level graded $K$-theory for real super Banach algebras. Our construction is categorical and homotopy theoretic, in the style of algebraic $K$-theory: the graded $K$-theory spectrum is obtained by a (co)fiber sequence from the $(\infty,1)$-categorical group completion of topological groupoids of finitely generated projective graded modules, rather than from spaces of Fredholm operators or Kasparov cycles. We define a connective spectrum $k^{\mathrm{ABS}}_A$ refining the Atiyah–Bott–Shapiro construction as a cofiber, together with its periodification $K^{\mathrm{gr}}_A$, and show that both are lax symmetric monoidal and functorial in bimodules, not merely in homomorphisms. The failure of graded $A$-modules to present all cocycles in $K^{\mathrm{gr}}_0(A)$ is shown to be purely a $\pi_0$-phenomenon on $k^{\mathrm{ABS}}_A$. We obtain a natural equivalence $K^{\mathrm{gr}}_{A\widehat{\otimes} \mathrm{Cl}_{p,q}} \simeq \Sigma^{p-q}K^{\mathrm{gr}}_A$, which links topological Bott periodicity with the Morita equivalence between $\mathrm{Cl}_8$ and $\mathbb{R}$. Restricting to invertible finite-dimensional semisimple super algebras yields a symmetric monoidal functor $\operatorname{Pic}(\operatorname{Bim}(\mathrm{sBan}_{\mathbb{R}})^{\mathrm{fd}}) \to \operatorname{Pic}(\mathrm{Mod}(KO))$ which splits off the bottom three Postnikov layers of $\operatorname{Pic}(\mathrm{Mod}(KO))$, giving a direct link between super division algebras and invertible $KO$-modules. We also give spectral refinements of Karoubi's and van Daele's graded $K$-groups, with explicit comparison equivalences, therefore connecting to $KK$-theory. We also provide an extensive general treatment for $K$-theory of ungraded topological rings that might be of independent interest. In particular, we characterize connective topological $K$-theory of ungraded Banach algebras by a universal property.
Read the full abstract
Instrumentation and Methods for Astrophysics
CHARA/SPICA: The six-telescope visible combiner and near-infrared fringe tracker for the CHARA Array
The suite called Stellar Parameters and Images with a Cophased Array (SPICA) has two interferometric instruments installed at the focus of the CHARA Array located at Mount Wilson, CA. SPICA is made of SPICA-VIS, a fiber-fed six-beam visible spectrograph with three spectral resolutions, and SPICA-FT, a six-beam near-infrared fringe tracker for the fast stabilization of the fringes. SPICA is opening access to imaging in the visible domain with an unprecedented angular resolution down to 0.2 milliarcseconds. It has been designed around a large survey of fundamental parameters of stars over the Hertzsprung- Russell diagram, aiming at understanding the deviations from the standard empirical relations of stellar physics as a function of activity: limb darkening, multiplicity, rotation, winds, and environments. SPICA makes use of the advanced technologies in electron multiplying detectors in the visible and electron- avalanche photodiode arrays in the near-infrared. It benefits from the newly commissioned adaptive optics on the one-meter telescopes of the array. The modules of the visible instrument, SPICA-VIS, optimize the injection of light into single-mode fibers for spatial filtering before spectral dispersion in the image plane. The fringe tracker, SPICA-FT, performs group-delay and phase-delay tracking for six beams in the H band. SPICA-FT can use an all-in-one or ABCD encoding of the fringe signals. SPICA is operational on sky and is close to reaching the expected performance in low spectral resolution, in particular, for the Interferometric Survey of Stellar Parameters (ISSP). More work is still needed to achieve the ultimate performance in terms of sensitivity and to allow operations with higher spectral resolutions.
Read the full abstract
Quantum Physics
Constructing and characterising anharmonic potentials in a harmonic oscillator
Continuous-variable quantum systems offer a natural platform for quantum information processing and analogue quantum simulation of real-world processes. Realising these applications, however, requires anharmonic potentials with programmable functional forms, which are challenging to engineer on demand. Here, in a superconducting harmonic oscillator coupled to a transmon qubit, we construct programmable non-Gaussian phase gates $e^{-iV(\hat{X})}$, corresponding to the impulsive action of an anharmonic potential $V(\hat{X})$, and characterise them by reconstructing their corresponding force pointwise. Using bosonic quantum signal processing, we compile target potentials into modular circuits of qubit rotations interleaved with a fixed conditional-displacement primitive. We first demonstrate a cubic phase gate whose cubic nature is jointly validated by the resulting non-Gaussian states and the force reconstructed pointwise from the gate's action on coherent probe states. We then construct a family of double-well potentials and use the reconstructed force to witness the double-well topology and tunable asymmetry. Finally, we engineer an approximate Morse potential and obtain its force profile using position-compressed probes, which extend reliable reconstruction towards the steep repulsive wall. These results establish a programmable route to constructing the potential landscape of quantum harmonic oscillators and a practical method for reconstructing its spatial structure, providing a building block for quantum simulation of anharmonic dynamics.
Read the full abstract
Machine Learning
Evidence for Shared Routing Geometry and Dynamics in Sparse Mixture-of-Experts
Sparse mixture-of-experts (MoE) models use an independently parameterized router at each sparse layer to select experts for every token. Prior work has shown that routing decisions across depth can often be predicted from earlier routing signals, suggesting that routing is not fully independent across layers. However, the structure behind this predictability remains unclear. In this work, we provide evidence that routing-relevant states across layers share a common geometric structure that is obscured by layer-specific coordinate systems. We isolate the control subspace of each router and align these spaces into a shared canonical representation using generalized orthogonal Procrustes analysis. After alignment, a single linear transition reaches $R^2=0.39$–$0.71$ and retains 79–90% of the predictive power of separately fitted layer-specific dynamics, indicating that much of routing-state evolution follows a reusable process across depth. We then ask whether this shared dynamics is specific to routing or simply reflects the smooth evolution of hidden representations. A matched-rank comparison shows that residual representations are often easier to predict across layers, while router-control states preserve the model's expert choices much more faithfully. This separates generic cross-layer predictability from routing-specific information. Finally, we test whether the predicted canonical states remain meaningful when used in place of native routing states. The transported states preserve local routing behavior, while learned state evolution reduces $\Delta\mathrm{NLL}$ relative to simple persistence by 15.7% on OLMoE and 6.2% over a 10-router horizon on Phi.
Read the full abstract
Mesoscale and Nanoscale Physics
Direct observation of flat bands in near-magic-angle twisted bilayer CVD graphene
Advances in chemical vapor deposition (CVD) growth have driven graphene crystal quality to unprecedented levels, yet it is still unknown whether this route can realize the fragile flat-band and correlated states of the magic-angle (MA) twisted bilayer graphene (TBG). Here, we report on the experimental observation by room-temperature nano-angle-resolved photoemission spectroscopy (nano-ARPES) of flat bands in a TBG sample close to the MA, assembled via a grow-and-stack protocol based on low-pressure CVD of graphene on copper. Our study indicates electronic bands fully comparable to those measured in exfoliation-based samples and determines the size of the largest near-MA domain to be compatible with electronic transport experiments, motivating further experiments on flat band physics in CVD-graphene.
Read the full abstract
Robotics
A Physics-Consistent Benchmark for Contact-Rich Human-Robot Interaction in Assistive Care
Conventional task-level evaluation asks whether a robot policy completes a specified action, but can miss failures that emerge only during physical human contact. This limitation is critical in contact-rich assistive tasks, where meaningful evaluation requires a physically responsive human, interaction-quality assessment beyond task success, and a leak-free observer-scorer protocol. We introduce a physics-consistent benchmark for contact-rich human-robot interaction, instantiated in robot-assisted bathing. The benchmark combines a deformable, passively responding human, physics-aware scores alongside task-level success, and a frozen vision-only / scorer-only evaluation protocol. To establish physical validity, region-wise simulated responses are calibrated against force-indentation measurements from Franka impedance pushes on a medical-care manikin. Under a frozen T1-T7 protocol with 140 runs per method, an LLM-augmented state machine (State Machine) achieves 72.9% task success but drops to 56.4% after correct-region and force-safety screening; VoxPoser produces lighter and more stable contact but completes only 27.9% of trials; and zero-shot pi0.5 achieves 0.7% task success with no correct-region or safety-gated successes. These results show that task completion alone does not imply physically valid contact and motivate physics-aware screening before deployment of contact-rich assistive robot policies.
Read the full abstract
Computer Vision
CA-OPD: Confidence-Aware On-Policy Distillation for Structured Visual Prediction
Autoregressive vision language models unify heterogeneous perception tasks but are highly susceptible to compounding errors. On-policy distillation (OPD) bridges the training-inference mismatch by training students on their own rollouts. However, unreliable student predictions, especially early in training, can derail the trajectory and degrade the quality of teacher supervision. While recent interleaved distillation methods allow the teacher to verify and replace student tokens, they primarily rely on rigid ranking metrics rather than exact teacher confidence, and they overlook how intervention decisions can inform token-level supervision. To address this, we introduce Confidence-Aware On-Policy Distillation (CA-OPD), a framework that couples reliable rollout construction with adaptive supervision. CA-OPD utilizes teacher confidence to selectively correct unreliable student transitions, gradually transferring rollout control to the student via a strict-to-relaxed schedule. Crucially, CA-OPD aligns knowledge transfer with these intervention decisions: corrected positions receive direct cross-entropy supervision from the teacher's prediction, while retained positions benefit from the teacher's full predictive distribution. Evaluated in a multi-teacher setting for GUI grounding and optical character recognition, CA-OPD substantially improves the Qwen3.5-0.8B baseline across all six target benchmarks, including gains of $9.50$ points on ScreenSpot-Pro and $6.72$ points on OCRBench-v2 English. Controlled studies further show that the gains depend on intervention placement, progressive rollout control, and intervention-aligned supervision, rather than intervention frequency alone.
Read the full abstract
Solar and Stellar Astrophysics
Multiplicity of Cool Stars and their Evolution
Making up a sizeable portion of the galactic census, stellar multiples are experiencing a renaissance. Enabling the study of multiple strands of the study of cool stars, stellar multiples have been found and characterised in great numbers by the missions of the last decade, allowing the exploration of stellar parameters and populations, observation of stellar interactions, studies into stellar formation and evolution, and characterisation of circumbinary systems. This exciting explosion of science is only set to continue, with future missions set to offer even further insights into the topic. Within these proceedings we will summarise the presentations and discussions on cool stellar multiplicity within our splinter sessions at the 23rd Cambridge Workshop on Cool Stars, Stellar Systems, and the Sun, as we examine the present state of the field and look to what the future may bring.
Read the full abstract
Artificial Intelligence
Contrastive Explanations in Quantitative Bipolar Argumentation Frameworks
Argumentation frameworks are useful tools for representing and reasoning with information in a variety of settings, e.g. in supplementing AI models as they perform classification tasks, with a notable benefit of providing additional explainability. In this paper, we introduce contrastive explanations for Quantitative Bipolar Argumentation Frameworks (QBAFs), one such formalism. Unlike most existing explanations for QBAFs, which explain the reasoning outcome of a single argument of interest (i.e. a topic argument), contrastive explanations explain the difference between two topic arguments. We introduce a general form of contrastive attribution functions (CAFs) and establish a set of general properties they should satisfy. We introduce CAFs based on removal, gradients and Shapley-values, and study their properties. Finally, to illustrate contrastive explanations, we demonstrate their usefulness in healthcare and bias identification settings.
Read the full abstract
Probability
Convex Order Comparisons for Sub-Gamma Random Variables
Recent work has shown that sub-Gaussian random variables are dominated in convex order by a sharp multiple of a Gaussian. We study the analogous question for the sub-Gamma class underlying Bernstein's inequality, with the Laplace law as the majorant. Here the moment generating function is controlled by a Bernstein-type bound over a finite range of frequencies, rather than by a purely quadratic bound. We derive a variational formula for the optimal multiple, show that it is strictly larger than the natural scale $\sigma \vee \alpha$, and prove that this value is sharp, being attained by an asymmetric two-point distribution. We then turn to the sub-exponential class, which has a quadratic bound as in the sub-Gaussian case, but only over a bounded range as in the sub-Gamma case. Interestingly, the sub-exponential class displays a different behavior: the optimal multiple is exactly $\sigma \vee \alpha$, but is attained only when $\alpha \leq \sigma$; when $\alpha > \sigma$, the constant remains sharp, but equality cannot hold for any non-affine convex function. Both results rely on a sharp finite-range variant of the Kearns-Saul inequality, which is of independent interest.
Read the full abstract
Materials Science
Symmetry-based modal analysis of heat transport in molecular dynamics of quasi-1D systems
Detailed analysis of thermal conductivity results obtained from molecular dynamics (MD) trajectories conventionally relies on knowledge of the harmonic vibrational modes of the system. This is the case in methods like Green-Kubo modal analysis (GKMA) and homogeneous nonequilibrium modal analysis (HNEMA). However, arbitrary mixing within degenerate phonon subspaces makes individual modal contributions basis dependent and can obscure their symmetry character. We propose an alternative for quasi-one-dimensional (quasi-1D) systems: we construct the modal basis for the decomposition of the thermal conductivity from line-group projection operators, so that every projected component carries well-defined symmetry labels (including rotational information and parities) and the decomposition is unique at the level of irreducible representations (irreps). Applying the idea to a (10, 0)-(20, 0) WS2-MoS2 double-walled nanotube (DWNT) described by a neuroevolution potential (NEP), we find that at 300 K both HNEMA and GKMA yield statistically consistent total conductivities and allow the identification of several prominent symmetry-adapted conduction channels. The GKMA pair matrix shows that within-block and same-channel cross-k terms account for 75.6% of the total conductivity, while cross-channel correlations contribute 24.4%.
Read the full abstract
Computation and Language
Improving Health Literacy through Lay Summarization of Radiological Reports: An Evaluation of BioNER and Retrieval-Augmented Generation
Radiology reports are written primarily for clinicians, and their specialized terminology often makes them difficult for patients to interpret. As a result, many patients turn to publicly available Large Language Models (LLMs) to help explain their reports, despite well-documented risks of factual inaccuracies and hallucinations. Automated lay-summary generation has emerged as a promising alternative, yet the effectiveness of retrieval-enhanced and clinically informed approaches for radiology-specific communication remains underexplored. This study investigates the extent to which Retrieval-Augmented Generation (RAG) and Named Entity Recognition (NER) improve the quality, factual consistency, and readability of automatically generated lay summaries compared with standard LLM-based generation. We develop a framework combining NER-based extraction of clinically relevant findings with a RAG mechanism for contextual grounding, evaluated across few-shot and fine-tuned variants of two models (Qwen, BioBART). Results show that NER consistently improves readability and overall quality, while RAG alone offers no benefit and can introduce hallucinations from irrelevant retrieved terms. Combining RAG with NER degrades performance in few-shot settings but improves readability when fine-tuned. Fine-tuned BioBART with NER achieves the best overall performance, highlighting entity-aware extraction as the primary driver of improved patient-friendly summaries.
Read the full abstract
High Energy Astrophysical Phenomena
Searching for optical pulsations from spider millisecond pulsars with the fast photometer SiFAP2
Optical pulsations from millisecond pulsars (MSPs) have recently been detected in a transitional MSP and an accreting MSP. Evidence for optical pulsations has also been found for a rotation-powered redback MSP. Observations suggest that optical pulsed emission is produced by different mechanisms depending on whether an accretion disk is present in the system. We explored a sample of rotation-powered MSPs in close binaries (P$_{orb}<1\,$day; redbacks and black widows), searching for optical periodic signals with the $SiFAP2$ photometer mounted on the $Telescopio\,Nazionale\, Galileo$ (TNG). We performed pulsation searches using the epoch-folding method with the most up-to-date (radio or gamma-ray) orbital solution for each system. These solutions were based either on previously published works or recent observations from Nançay, the Giant Metrewave Radio Telescope, the Parkes Observatory, and $Fermi$-LAT. We update or confirm radio and gamma-ray ephemerides for five of the presented systems. No optical pulsations were detected with a significance exceeding a $3\sigma$ confidence level in any of our searches, despite achieving sensitivities close to the instrument's limit. This places correspondingly stringent upper limits on the systems' optical pulsed magnitude and conversion efficiency. Our upper limits are consistent with the pulsed optical luminosity of optical pulsations from the redback PSR J2339-0533. Compared to accreting and transitional MSPs, redback and black widow systems show much lower efficiency in converting their spin-down power into pulsed optical emission. This supports the recent suggestion that the accretion disk around the neutron star plays a role in accelerating the particles responsible for producing bright optical pulsed emission.
Read the full abstract
Quantum Physics
A Recursive Module-Coupling Algorithm for Computing Low-Energy Eigenstates
Finding the eigenstates of a many-body Hamiltonian is a fundamental challenge in physics and computational science. Since the search space grows exponentially with system size, numerous classical and quantum algorithms have been developed to address this problem. A practical strategy is to identify a physics-informed low-dimensional subspace that effectively accommodates the low-lying eigenstates, thereby reducing the computational complexity. In this paper, we propose a recursive module-coupling algorithm, which iteratively treats a system as a composition of locally-coupled smaller modules, with low-energy subspace estimated successively according to the same recursive structure. Unlike the density matrix renormalization group (DMRG) approach that optimizes a global matrix product state through repeated local sweeps and obtains excited states sequentially, our algorithm constructs a physically tailored variational basis from module eigenstates and obtains several low-energy states on an equal footing, leading to substantial speedups if targeting moderate accuracy. Our proposed method further leads naturally to a recursive quantum variational algorithm, providing a systematic and modular circuit-construction framework compatible with contemporary gate-based quantum architectures. At each recursive level, block encoders are trained to map logical basis states onto the retained physical subspace, within which a variational circuit is subsequently optimized. Such a quantum-circuit implementation provides not only a quantum multistate eigensolver, but also a systematic prescription for hierarchically constructing quantum state-preparation circuits. Classical simulations demonstrate the accuracy and efficiency of the proposed method, whereas experiments on IBM quantum processors show that eigenstate preparation with reasonable fidelities is achievable even in the current NISQ era.
Read the full abstract
Cryptography and Security
CAPTCHAs in the Agentic Era: Solvers That Learn from Every Encounter
Vision-language models (VLMs) can solve visual CAPTCHAs without task-specific training, but the agents built on them approach every challenge from scratch. For such an agent, the hundredth instance of a familiar puzzle costs as much time and compute as the first. Specialized detectors invert the trade-off, answering in milliseconds but only for categories they were trained on. Neither improves with exposure. We study what changes when a solver improves with use. Our system pairs a fine-tuned YOLOv8 detector with an open-weight VLM behind a confidence-based router, and runs entirely from screenshots and operating-system input events, with no browser automation or DOM access. It reaches 85.4% overall and 84.2% macro accuracy across 16 classes, exceeding either component alone. Every answer VLM produces also serves as a training label, so the detector absorbs categories it was never trained for, typically after one or two encounters and without human annotation. The same loop also repairs it. A CAPTCHA operator can perturb images against the publicly released detector and drive its accuracy to 0%, but the perturbations leave VLM untouched, and its labels let the detector recover. Under a year-long simulated arms race in which the CAPTCHA operator re-crafts its perturbations each month, the solver recovers every round, and a cheap ~70%-accurate open-weight teacher hardens it as effectively as a perfect oracle. Visual CAPTCHA defenses that assume a failing bot stays failing therefore understate how quickly an adaptive solver returns.
Read the full abstract
Number Theory
Large values of cubic and quartic Dirichlet $L$-functions of prime moduli
Computation and Language
PolERo: Studying Political Evasion in Romanian
Political evasion refers to responses that engage with a question while withholding the requested information. Recent NLP work frames political evasion as a classification task using a two-level taxonomy of response clarity and fine-grained evasion strategies. Existing work on response clarity and evasion classification is limited to English, leaving open whether the taxonomy and model behavior transfer across languages and political contexts. We introduce PolERo, a dataset of 3,574 human-annotated question-answer pairs extracted from official transcripts of five Romanian presidents. We evaluate multiple classification approaches on both datasets under matched conditions, including TF-IDF baselines, fine-tuned encoder models, a proposed sliding-window encoder, and zero/few-shot LLM prompting. We study cross-lingual transfer through joint bilingual training and machine-translation-based data augmentation. Our results indicate that fine-tuned encoders are competitive, cross-lingual transfer is asymmetric, and ambivalent evasion categories involving pragmatic cues remain the main challenge across all model families.
Read the full abstract
Image and Video Processing
Seeing Beyond the Lesion: Disease Recognition from Reactive CNS Tissue
Sampling error yields exclusively reactive, non-lesional brain parenchyma in a significant proportion of intracranial biopsies, leaving the underlying disease undiagnosed. We benchmark four pathology foundation models (UNI2-h, Virchow2, Prov-GigaPath, H-optimus-0) as frozen patch encoders within a shared attention-based multiple-instance learning framework using 245 whole-slide images from 186 patients with confirmed downstream diagnoses. We first show that coarse disease-category prediction can be reproduced largely from slide size alone. After restricting classification to three finer diagnostic distinctions within common tissue categories, this confound no longer explains performance, yet disease labels remain predictable above chance under permutation testing (p $\le 10^{-4}$ throughout). Surprisingly, performance is statistically indistinguishable across all foundation-model encoders, suggesting that recovering these weak morphological signatures is not limited by current patch representations. Signed instance-contribution maps and expert review further test whether predictive evidence localizes to reactive parenchyma rather than sampling-induced bias like blood introduced during tissue sampling. These results position acquisition-shortcut auditing via a provenance-only baseline as a necessary control in computational-pathology benchmarks, and show, once that confound is removed, that weakly supervised models still recover disease signal from tissue conventionally regarded as non-diagnostic.
Read the full abstract
Combinatorics
The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two
An edge card of a graph is obtained by deleting one edge, and a class edge-reconstruction number asks for the fewest carefully selected cards that identify the graph when its class is known. We determine the sharp universal bound for maximal planar graphs. Two selected cards always suffice, and the octahedral graph shows that two can be necessary; some maximal planar graphs are already identified by one card. The argument exploits the fact that deleting a flippable edge leaves a single quadrilateral whose two diagonals give the only possible maximal-planar completions. Degree information then rules out the competing completion, with a separate argument for graphs containing a vertex of degree three. This settles a problem posed in a 2010 survey on reconstruction numbers.
Read the full abstract
Data Structures and Algorithms
Connectivity Oracles Under Vertex Failures via a Simple and Fast Low-Degree Steiner Forest Decomposition
We study the low-degree Steiner forest decomposition. Given a graph $G=(V,E)$ and a terminal set $U\subseteq V$, the standard decomposition returns a set $X\subseteq V$ of size at most $|U|/2$ and a forest $T\subseteq G-X$ of maximum degree $\Delta$ such that, for every connected component $C$ of $G-X$, some connected component of $T$ contains all terminals in $U\cap V(C)$. This is the central decomposition behind several connectivity oracles under vertex failures [DP20, LS22, LW24]. The state-of-the-art algorithms either take $O(mn\log n)$ time with degree bound $4$ [DP20], or take $m^{1+o(1)}$ time with the weaker degree bound $O(\log^{2}n)$ [LW24]. We show that if $T$ is allowed to contain vertices of $X$, then a degree-$4$ decomposition can be computed by a very simple algorithm in $O(m\alpha(n))$ time. Further, we show that this relaxed decomposition is equally useful for constructing connectivity oracles under vertex failures. As a consequence, we obtain a deterministic connectivity oracle under $d$ vertex failures with $\tilde{O}(m)$ space, $\tilde{O}(md_\star)$ preprocessing time ($d_\star$ is an upper bound on the number of failed vertices), $\tilde{O}(d^{2})$ update time, and $O(d)$ query time. Up to polylogarithmic factors, this oracle strictly improves all known oracles; in particular, it removes the $n^{o(1)}$ factors from the preprocessing and update times of [LS22, LW24].
Read the full abstract
Neural and Evolutionary Computing
Semantics-Guided Automatic Tensorization for Multiobjective Evolutionary Algorithms: A Multi-Agent Framework
Multiobjective evolutionary algorithms (MOEAs) naturally expose population-level parallelism, but many mature implementations encode their computation in sequential program structures designed for central processing units. Exploiting modern tensor computing platforms therefore requires more than direct code translation: the implementation must be restructured without changing the defining optimization mechanism of the underlying MOEA. We formulate automatic tensorization for MOEAs as semantics-guided computational restructuring and develop Evolutionary Code Conversion (EvoCoCo), a multi-agent framework that realizes this formulation. EvoCoCo reconstructs algorithm-specific states, dependencies, operators, and update logic into a structured semantic representation and organizes them through a shared tensorization blueprint. Specialized transformation branches then explore alternative tensor realizations, while execution feedback guides validation, repair, and candidate selection. Experiments on a benchmark of 48 MOEAs evaluate migration reliability, optimization fidelity, and computational scalability. Under matched large language model backends, EvoCoCo attains higher migration reliability than direct one-shot translation. Across the benchmark suites, 88.2% of valid comparisons satisfy the predefined optimization-fidelity criterion. The tensorized implementations also exhibit increasing acceleration on graphics processing units as population size or decision dimension grows, with median measured speedups ranging from $22.6\times$ under population scaling to $80.2\times$ under decision-dimension scaling. External-source and ablation studies further assess transfer beyond the main benchmark and the roles of the major framework components.
Read the full abstract
Number Theory
On the Growth of Denominators of Simultaneous Best Diophantine Approximations in a Norm Induced by an Inner Product
For $n$-dimensional simultaneous best Diophantine approximations in an arbitrary norm induced by an inner product, for $n\geq2$ we prove $q_{k+2^n}\geq q_k+\min\{q_{k+2^{n-1}},2q_{k+1}\}$. This yields $g_n(\alpha):=\liminf_{m\to\infty}(q_m)^{1/m}\geq\varphi^{1/2^{n-1}}, \text{ for } \ \varphi = \dfrac{1 + \sqrt{5}}{2}.$ Consequently, $\displaystyle G(n):=\inf_{\alpha\in\mathbb R^n\setminus\mathbb Q^n}g_n(\alpha)\geq\varphi^{1/2^{n-1}}$ and $\underline{\mathcal D}_n(\alpha)\leq\left\lfloor 2^{n-1}\frac{\log2}{\log\varphi}\right\rfloor+1$, where $\underline{\mathcal D}_n(\alpha)$ is a quantity related to multidimensional generalizations of the three-distance theorem. In particular, $g_2(\alpha)\geq\sqrt\varphi, \, g_3(\alpha)\geq\sqrt[4]{\varphi}, \, \underline{\mathcal D}_2(\alpha)\leq3, \, \underline{\mathcal D}_3(\alpha)\leq6.$
Read the full abstract
Analysis of PDEs
Kinetic Fokker–Planck Equations with Drifts in a Supercritical Range
We investigate kinetic Fokker–Planck equations with rough divergence-free drifts in anisotropic mixed Lebesgue spaces. The divergence-free structure yields an energy cancellation that remains effective under kinetic localization. Combining this cancellation with anisotropic regularization estimates and a De Giorgi iteration, we establish local boundedness for weak subsolutions and, consequently, global well-posedness for the Cauchy problem in a scaling-supercritical regime.
Read the full abstract
Metric Geometry
The truncated octahedron minimizes surface area among parallelohedra of equal volume
We prove that the regular truncated octahedron uniquely minimizes surface area among all parallelohedra of fixed volume. Equivalently, every three-dimensional parallelohedron $P$ satisfies \[ \frac{\mathcal H^2(\partial P)}{|P|^{2/3}} \ge \frac{3(1+2\sqrt3)}{4^{2/3}}, \] with equality if and only if $P$ is similar to the regular truncated octahedron. Among the non-truncated Fedorov types we prove a stronger sharp bound, attained uniquely by the regular rhombic dodecahedron.
Read the full abstract
High Energy Physics (Phenomenology)
Strictly solvable $d=4$ quantum field theory models with unitarity violation. Possible implications for baryon asymmetry of the Universe and dark matter
In this paper we consider quantum field theory with unitarity violation. We construct several $d = 4$ strictly solvable models with unitarity violation. As a possible application of the models with unitarity violation we construct two models explaining the observed baryon asymmetry of the Universe and the dark matter existence. In considered models dark matter particles have nonzero baryon number and the total baryon number of the Universe being the sum of the baryon number of the matter and dark matter is equal to zero. Dark matter paricles have mass $\sim 6~GeV$. Proposed models predict negligible cross sections of the dark matter with nuclei and electrons. It means that underground experiments will fail to discover dark matter.
Read the full abstract
Machine Learning (Statistics)
A computational approach to maximum likelihood thresholds for colored Gaussian graphical models
Gaussian graphical models (GGMs) are essential tools for interpretable structure learning. However, in high-dimensional, small-sample regimes, the available data is often insufficient for the maximum likelihood estimator to exist. Colored Gaussian graphical models (CGGMs) mitigate this limitation by imposing symmetry constraints through graph coloring, which reduces the required sample size. This minimal number of observations needed to guarantee that the estimator exists almost surely is defined as the maximum likelihood threshold (MLT). Here, we address the computation of the MLT for CGGMs by focusing on its geometric formulation: finding the minimum rank of a sample covariance matrix such that its projection lies almost surely within the interior of the cone of sufficient statistics. We establish a unified theoretical framework, extending results from uncolored to colored models and introducing new symbolic algorithms. Furthermore, we present a computational study integrating sampling with topological data analysis (TDA) to investigate the local geometry of the cone of sufficient statistics. Our results demonstrate the potential of TDA to overcome the computational bottlenecks of traditional symbolic algebraic methods, particularly Groebner basis computations, in analyzing the likelihood geometry of CGGMs.
Read the full abstract
Analysis of PDEs
Viscosity Supersolution Barriers to a Non-local Free Boundary Problem
We study a parabolic obstacle partial integro-differential equation (PIDE) with a dynamically moving bilateral free boundary. This type of problem arises in the mathematical modeling of speculative asset bubbles with Lévy jump processes. We investigate the existence of viscosity supersolution barriers within the class of functions exhibiting linear asymptotic growth ($O(|g|)$ at infinity) across three distinct parametric regimes. Our intention is to determine when such a barrier can be constructed by analyzing the balance between the stabilizing local drift, defined by the discount rate $r$ and mean-reversion $\rho$, and the non-local jump dispersion, characterized by the large-jump intensity $\lambda$ and Lipschitz constant $L_\gamma$. First, when $r+\rho > \sqrt{\lambda}L_\gamma$, we prove the global existence of non-negative viscosity supersolutions. Second, in the deficit regime ($r+\rho < \sqrt{\lambda}L_\gamma$), we construct non-negative supersolutions for every finite horizon $T>0$. However, by utilizing an asymptotic slope envelope, we prove that these barriers cannot be bounded by a fixed, pre-determined linear growth ceiling $C_{\max}$ across arbitrarily large horizons; rather, the required linear growth constant must inflate exponentially as the horizon length increases. Finally, at the exact critical boundary ($r+\rho = \sqrt{\lambda}L_\gamma$), we show the existence of a supersolution with a uniform spatial growth bound, provided an additional spatial no-crossing condition holds on the negative tail.
Read the full abstract
General Relativity and Quantum Cosmology
The Analytical Solutions of Dyonic Black Holes in Einstein-Euler-Heisenberg Theory
Recently, we constructed analytical purely electric and purely magnetic black-hole solutions in Einstein–Euler–Heisenberg theory, while the corresponding dyonic solutions were obtained numerically \cite{Luo:2026srx}. Motivated by the recent analytical construction of a dyonic black hole at the special coupling locus $b=a/2$ \cite{Ahmed:2026ufj}, we revisit the general dyonic sector. We show that exact analytical dyonic black-hole solutions can be constructed for nonlinear couplings satisfying $2b>a$, without imposing the restriction $b=a/2$. The mass function is expressed in closed form in terms of the Lauricella hypergeometric function. In particular, our construction yields an exact dyonic solution for the Euler–Heisenberg coupling $b=7a/4$. The solution of Ref.~\cite{Ahmed:2026ufj} is recovered in the limiting case $2b\rightarrow a$.
Read the full abstract
Computation and Language
MultiGhostBench: A Multilingual Benchmark for Long-Form LLM-Generated Text Attribution under Distribution Shifts
While existing work on LLM authorship attribution (AA) has made progress, available benchmarks remain limited, often focusing on English, controlled settings, or relatively outdated models, with the few multilingual studies considering only relatively short texts. We introduce MultiGhostBench, a multilingual benchmark comprising 928 books generated by five recent LLMs across six languages and three scripts, with an average length of approximately 59K words per book. The benchmark supports evaluation under domain, author, and language shifts. Evaluation of representative AA methods shows that no single method consistently performs best across settings, and performance generally degrades under distribution shifts. Transformer-based detectors can retain generator-related information across languages, although transfer effectiveness varies by language pair, whereas statistical and fingerprint-based detectors are more language-dependent. We envision MultiGhostBench as a valuable resource for the development and evaluation of robust AA methods. The dataset and code can be found at https://github.com/GrecoMT/MultiGhostBench.