Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Thursday 27 August

Atmospheric and Oceanic Physics

A Moisture-Vorticity Theory for the Boreal Summer Quasi-Biweekly Oscillation

We develop a moisture vorticity theory for the boreal summer quasi-biweekly oscillation (QBWO) in the tropics and analyze it with the aid of GPT-5.5. The model is formulated on a weak-temperature-gradient slow manifold, in which moisture anomalies diagnose the divergent circulation while the rotational circulation evolves through Rossby wave dynamics and vortex stretching. The key coupling is controlled by eddy advection of the background moisture gradient, with the projection $(\mathbf{k}\cdot\nabla\bar q)$ modifying propagation and the cross-gradient factor $(\mathbf{k}\times\nabla\bar q)_z$ controlling moisture extraction and growth. In the weak-coupling regime, which is relevant for the real-world situation, the QBWO is a Doppler-shifted Rossby mode whose growth or decay is determined by phase-coherent moisture extraction and subsequent vortex stretching; moisture damping weakens this feedback but does not introduce a sharp threshold in the minimal linear model. In terms of subtropical geographical locations, this renders the QBWO unstable over the Bay of Bengal with an intraseasonal growth rate and co-located vorticity and moisture anomalies, and it decays over relatively drier regions such as Central and West Africa with a quadrature relation between vorticity and moisture anomalies. The equations also admit a strong-coupling regime where the system approaches a moist-vortex limit. The theory interprets the QBWO as a Rossby-moisture-vorticity instability whose regional behavior depends on background moisture-gradient geometry, coupling strength, damping, and mean-flow advection.
Read the full abstract

Statistical Mechanics

Bound state of a He-3 atom at free He-4 surfaces

Quantum Monte Carlo simulations confirm the existence of a bound state of a single He-3 atom at a free superfluid He-4 surface in three dimensions, localized within a ~10-A thick low-density He-4 surface layer, with a binding energy of approximately 5 K with respect to vacuum. As the temperature is raised above ~ 1 K the He-3 atom leaves the surface to dissolve into the superfluid. The situation is entirely different in two dimensions, as the He-3 atom is excluded from the superfluid and no surface bound state exists. Results are also presented for the a He-3 atom binding to nanoscale size He-4 clusters adsorbed on weak substrates, a physical system that may allow for the observation of some of the physics predicted for extended surfaces. It is shown that a He-3 bound state localized at the perimeter of sufficiently small (a few tens of atoms) clusters exists not just on Cs, as previously reported, but on all alkali substrates.
Read the full abstract

Information Retrieval

A Versioned Unified Graph Index for Dynamic Timestamp-Aware Nearest Neighbor Search

We present TiGER (Time-Integrated Graph for Efficient Retrieval), a novel approach for performing fast time-aware approximate nearest neighbor searches on dynamic vector datasets with flexibility over any possible time range. Our proposed algorithm builds and maintains a unified graph for all vectors by leveraging an index structure based on integrated versioned connectivity, allowing arbitrary time intervals to be queried directly on the unified graph without having to traverse invalid vectors. This forgoes the need for post-search filtering or merging, or separate graphs for each possible composite range. Empirical evaluations show that our method attains up to a 5x improvement in queries per second (QPS) without compromising accuracy over baselines based on filtering or per-time-segment sub-graphs. We believe that this method will enable efficient temporal analysis across evolving datasets in real-time recommendation systems, log analysis, and any scenario requiring fast similarity search over dynamic, time-segmented data.
Read the full abstract

Machine Learning

Unsupervised Continual Learning with Growing Self-Organizing Maps and Synthetic Replay

This work presents a generative continual learning framework based on growing self-organizing maps (GSOMs) that are augmented with learned distributional statistics as well as encoder-decoder models for class-incremental learning. The proposed approach enables exemplar-free replay using distributional statistical memory, which eliminates the need to store raw data. Each GSOM unit maintains its own mean, variance, and covariance estimates, which are subsequently used to generate synthetic samples for replay; in encoder-decoder configurations, these samples are then decoded back into the input space (via ancestral sampling) for subsequent training. Our method is fully unsupervised, as it does not rely on explicit task boundaries or class labels during training. Results across multiple benchmarks show that the proposed approach achieves performance competitive even with supervised state-of-the-art memory-based methods while consistently outperforming memory-free approaches. In several settings, our framework matches or exceeds existing baselines, particularly in challenging single-class incremental scenarios. We also provide baseline results for single-class incremental TinyImageNet and MiniImageNet, offering a useful reference for future work. This work highlights the effectiveness of an unsupervised, adaptive, topology-driven neural form of statistical replay as a scalable, flexible approach to continual learning.
Read the full abstract

Computation and Language

Knowing Before Answering: Decoding Language Models for Reliable RAG

In Retrieval-Augmented Generation (RAG), retrieval may provide insufficient or conflicting information needed to answer a question. The system should not only know when to answer but also be able to identify cases in which the documents provided in RAG are insufficient or contain conflicting information. This can be framed as a three-way classification problem, where we use the model's internal signals to determine whether the provided information in the input can be classified as sufficient, insufficient, or conflicting. We create a controlled benchmark dataset that replicates a RAG setup with fictitious information and labels each instance as answerable, insufficient, or conflicting. We use hidden activations and attention-derived features as inputs to train a lightweight linear model to distinguish among the three classes. Across 16 language models spanning different architectures and a range of model sizes, our feature-based router consistently outperforms prompting-based baselines and the performance of specialised RAG-models. We further conduct analyses into the information dynamics of the models. We show that the most informative signals for the classification are available in the middle layers, with hidden activation states being more effective than attention values or the MLP-feature outputs in most of the tested models. Overall, our results suggest that language models internally encode whether retrieved evidence is sufficient to support answering, and that this signal can be decoded reliably for RAG triage.
Read the full abstract

All authors Syed Mahbubul Huq, Christopher Child, Tillman Weyde, Pranava Madhyastha

Representation Theory

Acyclic and totally acyclic objects in the $Q$-shaped derived category

This paper concerns homological algebra based on $Q$-shaped diagrams, where $Q$ belongs to a certain class of small categories. We will show that the Gorenstein property of noetherian commutative rings is characterised by the condition that acyclicity coincides with total acyclicity for $Q$-shaped diagrams of suitable classes of modules. Many special cases occur as corollaries, for instance $N$-complexes. This generalises a classic result by Iyengar and Krause to the programme of $Q$-shaped derived categories, which builds on an insight of Iyama and Minamoto. We prove our result using an adjoint triple of functors relating $Q$-shaped diagrams to chain complexes. One of the functors was introduced by Jasso, and the whole triple generalises the compression, cocompression, and expansion functors for differential modules introduced by Avramov, Buchweitz, and Iyengar and by Nkansah. We consider the adjoint triple to be the main contribution of this paper.
Read the full abstract

Systems and Control

Horizon-Dependent Tube MPC for Elliptical-Orbit Rendezvous Under Mass Uncertainty

A spacecraft closing on a target from three hundred kilometres to contact flies one guidance law across five orders of magnitude of range, and a controller that is provably safe at close range can lose that guarantee completely at long range while continuing to fly as though nothing were wrong. This paper derives the range at which the guarantee lapses and uses it as a design rule. The bound compares the prediction model's own linearisation error against the disturbance set the controller was built to reject, and needs only the sampling period, the orbit and that disturbance bound, so it can be evaluated before any simulation. On a Mars Sample Return approach it disqualifies the homing phase, where most of the propellant is spent, and clears the other two. Re-posing the disqualified phase in relative orbital elements restores the guarantee; re-posing a phase the rule already clears, in a frame two orders of magnitude more accurate, changes propellant by under a tenth of one per cent, and it is that second prediction that makes the rule falsifiable rather than descriptive. The constraint tightening also ties the prediction horizon to feasibility, so the horizon search limit becomes a mission parameter rather than a solver setting. Against a reimplementation of a published benchmark that reproduces its propellant to within one per cent, over five hundred dispersed Monte Carlo transfers per case on matched seeds, the controller saves 29% of the propellant on a circular target orbit and 40% on an eccentric one, docking inside the 0.20 m capture requirement on essentially every draw at a median miss near 5 cm. Two results run the other way: the saving is bought with time of flight and computation, and it comes from what the guarantee demanded of the terminal condition rather than from better disturbance rejection. Recursive feasibility and asymptotic stability are not claimed.
Read the full abstract

2608.27659 · 27 Aug · 19 pages, 12 figures, 8 tables. Accepted for presentation at the 77th International Astronautical Congress (IAC 2026), Antalya, Turkiye, 5-9 October 2026; paper IAC-26,C1,4,9,x108305. Accepted version (authors' preprint), not the version of record. Typeset in a plain article class rather than the IAF conference template

Computation and Language

When Tokenizers Fail: Byte-Level Chunking for Zero-Shot Transfer to Low-Resource Languages

Subword tokenization hinders low-resource language processing by imposing frequency patterns from dominant languages onto script-sharing variants. Byte-level models bypass this issue by processing raw UTF-8 characters, yet they create a granularity mismatch for word-level tasks in non-Latin scripts. Hierarchical byte-level architectures address this mismatch by grouping bytes into word-aligned chunks. However, these architectures require massive training data and suffer from representational misalignment when paired with frozen subword-based language models. In this paper, we propose an adapted hierarchical network framework that bridges this modality gap without extensive training. Our method initializes byte embeddings directly from the subword representations of a frozen base model. We apply a chunk alignment loss to project dynamically grouped byte chunks toward precomputed subword targets, and interleave lightweight part-of-speech (POS) supervision to guide boundary detection. Experiments across six languages demonstrate that our tokenizer-free approach improves performance for word-level morphological tasks, yielding up to a 13.3% improvement on POS tagging.
Read the full abstract

Probability

Stein Kernels and Normal Approximation for Log-Concave Bilinear Forms

Jiang, Lee, and Vempala conjectured that if $X,Y\in\mathbb{R}^n$ are independent isotropic log-concave random vectors, then $W_2(L(\langle X,Y\rangle),N(0,n))$ is bounded by a universal constant. Subject to Theorems 1.2 and 2.5 of arXiv:2607.24164v1, we prove this conjecture and a rectangular bilinear-form extension. For independent isotropic log-concave $X\in\mathbb{R}^m$, $Y\in\mathbb{R}^n$, and nonzero $B\in\mathbb{R}^{m\times n}$, put \[ r_4(B)=\frac{(\operatorname{Tr}(B^\top B))^2} {\operatorname{Tr}((B^\top B)^2)}. \] We construct a nonnegative scalar Stein kernel for $X^\top B Y/\|B\|_F$ whose squared $L^2$ discrepancy is at most $20/r_4(B)$, and consequently obtain the same bound for squared $2$-Wasserstein distance to $N(0,1)$. The proof develops an exact covariance identity and deficit decomposition for trace observables of moment-map Stein kernels, together with a stability theorem for positive Stein kernels under log-concave approximation. Taking $B=I_n$ yields \[ W_2^2\left(L\left(\frac{\langle X,Y\rangle}{\sqrt{n}}\right),N(0,1)\right)\leq\frac{20}{n}, \] which is the Jiang–Lee–Vempala conjecture.
Read the full abstract

Statistical Mechanics

Adaptive workforce exploration in complex productivity landscapes

Specialization and task allocation enhance efficiency and innovation across diverse systems, from biological organisms to socioeconomic institutions. The evolution of task distribution and its influence on organizational productivity encapsulate the dynamics between task dependencies and adaptive strategies. We explore the organizational division of labor, inspired by the NK model of rugged landscapes, which is widely applied in evolutionary biology, and incorporate interdependencies among the attributes of technical experts within an organization. Our model considers two types of employees characterized by their task allocation strategies: specialists, who are permanently assigned to a single task, and generalists, who stochastically select a task at each time step. We investigate how the ruggedness of the productivity landscape, shaped by task interdependency, affects the organization's capacity to optimize labor division and meet market demands. Using group selection algorithms, we reveal the emergence of nonlinear adaptive dynamics, providing insights into how companies can adapt their strategies to meet market demands and foster innovation.
Read the full abstract

All authors Mateus F. B. Granha, Igor V. G. de Oliveira, André L. M. Vilela, Chao Wang, Paulo R. A. Campos

Performance

Accelerating Data Preprocessing for Efficient Vision Model Inference on Jetson Edge Device

Data preprocessing is a crucial part of deep learning workflows on edge devices. However, decoding data saved in JPEG format is very compute-intensive and occupies a major portion of the preprocessing pipeline. Therefore, increasing the decoding speed is vital for improving overall throughput, especially for inputs with large image sizes, which are often subject to preprocessing bottlenecks. On the other hand, edge devices are equipped with specialized hardware units to accelerate media processing and image decoding. For instance, the NVIDIA Jetson platform possesses a dedicated NVJPEG unit. These units can be used to enhance the performance of the preprocessing pipeline. This paper introduces the utilization of such specific hardware acceleration units for offloading decoding tasks. By combining this with a multi-instance approach, it allows for the parallelization of all compute resources including CPU, NVJPEG, GPU, and DLA in Jetson devices. In this work, we compare various potential pipeline designs. On ResNet18, ResNet50, and ResNet152, three models with different sizes, we evaluate the impact of batch sizes and image sizes, as well as the characteristics of GPU/DLA inference. Finally, a fine-tuning experiment for multi-instance design has been conducted. The multi-instance design with a specific hardware decoding unit involved offers up to 30.02% speedup for large image sizes, compared with the most optimized design without it. Based on these findings, we demonstrate the benefits of using the NVJPEG unit in deep learning workflows and provide guidelines for tuning and optimizing edge inference workflows.
Read the full abstract

All authors Tian Chen, Nawras Alnaasan, Jinghan Yao, Aamir Shafi, Hari Subramoni, Dhabaleswar K. Panda

Systems and Control

Exact Decomposition of Value Functions for Two-Player Games in Hamilton-Jacobi Reachability

Hamilton-Jacobi reachability (HJR) is an important framework in safe control theory. HJR provides theoretical tools and numerical methods to obtain value-functions for tasks involving target-reaching and obstacle-avoidance. A recent work proposed an algebraic framework to scale to complex, composite tasks via decomposing the value functions of the composite tasks into value functions for the fundamental tasks traditionally studied in HJR, all in the one-player setting. Many of these decomposition results, however, do not directly translate to the two-player setting. In this technical note, we nevertheless show that one of the previous work's key results for analyzing various tasks involving reaching multiple targets while obeying constraints still holds in the two-player setting, so long as a critical monotonicity assumption is satisfied. In particular, we detail the analogous result and its proof (which structurally differs from the one-player case), we show via a counter-example what can go wrong if this monotonicity assumption is not satisfied, and we show how the analysis of a variety of tasks can be performed using this result. Such tasks include sequential and any-order multi-target-reaching tasks under constraints. We note that, whereas the prior work considered discrete-time, infinite-horizon tasks, which are more standard in reinforcement learning, we here consider continuous-time, finite-horizon tasks, which are more standard in HJR.
Read the full abstract

Game Theory

Condorcet-Winning Sets and Peer Selection in Planar Metric Elections

In ranked-choice voting, a Condorcet-winning set is a group of candidates for which no outside candidate is preferred to every member of the group by a majority of voters. We study Condorcet-winning sets in planar metric elections, where voters rank candidates according to their distance under a given norm. We formulate general metric elections, peer selection, and the one-round Voronoi game as instances of a two-player Stackelberg game and place these problems in a common hierarchy. We also introduce a new variant, which we call strong peer selection. Our main result concerns peer selection under the $\ell_1$ and $\ell_\infty$ norms. We prove that every planar instance admits a Condorcet-winning set of size at most three, even under strong peer selection. This follows from a new result for strong rectangular $\varepsilon$-nets. We show that, for every set of points in the plane, one can choose at most three input points that intersect every axis-parallel rectangle containing more than half of the points, improving the previous threshold of $9 / 16$ due to Ashok et al. Under the $\ell_2$ norm, we prove that every planar metric election admits a Condorcet-winning set of size at most four, improving on the general bound of five due to Song et al. Finally, we give new norm-independent bounds for the one-round Voronoi game.
Read the full abstract

Algebraic Geometry

Orbifold Degenerations of Hirzebruch Surfaces

We study orbifold degenerations of Hirzebruch surfaces. Our main theorem shows that every such degeneration $X$ arises as a partial smoothing of a toric surface. We then give a combinatorial description of the singularities that arise when $-K_X$ is not nef. This complements previous joint work with G. Urzúa, which treated the case in which $-K_X$ is ample. For Hirzebruch surfaces $\mathbb{F}_k$ with $k\geq 3$, we obtain an explicit description of all possible central fibers. For $k\leq 1$, we use the threefold minimal model program to reduce the problem to the case of central fibers whose anticanonical divisor is nef. The remaining surfaces are toric del Pezzo surfaces of degree $8$ with T-singularities. We classify these by studying the birational geometry arising from mutations of Fano polygons.
Read the full abstract

Machine Learning

More Data Cannot Break a Symmetry: Identifiability by Design

Unsupervised representational alignment recovers a stimulus-by-stimulus correspondence from geometry alone, but the automorphism group of the stimulus geometry bounds what any such alignment can identify, before data exist. The obvious diagnostic for this degeneracy, the cheapest non-identity relabelling, ranks two published designs in the wrong order, because dense sampling creates near-duplicates whose transposition is nearly free. We turn this known invariance (Demetci et al., 2024) into a design-time diagnostic and intervention. In colour, where candidate geometries have closed form, we show that the failure is structural: sixty-four times the restart budget leaves a symmetric design unmoved while an asymmetric set at the same N recovers every time. Discriminating representational models and recovering a correspondence are essentially uncorrelated objectives (r = -0.02 over 3,000 subsets). Choosing nine colours by this diagnostic alone, without consulting any learned representation, moves all 93 model representations away from the degenerate point and cuts catastrophic alignment failures from 75% to 2% with the models, the layers, N and the solver all held fixed. The same risk arises wherever a regular design meets its candidate geometry's isometry group, including evenly spaced orientations, tones, or motion directions, and the check costs one function call before data collection.
Read the full abstract

Quantum Physics

Topological Winding Readout of an Emergent Page-Wootters Clock

The Page–Wootters construction gives time a Hilbert space, representing it as an internal degree of freedom whose readings the rest of the system evolves with respect to. We ask whether such a clock degree of freedom can carry a topological invariant, and we propose a photonic architecture in which it does and in which the invariant can be measured. Signal–idler pairs from spontaneous four-wave mixing in a coupled microring array supply the clock–system partition, with the idler occupying a Rice–Mele band whose staggered coupling and detuning are cycled adiabatically around a gap-closing point. One cycle acts on that band as a rigid translation by \(C\) unit cells, times a geometric phase periodic in the crystal momentum, times a dynamical phase, an identity exact in the adiabatic limit and independent of the state on which it acts. The readout targets the winding of that geometric phase across the Brillouin zone. Reversing the traversal of the pump loop cancels the dynamical phase and isolates twice the geometric phase in a two-photon coincidence fringe, while energy anticorrelation lets a filter on the signal scan the clock momentum without touching the clock and supplies the phase reference relationally, in place of an external optical reference. The estimate is protected on two independent levels, by the gap against smooth deformation and by the digital character of the unwrapping against noise below a threshold. A parameter budget anchored to thin-film lithium niobate places the requirements within reach at a conservative operating point.
Read the full abstract

Systems and Control

From Generation to Discovery: Diffusion Mutation Kernels for Circuit and Physical Design

Generation and discovery are different problems. A generative model trained on valid artifacts reproduces a distribution, whereas discovery must produce artifacts that lie outside the observed corpus, satisfy hard structural constraints, and improve on established designs under evaluation that the model cannot influence. We introduce a diffusion-based discovery framework. Unlike conventional generative models that sample from learned distributions, it learns transition operators that transform existing artifacts into new candidates. Controlled partial re-noising followed by denoising defines a diffusion mutation kernel, a learned transition distribution that preserves the structural regularities of feasible designs while moving between regions of the design space. The learned model supplies feasibility structure only, and all correctness and performance judgments remain with external engineering tools. Intermediate diffusion trajectories are additionally monitored under a conformal risk budget so that unpromising candidates are discarded before expensive evaluation. We evaluate the framework on three electronic design spaces, an environment that supplies rigorous non-differentiable evaluators in the form of simulation, formal equivalence checking, and industrial physical implementation. The framework discovers 32-bit prefix adders that are formally verified equivalent to addition over all 2^64 input pairs and reduce delay by 17% and area by 18% relative to Kogge-Stone under a placed-and-timed flow; seven independently re-simulated amplifier topologies absent from the training corpus, spanning gains of 21.9-66.1 dB and bandwidths of 72.9 kHz-207 MHz; and macro placements on held-out netlists reaching 0.68x wirelength of an industrial placer.
Read the full abstract

All authors Dinithi Jayasuriya, Aravind Saravanan, Nilesh Ahuja, Amanda Rios, Amit Trivedi

Audio and Speech Processing

Alias-Free Oscillator Synchronization via Additive Synthesis

Oscillator synchronization is a widely used sound-synthesis technique, but straightforward digital implementations suffer from aliasing artifacts. This paper presents an alias-free method for digital emulation of oscillator synchronization of arbitrary periodic waveforms based on additive synthesis. Starting from a finite set of Fourier-series coefficients representing a bandlimited free-running waveform, we derive linear spectral-resampling transforms that map these coefficients to those of the bandlimited synchronized waveform. Beyond conventional hard synchronization, the proposed approach also supports two additional soft-synchronization modes. To address the high computational complexity of the proposed method, we introduce HASY, a 6 mm^2 application-specific integrated circuit (ASIC) fabricated in 65 nm CMOS technology. HASY generates one 96 kHz, 24 bit alias-free synchronized waveform with up to 512 harmonics and computes the spectral-resampling transform within only five audio-sample periods.
Read the full abstract

All authors Jonas Roth, Domenic Keller, Oscar Castañeda, Christoph Studer

Numerical Analysis

Numerical analysis of data assimilation for slightly compressible flow

Continuous data assimilation improves flow predictions by continually nudging a model toward available observational data. For slightly compressible flow, a recent model addresses the limitations of velocity-only nudging by assimilating both velocity and pressure data and nudging both quantities into the incompressible Navier-Stokes equations [5]; continuous-in-time error estimates and preliminary experiments show that this joint nudging is effective and substantially reduces the model error relative to velocity-only nudging. Motivated by these results, we carry out the numerical analysis of the model and its finite element discretizations. We establish stability and error estimates for the semi-discrete scheme and for the fully discrete, linearized backward Euler scheme. The analysis shows an infinite predictability horizon: the effect of the initial error decays exponentially in time, and the model error is first order in the observation resolution H and of order $\mu_1^{-1/2}$ in the pressure nudging parameter $\mu_1$. Balancing these two error terms, we choose $\mu_1=\mathcal{O}(H^{-2})$, which yields the optimal convergence rate. Numerical experiments confirm the predicted rates.
Read the full abstract

Artificial Intelligence

If Agents Were Angels, No Governance Would Be Necessary: Out-of-Band Policy Enforcement at a Trusted Tool Boundary

Give an agent a human's credential and it inherits the person's reach without the judgment that limits its use. It can sweep every reachable record into model context, where hidden instructions steer its next call, and every request stays credential-valid while the agent exceeds its job or absorbs a secret. Prompts are a brittle guardrail: one fallible reasoner interprets the task and enforces its limits. We present Out-of-Band Policy Enforcement (OBPE), a trusted boundary outside agent reasoning. It authorizes the typed operation and resource, narrows the query before the backend call, then filters records and fields or masks values in the response. Semantic gating can deny or hold an authorized call on argument values or external state. A data policy owner sets the maximum grant; agent policy can only narrow it. We prove, under stated conditions, that the policy plan is order-independent and agent policy cannot widen the ceiling. Field removal covers one execution; masking and history rules claim less. We release an HTTP proxy prototype simplified from our production system, with conformance tests tying its typed Cedar policy core to the model. Against Jira and ServiceNow mocks, our benchmark compares prompted agents with and without OBPE on four models, including 20 adaptive red-team tasks. A trace failure means protected data entered agent context, an exact value appeared in the answer, or a forbidden effect completed. In 3,621 trials it fell from 57.6% to 0.2%, a cluster-weighted reduction of 41.2 points [95% CI: 27.7, 54.9]; fulfillment fell from 79.1% to 60.9%, while paired safe-useful completion rose 21.8 points [9.5, 35.2]. Some answers reconstructed a value that never entered context or used filtered row counts as an oracle: shaping one execution is not noninterference. Write controls, durable approval, and temporal and aggregate policies lie outside this evaluation.
Read the full abstract

All authors Marc Millstone, Tyler Akidau, Johannes Brüderl, Marat Pekker

Materials Science

First-Principles DFT Study of Ferroelectric-to-Antiferroelectric Phase Transitions in LiTaO$_3$ under Electric Boundary Conditions

Ferroelectric and antiferroelectric phases of LiTaO$_3$ compete under different electric boundary conditions. First-principles density-functional calculations show that the high-symmetry reference structure supports two relevant unstable $\Gamma$ modes: a polar $A_{2u}$ mode at $181i$ cm$^{-1}$ that condenses into the ferroelectric (FE) phase, and an antipolar $A_{2g}$ mode at $103i$ cm$^{-1}$ that condenses into the antiferroelectric (AFE) phase. Under short-circuit conditions the FE phase is the global minimum, with a well depth of $\approx 144$ meV. Under open-circuit conditions the FE phase is destabilized by the unscreened depolarization field and the AFE phase becomes the ground state, with a well depth of $\approx 19$ meV. A weakly unstable longitudinal-optic mode at $48.3i$ cm$^{-1}$ yields a well of only $\approx 0.24$ meV and is thermodynamically irrelevant. Mapping the free energy versus electric displacement $D$ locates a second-order FE$\leftrightarrow$AFE transition at $D_c=0.051$ C/m$^2$, lower than the corresponding $0.07$ C/m$^2$ in LiNbO$_3$ and therefore more accessible experimentally.
Read the full abstract

Graphics

The Role of Mixed and Augmented Reality in Medical Visualization: Literature Review and A Context-Aware Taxonomy

The discovery and evolution of medical imaging technologies have enabled non-invasive visualization of internal anatomy that has be- come essential for supporting diagnosis, monitoring, and treatment. However, because medical imaging relies on complex physical processes and contrast mechanisms for image formation, imaging alone is not sufficient to enable humans to leverage the resulting in- formation fully. In addition, traditional methods to visualize the resulting information use two-dimensional displays to present three-dimensional anatomical structures. The introduction of Augmented and Mixed Reality (AR/MR) technologies offers an opportunity to provide valuable paradigms for medical imaging visualization, allowing users to observe, explore, and interact with anatomical infor- mation in more spatially intuitive ways. However, naive implementation without careful design considerations can lead to perceptual inconsistencies, potentially compromising utility and effectiveness. In this paper, we present a structured taxonomy of medical AR/MR visualization strategies aimed at providing clearer insight into how visualization design varies across clinical use cases. The taxonomy organizes techniques based on four core design components: image modality, data dimensionality, display technology, and clinical application. In addition, we introduce two critical dimensions that are often overlooked in the literature: visualization anchoring (the spatial relationship between virtual content and the physical world), and perceptual awareness (the use of visual cues to support spatial interpretation). Together, these components form a comprehensive taxonomy, offering a detailed framework for selecting appropriate visualization techniques in medical applications.
Read the full abstract

All authors Xinrui Zou, Mingxu Liu, Hongchao Shu, Ruixing Liang, Mathias Unberath, Alejandro Martin-Gomez

Materials Science

LDA-1/2 for Molecular Systems: A Real-Space Finite-Element Benchmark on the GW100 Set

The LDA-1/2 method provides an efficient correction to semilocal density functional theory for improving ionization energies and band gaps, yet its application to molecular systems has remained limited. In this work, we present an all-electron finite-element implementation of LDA-1/2 within the NESSIE electronic-structure framework and apply it to the GW100 molecular benchmark set with systematically controllable numerical accuracy. The self-energy correction is constructed explicitly from neutral and half-ionized calculations for each molecule, avoiding the use of precomputed atomic correction potentials. The real-space finite-element formulation enables systematic convergence with respect to the discretization and provides a controlled assessment of LDA-1/2 performance. For the GW100 set, the present implementation yields a mean absolute error of 0.472 eV and a root-mean-square error of 0.645 eV relative to CCSD(T) reference ionization energies, substantially improving upon conventional LDA and the previously reported LAPW implementation of LDA-1/2, while achieving accuracy comparable to G0W0@PBE. Convergence tests show that third-order finite elements are sufficient to reach or approach chemical accuracy relative to higher-order calculations for the representative systems considered. The resulting corrected Hamiltonian also improves several lower lying valence states relative to LDA, although the improvement becomes less systematic away from the HOMO. This work provides accurate LDA-1/2 benchmark data for molecular systems and establishes a rigorous finite-element foundation for future molecular GW calculations.
Read the full abstract

All authors Dongming Li, Niamh Matthews, Qingchuan Sang, Eric Polizzi

Distributed Computing

Characterizing the I/O Behavior of HPC Applications through Modeling and Simulation

Parallel applications process large amounts of data, leading to intensive parallel I/O operations. These operations can exhibit different levels of complexity, including, among others, multiple I/O access patterns, data staging, and contention risks. Therefore, in order to exploit high-performance computing (HPC) systems efficiently and optimize the I/O performance, it is crucial to consider the I/O behaviour of the HPC applications. In this work, we have developed a framework that reproduces the I/O access pattern of real applications in a simulated environment provided by ElastiSim, a batch-system simulator for rigid, malleable, and evolving workloads. The simulated applications are generated based on I/O traces captured from real applications provided by the HPC Input/Output (HPCIO) analysis repository. The HPCIO analysis database includes traces combined with information about real applications' performance across different parallel I/O libraries and layers of the I/O stack. We have conducted detailed case studies of real-world applications' traces to demonstrate how the proposed modeling framework can provide insights into the performance characteristics of I/O applications, including the I/O congestion analysis based on the application's I/O access pattern.
Read the full abstract

All authors Njoud O. Almaaitah, David E. Singh, Taylan Özden, Jesus Carretero, Raffaele Montella

Probability

Hard-Edge Determinant Fields and Second-Moment Universality for Random Matrix Ratios

We study the microscopic spectrum at the origin of ratios of independent complex Girko matrices. Under bounded-density and finite-moment assumptions, together with circular second-moment matching, we prove compact-uniform convergence of the normalized determinants to a random entire function constructed from the complex hard edge and an independent Ginibre array. The zero divisor of this limiting determinant field has the law of the infinite complex Ginibre process. Consequently, the first finitely many smallest and largest eigenvalue moduli, the inner and outer spectral radii, and eigenvalue counts in fixed bounded sets have universal limits depending only on the second moments. This answers the second-moment question posed by Chafaï, García-Zelada, and Xu for the spectral radii. We also obtain a multivariate determinant field for finitely many perturbation directions and prove the uniform hard-edge comparison needed to extend the conclusions to triangular arrays of atom laws.
Read the full abstract

High Energy Physics (Theory)

A geometric resolution limit from vacuum entanglement: Topological Structure and Particle-Wave Asymmetry

We establish that vacuum entanglement entropy, regulated by weak spacetime curvature, imposes a fundamental lower bound on radial resolution for quantum excitations. From the area law, weak gravity introduces a natural UV regulator via the perturbative Green's function. Geometric projection yields a minimal radial scale $\Delta r_{\min} \propto r_s^2/R$, where $r_s$ is the Schwarzschild radius and $R$ the boundary radius. Consistency with the Compton wavelength defines a global mass scale $m_{\text{geo}} \equiv \hbar R/(c r_s^2)$. Particle masses satisfy $m = \alpha m_{\text{geo}}$, where $\alpha$ encodes vacuum structure. For Earth, $m_{\text{geo}} \approx 2.84 \times 10^{-32}$ kg. We determine $\alpha$ via spectral analysis of curvature-induced mode shifts, implemented in Python with $N=3000$ radial points and $n_{\text{modes}}=1000$. The calculation yields $\alpha(2) \approx 33$, matching the electron benchmark without adjustable parameters, ruling out exponential ansätze in favor of slow power-law growth $\alpha(l) \propto l^{1.27}$. Crucially, this resolution limit endows the quantum vacuum with the properties of a granular refractive medium. This elegantly explains a fundamental particle-wave asymmetry: massive excitations with $\lambda_C \ll \Delta r_{\min}$ propagate in the geometric optics limit, following macroscopic gradients as classical geodesics. Conversely, photons with $\lambda \ll \Delta r_{\min}$ interact directly with the medium's granularity, leading to phase decoherence and anomalous dispersion. This framework reframes mass as a probe of vacuum-imposed resolution limits, yielding distinct, falsifiable predictions for high-energy photon propagation.
Read the full abstract

Computational Engineering

Dimension Bridging for 3D RANS with Neural Network Accelerated Gaussian Functional Regression

In many computational science and engineering problems, repeatedly solving fully resolved physics-based models to design for a quantity of interest (QoI) can quickly become intractable, requiring the use of low-fidelity models to predict the same QoI but introduce errors where some features are neglected or are otherwise inaccurately resolved. We use Gaussian Functional Regression (GFR) to learn a correction to a 2D Reynolds-Averaged Navier-Stokes (RANS) model to predict the aerodynamic coefficients from a 3D RANS model. This model pair has a disparity in the governing physics from the reduced dimensionality, a previously unexplored application for GFR. Empirically, our results show that with a proper choice of low-dimensional (LD) model, the proposed kernel allows for the use of fewer high-dimensional (HD) evaluations to regress a response surface to the same level of accuracy as standard stationary kernels. Moreover, the new kernel provides more informative uncertainty quantification, which we show is advantageous when used to drive an adaptive sampling algorithm. Finally, we propose a novel neural network accelerated kernel, which we show offers predictions in good agreement while speeding up evaluations by millions of times in wall clock measurements, bringing the computational budget within the real-time regime.
Read the full abstract

All authors Wesley Lao, Thomas Scott, Tan Bui-Thanh, Paul Laiu, Matt Bement

Artificial Intelligence

Generative AI Expands the Intellectual Reach of Course Based Undergraduate Research Experiences (CUREs)

Course-based undergraduate research experiences (CUREs) broaden access to authentic scientific inquiry through responsive instructor support as research problems become increasingly complex. Generative artificial intelligence (GenAI) may extend this support by providing individualized assistance that can adapt as student needs change. However, how embedding GenAI within a CURE to provide support across the research process impacts student inquiry, collaboration, and scientific reasoning remains unresolved. Here we use longitudinal qualitative data collected across three semesters of a bioinformatics and genomics CURE to show that GenAI expanded the intellectual reach of the research experience in three distinct ways. First, personalized, on-demand scaffolding allowed students to move beyond the boundaries of instructor expertise and transform their own interests into researchable inquiry, with all teams developing distinct self-directed projects rather than selecting instructor-provided topics. Second, GenAI became part of the distributed cognitive system of research teams, helping novice researchers communicate and coordinate across differentiated expertise without eliminating specialization. Third, expanded capability did not replace the need for disciplinary judgment. Students increasingly validated, revised, or rejected AI-generated contributions, such that research independence emerged through retained intellectual responsibility. Together, these findings suggest that GenAI can extend the reach of CUREs by expanding what novice researchers can investigate, how they can collaborate, and the level of responsibility they can assume while preserving human judgment central to authentic scientific inquiry.
Read the full abstract

Instrumentation and Methods for Astrophysics

Toward a realistic test of black-hole movie correlations as a probe of extreme lensing

In an optically thin setting, gravitational lensing around a black hole creates multiple delayed images of any localized source, appearing at different positions on the observer's screen. Even if particular sources cannot be singled out, this effect may be revealed in a black-hole movie (time-dependent image) by examining the two-point spatiotemporal correlation function of intensity fluctuations in the movie. Recently, the correlation function derived from a movie obtained by ray tracing of a general-relativistic magnetohydrodynamic simulation demonstrated the plausibility of this idea, even when the movie was blurred to angular resolutions corresponding to next-generation terrestrial very-long-baseline interferometric arrays. In this work, we further develop this method and study how some possible corruptions of the movie, motivated by real observational limitations, affect the ability to identify the extreme-lensing signatures by correlations. The effects are compared for both the original and blurred movies. We discuss the implications of our analysis for upcoming observations of M87* and Sgr A*, the two main targets of the Event Horizon Telescope and its future extensions. Our case study suggests that the types of data corruption we have explored, in themselves, do not preclude an identification of extreme-lensing effects in correlation measurements. We use our results to roughly estimate that, most importantly, for a successful correlation measurement, M87* may need to be continuously monitored for $\gtrsim 2$ years, while Sgr A* may need to be measured at a cadence $\gtrsim 1$ frame per minute. Finally, we outline a new analysis method that reduces the data in the complete correlation function—a large dataset defined on a five-dimensional configuration space—to a two-dimensional histogram that could be useful for black-hole parameter inference.
Read the full abstract

Statistics Theory

Algebraic implicitization techniques in the graphical models program

Many aspects of daily life now rely on technology driven by advanced techniques for analyzing multivariate data. Graphical models provide the general framework within which much of these analyses take place. However, different data types require different graphical models, with each requiring its own basic mathematical theory to guide sound statistical inference. Developing this theory for a family of graphical models requires solutions to fundamental questions, where emerging mathematical approaches are utilizing what can collectively be called algebraic implicitization techniques. These notes provide an introduction to the basics of graphical models and the algebraic implicitization techniques now appearing in instances of the graphical models program.
Read the full abstract

2608.27636 · 27 Aug · This is a preprint of a chapter intended for publication in a Springer Lecture Notes in Mathematics series based on the lectures given at the 43rd Finnish Summer School on Probability and Statistics in Lammi, Finland. It surveys basic results on graphical models and algebraic techniques, with the intent of being broadly accessible