Materials Science
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 14 September
Data-driven materials development requires the collection of large amounts of high-quality materials data. Full autonomy of materials experiments is anticipated, but its technical hurdles are high and its adoption remains limited. In this study, we constructed a simple, easy-to-deploy automated experimentation platform that focuses not on full autonomy but on the reliable automation and quantitative recording of experimental processes. Specifically, commercially available instruments such as robot arms, electric pipettes, web cameras, and an electronic balance are combined, components such as fixtures are fabricated with a 3D printer, and the instruments are operated by control code generated by an AI agent based on a large language model. As a demonstration, we applied the platform to a two-solution mixing experimental system and synthesized ZIF-8, a metal-organic framework. A white suspension phase was observed in the product, and X-ray diffraction measurements confirmed that it was ZIF-8. We also found that its particle size distribution depends strongly on the solution dispensing speed of the electric pipette, which is a parameter that is difficult to control or record in manual operation. This dependence was reproduced in repeated runs, confirming the repeatability of the automated synthesis. This result is a good example showing that the control and recording of process parameters that are rarely quantified in manual work can govern the quality of materials data. All control code, CAD models, and documentation are made publicly available to encourage the spread of laboratory-scale automation of experiments.
Algebraic Geometry
Torsion, Betti rank, and small points in semiabelian schemes
Let $\mathcal G\to S$ be a semiabelian scheme over a smooth complex algebraic base, with abelian relative dimension $g$ and toric rank $r$. We prove that a dominating irreducible subvariety not contained in a proper relative special subvariety has Zariski-dense fibrewise torsion if and only if its mixed Betti rank is $2(g+r)$. In particular, its dimension is at least $g+r$. For every prime, primary torsion is then dense even among points of maximal rank. The exceptional loci include generalized Ribet loci. Over algebraic numbers, we prove that generic small points force full mixed rank whenever the abelian Betti rank is maximal. This yields a transfer from abelian relative Bogomolov dimension theorems to arbitrary toric extensions, together with toric height gaps above abelian torsion and order-linear gluing-height bounds for nodal Pell equations. The proof combines algebraic quotients of marked $1$-motives, quadratic nef compensation, a central-monodromy calculation, and algebraicity of mixed Betti strata.
Read the full abstract
Analysis of PDEs
Linearized PINN with pretrained nonlinear layers
We propose a linearized Physics-Informed Neural Network (lPINN), a reduced-order neural basis method for forward and inverse differential equations. In an offline stage, lPINN learns operator-compatible continuous neural basis functions from an ensemble of numerical solutions. The basis functions are differentiable through automatic differentiation and are pretrained using solution data together with either derivative information or physics residuals. For each new problem instance, the basis functions are frozen and the solution is obtained by minimizing the governing-equation residual together with applicable initial, boundary, regularization, and observational terms. Unlike surrogate and operator-learning methods, the training data define the trial space offline, while the instance-specific solution is computed online by enforcing the governing physics. Relative to vanilla PINNs, lPINN pretrains the nonlinear hidden-layer representation offline and performs online inference only in the final linear layer. We evaluate lPINN on forward and inverse problems for the advection-diffusion equation, Burgers' equation, and the nonlinear pendulum equation. Compared with vanilla PINNs, lPINN achieves lower solution and parameter errors while reducing online inference times by approximately one to more than three orders of magnitude, with the largest gains generally observed for limited residual or measurement data. Cross-resolution experiments show that the learned continuous representation can be evaluated on finer meshes without retraining and with nearly unchanged accuracy.
Read the full abstract
Materials Science
Machine Learning Guided CALPHAD Design of Ru-Stabilized BCC B2 Refractory Alloys
Refractory alloys with a ductile body-centered-cubic (BCC) matrix strengthened by ordered B2 precipitates offer a high-temperature analogue to the gamma/gamma-prime architecture of Ni-based superalloys. Ruthenium is particularly attractive as a B2 stabilizer because RuHf, RuZr, and RuTi can retain ordered phases well above 1300 C. In this work, equilibrium CALPHAD calculations were coupled with random-forest-guided active learning to explore a ten-element Nb-based, Ru-bearing composition space containing Nb, Ta, Mo, V, Ru, Ti, Zr, Hf, Al, and Y at 1 at.% resolution. Across 500 CALPHAD-evaluated alloys, the calculations reproduced the principal trends reported for the Ru-B2 design space. RuHf and RuZr remained stable to the solidus, RuTi commonly exhibited a solutionizing window, and Al-containing alloys preferentially formed competing sigma and A15 phases. The upper bound of the BCC+B2 field increased from a median of approximately 1570 C at 5 at.% Ru to approximately 1980 C near 9-10 at.% Ru. Among the group-IV additions, Hf, Zr, and Ti produced progressively lower two-phase stability. Re-screening using physically motivated criteria identified 100 alloys satisfying requirements for high-temperature BCC+B2 stability, absence of liquid, phase purity, and appropriate secondary-phase fraction, including 19 Ru-lean compositions and two independently reported HfRu-B2 alloys. The results establish practical compositional design rules for Ru-stabilized dual-phase refractory alloys and identify phase-specific BCC/B2 lattice misfit as a key target for future design cycles.
Read the full abstract
Probability
Sharp Gaussian Asymptotics for Marginals of Euclidean Balls
We study Gaussian approximation for probability measures obtained by normalizing one-dimensional profile functions, with one-dimensional marginals of Euclidean balls as the principal example. We first establish quantitative concentration estimates near the set of maximizers. For profiles with a unique nondegenerate maximizer, we give sufficient conditions under which centering at the maximizer and rescaling according to the local quadratic approximation of the logarithm of the profile yield densities that converge in $L^1(\mathbb{R})$ to the standard Gaussian density. We then specialize to one-dimensional marginals of Euclidean balls in $\mathbb{R}^n$. Writing $N=n-1$, we consider two standardizations of the marginal distribution: one determined by the logarithmic curvature at the maximizer, and the other by the exact standard deviation. For each standardization, we identify the first-order correction, of order $N^{-1}$, to the standard Gaussian density in $L^1(\mathbb{R})$. These expansions also determine the corresponding first-order corrections to the probabilities of symmetric intervals and the leading terms of the total variation distances from the standard Gaussian distribution. In particular, under exact-variance standardization, the total variation distance is asymptotic to an explicit positive constant times $N^{-1}$. Consequently, the previously known $O(N^{-1})$ bound for approximation by the Gaussian distribution with the same variance is sharp in order.
Read the full abstract
Probability
Moderate deviations and laws of the iterated logarithm for geometric functionals in the sparse regime
We prove moderate deviation principles and laws of the iterated logarithm in the sparse regime for geometric and topological functionals associated with $k$-point connected components. These limit theorems are established at both the measure-valued and vector-valued levels, for Poisson and binomial point processes. As applications, we derive corresponding results for component counts in random geometric graphs and Čech complexes and for counts of Morse critical points.
Read the full abstract
Machine Learning (Statistics)
Steady-State Convergence of Stochastic Approximation
For constant-stepsize stochastic approximation (SA), the iterates converge in distribution to a stationary law that depends on the stepsize $\alpha.$ Steady-state convergence (SSC) concerns the limit of the scaled stationary distribution as $\alpha \downarrow 0.$ Existing SSC theory requires i.i.d. or additive noise and global differentiability of the mean operator, and yields suboptimal rates. We develop a unified SSC theory for constant-stepsize contractive SA driven by Markovian, multiplicative noise, covering both locally differentiable and locally nondifferentiable mean operators. A key methodological contribution is a multi-step universality framework that progressively reduces the original stochastic recursion to tractable auxiliary dynamics while preserving its steady-state limit. Under local quadratic linearization at the fixed point, we obtain a Gaussian approximation of the scaled steady state at the optimal rate $O(\sqrt{\alpha})$ in Wasserstein-2 distance, which further gives finite-time Gaussian approximations for the raw iterates. In the locally nondifferentiable regime, we establish a general SSC result and show that the leading-order asymptotic bias can be of order $\sqrt{\alpha}$, in contrast to the $\alpha$-order bias in the smooth regime. We apply the theory to Markovian linear SA and asynchronous Q-learning, neither of which is covered by prior results. We further propose a bias-reduction scheme for Q-learning that requires no knowledge of the local smoothness regime, validated by numerical experiments.
Read the full abstract
Algebraic Geometry
Riemann-Roch Polynomials, MBM Classes and Poor IHS Manifolds
We study poor irreducible holomorphic symplectic manifolds, namely those containing no rational curves and no codimension-one subvarieties. We show that, for such manifolds, several natural cones in \(H^{1,1}(X,\mathbb R)\) coincide, giving strong rigidity consequences. In particular, poor elliptic irreducible holomorphic symplectic manifolds admit no holomorphic foliations. Using this rigidity property, we give a criterion for detecting monodromy birationally minimal classes from the roots of Riemann–Roch polynomials on any irreducible holomorphic symplectic manifold. To each primitive negative class we associate a polynomial depending only on the deformation type and on its Beauville–Bogomolov–Fujiki square. Under a simple-root assumption on the positive real roots, the position of the number \(1\) among these roots implies that the class is MBM whenever it is of type \((1,1)\). This gives a uniform root-theoretic sufficient condition for the existence of rational curves on irreducible holomorphic symplectic manifolds. We then describe poor elliptic irreducible holomorphic symplectic manifolds in terms of their deformation spaces and show that every connected component of the moduli space contains a poor irreducible holomorphic symplectic manifold of positive Picard rank.
Read the full abstract
Optimization and Control
Verifying performance, stability, and feasibility of inexact non-linear model predictive controllers
We introduce a verification framework to numerically analyze inexact model predictive controllers (MPCs) in the constrained non-linear discrete-time setting. Rather than modifying the controller so that guarantees hold by construction, we treat the controller as given. In particular, we focus on two types of inexact controllers: (a) one whose input is extracted from a primal-dual point satisfying the Karush-Kuhn-Tucker (KKT) conditions of the non-convex MPC problem, and (b) one whose input is obtained by linearizing the dynamics and solving a convex quadratic program. The main idea of our verification framework is to formulate an optimization problem that searches over the worst-case initial state within a given set and control inputs consistent with the inexact controller to maximize a carefully-chosen performance metric. Using this framework, we show how to certify (i) the worst-case suboptimality gap of a single MPC problem, (ii) the worst-case closed-loop suboptimality gap over a given number of dynamical system iterations, (iii) closed-loop stability, and (iv) feasibility of the closed-loop system. Through numerical examples, we showcase the ability of our framework to precisely quantify both types of suboptimality, and to test the stability and feasibility of the inexact controllers.
Read the full abstract
Quantum Physics
The Ergotropy of Quantum Batteries under Unruh Effect
We study the effects of uniform acceleration on the ergotropy of quantum batteries modeled as Unruh-DeWitt detectors, in both bipartite and tripartite setups. In the bipartite system, we systematically compare three scenarios: accelerating the battery, accelerating the charger, and accelerating both simultaneously. We find that only battery acceleration can induce a sudden emergence of ergotropy at a critical acceleration threshold, while the corresponding composite-system energy change may increase or decrease depending on the initial state at the onset of acceleration. Charger acceleration leaves the battery ergotropy constant within the perturbative regime, while simultaneous acceleration leads to monotonic decay due to coherent cancellation of the q-dependence. Extending to a tripartite system with one battery and two chargers, we find that battery acceleration again induces ergotropy emergence, whereas accelerating adjacent charger does not–consistent with the bipartite charger-acceleration case. These results reveal that the Unruh effect plays a dual role, both enhancing and degrading quantum battery performance, depending on which subsystem is accelerated and on the multipartite structure, bridging relativistic quantum field theory and quantum thermodynamics with relevance to experimentally accessible platforms.
Read the full abstract
Data Structures and Algorithms
Accelerated Local Algorithms for Personalized and Regularized PageRank
Local PageRank algorithms seek sparse approximations with work independent of graph size. We give a deterministic algorithm for regularized personalized PageRank with additive objective accuracy $\epsilon$ in $\widetilde{\mathcal{O}}(1/(\rho\sqrt\alpha))$ local work, where $\alpha$ is the lazy teleportation parameter and $\rho$ is the regularizer. Accuracy enters only polylogarithmically. The bound charges discovery, repeated neighborhood scans, numerical updates, certification, and output, without graph-wide preprocessing or a supplied solution support. The algorithm combines regularization continuation with accelerated corrections constrained by a degree-scaled box and a mass cap. Two energies for the same recurrence control objective convergence and the response that activates coordinates. A selected-flow argument bounds cumulative scanned volume, and a sparse threshold reporter realizes the bound. We also specify a bounded-arithmetic implementation for rational inputs. A second, randomized algorithm uses support-safe threshold batches. A block-Cholesky and Chebyshev argument bounds their depth, and certified SDD solves give expected work $\widetilde{\mathcal{O}}(V_*\min\{k_*,\alpha^{-1/2}\})$, where $k_*$ and $V_*$ are the optimal support's cardinality and degree volume. Both methods imply the corresponding accelerated degree-normalized PPR approximation. The concurrent September 2026 preprint of Cui, Wei, and Yang also attains the randomized work scale. Our principal distinction is deterministic local acceleration with only polylogarithmic overhead and no SDD oracle.
Read the full abstract
Digital Libraries
Geometric Signatures of Conceptual Reorganization: A Counterfactual Embedding Framework for Detecting Scientific Revolutions
We introduce document embedding geometry as a quantitative observable of conceptual reorganization and develop a counterfactual ablation framework for measuring how individual concepts influence the organization of scientific knowledge, providing a quantitative framework for detecting scientific revolutions. The observable is defined by the geometric perturbation induced when removing documents associated with a candidate concept from the embedding space before and after its historical emergence. Statistical validation is performed using five historical case studies spanning physics, mathematics, and machine learning: special relativity, Gödel's incompleteness theorems, the Higgs mechanism, deep learning, and the attention mechanism underlying transformer architectures. Across the historical case studies, the framework identifies measurable geometric signatures associated with conceptual reorganization, while the validation studies expose important limitations arising from document assignment and sparse historical data. These results establish embedding geometry as a medium for quantifying conceptual reorganization, providing a new approach for studying how scientific fields restructure over time.
Read the full abstract
Sound
Tracing the Origins: Legacy Codec Identification in Neural Audio Transcoding
Residual Vector Quantization (RVQ)-based neural audio codecs (NACs) enable high-fidelity audio distribution at unprecedentedly low bitrates through discrete token-based representations. However, this shift disrupts traditional forensics, as non-linear neural transcoding obscures the underlying traces of legacy compression. This study defines the forensic gap and proposes a Transformer-based framework designed to leverage the hierarchical and temporal dependencies inherent in RVQ sequences. By modeling inter-layer causal relationships and dynamic forensic significance, our model effectively disentangles superimposed artifacts from legacy-to-neural transcoding. Experimental results achieve 97%+ accuracy for codec identification and robust joint identification performance across 32-128 kbps. These results demonstrate that traditional codec traces persist even after neural transcoding, supporting the feasibility and necessity of neural-codec-aware audio forensics.
Read the full abstract
Number Theory
The typical size of Hecke eigenvalue sums is $o(\sqrt{x})$
Let $\mathcal{H}_k$ denote the set of normalized holomorphic Hecke cusp forms of weight $k$ for the full modular group $ \mathrm{SL}_2(\mathbb Z)$. For each $f\in\mathcal{H}_k$, let $\lambda_f(n)$ denote the corresponding eigenvalue of the normalized Hecke operator $T_n$. We prove nontrivial upper bounds for \[\sum_{f \in \mathcal{H}_k}\omega_f \left|\sum_{n \leq x} \lambda_f(n)\right|^{2q},\] where $k$ is a positive even integer, $1\leqslant x\leqslant k$, $0\leqslant q \leqslant 1$ and $ \omega_f = \frac{\Gamma(k-1)} {(4\pi)^{k-1}\langle f,f\rangle} = \frac{2\pi^2} {(k-1)L(1,\mathrm{Sym}^2 f)}. $ Our estimates match the conjecturally sharp upper bound for $1\leqslant x\leqslant k^{0.99}$. In particular, whenever both $x$ and $k/x$ tend to infinity with $k$, we obtain \[\sum_{f \in \mathcal{H}_k}\omega_f \left|\sum_{n \leq x} \lambda_f(n)\right|=o(\sqrt{x}).\] We also prove upper bounds for low moments of sums of Hecke eigenvalues associated with Hecke–Maass cusp forms for $\mathrm{SL}_2(\mathbb Z)$. We study these sums through the probabilistic model proposed by Cogdell–Michel. We also determine the order of magnitude of low moments of this probabilistic model, which is equivalent to determining the order of magnitude of low moments of Hecke eigenvalue sums in the limit.
Read the full abstract
Analysis of PDEs
Resolvent estimate for asymptotically hyperbolic surfaces without evenness assumption
We prove a sharp cut-off resolvent estimate for the Laplacian on non-compact Riemannian manifolds whose ends satisfy the Cardoso–Vodev assumption and whose geometry near the trapped set agrees with that of an even asymptotically hyperbolic manifold with the corresponding resolvent estimate. As applications, we show the global Strichartz and spectral projection estimates on negatively curved asymptotically hyperbolic surfaces, without assuming the evenness at infinity.
Read the full abstract
Artificial Intelligence
Externalizing Requirement-to-Repair Artifacts as Observable Traces for LLM-Based Program Repair
Repository-level repair requires not only correct patches but also inspectable records that explain how issue requirements are translated into code changes and post-edit evidence. We contribute THEMIS, a stage-aware repair workflow that externalizes this requirement-to-repair process through semantic interpretation, a runtime requirement-code graph, graph-derived Developer guidance, retained repair rationale and patches, and post-edit audit records. A retrospective audit of 300 SWE-bench Lite cases demonstrates that these artifacts provide broad support for cross-stage inspection: a complete Developer rationale is available for 288 cases, and 214 cases (71.3%) retain a complete audited field set connecting the selected stages. The retained records further enable systematic measurement of cross-stage correspondence: target symbols recur in 62.6% of Developer rationales and in 62.8% of patches, rising to 75.8% when related symbols are included. In a paired 100-case comparison, the relational workflow resolves 19 cases versus 9 for the direct same-input condition; because the two conditions also differ in Analyzer output, graph-derived distillation, and Judge records, we report this as preliminary, workflow-level evidence rather than a causal effect of the graph component. Together, these results show that THEMIS makes otherwise implicit requirement-to-repair transitions inspectable, enabling systematic examination of how repair decisions persist, align, and evolve across stages.
Read the full abstract
Logic in Computer Science
A Lean Paper About Paper: A Formal Framework for Origami
The mathematics of Origami have been well studied and shown to develop several interesting results. We use Lean 4 tactics and build on Mathlib to redefine the 7 Huzita operations as theorems instead of axioms and prove their existence. We develop proofs for important origami constructions (such as trisecting an angle), implement origami-constructible numbers and prove the associated Cardano's formula, and formalize Haga's theorem. A Crease Pattern Inspector explores physical folding by providing a full pipeline to create and visualize models constrained by the Huzita formalism. The Lean codebase brings 100+ theorems and lemmas.
Read the full abstract
Human-Computer Interaction
Sensemaking as Artifact: Accumulated Influence in AI-Mediated Information Environments
Generative AI is changing what can happen after a source artifact reaches its audience. A viewer's interpretation can now be externalized into a derivative artifact, allowing private sensemaking to become part of subsequent communication. Once such a derivative artifact circulates, it can enter subsequent viewers' information environments and shape the conditions under which their later sensemaking occurs. In this paper, we examine how this shift changes visual information communication. We first consider the viewer's immediate interaction with a source artifact and generative AI. We then examine what becomes consequential when the viewer's sensemaking takes communicative form, including communicative commitment, the legibility of transformations and source relationships, and the literacy required to interpret already-mediated information. Finally, we broaden the unit of analysis to consider how repeated and distributed AI mediation may accumulate over time, shaping what subsequent viewers notice, consider plausible, trust, and carry into subsequent sensemaking. We argue that understanding these longer-term forms of influence is a research direction for AI-mediated visual communication.
Read the full abstract
Classical Analysis and ODEs
Cahn-Hilliard equation associated with hypergraph
A hypergraph Laplacian was introduced to investigate the structure of networks written as hypergraphs. It was shown that the behavior of solutions to an evolution equation associated with the hypergraph Laplacian quite resembles that of solutions to the classical heat equation. Hence by replacing the Laplacian in PDEs with the hypergraph Laplacian, we might be able to introduce various diffusion models on hypergraphs (discrete domains), whose behavior of solution is similar to PDEs. In this paper, we consider a system of equations obtained by replacing the Laplacian in the original Cahn–Hilliard equation with the hypergraph Laplacian. Due to the nonlinearity and multivaluedness of the hypergraph Laplacian, it is difficult to apply methods for the original Cahn–Hilliard equation to our problem. To cope with these difficulty, we shall introduce a new proof by using properties of the hypergraph Laplacian in this paper.
Read the full abstract
Functional Analysis
Hardy–Littlewood Constants Beyond Polarization
The polynomial Hardy–Littlewood inequalities bound coefficient norms of homogeneous polynomials on $\ell_p$ balls by their supremum norms, with constants independent of the dimension. Their $p=\infty$ endpoint is the Bohnenblust–Hille inequality. A longstanding obstruction to connecting their constants is the polarization loss in the usual multilinear approach. We overcome this obstruction by proving $D_{m,p_m}\le(1+o(1))D_m$ whenever $p_m/m^2\to\infty$, where $D_{m,p}$ and $D_m$ are the optimal complex polynomial Hardy–Littlewood and Bohnenblust–Hille constants. At the opposite boundary, we determine the optimal endpoint constant exactly, $D_{m,m}=m$. We then prove the full first-order asymptotic $D_{m,p_m}\sim m$ whenever $p_m\ge m$ and $p_m-m\to0$, and the exact polynomial growth $D_{m,p_m}=m^{1+o(1)}$ on the wider scale $p_m-m=o((m/\log m)^{1/3})$.
Read the full abstract
Analysis of PDEs
Global existence for a scalar quasilinear wave equation in two space dimensions beyond the cubic null condition
We prove global existence, both to the future and to the past, for a family of scalar quasilinear wave equations in two space dimensions for sufficiently small $C_c^\infty$ initial data. These equations have cubic leading quasilinear nonlinearities of the form $u^2\partial^2u$ and satisfy a sign condition that allows the cubic null condition to fail. To explain the sign condition, we derive the geometric reduced system for quasilinear wave equations with cubic leading nonlinearities in two space dimensions and introduce a notion of geometric weak null condition. We prove that the geometric weak null condition holds for the model scalar equation if and only if the sign condition holds. At the level of the geometric reduced system, the sign condition prevents the corresponding characteristic curves from intersecting in finite time. We also recover the geometric reduced system from the global solutions in our main theorem. If the model scalar equation satisfies the sign condition but fails the cubic null condition, and if $u$ is a nonzero global solution to the model equation, we show that, for $r=|x|$, the $L^\infty$ norm of $t^{\frac{1}{2}}\partial_r^2u$ in a region where $|r-t|\ll t$ tends to infinity as $t\to\infty$. Thus, its asymptotic behavior differs from that of a solution to the linear wave equation $\Box \psi=0$ with $C_c^\infty$ data.
Read the full abstract
Game Theory
Strategic Decision Focused Learning
Machine learning (ML) predictions are increasingly being used to guide decision-making, giving rise to the problem of decision-focused learning (DFL) where predictors are optimized for downstream decision quality rather than accuracy alone. However, most existing work assumes a single decision-maker optimizing in isolation. This paper formalizes strategic decision-focused learning, where an ML system predicts an exogenous state that some agents observe before playing a game. For example, a park ranger may predict wildlife locations to allocate anti-poaching patrols against strategic poachers. While the exogenous state is unaffected by agent actions, predictions influence agents' strategies and the resulting equilibrium. We find that strategic considerations fundamentally change the learning problem. In particular, we show the prediction accuracy-equilibrium payoff landscape can be non-monotonic, i.e., better predictions can degrade performance. We propose algorithmic approaches to address these challenges and validate them across benchmarks in wildlife conservation and infrastructure protection. Our theory and experiments highlight the importance of accounting for strategic interactions when designing predictors.
Read the full abstract
Materials Science
Neural-Network Solutions to Real-Space Charge Density and Generalization
The Hohenberg-Kohn theorem establishes that, in principle, the ground state (GS) charge density contains all GS information of a many-electron system, such that all GS observables can be expressed as functionals of the GS charge density. Conventional Kohn-Sham density functional theory requires iterative solution of the self-consistent-field equations at substantial computational cost, motivating the development of deep learning surrogates for electronic structure calculations and, in turn, accelerating computer-aided materials design. Here, we propose AIDEN, an Atomic-Interaction Density Equivariant Network for solving real-space charge density. AIDEN separates the element-dependent one-center density from environment-induced density redistribution and represents the latter through complementary atom- and edge-centered tensor correlations. A continuous low-rank Gaussian decoder then reconstructs the density at arbitrary spatial coordinates while reusing atomic encodings independently of the evaluation grid. AIDEN achieves state-of-the-art accuracy on periodic crystal benchmarks while remaining competitive for molecular systems, and further demonstrates zero-shot transferability across several structurally distinct out-of-distribution case studies. Furthermore, AIDEN provides substantially faster inference than both baseline models and full SCF calculations, enabling efficient charge density reconstruction for large-scale electronic structure calculations.
Read the full abstract
Dynamical Systems
Wild attractor exists for symmetric Fibonacci bimodal map
We consider smooth symmetric bimodal maps with Fibonacci combinatorics. We prove that, when the critical order is sufficiently large, the common $\omega$-limit set of the two critical points is a wild Cantor attractor. Using a full-family argument, we first prove the existence of smooth symmetric Fibonacci bimodal maps with any prescribed critical order $\ell>3$. The proof of the existence of the wild attractor is based on a two-to-one semi-conjugacy which reduces the generalized renormalization of the bimodal map to a Fibonacci box mapping with one critical point.
Read the full abstract
Algebraic Geometry
Geometric Invariant Theory for Affine Superschemes
We develop Geometric Invariant Theory for affine superschemes under the action of reductive algebraic supergroups, formulating the theory in terms of coordinate Hopf superalgebras in order to accommodate anticommuting and nilpotent variables. Within this algebraic setting, we construct affine superquotients and establish their basic structural properties under suitable hypotheses. We then prove a supergeometric analogue of the Hilbert-Mumford criterion, giving a numerical test for the semistability and stability of points under natural constraints on the supergroup coaction. We show that this numerical criterion can be used to construct the GIT superquotient of these superschemes, and we give examples illustrating how the supergeometric GIT superquotient differs from its classical counterpart.
Read the full abstract
Robotics
HydroMap: Probabilistic Water Surface Elevation Mapping for Semantic Scene Representation in Inland Waterways
Autonomous surface vehicles operating in inland waterways require a persistent representation of both surrounding structures and the water surface. LiDAR-based simultaneous localization and mapping often produces sparse or missing water returns, leaving this operational surface absent from the reconstructed scene. We propose HydroMap, an odometry-decoupled framework that reconstructs water surface elevation from stereo observations and integrates it with the structural map. Per-frame water points form joint cell observations with propagated stereo and pose uncertainty, and successive observations are fused into a persistent probabilistic elevation map. Semantic map conversion then combines the elevation map with structural geometry in a unified 2.5D representation of water, boundaries, structures, and overhead regions. On the Pohang Canal and Leuven Vaart datasets, the elevation RMSE remains below 5 cm relative to LiDAR references expressed in the same map frame. The elevation and semantic maps are published at 2 Hz and 1 Hz, respectively. HydroMap thereby complements LiDAR maps with a persistent representation of the water surface for downstream navigation in inland waterways.
Read the full abstract
Machine Learning (Statistics)
Shapley Value Estimation for Multi-Site Data with Blockwise-Missing Features
Shapley value (SV)-based methods are the prevailing framework for feature attribution in machine learning, yet existing population-level Shapley estimators generally assume that observations used to evaluate the coalitional game are fully observed under a common feature space. This assumption is routinely violated in multi-site studies across biomedicine, social science, and environmental monitoring, where institutions record different features under different protocols, producing systematic blockwise missingness across sources. We first show that the standard remedy of imputing missing features before computing Shapley values introduces systematic, coalition-dependent bias into the resulting attributions. We then propose FUSHAP (Fusion Shapley Attribution from Partially-observed data), a method that leverages partially-observed auxiliary sites to reduce the variance of a preliminary single-site Shapley estimate without imputation. A permutation-based screening step detects and excludes sites whose data distributions are incompatible with the target population. In synthetic experiments, FUSHAP achieves $3$–$8\times$ lower MSE than the single-site estimator and $2$–$3\times$ lower MSE than imputation baselines without incurring imputation-induced bias, and the screening procedure identifies misaligned sites with $82\%$ power at moderate misalignment and $100\%$ for strong misalignment. On multi-site air quality and multi-center clinical data, FUSHAP reduces MSE by approximately $3$–$7\times$ relative to the single-site estimator; in the clinical application, standard imputation can increase MSE above the single-site baseline.
Read the full abstract
Astrophysics of Galaxies
Tracing Stellar Populations through the Mg-Al Anti-Correlation in Gaia-ESO Globular Clusters
Context. Globular clusters (GCs) are fragments of the chemical history and evolution of the Milky Way. Their notable intra-cluster abundance variations have been used to characterise chemical trends and stellar populations. However, the origins of these populations and GCs in general are still largely unknown. Aims. Our aim is to explore the origin of the stellar populations belonging to 14 GCs making use of their abundances derived from the Gaia-ESO Survey (GES) spectra. In particular, we use the Mg-Al anti-correlation to separate the populations. Methods. The GES spectra were revisited to derive additional homogenous chemical abundances for Mg and Al. A Gaussian Mixture Model (GMM) was applied to the [Mg/Al] distribution for each cluster to define a threshold between the two main populations. Results. Eight clusters imply the presence of Mg-Al anti-correlations and dual populations. We find there is a regime transition near [Fe/H] approximately -1.4, where, the Mg-Al anti-correlation disappears at higher metallicity. Several clusters, regardless of their Mg-Al anti- correlation behaviour, exhibit metallicity spreads (e.g., NGC 2808, NGC 6752) and s-process variations (e.g., NGC 7078, NGC 1851), suggesting complex enrichment histories. Conclusions. The presence and spread of the Mg-Al anti-correlation depend on cluster mass and metallicity, with metal poor and/or massive clusters exhibiting the clearest anti-correlation. This work demonstrates additional abundances that can be retrieved from Gaia-ESO Survey spectra and provides further insight into the chemistry of multiple stellar populations within GCs. These findings highlight the chemical complexity of GCs and the need for large, homogeneous datasets to trace their formation histories.
Read the full abstract
Human-Computer Interaction
First Impressions: How Placement Shapes the Influence of AI Summaries
AI-generated summaries increasingly mediate how people interpret information across platforms, including product reviews on e-commerce sites. Using Amazon's AI summaries as a case study, we conducted a preregistered, randomized experiment (N = 278) comparing how AI summaries and user reviews shaped product perceptions, and how their influence varied with valence and presentation order. We found that both AI summaries and user reviews influenced participants' opinions, with negative summaries having a larger effect than positive ones. Presentation order was the most important factor: the first source anchored judgment and only user reviews could displace an existing anchor. Although participants reported preferring user reviews, they often underestimated the influence of AI summaries on their judgments. Our findings show how the placement of AI summaries shapes user perception and highlight opportunities to design interfaces that support more deliberate judgments about when to rely on summaries and when to examine the underlying content directly.
Read the full abstract
Computer Vision
What Makes a 3D Scene Editable? A Factorized Benchmark of Fidelity, Locality, Consistency, and Preservation
Neural 3D scene editing is often evaluated by semantic alignment alone, although a convincing result may alter unrelated content or become inconsistent across views. We introduce EditBench3D, a representation-agnostic benchmark that treats editing as controlled information replacement. It evaluates four complementary properties: instruction fidelity, spatial locality, cross-view consistency, and preservation of non-target content. The protocol combines visibility-aware 3D target supports, paired descriptions, held-out cameras, and five edit families covering appearance, material, geometry, and object-level changes. We evaluate eight representative NeRF, 3D Gaussian Splatting, hybrid, and proxy-based editors on 240 scene-edit pairs. The study shows that semantic fidelity is only weakly associated with the other editing properties, and that no single method is optimal across all dimensions. Explicit Gaussian editors offer a strong overall balance, whereas direct proxy manipulation provides the most conservative edits at the cost of open-ended fidelity. These findings support reporting editability as a multi-objective profile rather than a single semantic score.