History and Overview of Mathematics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
A categorial approach to the non-metric geometry in Books V and VI of Euclid's Elements is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.
Statistical Methodology
Differentially Private Average Treatment Effect Estimation by Propensity Score Blocking
Average treatment effect (ATE) estimation in observational studies is a fundamental statistical tool used frequently in social science, medicine, and other fields. These fields often work with sensitive data where privacy protections are important, so a differentially private mechanism for ATE estimation is highly desirable. Here we present two propensity score-based algorithms for ATE estimation on observational data, one improving the inverse probability weighting (IPW) method used in prior work, and the other using blocking on the propensity score (BPS). Both show lower error and less bias than prior work, with the BPS-based algorithm frequently reducing error by 75% or more compared to prior work.
Read the full abstract
Operator Algebras
A simple C$^*$-algebra which is not $K_1$-injective
We exhibit a simple unital infinite-dimensional C$^*$-algebra $A$ which is not $K_1$-injective, i.e., the canonical map $ U(A)/U_0(A)\longrightarrow K_1(A)$ is not injective. This phenomenon is well known in the non-simple case. Indeed, a natural example is the generator $u$ of $\pi_4(U(2))\cong\mathbb{Z}/2$, and we use exactly this example as the seed of our construction. The construction proceeds by developing a higher-rank matrix trapping technique in homogeneous algebras generalizing the machinery of Villadsen in higher stable rank simple C$^*$-algebras. A hypothetical homotopy from the homomorphic image of $u$ to the identity in a certain homogeneous algebra is shown, through matrix trapping, to yield a spin bordism from the class of $u$ to that of the identity matrix $\mathrm{1}_2 \in M_2$, and this, in turn, is obstructed by the fact that the bordism class of $u$ is not trivial. We then fit our new arguments into a generalized version of Villadsen's higher stable rank construction to arrive at a simple example.
Read the full abstract
Commutative Algebra
Lefschetz properties for monomial complete intersections
We give a complete characterization of the weak Lefschetz property (WLP) for monomial complete intersections over a field of positive characteristic. Richard Stanley observed that in characteristic zero WLP, and in fact the strong Lefschetz property (SLP), holds for all degree sequences, as a consequence of the hard Lefschetz theorem, and the same result was explained by Junzo Watanabe using the representation theory of $\mathfrak{sl}_2$. In positive characteristic, many partial results are known, most notably the classification for constant degree sequences due to Brenner–Kaid and Kustin–Vraciu. Our approach is based on a cohomological and representation-theoretic interpretation of WLP. Combined with an analysis of cohomology characters, this leads to a complete numerical criterion for WLP, expressed by simple inequalities involving the $p$-adic digits of the exponents. We also give a new proof of the known classification of SLP using Renaud's algorithm for multiplication in the Green–Han–Monsky ring.
Read the full abstract
Computers and Society
Scalable Oversight for AI in Mental Health: Lessons from 350,000 AI Coaching Conversations between Therapy Sessions
Clinician review of every AI output is often proposed as a safeguard in mental healthcare, but vigilance research suggests this approach fails at scale and may paradoxically reduce safety. Drawing on our experience deploying an AI coaching tool across 350,000+ conversations between therapy sessions, we describe how we arrived at a three-layer human-on-the-loop oversight framework combining preventive design, real-time monitoring, and continuous clinician evaluation. We show how specific findings from clinical review drove iterative improvements, and offer practical recommendations for mental health professionals evaluating AI systems.
Read the full abstract
Soft Condensed Matter
Comprehensive molecular dynamics study of the dynamical properties of a dense binary hard-sphere mixture
We present an extensive molecular dynamics (MD) study of the dynamical properties of a binary hard-sphere fluid over a wide range of packing fractions, $\phi \approx 0.357-0.582$. The self-diffusivity, $D$, and shear viscosity, $\eta$, are computed using an efficient implementation of the Einstein–Helfand method. The finite-size effects in $D$ scale as $1/N^\alpha$, with $\alpha$ increasing from approximately $1/3$ to $3/4$ with increasing $\phi$, whereas those in $\eta$ are negligible except for $\phi \gtrsim 0.554$, where they scale as $1/N$. The data are then extrapolated to the thermodynamic limit to obtain $D_{\infty}$ and $\eta_{\infty}$. Both coefficients show a super-Arrhenius dependence on $\phi$ for dense states, accompanied by a breakdown of the Stokes–Einstein relation. Although both $D_{\infty}(\phi)$ and $\eta_{\infty}(\phi)$ data are well described by an exponential form, we demonstrate that these fits do not provide reliable estimates of the critical packing fraction, $\phi_0$, owing to the substantial extrapolation required beyond the accessible equilibrium range. We find the commonly assumed proportionality between $\eta$ and the structural relaxation time, $\tau_\alpha$ , to not hold for this system. For $\phi\gtrsim 0.570$, the van Hove self-correlation function $G_s(r, \tau)$ exhibits a spatial exponential decay at intermediate times, $\tau$, signaling dynamic heterogeneity. The characteristic decay length scales as $\lambda \sim \tau^\nu$, with $\nu \approx 1/3$, in contrast to the conventional square-root scaling. We also investigate temporal heterogeneity through the four-point dynamic susceptibility, $\chi_4(\tau)$, and its peak time, $\tau_4$. These findings provide rigorous benchmark MD data for computational studies of glassy dynamics and establish a reference for testing theoretical models in dense disordered systems.
Read the full abstract
General Relativity and Quantum Cosmology
From driven oscillations to free ringdown: a particle plunging into Kerr
We show that a ringdown waveform can admit a constant-coefficient quasinormal-mode (QNM) representation while its individual QNM-pole contributions remain driven. To establish this result, we construct a first-principles rational approximation to the Kerr Green's function from its QNM poles, physical residues, and horizon-frequency zeros. For particles plunging from the innermost stable circular orbit into Kerr black holes with spins 0.5-0.9, each QNM-pole contribution initially follows the source's instantaneous complex frequency and decouples only after the source decays faster than the corresponding mode. At late times, the source approaches a sum of damped oscillations at the third and higher horizon frequencies. The corresponding zeros in the Green's function cancel these source-frequency components in the coherent waveform, while the continuing drive generates oscillations at QNM frequencies. Thus, an apparently free QNM superposition can emerge before its individual contributions dynamically decouple from the source.
Read the full abstract
Nuclear Theory
MUSES workflows for pQCD constraints on dense matter with finite quark masses
We present a modular implementation of next-to-leading order (NLO) perturbative QCD (pQCD) thermodynamics with finite strange quark mass in the MUSES Calculation Engine, enabling reproducible connections between high-density QCD calculations and neutron star observables. Using this implementation, we investigate the interplay between flavor symmetry and physically motivated renormalization-scale prescriptions in cold, $\beta$-equilibrated quark matter. We compare prescriptions associated with the conserved-charge $BQS$, isospin $BI_3S$, and $SU(3)$ Cartan $BI_3Y$ bases, and show that their different symmetry properties at finite perturbative order can significantly affect the predicted flavor composition. In particular, while the $BQS$ and $BI_3Y$ prescriptions yield the same reduced $\beta$-equilibrated \eos{} for $\mu_S=0$, they can predict different flavor compositions, whereas the $BI_3S$ prescription generates additional contributions to the charge-neutrality condition and develops strong scale dependence at low chemical potentials. We then apply stability and causality constraints to investigate the effect of the strange quark mass on the neutron star \eos{}. In an exploratory benchmark at $\mu_B=2.4$~GeV and fixed fiducial renormalization scale, increasing the fixed strange quark mass from $m_s=0$ to $m_s=300$~MeV reduces the fraction of \eos{} in our prior that is incompatible with the pQCD constraint from 51% to 36% and qualitatively changes the region of \eos{} space that is selected, retaining greater support for stiffer behavior. These results motivate systematic studies of strange quark mass and renormalization-scale uncertainties in pQCD constraints. The MUSES implementation provides a modular framework for such extensions and for future higher-order calculations.
Read the full abstract
Logic
Frobenius Galois expansions of substructural logics:Algebraization, Kalman equivalence and positive cone semantics
The main aim of this paper is to introduce a Frobenius–Galois expansion of the substructural logic $\mathbf{FL}_{ew}$ and develop its algebraic and categorical semantics. The resulting logic, denoted by $\mathbf{FL}^{\mathbf{FGC}}_{ew}$, is obtained by adjoining a pair of unary connectives forming a Galois connection and satisfying suitable Frobenius-type compatibility conditions. Firstly, we prove that $\mathbf{FL}^{\mathbf{FGC}}_{ew}$ is algebraizable in the sense of Blok and Pigozzi and identify its equivalent algebraic semantics with the variety of Frobenius-adjoint residuated lattices, establishing the conservativity over $\mathbf{FL}_{ew}$ and relating its finite model property to residual finiteness of finitely generated free algebras. Secondly, for the distributive setting, we lift the Kalman construction to the Frobenius-adjoint algebraic framework. More precisely, we establish a categorical equivalence between Frobenius-adjoint residuated distributive lattices and Frobenius-adjoint $c$-differential residuated distributive lattices with the condition $\mathbf{CK}$. This equivalence yields a positive-cone representation of the former structures and, in turn, a logical counterpart of the categorical correspondence. Finally, for the distributive extension $\mathbf{FL}^{\mathbf{FGC},d}_{ew}$, we prove that derivability, validity over Frobenius-adjoint residuated distributive lattices, and validity over the corresponding positive cones determine the same consequence relation, and further show that this correspondence preserves equational and quasi-equational consequence, conservativity, and finite countermodels. These results provide a unified algebraic, categorical, and logical framework for Frobenius–Galois expansions of substructural logics.
Read the full abstract
Computer Vision
MotionBlind: Probing the Illusion of Motion Understanding in Video-LLMs
Video large language models (Video-LLMs) are increasingly used as the perceptual front end of world models, a role that assumes they can read motion: how fast something moves, which way it travels, how hard it is pushed. We show they cannot. A Video-LLM can watch two clips of the same person in the same room, name every object in both, and still fail to say which clip moves faster. We introduce MotionBlind, a contrastive benchmark of self-recorded video for physically grounded motion(speed, magnitude, and direction), the variables a world model must predict. Each instance is a pair of near-identical clips that differ only in motion. Each clip carries two complementary yes/no questions, giving four items per instance, and a model earns credit only if all four are correct. We report Instance Accuracy(IAcc), which has a 6.25% chance floor. Single-frame, appearance, and language-only shortcuts all collapse to it. MotionBlind complements the recent TimeBlind benchmark. We run a controlled study of six open and two frontier Video-LLMs, varying whether the video is present, whether frames are shown in the correct temporal order, and how frames are sampled (1 to 24 frames, four selection strategies). Open models sit near the 6.25% floor, and scale does not help. Removing the video drops every model to zero IAcc, and shuffling frames collapses IAcc to chance, so the task genuinely needs video in order. Neither more frames nor smarter frame selection closes the gap, because these change which frames are seen, not whether motion is read. Only Gemini3.1 Pro clears the benchmark overall, and even it fails on speed. A frontend that cannot tell two speeds of the same action apart is not yet a trustworthy source of supervision, reward, or evaluation for a world model.
Read the full abstract
Differential Geometry
Conformal boundary rigidity for simple Finsler metrics
In this paper, we consider the conformal boundary rigidity problem for Finsler metrics on a bounded domain. We establish stability estimates for determining the conformal factors of simple Finsler metrics in the same conformal class from their boundary distance functions. Our results provide the Finslerian version of the well-known stability estimates for Riemannian metrics.
Read the full abstract
Hardware Architecture
Benchmarking Agentic HLS Design Tasks With HLS-Eval
Large language models (LLMs) and AI agents are increasingly explored for hardware design, including high-level digital design. While most work targets code generation and editing for hardware description languages (HDLs), our prior work introduced HLS-Eval, an open-source benchmark for evaluating LLMs on high-level synthesis (HLS) design tasks. Those evaluations, however, focused on zero-shot generation and editing, leaving open how agents achieve HLS design tasks. We therefore extend HLS-Eval with an agentic evaluation flow built on the open-source mini-swe-agent framework. The flow lets HLS design agents use file-editing tools, invoke a C++ compiler for self-verification, and iteratively refine designs during inference, while logging agent traces for analysis of cost, token usage, and iteration count. We present initial results on the existing HLS-Eval benchmarks. In our initial evaluation, we find open-source LLMs paired with an agentic harness solve every simple HLS code generation task in our evaluation, underscoring the need to expand benchmark difficulty as model capabilities advance. Analyzing traces from passing and failing runs, we show how model size, token usage, and trajectory length relate to design pass rates. These results establish a foundation for agentic HLS design and motivate harder benchmarks and new agentic tooling as model capabilities progress.
Read the full abstract
Group Theory
Kleisli convolution representations and a Margolis–Sakurai version of the modular isomorphism problem
We introduce Kleisli convolution representations for groups, rings, and algebras. We show that their representation categories are equivalent to the usual ones for groups and finite-dimensional algebras, but for rings only recover modules whose underlying Abelian groups are free of finite rank. We also apply the Kleisli convolution representation to provide a partial answer to the Margolis–Sakurai version of the modular isomorphism problem: If $G$ is a finite $p$-group with $D_3(G)=1$ and $\gcd(m,c_G!)=1$, then $\mathbb F_{p^m}G\cong\mathbb F_{p^m}H$ implies $G\cong H$, where $c_G$ is the number of geometric connected components of $\mathrm{Aut}(\overline{\mathbb F}_pG)$.
Read the full abstract
Optimization and Control
Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps
We study the oracle complexity of computing a point with small fixed-point residual $\|T(x)-x\| \leq \epsilon$, for a general norm $\|\cdot\|$ and a self-map $T$ of a compact convex set. We study this problem in the setting where $T$ is nonexpansive with respect to the same norm $\|\cdot\|$ and accessed via an unbiased stochastic oracle with bounded variance $\sigma^2$. We provide an algorithm that solves such instances for any norm with a weak Rademacher type $q > 1$, with high probability. The algorithm is based on a recursive anchoring technique. For type-$2$ spaces, such as $\ell_p$-spaces for $p \in [2, \infty]$, our algorithm attains stochastic oracle complexity $\tilde O(\sigma^2 \epsilon^{-3} + \epsilon^{-1})$. We further prove a near-matching lower bound (i.e., matching up to poly-log factors) for such $\ell_{\infty}$-norm instances in high dimensions. Our lower bound holds against any randomized algorithm that succeeds with constant probability. It further extends to settings with “sparse” noise, where variance measured with respect to any $\ell_p$ norm is of the same order, ruling out the possibility of improving oracle complexity as a function of $\varepsilon$ by measuring variance in a non-matching $\ell_p$ norm.
Read the full abstract
Atomic Physics
A metastable state in $\mathrm{Yb}^+$ with lifetime greater than 10 minutes
We find through direct, time-domain measurement of trapped $\mathrm{Yb}^+$ ions that the excited ${}^3[11/2]_{9/2}^o$ state has a collision-free lifetime of 17.8(6) min, long enough for use in atomic clockwork or quantum information processing. We locate and benchmark a broad “repump” transition at $701\, \mathrm{nm}$ that readily transfers population back into the Doppler cooling cycle with the ground state, which may allow for quantum nondemolition measurement of sub-structure in the metastable manifold. Using a bi-stable Coulomb-crystal manometer, we find that the collisional quenching of this metastable ${}^3[11/2]_{9/2}^o$ manifold by background gas is more efficient than for ${}^2\mathrm{F}_{7/2}^o$, but nonetheless we observe an average lifetime exceeding 10 minutes at the base pressure of our apparatus.
Read the full abstract
Analysis of PDEs
Three-dimensional steady transonic shocks for the relativistic Euler equations
We investigates the transonic shock problem for steady relativistic Euler equations in hemispherical shells. We show the existence and uniqueness of spherically symmetric transonic shock solutions via the shooting method and the monotonicity between the exit pressure and shock position. Furthermore, without any restrictions on background transonic shocks, we prove the existence and stability of transonic shocks under three dimensional perturbations of the exit pressure. The key techniques involve the decoupling the hyperbolic and elliptic components in steady relativistic Euler equations using the deformation tensor and vorticity. To address the coordinate singularities, the “spherical projection coordinates" combining the spherical coordinates and the stereographic projection is employed. Subsequently, the Rankine-Hugoniot conditions are appropriately reformulated to determine the shock front and derive the boundary conditions on the shock front for a first-order nonlocal deformation-curl system.
Read the full abstract
Instrumentation and Detectors
Development and demonstration of the Korea ALICE Telescope using electron beams at KEK PF-AR
The development of ultra-low-mass, high-precision vertex detectors is a key requirement for future collider experiments and motivates extensive research and development of novel silicon tracking technologies. In this work, we present the development and beam-test demonstration of the Korea ALICE Telescope (KATS), a silicon-tracking telescope designed to support R&D on next-generation cylindrical vertex detectors, such as the proposed ALICE ITS3 upgrade. The telescope consists of six ALPIDE Monolithic Active Pixel Sensors (MAPS) used as reference tracking planes, a bent ALPIDE sensor serving as the device under test, and a scintillating-fiber-based trigger system, all housed in a light-tight modular enclosure. This setup enables precise track reconstruction and detailed performance studies of both planar and curved silicon sensors. Beam tests were carried out using high-energy electron beams at the KEK Photon Factory Advanced Ring (PF-AR). The telescope system operated stably under realistic beam conditions, and its tracking performance was successfully validated. The bent ALPIDE sensor was operated at a bending radius of approximately 18 mm, consistent with ITS3's design goals, without any observable degradation in detection performance. The measured results confirm that the KATS provides a versatile and reliable platform for studies of curved MAPS technologies, alignment precision, and tracking performance. These results provide important experimental validation of key technologies for future low-mass cylindrical silicon vertex detectors and establish KATS as a valuable facility for ongoing and future detector R&D.
Read the full abstract
High Energy Astrophysical Phenomena
Multi-Wavelength Identification of a Luminous Mid-Infrared Supernova Powered by Circumstellar Interaction with Binary-Driven Pre-supernova Mass Loss
Terminal mass-loss in massive stars is commonly reconstructed from observations of circumstellar interaction in core-collapse supernovae (CCSNe); however, such signatures can be easily missed depending on the phase when they appear. In this paper, we present a multi-wavelength study of SN\,2022yyz, a nearby CCSN selected by its luminous late-time mid-infrared (MIR) excess in NEOWISE at $> 500$ days after the discovery. Classified as a Type II SN at discovery, it reached a peak bolometric luminosity of $1.3^{+0.7}_{-0.4}\times10^{43}$ erg s$^{-1}$ before fading away with a light-curve drop at $\sim 300$ days. We present late-time HST/WFC3 ultraviolet (UV) imaging and Keck/LRIS spectroscopy at $\sim 1200$ days, which reveal clear signs of circumstellar-medium (CSM) interaction via a UV excess consistent with a strong MgII contribution and a flat-topped H$\alpha$ profile. We show that the bolometric light curve and the late-time UV luminosity can be explained using a semi-analytic CSM interaction model involving a broken power-law density profile: with $\sim 2.7~M_\odot$ of nearby, dense CSM within a radius of $\sim 10^{16}$ cm surrounded by wind-like outer CSM with a mass-loss rate of $\sim 10^{-4} {\rm ~M_\odot~yr}^{-1}$. The broken density profile indicates $\gtrsim 100\times$ mass-loss rate enhancement starting a few hundred years before explosion, pointing to a possible common-envelope ejection in a binary system. Despite being overlooked for follow-up at such proximity, our results demonstrate that IR photometric selection methods provide a powerful way of mapping terminal mass-loss in massive stars - laying the groundwork for the Roman Space Telescope surveys.
Read the full abstract
Hardware Architecture
HLSFactory-Agent: Large-Scale Agentic HLS Dataset Construction from Academic and Open-Source Projects
Building large, diverse datasets of high-level synthesis (HLS) designs beyond common community benchmarks remains an open challenge. This challenge is made urgent by the rise of deep learning and LLMs for hardware design, which demand such datasets to train QoR models and benchmark LLMs on HLS tasks. Despite ongoing efforts to broaden sources, dataset curation still depends on manual work: locating HLS designs across academic publications and open source, then extracting standalone designs from larger codebases. The process is error-prone and demands expert knowledge, iterative testing, and substantial per-repository engineering. To address this, we present HLSFactory-Agent, an LLM agent that automates large-scale HLS dataset curation by extracting standalone designs from larger codebases. HLSFactory-Agent runs the open-source Pi agent framework inside Docker containers to build and evaluate each extracted design. This turnkey automation allows users to pass a GitHub link or code directory to HLSFactory-Agent and receive a folder of extracted HLS designs ready to be integrated into the HLSFactory dataset framework. Additionally, we provide open-source scripts to scrape and index papers from computer architecture, EDA, and FPGA conferences that possibly implement or use HLS designs, allowing for faster human discovery and curation of HLS designs for HLSFactory-Agent. We report initial results from running HLSFactory-Agent across a small subset of our indexed repositories, demonstrating successful extraction of synthesizable designs from structured codebases. We open source HLSFactory-Agent and indexing scripts at https://github.com/sharc-lab/hlsfactory-agent.
Read the full abstract
Statistical Mechanics
The Role of Concentration in Determining NaCl Nucleation Mechanism: A Story of Pathways Coexistence
Deciphering the microscopic details of crystal nucleation remains a key open problem in chemical physics. For aqueous sodium chloride (NaCl), the extent to which nucleation involves amorphous ion aggregation, and the supersaturation regime in which two-step-like behavior emerges, remains actively debated. In this work, we examine NaCl nucleation at 12, 13, and 14 mol/kg ($S = 3.2, 3.5, 3.8$) using unbiased path sampling with $\infty$RETIS. Through a combination of reaction coordinate analysis, joint and conditional probability distributions, diffusion tensor analysis, and conditional free energy landscapes, we identify nucleation pathways without a priori mechanistic assumptions. While all concentrations are governed by the same reaction coordinate, indicating that nucleus growth and structural ordering are central to crossing the barrier, the nature of reactive trajectories changes with supersaturation. At lower concentrations, nucleation mainly occurs via tightly coupled increases in cluster size and ordering, compatible with a one-step-like mechanism. As concentration increases, amorphous aggregation becomes increasingly decoupled from crystallization, and pathways involving substantial amorphous growth prior to crystallization become progressively more probable. Importantly, these pathways coexist within a single broad reaction channel rather than proceeding through distinct metastable intermediate states. Together, these results reconcile earlier, contradictory reports on NaCl nucleation mechanisms and support a view of nucleation as an ensemble of competing reactive pathways whose relative probabilities vary continuously with supersaturation. More broadly, our findings illustrate that substantial mechanistic diversity can emerge within a classical nucleation framework, without requiring distinct non-classical descriptions.
Read the full abstract
Plasma Physics
All field strengths are possible locally in Boozer coordinates
The magnetic field strength is a central design object in the theory of magnetic confinement of plasma. Desirable confinement properties such as quasi-symmetry and omnigenity are characterized by special forms of the field strength when it is given in the particular coordinate system called “Boozer coordinates." We ask a basic realizability question: which functions of Boozer coordinates can arise as the magnitude of a magnetic field that is written in Boozer coordinates? Using exterior differential systems and the Cartan-Kähler theorem, we show that every positive analytic function is locally realizable. Thus there is no local analytic obstruction to prescribing the field strength in Boozer coordinates; though further restrictions might arise from global geometric or additional physical constraints.
Read the full abstract
Statistical Methodology
Differential Privacy Guarantees in Small Area Estimation
Statistical agencies increasingly rely on small area estimation to produce reliable estimates for subpopulations with limited sample sizes. These estimates are built from individual survey responses, so agencies must ensure that releasing them does not reveal information about any single respondent. We show that when a single draw from the posterior distribution of the Bayesian Fay-Herriot model is released, pure $\varepsilon$-differential privacy is unattainable, but the release satisfies formal privacy guarantees under Rényi differential privacy and zero-concentrated differential privacy without any noise being added, provided we treat the variance components as fixed. The key insight is that the posterior draw equals the posterior mean plus the Gaussian noise whose variance equals the posterior variance. The guarantee is thus governed by the sensitivity of the direct survey estimate and the posterior variance, and applies equally to a release of the posterior mean with that amount of noise added. For binary outcomes estimated with the Hájek estimator, the sensitivity equals the largest survey weight in the area divided by the sum of the weights. For the intercept-only model we derive exact coefficients describing how a change in one record propagates to every area's posterior mean, giving finite-sample per-area guarantees and a joint guarantee for releasing all areas at once that exceeds the largest per-area guarantee by at most a few percent in our applications. Two applications, poverty prevalence across 2,462 Public Use Microdata Areas in the American Community Survey and smoking prevalence across 52 substrata in the Washington state Behavioral Risk Factor Surveillance System, show that the guarantee is driven far more by the inequality of the survey weights than by the sample size, and that the shrinkage of the model tightens it substantially.
Read the full abstract
Optimization and Control
Global Optimization Framework for Automated Low-Thrust Gravity-Assist Trajectory Design
Gravity-assist trajectory design requires searching numerous leg combinations, but applying nonlinear programming (NLP) for low-thrust trajectory optimization to all combinations is computationally prohibitive. Therefore, conventional frameworks first perform broad search using lightweight trajectory models such as Lambert-based calculation and simplified deep-space maneuver models, while pruning infeasible candidates. However, to maintain efficiency, conventional approaches handle only low-dimensional formulations with limited constraints such as up to a couple of impulse maneuvers per leg. Consequently, they cannot accommodate the constrained multivariable optimization required for low-thrust design, running the risk of prematurely pruning viable trajectories. To address this, this paper introduces a convex pruning approach capable of solving constrained multivariable problems directly within broad search while retaining the computational efficiency. We then augment the broad search stage with a robust local low-thrust optimization algorithm based on thrust regularization, which together enable global exploration and optimization in an automated fashion. We apply the proposed framework in a BepiColombo-inspired scenario involving nine gravity assists, successfully demonstrating its broad search capability to discover a far greater number of solutions (36,335) compared to a conventional approach (4,664) while identifying a wider feasible launch window by one year.
Read the full abstract
Combinatorics
Counting Lie ideals of niltriangular matrices
We give an explicit finite sum for the number of ideals of the Lie algebra of strictly lower triangular $n\times n$ matrices over $\mathbb F_q$, valid for every prime power $q$. The sum runs over integer compositions, with weights expressed using ordinary and Gaussian binomial coefficients. A contraction bijection transforms Gagnon's configuration sum into a weighted enumeration of nonnesting partitions, with antichains of intervals chosen independently in each block. We derive a Stieltjes continued fraction for the block weights. Lagrange inversion and the coefficient formula for Stieltjes–Rogers polynomials then yield the explicit sum.
Read the full abstract
Computer Vision
AnimalLift: Reconstructing Animatable 3D Animals from a Single Image by Learning Canonical Shape, Texture, and Fur Maps
Reconstructing a fully animatable 3D animal from a single image remains challenging because animation-ready assets require not only plausible geometry, but also a unified topology, editable appearance, and fur representations compatible with deformation and simulation. Existing image-to-3D approaches often rely on implicit or loosely structured representations that are difficult to rig or edit, while parametric animal models support animation but cannot capture detailed texture and fur appearance. We present AnimalLift, a framework for reconstructing structured, animation-compatible 3D animal assets with explicit fur from a single image. Our method lifts an input image into a shared canonical space with a consistent topology and UV parameterization across the dataset, enabling joint prediction of canonical geometry, texture, and fur in a unified feed-forward architecture. A key component of our representation is a UV-aligned fur map that encodes strand geometry in a surface-aligned canonical domain, allowing explicit fur reconstruction compatible with mesh deformation and fur simulation. To train the model, we introduce a procedural data generation pipeline that provides large-scale supervision with aligned geometry, texture, and fur across diverse animal species and appearances. Experiments on synthetic and real-world datasets demonstrate strong reconstruction quality and generalization across animal categories. Beyond reconstruction, our structured representation directly supports downstream applications including animation, pose transfer, fur editing, and simulation-compatible rendering.
Read the full abstract
Analysis of PDEs
Global well-posedness for the four-dimensional repulsive Vlasov–Poisson system and for Vlasov–Riesz equations
We establish global classical well-posedness for the four-dimensional repulsive Vlasov–Poisson system, for every nonnegative \(f_0\in C_c^1(\mathbb{R}^8)\). We also prove global well-posedness for Vlasov equations with power-law interactions for \(d\ge4\). For every \(0<\alpha<3\), we treat both attractive and repulsive interactions with arbitrary nonnegative, compactly supported bounded initial data. Neither result requires a smallness assumption on the initial data. For attractive interactions, a virial argument yields finite-time breakdown for negative-energy solutions when \(3\le\alpha<d+1\). The global existence proofs combine estimates along characteristics, analysis in Lagrangian coordinates, and Serre's compensated integrability.
Read the full abstract
Signal Processing
Adaptive Distributed Physical-Layer Authentication and Attack Detection in 6G Non-Terrestrial Networks via Causal Meta-Learning
Physical-layer authentication (PLA) in non-terrestrial networks (NTNs) is challenged by severe Doppler shifts, long delays, and fast channel variations, which cause distribution shifts and degrade conventional learning methods. Existing PLA schemes often rely on single features or generalize poorly to unseen environments. This paper proposes a secure adaptive framework for authentication in multi-zone networks (SAFA-MZ), a causal meta-learning framework for distributed PLA (DPLA) in NTNs. First, we design a multi-feature fingerprint that combines spatial, angular, combiner, subspace, and Doppler-delay features. The fingerprint is adaptive and distributed, as it fuses heterogeneous physical-layer features and measurements from multiple aerial nodes. Second, we formulate a structural causal model (SCM) to capture the relations among design choices, environmental factors, extracted features, and authentication outcomes. Third, we develop a model-agnostic meta-learning (MAML) strategy with invariant risk minimization (IRM) and causal consistency regularization for fast adaptation to unseen NTN environments with few labeled samples. Fourth, we propose a two-stage authentication scheme that performs local recognition and activates time-difference-of-arrival (TDOA) localization with a graph attention (GAT) network only when needed, which reduces backhaul overhead. Simulations show that SAFA-MZ achieves 92% accuracy and 96% AUC, outperforming centralized deep learning and single-feature baselines across diverse environments.
Read the full abstract
Image and Video Processing
CHIMERA Challenge Task 2 and 3: Response Subtypes Classification and Progression Survival Prediction in Bladder Cancer Patients using Multimodal Datasets
High-risk non-muscle-invasive bladder cancer (HR-NMIBC) carries substantial risks of recurrence and progression, while current clinical risk stratification remains limited. CHIMERA was established as a multimodal AI challenge to benchmark prediction in HR-NMIBC under standardized evaluation. Task BRS predicts RNA-seq-defined BCG Response Subtypes from histopathology and structured clinicopathological data, whereas Task Progression models time-to-progression using histopathology, structured data, and RNA sequencing. A multimodal dataset of 368 patients was divided into public training and hidden validation and test sets. In total, 159 submissions were made, and 13 top-performing models were selected for benchmarking. The best models achieved a weighted F1 score of 0.73 for Task BRS and a C-index of 0.68 for Task Progression. Post-challenge analyses revealed task-dependent modality contributions, cohort-dependent performance degradation, and sensitivity to missing structured data. In Task BRS, histopathology partly compensated for pathology-derived structured variables, whereas progression models showed greater dependence on complementary inputs. Cross-model error analysis further identified patients that were consistently difficult across different architectures, with T1 substage associated with prediction difficulty. These findings highlight barriers to transportability and the importance of missingness-aware modeling and independent multi-institutional validation. CHIMERA provides a standardized multimodal benchmark for bladder cancer and a framework for studying not only model performance, but also robustness, information sufficiency, and patient-level prediction failure.
Read the full abstract
Number Theory
Models of Elliptic Curves with Maximal 2-adic Image Subject to a Rational 2-Isogeny
Let $E$ be a non-CM elliptic curve defined over $\mathbb{Q}$. We present models of curves that have 2-adic image as large as possible, given the constraint that they have a rational 2-isogeny. These curves are known to be generic, and one of the aims of this article is to make that fact explicit. Our techniques make use of modular curves and their $j$-maps, as well as classification results on isogeny-graphs that have appeared in the literature recently.
Read the full abstract
Combinatorics
A lattice path model for the volume of the Monge polytope
Monge matrices arise throughout combinatorial optimization and algorithm design; the Monge polytope $\mathcal{M}_{pq}$ is the set of $p \times q$ Monge matrices lying inside the standard simplex on the set of matrix coordinates. We find a Stanley decomposition of the associated affine semigroup, and use it to obtain a volume formula for $\mathcal{M}_{pq}$ expressed as a sum over "Z-avoiding" Delannoy paths in a $p \times q$ grid. An efficient dynamic-programming implementation of this formula computes the volume in dimensions far beyond the reach of general-purpose exact-volume algorithms (e.g., the volume of $\mathcal{M}_{20,20}$, which has dimension 399, is computed in a fraction of a second). As a corollary of our Stanley decomposition, we also obtain a combinatorial closed form for the Ehrhart series of $\mathcal{M}_{pq}$.