Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 10 September
We study regularity, existence, and uniqueness of solutions to vector fields on the two-dimensional torus in Sobolev spaces of dominating mixed smoothness, which measure regularity separately in the two variables. For constant-coefficient vector fields, we obtain families of mixed smoothness estimates describing how the gain or loss of regularity can be distributed between the two variables. In the nonreal case, a gain of one derivative can be distributed between the two directions, whereas for real irrational coefficients the loss is governed by the irrationality measure of the coefficient. We also establish sharpness below the corresponding arithmetic threshold and describe the rational and Liouville obstructions. For real-valued variable coefficients, direct estimates for the periodic Fourier-mode equations yield mixed smoothness regularity results and their isotropic and classical consequences. We then use a periodic conjugation to the averaged constant-coefficient normal form. Although this conjugation introduces an additional loss in the mixed smoothness scale, it preserves isotropic Sobolev orders and therefore transfers the sharp constant-coefficient isotropic theory to the variable-coefficient setting. In the nonresonant regimes, we also obtain existence and uniqueness under the natural zero-mean compatibility condition.
Robotics
An Automated Thickness Evaluation Procedure Using an Integrated Structured Light 3D Camera in a Robotic Bioprinting Framework
Bioprinting is emerging as a tissue engineering technique to replace common treatment methods for large scale injuries. While thickness of the BioPrinted Constructs (BPCs) have shown to be of importance in the cell maturation and integration, the literature lacks a robust, automated, and quantitative method for measuring these metrics. In this paper, we propose a fully automated vision-based method for measuring the thickness of the BPCs with complex geometries. Leveraging the point cloud and RGB images of a structured light 3D camera, our proposed method performs an image-based segmentation for delineating the BPCs from the RGB images, accompanied by novel geometry-based thickness measurement algorithms performed on the point cloud scans. These algorithms combine the segmentation mask with the robot's forward kinematics data and a 3D point cloud scan to precisely measure the aforementioned metrics for complex-shaped BPCs. The proposed method was evaluated in simulation and experimental studies. In simulation studies, the algorithms were used to measure the thickness of some virtually created BPCs with known thickness. The comparison between the measured and true thicknesses demonstrates the high accuracy of the proposed method, achieving mean absolute errors between 0.025 mm and 0.057 mm in simulation at a spatial resolution of 0.1 mm x 0.1 mm per pixel. Furthermore, we successfully deployed the algorithms on our robotic bioprinting setup utilizing a structure light 3D camera, where complex patterns were printed and the developed methods utilized to accurately measure the thickness of printed BPCs.
Read the full abstract
Human-Computer Interaction
Plans They Abandon, Reports They Author: The Narrative Layer of Autonomous Agents
When a coding agent finishes a task, the developer reviews a summary the agent wrote about itself, not a display someone designed. We ask how much of the agent's work that summary carries, and whether it drifts toward the plan the agent stated when execution departed from it. Across 5,851 real developer sessions and 355,942 tool calls, a self-report referred to about one action in eleven, and a reader working from the report alone recovered roughly a fifth of the action log. Neither figure depended on whether the session later needed human correction. Reports did not generally resemble the stated plan more than the executed one, but they did so increasingly as execution diverged from the plan. We hand-validate both measurement steps that use a language model, report the one that failed alongside the one that passed, and draw conclusions only from measures that survived.
Read the full abstract
Quantum Physics
Path-Degenerate Quantum Interferometry for Loss Resilience in Gravitational-Wave Detectors
Optical decoherence degrades quantum correlations in squeezed states of light, severely limiting the quantum-nondemolition (QND) sensitivity of gravitational-wave detectors. Here, we propose the path-degenerate quantum interferometry scheme that obviates the need for entire optical subsystems—including additional filter cavities, auxiliary parametric amplifiers, and Faraday isolators—thereby drastically reducing spatial mode mismatches while inherently integrating variational output, a long-standing theoretical proposal to further deepen the QND regime. We experimentally demonstrate a core aspect of this scheme, achieving a shot-noise-preserving signal enhancement that directly counteracts the detrimental effects of readout loss. By delivering an improved signal-to-quantum-noise ratio solely through the consolidation and reduction of currently considered optical subsystems, our approach offers a highly optimized route toward enhanced quantum-noise reduction in upcoming LIGO upgrades and next-generation gravitational-wave observatories.
Read the full abstract
Astrophysics of Galaxies
NOEMA probes the [CII] and dust content in a 2175Å UV Bump Galaxy at $z=7.1$
The detection of the $2175$Å UV bump at $z>6$ challenges existing models of dust formation, suggesting rapid formation of small carbonaceous dust grains within the first billion years of cosmic time. We present the results of the first direct attempt at linking far-infrared (FIR) observations to the UV bump within the Epoch of Reionisation (EoR), through NOEMA observations of GNWY-7379420231 at $z=7.108$, a galaxy exhibiting the strongest known UV bump feature at $z>4$. We detect the [CII] 158$\mu$m emission line at 5.1$\sigma$ at $z_\mathrm{[CII]} = 7.1078 \pm 0.0005$, in excellent agreement with the redshift derived from the [OIII] $\lambda 5007$Å line. The {\cii} luminosity implies $\mathrm{SFR}_\mathrm{[CII]}=16.2^{+5.8}_{-5.5}M_\odot \mathrm{yr}^{-1}$, consistent with short timescale SFR tracers such as dust corrected $\mathrm{SFR}_\mathrm{H\alpha}=18.0\pm3.9 M_\odot \mathrm{yr}^{-1}$ and $\mathrm{SFR}_\mathrm{10~Myr}=20.5^{+3.8}_{-5.0}M_\odot \mathrm{yr}^{-1}$ from SED fitting. The dust continuum is not detected suggesting an obscured SFR of $\mathrm{SFR}_\mathrm{IR} < 32 ~M_\odot \mathrm{yr}^{-1}$ and a dust mass of $M_\mathrm{d} < 5.3\times10^6 ~M_\odot$ $(M_\mathrm{d}/M_\star<2\%)$. Finally, the [CII]-derived dynamical mass of $\log_{10}(M_\mathrm{dyn}/M_\odot)=8.95^{+0.51}_{-0.66}$ and stellar mass of $\log _{10}\left(\mathrm{M}_{\star} / \mathrm{M}_{\odot}\right) = 8.39_{-0.09}^{+0.13}$ suggest a gas-rich moderately massive galaxy. Taken together these results rule out GNWY-7379420231 being a heavily dust obscured or massive galaxy, but rather a `normal' EoR galaxy with a recent upturn in star-formation. Our results suggest efficient shattering of larger dust grains in the diffuse, turbulent ISM and/or fortunate line of sight alignment are needed to explain the UV bump properties of GNWY-7379420231.
Read the full abstract
Computer Vision
QuPAINT: Physics-Aware Multimodal Reasoning for Quantum Material Characterization
Characterizing two-dimensional (2D) quantum materials by optical microscopy requires localizing exfoliated flakes and determining their layer thickness from subtle optical contrast and interference color to select suitable flakes for device fabrication. However, models face synthetic-to-real domain shifts and variation across materials, substrates, laboratories, and imaging conditions. We present QuPAINT, a physics-aware multimodal framework for transferable quantum flake characterization. The Synthetic Materials Framework (Synthia) generates diverse synthetic microscopy images while preserving layer-dependent optical behavior. Using these images, we construct QMat-Instruct, a multimodal instruction dataset with image-specific reasoning traces generated from verified annotations and constrained to observable optical cues. QuPAINT integrates these signals through Physics-Informed Attention (PIA), which injects substrate-relative optical priors into the visual representation to support grounded multimodal reasoning. For evaluation, we introduce QF-Bench, to our knowledge, the largest real-world benchmark for this problem, spanning diverse microscopy and substrate conditions. Using its verified annotations, we study counting, visual grounding, reasoning quality, confidence calibration, and transfer to an unseen material. QuPAINT-8B substantially outperforms prior methods and establishes state-of-the-art performance for both general and monolayer flake detection. Additional experiments show that image-grounded supervision improves strict spatial grounding and confidence calibration while preserving robust general flake detection on the unseen material.
Read the full abstract
Sound
Real-Time Music Source Separation on a Low-Power Audio DSP
Real-time music source separation is validated on desktop CPUs and GPUs. Does any published system fit the embedded audio hardware it targets? On a commercial audio DSP (2 MB SRAM, 2.07 GMAC/s measured), none does, and the constraints eliminate different models: memory rules out the 16-51 M parameter TasNet/X-UMX family, per-frame compute rules out RT-STT, needing 5.5x the available MAC rate. Parameter count predicts neither: weight reuse spans 1x to 345x. We then build one that fits. Training on continuous rather than block-padded convolution context proves essential: a model scoring 3.93 dB block-wise otherwise collapses to silence within 2 s frame-by-frame. A gated complex FIR deep filter adds a latency knob, gaining 0.38 dB even when strictly causal. It reaches 4.70 dB cSDR on MUSDB18-HQ and runs in 10.43 ms of an 11.6 ms hop, 0.5-0.7 dB behind systems that do not fit.
Read the full abstract
Quantum Physics
Ab initio multichannel calculation of the Bethe surface and Compton defects for molecular hydrogen
A correlated multichannel computation of the generalized oscillator-strength density for electrons scattering off randomly oriented molecular hydrogen at the internuclear separation of 1.4 $a_0$ is being presented. The numerical procedure features a novel free-boundary method based on configuration interaction of ionic orbitals expanded in B splines using prolate-spheroidal coordinates. Satisfactory agreement between the present and both experimental as well as other theoretical results has been found, thus providing a view on the Bethe surface for energy transfers up to of 558 eV. The systematic and robust convergence behavior of the method further allowed for assessing the validity of the binary-encounter approximation, providing a confirmation of experimentally determined Compton defects for H$_2$ using a single consistent theoretical description. Overall, the present findings are expected to be helpful for calculating highly accurate energy-loss spectra for fast electrons passing through and ionizing molecular hydrogen gas or its isotopologues.
Read the full abstract
Strongly Correlated Electrons
Selective coupling of coherent phonons to intertwined charge-orbital and magnetic orders in doped manganites
Strongly correlated materials feature technologically relevant functionalities such as high-temperature superconductivity and colossal magnetoresistance, which emerges from the competition and coexistence of electronic and magnetic phases. Uncovering the microscopic interactions underlying these phenomena remains challenging because spin, orbital, charge, and lattice degrees of freedom are inherently intertwined. Here, by combining time-resolved X-ray diffraction and polarization-resolved ultrafast optical reflectivity in La1/4Pr3/8Ca3/8MnO3, we reveal that coherent phonon modes can selectively track different ordered phases: the in-plane phonon response is predominantly sensitive to charge/orbital order, and the c-axis phonon response is sensitive to magnetic order. Moreover, a ferromagnetic-related hysteresis emerges even when solely probing the charge/orbital-ordered phase, indicating a strong microscopic coupling between the spatially separated charge/orbital-ordered and ferromagnetic-ordered phases. These results demonstrate that coherent phonons provide a direct time-domain route to disentangle intertwined electronic and magnetic dynamics in coupled phases.
Read the full abstract
Materials Science
Pseudo-hybrid density functional ACBN0 for Hubbard $U$ correction in a numeric atom-centered orbital basis
We present a formulation and implementation of the Agapito-Curtarolo-Buongiorno Nardelli (ACBN0) pseudo-hybrid density functional in a numeric atom-centered orbital basis. The method is realized in the all-electron, full-potential electronic-structure package FHI-aims. The implementation uses a Löwdin-orthogonalized projector, which improved the stability of the self-consistent ACBN0 iterations for the tested systems. For a benchmark set of materials including metal oxides and nitrides, ACBN0 with the fully localized limit (FLL) as the double-counting treatment reduces the aggregate band gap errors relative to the Perdew-Burke-Ernzerhof (PBE) and strongly constrained and appropriately normed (SCAN) functionals, reaching an accuracy comparable to the Heyd-Scuseria-Ernzerhof functional (HSE06). The computational cost of a single ACBN0 self-consistent-field iteration is comparable to that of the parent functional and substantially lower than that of HSE06. The applicability of the localizedbasis implementation to low-dimensional systems is demonstrated by calculations of adsorption and the oxygen evolution reaction (OER) overpotential on a $\beta$-NiOOH(001) surface. On structures relaxed with regularized SCAN (rSCAN), single-point ACBN0 calculations based on rSCAN (ACBN0@rSCAN) with the "tight" numerical settings reduce the mean absolute deviation of the reaction-step energies from HSE06 and shift the estimated overpotential toward the HSE06 and Perdew-Burke-Ernzerhof hybrid (PBE0) reference results.
Read the full abstract
Game Theory
Opening the Strategic Pandora Box: Conditional Transaction Mechanisms
Conditional transaction engines (CTEs) execute conditional instructions for offline users. This paper formalizes the mechanism-design problem within each engine invocation. A conditional transaction mechanism (CTM) decides which pending conditions to evaluate first because each evaluation delays the eventual write. We model this problem as Strategic Pandora, a discounted variant of the Pandora's box model with independent Bernoulli boxes. Agents report privately assessed success probabilities and, in the full model, values for the write action. We propose the reported-Weitzman mechanism (RW) and the reported-values second-price mechanism (RWSP). To compare revenue without a common prior, we introduce dynamic No-Betting Revenue. Under the stated competition and equilibrium conditions, every qualifying pure equilibrium of RW or RWSP earns a constant fraction of its corresponding dynamic NBR benchmark.
Read the full abstract
Group Theory
Property $(T)$ and nonlinearity of mapping class group quotients
We give a general method for proving Kazhdan's property $(T)$ for quotients $G/K_{[c+1]}$, where $G$ is countable, $K$ is a normal subgroup and $K_{[j]}$ denotes its lower central series. The method combines an affine realization of $G/[K,K]$, a contraction argument, and permanence for nilpotent normal subgroups. We apply this method to several classes of groups by means of homological representations. For the Torelli lower-central series quotients $\operatorname{Mod}(\Sigma_g)/(\mathcal{T}_g)_{[c+1]}$ for $g\ge3$ we show that they have property $(T)$ for every $c\ge1$. We also prove property $(T)$ for $\operatorname{Aut}(F_3)/(\mathrm{IA}_3)_{[c+1]}$ for every $c\ge1$, relating these groups to the tame nilpotent images studied by Lubotzky and Pak. Several other classes of examples are discussed as well. We also prove that the Torelli lower-central series quotients for $c\ge2$ are not residually finite, and thus non-linear.
Read the full abstract
Signal Processing
CORDIS: A Scalable Coordinated Resource Allocation Framework for Distributed Cell-Free ISAC
Integrated Sensing and Communication (ISAC) is envisioned as a key technology for 6G wireless networks, enabling the joint use of spectrum and hardware for sensing and communication. In multi-static cell-free architectures, coordinating beamforming and power resources across distributed access points (APs) is critical in order to mitigate severe communication-sensing interference. Most existing ISAC resource allocation solutions rely on centralized architectures with full network knowledge, which limits their scalability and practicality in distributed cell-free deployments with imperfect channel state information (CSI). In this paper, we introduce a framework for COordinated Resource allocation for Distributed ISAC Systems (CORDIS) that optimizes network sensing while suppressing clutter and maintaining per-user communication performance constraints. Two algorithms are developed: CORDIS-Split, a low-overhead scheme that pairs fixed local beamformers with centralized power allocation, and CORDIS-ADMM, which jointly optimizes beamforming and power through the consensus Alternating Direction Method of Multipliers (ADMM). By localizing high-dimensional matrix operations, both algorithms ensure fronthaul overhead and per-AP computation remain independent of antenna and AP counts. Simulations demonstrate that CORDIS-ADMM approaches the centralized performance bound and degrades gracefully under CSI estimation error, remaining effective even with locally rank-deficient channels, while CORDIS-Split offers a minimal-overhead alternative. These results confirm that CORDIS is a scalable and communication-efficient foundation for robust ISAC in decentralized wireless networks.
Read the full abstract
General Relativity and Quantum Cosmology
Distinguishing Dymnikova and Schwarzschild Black Holes through Gravitational Lensing with EFT-Corrected Photon Propagation
We investigate whether a Dymnikova regular black hole can be observationally distinguished from a Schwarzschild black hole through strong gravitational lensing, taking into account effective field theory (EFT) corrections to photon propagation. We derive the modified photon propagation law induced by non-minimal couplings between the electromagnetic field and spacetime curvature and analyze the resulting photon trajectories in the Dymnikova spacetime. Within the strong deflection limit, we derive the EFT corrections to the photon sphere and the strong-deflection coefficients characterizing the logarithmically divergent behavior of the deflection angle. Although the EFT corrections are parametrically small, their effects can become relevant in the strong-deflection regime, where the deflection angle is highly sensitive to photon propagation near the critical orbit. We evaluate the strong-deflection observables for representative values of the Dymnikova parameter $\ell$ and compare them with the corresponding Schwarzschild results. We find that EFT corrections to photon propagation leave characteristic imprints on the strong-lensing observables. Furthermore, the contribution of the EFT corrections becomes more pronounced as the Dymnikova parameter $\ell$ approaches its critical value, indicating that the near-critical regime provides a particularly sensitive setting in which curvature-dependent corrections to photon propagation may affect gravitational lensing. These results suggest that strong gravitational lensing, together with EFT-induced modifications of photon propagation, may provide a means of distinguishing Dymnikova regular black holes from Schwarzschild black holes.
Read the full abstract
Materials Science
Different critical exponents on two sides of the magnetic transition in two dimensions
The possibility of different critical exponents on two sides of a magnetic transition has been theoretically predicted [PRB 13, 2222 (1976), PRL 115, 200601 (2015)] and experimentally realized [PRL 128, 015703 (2022)] in three-dimensional systems. However, the emergence of such a scenario in two dimensions is not yet established. Here, we report distinct two-dimensional (2D) critical exponents below and above the magnetic transition temperature (TC) through critical scaling analysis in a quasi-2D non-centrosymmetric, Dzyaloshinskii-Moriya interaction (DMI) active hybrid perovskite (C7H9NBr)2CuBr4. The system exhibits critical exponents of 2D Ising-type below TC and 2D XY-type above TC . In contrast, isostructural Cl and centrosymmetric Br analogs, in which the DMI effect is expected to be weaker, exhibit symmetric 2D critical behavior. These results highlight the crucial role of DMI in (C7H9NBr)2CuBr4 as a symmetry-breaking perturbation that alters the magnetic critical behavior differently above and below TC . Our study is the experimental realization of hitherto unreported asymmetric 2D critical behavior in structurally flexible and dimensionally tunable hybrid perovskites.
Read the full abstract
Analysis of PDEs
Doubling inequalities and propagation of smallness for Schrödinger equations with singular potentials
We study quantitative unique continuation for solutions of the Schrö\-din\-ger equation with complex-valued singular potentials \(V\in L^t\), \(t>d/2\). We obtain a family of scale-invariant \(L^p\to L^q\) Carleman inequalities for the Laplacian and use them to prove the doubling inequalities with explicit dependence on the \(L^t\)-norm of the potential. These estimates are combined with multiscale arguments to obtain propagation of smallness from arbitrary measurable sets of positive measure. As an application of the main results, we prove an upper bound for the BMO norm for the logarithms of Dirichlet-Laplace eigenfunctions in simply connected planar Lipschitz domains.
Read the full abstract
Computation and Language
GAUGE: When Not to Trust LLM-as-a-Judge in User-Simulated Evaluation of Task-Oriented Agents
Comparing and selecting task-oriented LLM agents increasingly relies on a low-cost offline evaluation gate: persona-driven LLM user-simulators converse with each candidate, an LLM-as-a-judge scores the transcripts, and the higher-scoring agent is promoted. We introduce GAUGE, a reusable offline protocol that measures whether this gate's ranking matches a grounded verifiable reward across 25 agents from six providers on the $\tau^2$-bench and SimulatorArena benchmarks, separating two kinds of evaluation validity that release practices conflate: ranking validity and construct validity. First, a satisfaction-success gap: satisfaction carries essentially no information about task success, as conversations rated satisfied by our blind panel are decorrelated from actual success, with 57.5% of them failing the customer's task, a pattern consistent across five rater populations, both benchmarks, and every subjective dimension we rated. Second, while the gate's ranking is robust across the broad capability span, it loses resolution among the near-equal strong agents: this decision-disagreement rate jumps from $<$1% on wide-reward pairs to 31% on close pairs. The gate is thus human-validated yet mis-anchored. As a remedy, we propose a calibrate-then-trust cadence in which a judge-free completion bit is a zero-cost tripwire for truncation regressions.
Read the full abstract
Software Engineering
Retrieval-Augmented Generation for Scientific Code Understanding
Large language models have become central to modern coding assistants, but state-of-the-art systems such as Claude Code or Codex rely on very large, cloud-hosted models with significant computational cost and data-privacy implications. This work investigates whether a useful, fully local coding agent can be built around small open-source models by shifting the computational burden away from inference. We develop a Retrieval-Augmented Generation (RAG) system for scientific code understanding that strictly separates an expensive offline ingestion stage parsing, structural graph construction, LLM-generated entity explanations, and embedding from a lightweight online answering stage. The system is evaluated on a 100-question benchmark spanning eleven categories over the IPPL scientific codebase written in C++, with answers scored by an independent frontier model as the judge. Across seven answering models, we find that model family and retrieval quality matter more than parameter count, i.e. a 9B model achieves the highest average score (0.795), outperforming both larger models within our pipeline and the same models embedded in the Claude Code retrieval architecture. The results indicate that front-loading code understanding into a reusable, codebase-specialised vector store enables small local models to deliver grounded and repository-specific answers, making the agent well suited as a privacy-preserving development tool for in-house scientific codebases.
Read the full abstract
Metric Geometry
Non-compact convex hulls in CAT(0) spaces revisited
We simplify Goodwin's construction of a non-compact closed convex hull in a CAT(0) space and show that three points suffice for the example.
Robotics
Battery-Aware Predictive Trajectory Planning and Control for Multirotors Under Disturbances
This paper presents a battery-aware predictive trajectory-planning and control framework for multirotors operating under spatially localized disturbances. Candidate trajectories are evaluated through closed-loop vehicle–motor–battery propagation, allowing disturbance-induced control demand, electrical energy, battery evolution, and terminal-voltage-dependent actuator capability to enter the planning process. % A reduced-order battery model is numerically benchmarked against an independently implemented Simscape equivalent-circuit reference, with a power NRMSE of $0.64\%$ and a cumulative-energy discrepancy below $0.7\%$. % In a $150$-s, $640$-m mission containing three disturbance regions, the selected trajectory reduces electrical energy consumption by $7.46\%$ and position-tracking RMSE by approximately $72\%$ relative to the disturbance-aware fixed-reference baseline. % Planner ablations show that battery-dependent terms are nonbinding at nominal SOC but alter the selected trajectory under a depleted-battery stress condition. % Execution with multiple feedback controllers further demonstrates that controller selection changes the tradeoff among tracking accuracy, energy consumption, and actuator utilization. % The results demonstrate the benefit of accounting for predicted closed-loop energetic and battery–actuator consequences during trajectory selection.
Read the full abstract
Operator Algebras
A Nica-amenable submonoid of a group which fails to embed in an amenable group
We construct a weakly quasilattice-ordered submonoid of a group whose full semigroup $\mathrm{C}^*$-algebra is nuclear, while the monoid does not embed into any amenable group. Hence, Nica amenability, as well as the nuclearity of its semigroup C*-algebra, do not characterize embeddability into an amenable group for group-embeddable monoids.
Read the full abstract
Functional Analysis
One-dimensional Dirichlet forms with prescribed Hölder regularity
We study a class of strongly local, regular Dirichlet forms on the standard unit interval. The aim of our work is to record some Hölder regularity properties that have not been noted in the prior literature. In particular, as our main result, we show that for every $\delta \in (0,1]$ there exists a metric measure space $(X,d,\mu)$ equipped with a strongly local, regular Dirichlet form $(\mathcal{E},\mathcal{F})$ on $L^2(\mu)$ with the property that $\delta$ is the supremum of $\alpha \in (0,1]$ for which the domain $\mathcal{F}$ of the Dirichlet form contains a non-constant $\alpha$-Hölder continuous function. To the best of our knowledge, such examples were previously known only for $\delta = 1$. In our construction, the value $\delta$ is characterized by the upper Hausdorff dimension of a certain Radon measure that is used to define $(\mathcal{E},\mathcal{F})$.
Read the full abstract
Fluid Dynamics
Transferable Low-Dimensional Representations of Aircraft Surface Fields
Analyzing flow fields on aerodynamic surfaces is critical to designing next-generation aircraft. Raw computational representations are high-dimensional and costly for complex three-dimensional bodies, while conventional low-dimensional representations apply only to the systems from which they derive. We introduce an approach that learns fluid flow representations from simple two-dimensional geometries and transfers them to complex real-world three-dimensional aircraft. Comparing the proposed Least Volume autoencoder (LVAE) to proper orthogonal decomposition (POD), we show both yield compact 28-41 dimensional representations of two-dimensional flow fields, with the nonlinear LVAE producing more accurate in-domain reconstructions at matched dimensionality. These models transfer zero-shot to three-dimensional systems, and counterintuitively the linear POD transfers more accurately than LVAE. Applied to extruded wings, POD-reconstructed lift and drag remain within 0.1% and 0.7% of true values, while transfer to complex blended wing body aircraft preserves lift and drag to within 0.3% and 0.7% without any three-dimensional training data. We further show that three-dimensional flow patterns missed by the pretrained model can be isolated to train a disentangled 3D latent space via a dual encoder-decoder transfer learning strategy, performing accurately in previously inaccessible data-scarce regimes. Using only five blended wing training cases, mean squared reconstruction error drops by 5x relative to the 2D pretrained models and 70x relative to models trained from scratch. These results establish that transfer learning from readily available two-dimensional datasets unlocks compact, interpretable representations of complex three-dimensional aircraft surface flows, enabling design insights in data-starved early phases where conventional approaches require hundreds to thousands of simulations.
Read the full abstract
Instrumentation and Detectors
Agentic TCAD Calibration Workflow for Oxide Semiconductor Transistors
Experimental TCAD calibration is essential for predictive technology modeling of emerging oxide semiconductor transistors. However, it remains time-consuming and expert dependent because of model ambiguity. Multiple physical models and parameter sets can reproduce the same measured transfer characteristics, while local fitting alone cannot uniquely identify the underlying device physics. We present the first demonstration of an agentic TCAD calibration workflow for a fabricated bottom-gate In–W–O (BG-IWO) transistor. Starting from the measured transfer curve and device information, the workflow uses measurement–TCAD residuals and local sensitivity tests to select bounded parameter corrections or evaluate additional physical models, and accept only updates that improve device metrics. The LLM agent orchestrates the workflow, while Sentaurus governs the device physics. For the 2%-W reference device, five agent-suggested updates yield a fixed calibrated model, reducing the multi-metric device objective $J$ by 14.3$\times$. Maximum $V_{\mathrm{th}}$/$I_{\mathrm{on}}$ errors are 36.1~mV/0.022 decade for varying-drain-bias tests and 46.2~mV/0.062 decade for varying-channel-length tests, demonstrating model transferability across bias and geometry rather than a local parameter fit. W-composition tests provide process-sensitive insight. This agentic workflow provides a faster route to model development for emerging device technologies.
Read the full abstract
Data Structures and Algorithms
A Tight $\widetilde \Omega (\sqrt{m})$ Information-Theoretic Lower Bound for Randomized Online Set Cover
Online set cover is a fundamental problem in online algorithms, admitting a deterministic $O(\log m\log n)$-competitive algorithm, where $m$ is the number of sets and $n$ is the number of elements. This is essentially tight for deterministic algorithms as well as for polynomial-time randomized algorithms assuming $\mathrm{NP}\not\subseteq\mathrm{BPP}$. However, the best lower bound known for information-theoretic (computationally unlimited) randomized algorithms against an oblivious adversary is only $\Omega(\log m)$, whereas the upper bound in terms of $m$ is $O(\sqrt m\log m)=\widetilde O(\sqrt m)$. We prove an $\Omega(\sqrt m)$ lower bound for information-theoretic randomized unweighted online set cover, showing that even with unbounded computational power, randomization cannot achieve an $O(\log m)$-competitive ratio. Specifically, our lower bound rules out $O(\log m\cdot\log^{1/2-\varepsilon} n)$-competitive algorithms for every constant $\varepsilon>0$. Our techniques also prove an $\Omega(m^{1/3})$ lower bound in the random-order model, and show that every algorithm with $poly(m)$ memory has competitive ratio $\Omega(m/\log m)$, even with unlimited computation between requests.
Read the full abstract
High Energy Physics (Phenomenology)
Radiative corrections to weak interaction processes
The search for physics beyond the Standard Model in low-energy weak interaction processes requires a precise knowledge of the Standard Model background at tree- and loop-level. In many such cases, radiative corrections represent one of the major sources of theory uncertainty due to the non-perturbative structures of nucleon or nuclei. In this review, I discuss several modern strategies based on dispersion relation, lattice gauge theory and nuclear many-body calculations to pin down the hadronic and nuclear uncertainties in the radiative corrections to low-energy weak interaction processes such as beta decays and parity-violating electron-nucleus scattering.
Read the full abstract
Computer Vision
Physics as the label for measuring and correcting materials reasoning in multimodal models
Vision-language and language models increasingly interpret materials data, yet benchmarks report that they hallucinate invalid properties and violate physical law. Evaluation matches final answers to scarce human labels, while discovery agents verify final proposals or density functional theory (DFT) execution. Neither measures the physical consistency of a model's reasoning chain. Materials data carries its own physics, making a large class of materials reasoning verifiable without annotation. We introduce MatPCR, a label-free benchmark whose programmatic oracles check diffraction geometry through Bragg's law, scale bars, spectral peaks, and Materials Project-grounded checks of near-hull stability, computed band-gap class, and net magnetization. We define the Physical-Consistency Rate over image and structure inputs; introduce Constraint-Grounded Self-Verification, an agentic loop whose gain survives self-refinement and equal-compute re-prompting controls; release an open verifier useful in distribution but near chance on all six held-out constraint types; and derive an exact identity for how oracle error displaces the reported rate.
Read the full abstract
Analysis of PDEs
Optimal regularity for vectorial, higher order and non-minimizing Bernoulli problems
We prove the Lipschitz regularity of solutions for a wide class of generalized Bernoulli free boundary problems, in vectorial, higher order, and non-minimizing settings. Our method does not rely on notions of viscosity solutions or comparison methods, which allows us to reach the optimal regularity for Bernoulli-type problems associated to elliptic operators which do not satisfy any maximum principle, namely the elasticity, biharmonic and Stokes equation. With a similar method we obtain the optimal Lipschitz regularity for stationary, non-minimizing solutions of the standard Bernoulli problem in two dimensions.
Read the full abstract
Machine Learning
Explanations-Driven Active Feature Acquisition for Algorithmic Recourse
Algorithmic recourse methods typically assume that a predictive model has access to all features of an individual. In practice, decisions are often made with partial information, because features are costly to acquire. Active feature acquisition addresses cost-constrained prediction, but existing methods are explanation-agnostic: prior work provides explanations only after acquiring additional features, rather than using explanations to drive acquisition. This work flips that and treats algorithmic recourse and feature acquisition jointly. We use Markov Blanket theory to unify counterfactual, semifactual, and alterfactual explanations and to characterize how available recourse grows as features are acquired. Building on this framework, we propose an Explanation-Driven Feature Acquisition (EDFA) method that selects features by explanatory value per unit cost. The framework is further extended with distribution-free validity guarantees for recourse issued from partial information, which signal trustworthy, lower-cost recourse, along with a lower bound on the calibration data required to certify them. Experiments on 7 publicly available datasets with neural network-based predictive models show that EDFA acquires substantially fewer features than state-of-the-art AFA baselines while maintaining comparable accuracy and yielding more decision-relevant, actionable recourse. The implementation is available on GitHub.
Read the full abstract
Numerical Analysis
Global Sensitivity Analysis of Spatial Sets: Finite-Element-Based Estimation and the Role of Observation Windows
In this work we consider numerical models with random input parameters, where the model output is a spatially distributed random field. We carry out a statistical sensitivity analysis of spatial sets which arise for instance when the model output exceeds a critical threshold. We consider two approaches: (i) a kernel-based sensitivity analysis working with the Hilbert–Schmidt Independence Criterion, and (ii) a function-valued sensitivity analysis working with generalized Sobol' indices, where the model output is the indicator function of the spatial set of interest. We develop efficient estimators for the sensitivity indices, especially for finite-element-based numerical models, where we approximate volume integrals in the sensitivity measures by finite element quadrature, thereby avoiding Monte Carlo sampling over the spatial domain. This improves the state-of-the-art for the kernel-based indices and makes these methods practically accessible for expensive numerical models. For the generalized Sobol' indices we utilize the same finite element quadrature for efficient computation. We present numerical experiments for a hydrogen combustion process, modeled by a coupled system of convection-diffusion-reaction equations in a two-dimensional spatial domain, and ask whether the temperature remains below a critical value in selected regions of the combustion domain. Our results show that in this example the kernel-based and the generalized Sobol' indices give qualitatively similar input importance rankings. Moreover, the ranking depends on the chosen observation window and can flip between different windows. The algorithms for implementing the proposed methods are provided in the supplementary materials and in an open source code repository.