Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Wednesday 9 September

Machine Learning

Certifying Lower Bounds for Risk-Sensitive Reinforcement Learning under Adversarial State Perturbations

Reinforcement learning (RL) agents deployed in real-world environments are often vulnerable to adversarial perturbations in state observations, creating risks in safety-critical applications. Certification methods can improve robustness against adversarial perturbations by providing lower bounds on expected cumulative rewards. Existing certification methods, however, mainly focus on risk-neutral objectives. In this paper, we extend certification methods to risk-sensitive objectives by establishing lower bounds on the exponential utility of cumulative rewards under $l_{p}$-norm-bounded state adversarial perturbations ($1\leq p <\infty$). By introducing a $\phi$-divergence relaxation of the perturbation set, we formulate the risk-sensitive certification problem as a convex optimization and derive its dual to obtain a tractable approximation of the certified lower bound. We further propose an empirical method that improves certified lower bounds by selecting the training risk-aversion parameter $\beta$ independently of the risk level used during evaluation. Experiments on both OpenAI Gym environments and a machine replacement problem show that, compared to risk-neutral training, risk-averse training generally yields policies with higher certified lower bounds, particularly under larger perturbation budgets. Moreover, under both risk-neutral and risk-averse evaluation settings, increasing risk aversion during training leads to non-monotonic certification performance, where certified lower bounds initially improve but eventually decrease due to overly conservative policies.
Read the full abstract

Statistics Theory

The Elliptically Optimal Confidence Interval: A Bivariate Extension of Wilson's Score Method

Constructing a confidence interval for the difference between two independent binomial proportions involves a nuisance direction that is not identified by the estimand. The one-sample Wilson score interval inverts a scalar score test, but has no direct bivariate analogue isolating the difference: inverting the joint normal approximation yields an elliptical region in the unit square, whereas the estimand \(p_1-p_2\) is one-dimensional. We define the Elliptically Optimal (EO) confidence interval as the range of \(p_1-p_2\) over this region and solve the resulting optimization problem in closed form, obtaining explicit bounds in six mutually exclusive and exhaustive cases. The solution admits a compact characterization: the EO interval is the score interval obtained by maximizing over the nuisance variance rather than estimating it. It is therefore the shortest interval obtained by projecting the elliptical region, and inherits its coverage guarantee. We derive the exact coverage excess, \(2[\Phi(z\mathcal{R})-\Phi(z)]\), where \(\mathcal{R}\) is the ratio of the least-favourable to the true standard deviation. The excess vanishes on an explicit line through the parameter space, is bounded by \(\alpha\), and is invariant under proportional scaling of the sample sizes. Exact enumeration of the binomial coverage shows that the Wald interval, whose variance estimator is downward biased by a factor \(1-1/n\) under balanced allocation, falls below nominal coverage almost everywhere. The EO interval never under-covers under the normal approximation and always yields admissible, non-degenerate bounds. Its price is over-coverage when both proportions are extreme, which we quantify exactly.
Read the full abstract

Logic

Well-Defined but Not Predetermined Persistent Mathematical Objects, Embedded Observers, and the Provability of P = N P

We develop a foundational distinction between well-definedness and predetermination. A persistent mathematical or computational object may return a unique answer whenever a query is made and preserve every previously returned answer, while its answers to as-yet unqueried inputs are not represented by one completed, history-independent extension. We call such an object well-defined but non-predetermined. We next formulate an observer-based semantics. All observers inhabit one shared computational world, their interactions modify one common global state, and they have access to one realized history. Under axioms of shared history, historical irreversibility, persistence, and historical indistinguishability, embedded observers cannot establish from the realized history alone whether its compatible extension was predetermined or progressively formed. A persistently evolutionary polynomial time computable oracle supplies a concrete example and yields a deterministic–nondeterministic separation under an explicitly history-sensitive semantics. We then derive a conditional result concerning the provability of \(P=NP\). The conclusion is an observer-relative unprovability theorem, not an unconditional proof of classical \(P\neq NP\).
Read the full abstract

Machine Learning

Flow Duality and Source Geometry for Categorical Generation

Continuous and discrete flow matching are usually treated as separate constructions. This paper identifies a duality between them: projecting continuous convex-interpolant flows with one-hot targets through a position-wise argmax yields discrete convex-interpolant flows. The result requires source laws with appropriate coordinate symmetry and regularity, and it makes the continuous source distribution an explicit design choice for categorical generation. We derive the induced discrete interpolation behavior for Gaussian, bounded-uniform, and centered negative-exponential sources, showing that different source geometries lead to qualitatively different transition timing and vocabulary-size dependence. Small visual diagnostics and a short language-modeling pilot suggest that these source-design effects can also appear in learned transports and early generative quality.
Read the full abstract

Sound

Project Qualia: Recovering Experiential Music Structure from Session Co-occurrence Data

This report presents results from Project Qualia, an ongoing effort to determine whether experiential similarity between songs, a structure not captured by genre or metadata taxonomies, can be recovered from real listening behavior. We constructed a large-scale dataset of listening sessions, comprising 1.29 billion scrobbles collected from 9,396 users via the Last.fm API and reduced through a preprocessing pipeline to 531.6 million training scrobbles across 28.6 million sessions. On this corpus, we trained a skip-gram Word2Vec model (Song2Vec), treating each session as a sentence and each track as a token. As anticipated, the resulting embedding space was dominated by artist identity, a consequence of single-artist runs within sessions. To test for a subtler, artist-independent signal, we developed an artist-residual procedure: subtracting each artist's centroid from its tracks' embeddings and evaluating whether the remainder retained structure. Mean cross-artist cosine similarity fell from 0.2487 in raw embedding space to 0.0005 in residual space, yet 4,577 cross-artist track pairs retained cosine similarity $\ge 0.70$ in residual space, forming coherent genre- and era-based clusters, including trip-hop, 1990s grunge, 2020 mainstream pop, and cross-composer classical piano pairs at cosine similarity up to 0.95. These results confirm that the training data contains experiential structure independent of artist identity, establishing an empirical basis for an architecture designed to learn this experiential layer directly.
Read the full abstract

Hardware Architecture

REACH: Controller-Managed Long-Span ECC for HBM AI Inference

High-Bandwidth Memory (HBM) cost motivates stronger controller protection that can support a wider range of device error rates. Long-span error-correcting codes provide stronger protection at a comparable code rate, but a direct implementation couples small accesses to span-wide state and requires costly decoding at HBM bandwidth. Read-dominated LLM decode offers a favorable setting: sequential reads support span aggregation, while sparse writes limit parity-update traffic. This paper presents REACH, a controller microarchitecture that uses established inner codes to correct common errors and identify unresolved chunks, reserving a long outer code for known-erasure repair. Differential parity bounds write traffic, and a co-designed endpoint preserves 32\,B transactions without an extra data burst. Ramulator2 sustains 1.88\,TB/s of application traffic at the highest error stress, while separate full-interface sizing supports a 2.69\,TB/s application target using ASAP7-synthesized kernels. At this analytical target, REACH's nominal composition uses 55.8% less controller area and 57.7% less modeled power than the evaluated mean-work direct-long design, showing the benefit of reserving long-span recovery for exceptional requests.
Read the full abstract

All authors Rui Xie, Yunhua Fang, Asad Ul Haq, Linsen Ma, Sanchari Sen, Swagath Venkataramani, Liu Liu, Tong Zhang

Analysis of PDEs

Stability Framework for the Singularity of the Euler Equations on $\mathbb{R}^3$

In a recent numerical study, we found a high-precision singular profile for the Euler equations on the unbounded domain $\mathbb{R}^3$. The present manuscript complements that study by establishing in detail a preliminary framework for proving (nonlinear) stability of the approximate self-similar profile, reducing the analysis to a large but finite collection of explicit estimates and computable constants. Conditional on rigorous certification of the estimates and constants appearing in the argument, and on the candidate profile satisfying the required nonlinear stability conditions, the framework closes the stability proof and, crucially, allows the resulting stable rescaled profile to be reconstructed as an admissible solution in the original variables that becomes singular in finite physical time. With the overall stability and reconstruction mechanisms formulated, the remaining work within this approach is largely quantitative: determining whether the explicit constants and margins can be rigorously certified with sufficient positive margin and, where necessary, sharpening selected analytic estimates.
Read the full abstract

All authors Valentin Duruisseaux, Adarsh Ganeshram, Robert J. George, Anima Anandkumar

High Energy Physics (Theory)

Presymplectic BV-AKSZ and constrained DGCAs

The AKSZ construction encodes the Batalin-Vilkovisky formulation of a topological field theory in terms of finite-dimensional geometric data. There are at least two ways to extend this approach to nontopological gauge theories. The first, due to Costello, replaces the spacetime exterior algebra with a more general DGCA that is not freely generated. The second replaces the symplectic structure with a degenerate presymplectic structure, which may also be non-regular. In this work, we show that both approaches are special cases of a more general algebraic AKSZ construction, in which the underlying algebras are allowed to be constrained and the presymplectic structure may be degenerate and non-regular. Within this framework, we explicitly relate Costello's formulation of the Chalmers-Siegel model to the presymplectic formulation, the latter admitting a first-principles derivation. We also construct Costello-like formulations of higher-form analogues of the Chalmers-Siegel model and of self-dual higher-spin gauge theories of Yang-Mills type, obtaining in the latter case a remarkably concise description. In so doing we propose a simple algebraic construction for the corresponding source space DGCAs underlying these examples.
Read the full abstract

Image and Video Processing

Annotating anatomy and pathology in the National Lung Screening Trial computed tomography images

Large-scale public medical imaging datasets contribute critically to translational research. When accompanied by rich clinical and multi-omics data, they can stimulate exploratory research and enable secondary analyses. Expert annotations of such imaging collections can support the development of new image analysis tools. Continuous enrichment of images with image-derived data makes them more usable for researchers without expertise in image analysis or access to large-scale computational resources. The National Lung Screening Trial (NLST) released a rich longitudinal dataset that includes Computed Tomography (CT) images for over 26,000 patients. We introduce three Digital Imaging and Communications in Medicine (DICOM) formatted datasets, complementing NLST CT images, shared as analysis results in the National Cancer Institute Imaging Data Commons (IDC). Two of those (IDC NLSTSeg and IDC NLSTSybil) contain DICOM-harmonized annotations and extracted measurements (for 581 and 601 NLST patients, respectively) shared earlier using research formats (Sybil and NLSTseg). The third one (TotalSegmentator-CT-Segmentations) contains volumetric segmentations generated using TotalSegmentator and radiomics features for each segment for 26,194 NLST patients.
Read the full abstract

All authors Deepa Krishnaswamy, Vamsi Thiriveedhi, Suraj Pai, David Clunie, Igor Octaviano, Christopher P. Bridge, Steve Pieper, Ron Kikinis, Andrey Fedorov

Numerical Analysis

Quadrature by Matched Asymptotic Expansion (QBMAX): Accelerating Evaluation of Layer Potentials with Boundary Layers

Evaluating layer potentials with rapidly decaying kernels becomes computationally challenging in the presence of boundary layers, as occurs for Helmholtz layer potentials with large imaginary wavenumbers. We introduce Quadrature by Matched Asymptotic Expansion (QBMAX), a high-order method that extends the Quadrature by Expansion (QBX) framework by incorporating the kernel's asymptotic decay behavior directly into the Taylor expansion of the potential. Numerical results in both 2D and 3D show improvements of up to four digits over QBX for the tested large-parameter cases, while the methods can perform similarly for smaller parameters or more strongly curved geometries. A symbolic weighted operation-count model indicates comparable costs for forming the two expansion kernels. The Taylor expansions have the same formal order, while QBMAX reduces the truncation-error constants in the flat-boundary model and generally exhibits less convergence degradation in the reported experiments.
Read the full abstract

Computers and Society

Following the Preference, Missing the Optimum: Compliance Without Optimization in AI Housing Recommendation

Large language models are becoming the first point of contact for consumer search in domains where the stakes are material and the law is explicit. Existing audits show that models steer housing seekers by perceived identity, but none can say what a user loses when a recommender overlooks a suitable option, for want of an enumerated inventory to score omissions against. We audit AI housing recommendation against a verifiable ground truth. For each of 150 synthetic renter scenarios in New York City we build a pool of 120 real listings with known rent, bedrooms and GTFS-computed transit commute, compute the exact set satisfying the renter's stated constraints, and derive its Pareto frontier. The primary outcome assumes no utility function: a recommendation is strictly dominated if the same pool holds a listing cheaper, faster to commute from and no smaller in bedrooms. Across 9,945 calls to three models from two vendors, compliance is near-perfect (1.8% violation against a 66.6% random floor), yet 39.0% of recommendations are strictly dominated, and the dominating listing is a median 900 USD/month cheaper and 3.5 minutes closer. A within-scenario manipulation separates two capabilities usually conflated: changing one sentence moves median recommended rent by 646 USD/month in the correct direction, so preferences are honored, yet recommendations still sit 606 USD/month above the five cheapest qualifying listings on the same screen, and an unambiguous lexicographic instruction gives no improvement under equivalence testing against a pre-specified 50 USD/month bound. The gap widens with candidate-set size and replicates across OpenAI and Anthropic models to within 3 USD. We characterize the failure as compliance without optimization, propose dominance-rate instrumentation as a deployable diagnostic, and release all code, prompts and per-call results.
Read the full abstract

Computer Vision

Evaluation of Vision-Language Models Across Diverse Coastal Environments

Vision-language models (VLMs) enable robotic per- ception by associating visual observations with natural-language concepts. Yet their performance in coastal environments remains largely unexplored. We introduce a densely labeled coastal dataset containing more than 1,000 images collected across seven missions in three regions of Oahu, Hawaii, with 18 semantic classes and over 7,400 annotated instances. We evaluate seven modern VLMs through three complementary experiments mea- suring text-to-mask, mask-to-mask, and mask-to-text alignment. Broad landscape classes are generally recognized more accurately than conventional object and coastal classes, with coastal con- cepts presenting the greatest challenge. However, comparisons of shared conventional classes across coastal and terrestrial datasets reveal no consistent performance difference attributable solely to environmental context. Mask-to-mask matching also remains similar across conventional and coastal classes, while alternative textual labels substantially improve recognition of several coastal concepts. These results suggest that lower performance on coastal classes (at least on the objects/query categories evaluated) is heavily influenced by segmentation and linguistic representation.
Read the full abstract

All authors Seth Knoop, Chad R. Samuelson, Gabriel R. Slade, Brady Moon, Joshua G. Mangelson

Cryptography and Security

No-Box Vulnerability Analysis: Description-only Detection of Indirect Prompt Injection Vulnerabilities in MCP Servers

Conventional vulnerability analysis relies on either system access or dynamic interaction, all of which may be unavailable to third-party analysts auditing closed-source, remotely hosted, critical in situ systems, or commercially gated software. Therefore, we propose a new paradigm of no-box vulnerability analysis in which neither access nor runtime interaction is available, and only functionality metadata is available. Such metadata defines the intended behavior of the system, including its inputs, outputs, and side effects, while constraining the space of implementations consistent with that behavior. We propose hypothesizing about vulnerabilities that exist across all possible implementations of a given system metadata, without observing or interacting with the target system. An analyst can later validate these hypotheses when additional access is available. We showcase the feasibility of no-box vulnerability analysis through implementing a prototype called MCPSEC, which audits Model Context Protocol (MCP) servers for indirect prompt injection vulnerabilities using only the tool metadata exposed at server registration time. We evaluate MCPSEC on 20 widely deployed MCP servers comprising 177 tools, among which human evaluators confirm 95 vulnerable tools. MCPSEC identified 143 tools as vulnerable, and for each vulnerable tool, it produced a hypothesized vulnerability along with exploitation technique. Using metadata alone, MCPSEC predicted 94 (98.9% recall) real verified vulnerabilities, compared against an LLM baseline with 80 (84.2% recall). Overall, our results introduce no-box vulnerability analysis as a new analysis paradigm and demonstrate its practical feasibility in realistic systems.
Read the full abstract

All authors Zehua Zhang, Jie Hu, Pratham Hegde, Aditya Maheshbhai Gabani, Souradip Nath, Yibo Liu, Siyu Liu, Hongkai Chen, Hulin Wang, Zhuoer Lyu, Chang Zhu, Divij Handa, Yan Shoshitaishvili, Tiffany Bao, Ruoyu Wang, Adam Doupé

Computational Physics

A new generation of effective core potentials: Selected heavy 5d and 6p elements

We expand the correlation-consistent effective core potentials (ccECPs) library by developing semi-local pseudopotentials and matching basis sets by heavy-elements from $5d$ (Hf, Os, Hg) and $6p$ (Tl, Po, At, Rn) blocks. In order to accurately capture scalar relativistic effects, spin-orbit coupling, and electron-electron correlation, we implement a tiered core-valence partitioning strategy across three distinct resolutions. This includes a small 60-core (Hf, Os, Hg) that explicitly correlates subvalence shells, a large 78-core definition for the main-group elements that rigorously accounts for core polarization and relaxation effects in sparse valence environments, and an intermediate 68-core partition for Hg and Tl. This 68-core architecture represents a unique development in the ccECP library, optimizing the balance between accuracy and computational efficiency in a manner unexplored for ligther elements. Optimized against relativistic all-electron CCSD(T) references, the ccECPs deliver outstanding atomic precision, achieving a global average atomic low-lying states deviation of just 0.045 eV. This accuracy translates directly to robust molecular transferability, systematically restricting dissociation energy discrepancies to under 0.03 eV, equilibrium bond lengths to within 0.005 Å. By enforcing a regularized, finite potential at the origin for enhanced numerical stability in stochastic quantum Monte Carlo methods, this library removes a critical methodological bottleneck for predictive many-body simulations of heavy-element systems and materials.
Read the full abstract

Functional Analysis

Zonoids whose polars are zonoids: the Banach–Mazur distance need not tend to one

For every $n\geq2$, we consider a Gaussian zonoid of revolution $Z_n$ arising from works of Vitale and Mathis. We prove that $Z_n^*$ is also a zonoid and compute the Banach–Mazur distance from $Z_n$ to the Euclidean ball. This distance is independent of the dimension and is approximately $1.10$. Consequently, the supremal Banach–Mazur distance among zonoids whose polars are zonoids does not converge to $1$. The construction also produces a separable real Banach space $X$, not isometric to a Hilbert space, such that both $X$ and $X^*$ embed linearly isometrically into $L_1$.
Read the full abstract

Computer Vision

Are We Really Doing Few-Shot Learning? A Critical Examination of Pre-Training Assumptions

Few-shot learning is commonly evaluated under protocols that pre-train a model on a large auxiliary set whose classes are disjoint from the target episodes yet drawn from the same visual domain. This paper examines whether such protocols truly reflect low-data learning. We systematically compare no pre-training, class-disjoint in-domain pre-training, supervised out-of-domain pre-training, and label-free out-of-domain pre-training across eight datasets, three few-shot architectures, and multiple way-shot settings. Our results show that class disjointness alone is insufficient to remove the influence of target-domain data. In-domain pre-training improves over no pre-training by 33.41 percentage points on average, whereas supervised out-of-domain pre-training yields 23.75 percentage points, revealing a 9.66-point optimistic bias associated with domain overlap. Although out-of-domain pre-training is more realistic in applications where target-domain data are scarce, its effectiveness depends strongly on the compatibility between source and target domains. We further show that labeled source data are not strictly required, with an augmentation-based label-free strategy reaching an average gain of 27.71 percentage points and closely matching supervised out-of-domain pre-training at 27.97 percentage points. Finally, we introduce a descriptor-based source-selection strategy that estimates source-domain suitability before pre-training, reaching a median gap of only 1.37 percentage points to oracle selection. These findings highlight the need to move beyond in-domain pre-training as the default few-shot evaluation protocol, since it can overestimate performance in realistic scenarios where target-domain data are scarce.
Read the full abstract

Earth and Planetary Astrophysics

Constraining Tidal Migration with the Hot Jupiter Population

Hot Jupiters with orbital periods shorter than a few days have probably been affected by tidal orbital migration. We develop an analytical framework for constraining tidal migration from the present-day hot Jupiter period distribution, taking into account the uncertain rate and period distribution of hot Jupiters produced by mechanisms such as high-eccentricity migration or disk-driven migration. Assuming the tidal migration timescale is proportional to $P^{\chi_\tau}$, solutions with $\chi_\tau \simeq 3, 1.7,$ and 5.6 are all compatible with the present-day period distribution. The $\chi_\tau \simeq 3$ solution is consistent with equilibrium tides with suppression of dissipation at short periods, and implies that newly circularized hot Jupiters have periods concentrated near $3-4$ days, as predicted in some high-eccentricity migration models. The $\chi_\tau \simeq 1.7$ solution is also compatible with the $3-4$ day peak but has no clear counterpart in existing tidal theories and is more finely tuned. The $\chi_\tau \simeq 5.6$ solution is compatible with enhanced short-period equilibrium tidal dissipation or weakly nonlinear gravity-wave dissipation, but requires circularization at unexpectedly short periods. Thus, we find the model with $\chi_\tau \simeq 3$ most appealing. Transit timing of individual systems and observational constraints on the rate of hot Jupiter engulfment provide additional constraints, which are presently inconclusive but should improve with future data. Improved measurements of the occurrence of short-period planets as a function of planet mass and system age could also help to sharpen the constraints on tidal migration.
Read the full abstract

All authors Linhao Ma, Yubo Su, Samuel W. Yee, Caleb Lammers, Eliot Quataert, Joshua N. Winn

Numerical Analysis

Structure-preserving operator splitting for 2.5D ideal MHD with an entropy-stable DGSEM and exactly divergence-free compatible finite elements

We develop a high-order, fully explicit operator-splitting method for 2.5D ideal magnetohydrodynamics on Cartesian meshes. The hydrodynamic subflow is advanced by an entropy-stable discontinuous Galerkin spectral element method equipped with stagewise oscillation elimination and a positivity-preserving limiter. The magnetic–velocity subflow uses compatible finite elements and mass-lumped reconstructions of electric field and current density. Its discrete-curl update exactly preserves the global $H(\mathrm{div})$ divergence-free subspace, while the ideal semidiscretization balances kinetic, magnetic, and internal energy. Curl-form artificial resistivity and a direction-resolved velocity filter return removed magnetic and kinetic energy to internal energy; consequently, the stabilized magnetic stage preserves positive internal energy and satisfies a discrete entropy inequality. The two solvers are composed by a second-order hydrodynamic–magnetic–hydrodynamic Strang splitting, yielding a matrix-free scheme that retains global mass, nodal admissibility, and magnetic divergence on accepted steps. Smooth Alfvén-wave and advected-vortex tests reveal an even–odd convergence pattern in the magnetic polynomial degree, verify second-order temporal accuracy, and show that stabilization preserves high-order accuracy. Field-loop, Orszag–Tang, rotor, MHD blast-wave, and Kelvin–Helmholtz calculations demonstrate robust performance for nonsmooth multidimensional flows and show that artificial resistivity suppresses grid-scale magnetic oscillations while retaining the resolved structures.
Read the full abstract

Accelerator Physics

Turn-by-turn Tune Analysis Using Adaptive BPM Ensembles in the Fermilab Mu2e Delivery Ring*

The Mu2e experiment at Fermilab requires stable resonant slow extraction from the Delivery Ring, making reliable tune monitoring an important operational diagnostic. This work investigates BPM-based tune-candidate extraction using synchronized turn-by-turn position data distributed across multiple digitizers. Each spill contains approximately 50,000 turns from many BPMs in both transverse planes, enabling spectral analysis of tune-like structure. The analysis captures coherent spill snapshots, verifies synchronization using stream timestamps, and computes tune candidates in configurable horizontal and vertical tune bands. Rather than relying on a single BPM or fixed BPM list, it evaluates BPM quality on a spill-by-spill basis and selects small adaptive BPM ensembles. A multi- spill study shows that tune observability is distributed and dynamic rather than concentrated in one globally optimal BPM. Adaptive ensembles improve tune-candidate quality compared with single-BPM selections, with the clearest results in the vertical plane. The horizontal plane shows useful ranking structure but weaker visibility under present thresholds. Direct evaluation of fixed global BPM sets shows that static selections do not reproduce dynamic per-spill performance. These results motivate an adaptive BPM-ensemble approach for Delivery Ring tune analysis using selected BPM subsets, confidence metrics, and quality flags rather than a single preferred BPM or fixed BPM list.
Read the full abstract

Dynamical Systems

The three-vortex system: Hopf fibration, symplectic reduction, and near-collisions

We study the dynamics of collisions and near-collisions in the system of three point vortices in the plane. The dynamics is known to be completely integrable and can be reduced to the study of Hamiltonian systems on two-dimensional symplectic leaves. This still allows for interesting behavior of the solutions, various aspects of which have been investigated in a large body of work by many authors. Our focus will be on collisions and the possibility of their regularization through perturbations of suitable parameters of the system. We will use the reduced coordinate given by $\zeta=(z_2-z_1)/(z_3-z_1)$, where $z_1,z_2,z_3$ are the complex numbers representing the positions of the vortices. This choice seems very natural, although we have not come across it in the existing literature on the topic. Some of our results concerning the near-collision behavior appear to be new, and we also prove inequalities between critical energy values that we have not found in the literature. The calculations we do to analyze the collisions and near-collisions also reproduce various classical results that were previously obtained by other authors using different coordinates, and parts of the paper therefore have an expository character.
Read the full abstract

Functional Analysis

A Compact Counterexample to Suárez's Berezin Approximation Question

Let $A^2(\mathbb D)$ be the unweighted Bergman space and write $Q_m(S)=T_{B_m(S)}$ for the map induced by the $m$th higher-order Berezin transform. Suárez asked in 2005 whether $Q_m(S)$ converges to $S$ in operator norm for every $S$ in the full Bergman Toeplitz algebra. We answer this question negatively in a strong form: there is a compact operator $S$ such that \[ \sup_{m\geq 0}\|Q_m(S)\|=\infty. \] In particular, along a strictly increasing sequence $(m_n)$ one has \[ \|Q_{m_n}(S)-S\|\longrightarrow\infty. \] The obstruction is a moving matrix edge. The proof uses a moving family of rank-one test operators, each supported in the $m$th matrix column. Near the corresponding edge, these test operators are sent to weighted Hankel matrices, and the limiting coefficients form an explicit Pascal kernel. We prove a standalone Pascal–Hankel theorem showing that the associated weighted Hankel transformation fails to map $\ell^2$ boundedly into trace class. Finite-section convergence, trace duality, and the Uniform Boundedness Principle then transfer this instability to the exact Bergman maps.
Read the full abstract

High Energy Astrophysical Phenomena

XRISM observations of the Perseus cluster along two arms: Chaotic ICM motions probed by resonant scattering

XRISM has mapped gas velocities across the core of the Perseus cluster, separating the kinematic effects of mergers and AGN feedback. The physical properties of these motions remain unclear: are they a superposition of bulk flows, predominantly random/turbulent motions, or a mixture of both? Without resolving this question, constraints on the nonthermal pressure fraction and heating rate remain uncertain, as both assume predominantly random motions. Unlike emission line broadening, resonant scattering is most sensitive to small-scale, random motions rather than coherent bulk flows. Taking advantage of the extensive XRISM coverage of the Perseus cluster, we detect the full effects of resonant scattering on the He{\alpha} w line for the first time. This includes flux suppression in the cluster center, enhancement in the outer regions, and non-Gaussianity in the emission line. We employ radiative transfer simulations to constrain the amplitude of small-scale ICM velocities in the inner 60 kpc of Perseus, finding them to be consistent with the line broadening measurements within the uncertainties. This indicates the observed velocity dispersion is primarily due to small-scale random motions in the central Perseus regions rather than coherent bulk flows. We further explore potential anisotropy of these motions, showing that they are consistent with isotropic or radial motions rather than tangential ones. Longer XRISM observations are required to improve these anisotropy constraints. Finally, we explore azimuthal variations between the two complete radial arms observed by XRISM.
Read the full abstract

All authors Annie Heinrich, Irina Zhuravleva, Congyao Zhang, Anna Ogorzalek, Ayşegül Tümer, François Mernier, Phillip C. Stancil, Elena Bellomi, Lior Shefler, John ZuHone, Yutaka Fujita, Julie Hlavacek-Larrondo, Yuto Ichinohe, Kyoko Matsushita, Nhut Truong, Shutaro Ueda

Robotics

Expressive Robotic Pianist: Mastering Complex Piano Repertoire with Graph-Mimic and Musical Dynamics

Enabling robots to perform musical instruments with human-level expressivity represents a frontier in bridging the gap between mechanical precision and artistic interpretation. Despite advances in robotic dexterity, replicating the fluid finger transitions and nuanced dynamic control characteristic of human pianists remains a significant challenge. Through a reinforcement learning-based control framework, we demonstrate that a dexterous robotic hand can achieve high-fidelity performance across a diverse piano repertoire. Central to our approach is a graph-based optimization strategy that guides the robot to generate natural pre-press and key-press fingering strategies that closely resemble human movement patterns. To achieve expressive sound production, the control system is coupled with a physics-inspired acoustic model that modulates keypress velocity to accurately reproduce the dynamic variations specified in musical scores. Quantitative evaluations demonstrate that our expressive control model significantly outperforms baseline methods in both finger morphology similarity and dynamic velocity accuracy. In a perceptual test involving participants from diverse listener groups, performances generated by our system are significantly preferred over baseline robotic performances and are indistinguishable from human performances for non-professional audiences. Furthermore, extensive experiments across multiple musical styles confirm that our method maintains high note-level accuracy while achieving expressive performance. Our approach provides a robust pathway for robotic systems to move beyond mere mechanical accuracy, elevating robotic musicianship to a level of expressive performance comparable to human pianists.
Read the full abstract

All authors Yanhong Liang, Xianwei Liu, Chaojie Fu, Shaowen Cheng, Yanyan Yuan, Chengwei Zhuo, Xi Chen, Yongbin Jin, Wei Yang, Hongtao Wang

Nuclear Experiment

A detailed view at magnetic dipole strengths: The case of semi-magic $^{50}$Ti

Magnetic dipole, $M1$, strengths were studied in semi-magic $^{50}$Ti up to the neutron-separation threshold by combining data from $(d,p)$ one-neutron transfer, $(\gamma,\gamma')$ real-photon scattering, $(e,e')$ inelastic scattering at extreme backward angles, and $(p,p')$ at $E_p = 210$ MeV and extreme forward angles. The combination of all probes provided unique access to the neutron spin-flip contribution and the possibility to evaluate its role in generating the spin-flip $M1$ strengths. The small contribution of the neutron $(1f_{7/2})^{-1}(1f_{5/2})^{+1}$ spin-flip transitions, which were probed with the $(d,p)$ reaction, to the overall strength in $^{50}$Ti questions the standard picture for the microscopic origin of spin-flip strength in the $fp$ shell. For $^{50}$Ti, this letter shows that $J^{\pi} = 1^+$ states with larger neutron $(1f_{7/2})^{-1}(1f_{5/2})^{+1}$ spectroscopic factors do not correspond to the ones with the largest $B(M1;0^+_1 \rightarrow 1^+_i)$ strengths.
Read the full abstract

All authors B. Kelly, M. Spieker, U. Friman-Gayer, L. T. Baby, T. Beck, A. L. Conley, S. W. Finch, J. Isaak, Krishichayan, E. Litvinova, H. Pai, N. Pietralla, D. Savran, W. Tornow, N. Tsoneva, A. Volya, V. Werner

Computers and Society

Alternative AI Philosophy: Daoism as Method for AI in Education

As artificial intelligence (AI) rapidly iterates and transforms teaching, learning, and knowledge production, philosophical reflection has become increasingly indispensable to educational debates that remain predominantly shaped by Western intellectual traditions. This article proposes Daoism as an alternative philosophical framework for reimagining AI in education. Through philosophical analysis and textual interpretation of classical Daoist sources, brought into dialogue with contemporary scholarship on AI in education, it examines how the Daoist concepts of "Dao nature," "self-cultivation," and the "Zhenren" address fundamental questions concerning reality, the epistemic aims of education, and ethical action in the AI-mediated era. In doing so, the article diversifies the philosophical voices shaping inquiry into AI and education, enriching the field's conceptual resources for grappling with the philosophical questions AI raises for education and offering a genuinely pluralistic foundation for comparative philosophy of education in the AI era.
Read the full abstract

High Energy Physics (Phenomenology)

Glueball interactions from the colour Van der Waals potential

We examine pure Yang-Mills theory glueball-glueball interactions in constituent-gluon approaches. Because of the large mass gap, Van der Waals interactions are relatively more significant than in light-quark QCD hadrons where the pion gives rise to strong Yukawa exchanges. We find that the colour Van der Waals potential, computed along the traditional lines of the quantum London-Eisenschitz-Wang force, is a relevant interaction at distances between about 0.66 fm (when the glueballs are in contact) to 1.9 fm (when the virtual string tension among the colour-polarized glueballs in the intermediate state breaks down). In employing a Cornell potential as the microscopic one among colour charges, we find that the Van der Waals interaction derived from the linear potential part closely cancels that of the Coulomb one for the ground state glueballs. This means that the interaction, while sizeable and capable of saturating the lattice data depending on parameters, is far weaker than the London force derived from the Coulombic part alone. (This suggests that one should move effective theories for glueballs beyond dilaton-type approaches and perhaps deploy some variant of Van der Waals Effective Field Theory.)
Read the full abstract

Mathematical Physics

Probabilistic representation and limit theorems for particle numbers of quasi-free states

We study the particle number distribution of locally interacting bosonic quasi- free states, which arise in various areas of mathematical physics. We show that the particle number decomposes into an infinite sum of independent geometrically distributed random variables, confirming predictions from the physics literature. This representation yields exponential tail bounds for the particle number, a law of small numbers together with a large deviation principle at logarithmic speed when the lattice spacing diverges, and a central limit theorem when it vanishes. As an application, we obtain a detailed description of the statistics of the quantum depletion in Bose–Einstein condensates, with the constants explicit in terms of the scattering length of the interaction potential.
Read the full abstract

Probability

How Robust is Scale-Free Structure? Phase Transitions in Preferential Attachment Model under Attack?

Will an attack on a network affect its structure in a major way? In this work we study this question by investigating a dynamic preferential attachment-type graph in which an attacker interferes with the growth mechanism. We show that our model of an attack exhibits a phase transition. If the skill of the attacker is low, the network preserves its scale-free structure inherited from the underlying preferential attachment structure (even though the tail of the degree distribution becomes lighter due to the attack). When the skill of the attacker increases and crosses a critical boundary, the scale-free property is destroyed. The skill of the attacker is expressed as the probability that, at a given step, the attacker succeeds in preventing adding an edge to the network and, instead, causes a deletion (in a preferential manner) of an edge. In all cases we describe the tail behaviour of the degree distribution.
Read the full abstract

Quantum Physics

The Quantum Overlap Gap Property and Algorithmic Hardness for the Quantum Hypergraph Max-Cut Problem

In this work, we analyze the average-case hardness of approximation for the Quantum Hypergraph Max-Cut problem using the theoretical framework of the Quantum Overlap Gap Property (QOGP). We establish two main results. Our first result applies to a wide class of stable quantum algorithms, satisfying a Lipschitz property with respect to the quantum Wasserstein distance of order $2$. We show a weak hardness result, demonstrating that for any Lipschitz constant $L$, there is some $k$ such that $L$-stable algorithms cannot approximate the optimal solution to Quantum Hypergraph Max-Cut on $k$-uniform hypergraphs in the average case. Additionally, we establish a strong hardness result where $k$ is independent of $L$, but only for a more restricted class of local quantum algorithms defined using the quantum Wasserstein distance of order $\infty$. We apply these results to establish concrete depth lower bounds for popular quantum algorithms for preparing near-optimal states for this problem.
Read the full abstract

Mesoscale and Nanoscale Physics

Controlling topology in flux-mismatched Hofstadter bilayers

Stacked two-dimensional materials provide a promising platform for electrically controlling topological electronic states. However, tunneling between layers hybridizes their bands and removes the crossings needed to change topology. We show that this does not always have to be the case. Band crossings and associated Weyl points are topologically enforced in Hofstadter bilayers whose layers experience different magnetic fluxes. When resonant magnetic Bloch multiplets carry unequal Chern numbers, their projected tunneling is topologically obstructed and must vanish at isolated momenta. Sweeping the layer bias through these zeros creates synthetic Weyl monopoles in momentum-bias space that transfer the Chern mismatch. We demonstrate two consequences: a direct transition between insulating Chern phases and a reentrant compensated metal in which Lifshitz transitions bound the metallic window while internal Weyl events reconstruct the band topology. Consequently, the fixed-filling Hall response remains continuous and nonquantized even as integer Chern number is transferred between bands. Berry-flux, TKNN, and interface calculations independently verify the mechanism and its multichannel chiral signature. We outline realizations in Moire and anomalous-Hall heterostructures, establishing flux mismatch as an experimentally accessible route to electrically programmable Chern phases and chiral transport.
Read the full abstract