Peer Revenue Publish or profit

Papers

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

All of arXiv

Sunday 6 September

Functional Analysis

Partition invariance of variation indices and classical $p$-variation spaces

We study the variation index of a continuous path along a refining partition sequence, defined as the infimum of exponents $p\ge1$ for which the corresponding $p$-th variation sums are uniformly bounded. Under natural geometric assumptions on the partitions, we prove that this index coincides with the classical variation index, defined using all finite partitions, for every path with positive Hölder regularity. The result extends to paths with an all-orders Dini modulus and yields a characterization of the classical variation index in terms of dyadic Faber–Schauder coefficients. Explicit counterexamples show that the partition assumptions cannot in general be omitted. Even under these assumptions, however, membership in the corresponding function spaces at the critical exponent may still depend on the partition sequence. We further obtain compact subcritical embeddings into the space of paths with vanishing classical $p$-variation and establish a strict hierarchy of coefficient and variation spaces. Finally, we show that the continuous embedding of the classical $p$-variation space into the space of continuous paths with uniformly bounded dyadic $p$-th variation sums has nonclosed range.
Read the full abstract

Artificial Intelligence

MARBO: Relational Belief Grounding for LLM Agents in Social Deduction Games

Social deduction games (SDGs) require agents to reason under partial observability by maintaining relational beliefs about hidden roles and team alignments. While recent LLM-agent approaches improve gameplay through prompting and preference optimization, they often optimize actions and in-game speech without explicitly grounding them in such beliefs. This frequently leads to strategically inconsistent behavior, especially for compact LLM agents. We introduce Multi-Agent Relational Belief Optimization (MARBO), a belief-grounded preference optimization framework that leverages relational beliefs to guide strategic decisions and in-game speech. MARBO provides preference feedback only when behaviors are supported by reliable relational beliefs and lead to strategically favorable social outcomes, encouraging more consistent learning under uncertainty. Experiments on representative SDGs show that MARBO enables compact LLM agents to consistently outperform existing baselines. The Code is available on https://github.com/PleaseTakemeAway/MARBO.
Read the full abstract

All authors Yechan Hwang, Sangjun Bae, Jeongmo Kim, Sangwoo Bang, Seungyul Han

Plasma Physics

Magnetic island structures in relativistic laser-driven plasma channels

We develop a theoretical model for self-generated magnetic islands in relativistic laser-driven channels in near-critical-density plasmas. The islands arise from the nonlinear superposition of the quasi-static magnetic fields generated by the longitudinal channel current $j_x$ and the laser-front driven transverse current $j_y$. By deriving the critical conditions among laser depletion, transversely symmetric channel formation, and magnetic-island formation, we identify the laser-plasma parameter window in which the magnetic island structures can exist. Within this window, the balance between the laser ponderomotive force and the charge-separation force, expressed through an effec tive electron density $n_\mathrm{eff}$, determines the transverse island width $H$, whereas the mismatch between the laser group and phase velocities determines the longitudinal period $L$. Large-scale particle-in-cell simulations over a broad range of laser intensities and plasma densities validate the resulting scaling laws. The model turns the island geometry from a qualitative feature of the channel field into a predictable quantity, providing a basis for tailoring electron transport, particle acceleration, high-energy radiation, and novel fusion ignition schemes in relativistic laser-plasma interactions.
Read the full abstract

All authors Dongchi Cai, Zheng Gong, Guanqi Qiu, Deji Liu, Yinren Shou, Xueqing Yan

Mesoscale and Nanoscale Physics

Three-Dimensional Fermiology and Thickness-Tuned Magnetotransport in Single-Crystalline Antimony Flakes

The extreme magnetoresistance of compensated semimetals is governed by both the Fermi-surface geometry and carrier relaxation, but these contributions are difficult to disentangle in finite-size structures. Here, we combine longitudinal and Hall magnetotransport measurements with temperature- and angle-dependent Shubnikov–de Haas oscillations in single-crystalline Sb flakes grown by chemical vapor deposition (CVD), with thicknesses ranging from 110 to 783 nm. As thickness increases, the non-saturating MR at 2 K and 14 T rises nearly 30-fold, reaching $7.13\times10^{5}\%$, while the primary frequency $F_{\alpha}$ remains approximately 99 T without any systematic shift. A joint three-channel analysis of $\rho_{xx}(B)$ and $\rho_{xy}(B)$ reveals that this evolution is driven by an increase in the mobility of a nearly compensated electron–hole pair, rather than by a reconstruction of the primary pockets. Angle-dependent measurements confirm the existence of a closed three-dimensional $\alpha$ pocket, and a reproducible high-frequency sector (335-377 T) is consistent with the electron $\beta$ orbit of the $L$-point pockets in bulk Sb. Together, the transport and quantum-oscillation results show that thickness tunes extreme MR through dimension-dependent scattering while preserving bulk-like fermiology.
Read the full abstract

All authors Mikhail Gaponov, Jicheng Wang, Liang Zha, Rui Wu

Signal Processing

Large-System Analysis of Sparse Bayesian Learning

Sparse Bayesian learning is widely used for sparse linear inverse problems, yet its large-system stationary behavior remains poorly understood because all variance hyperparameters are estimated from the same data. We study classical sparse Bayesian learning, formulated as evidence maximization (type-II maximum likelihood), for underdetermined linear models with sensing matrices having independent and identically distributed Gaussian entries, Gaussian measurement noise, and an unknown deterministic signal sequence. Hyperparameter reoptimization induces a nonvanishing feedback term: a typical coordinate obeys a reoptimization-corrected scalar Gaussian law whose signal coefficient is governed by the normalized adaptive response rather than the frozen resolvent trace. A one-coordinate leave-one-out construction gives an exact conditional Gaussian law, which is transferred to a selected full stationary branch without assuming asymptotic closeness of the reduced and full stationary vectors. Combining this law with the Karush–Kuhn–Tucker conditions of the evidence objective yields a generally set-valued scalar relation and three branchwise large-system consistency relations. If the model noise variance is jointly estimated by evidence maximization, interior joint stationarity yields an exact finite-dimensional equality between the normalized residual energy and normalized resolvent trace. When the limiting signal law has nonzero mass at zero, this identity further yields a parameter-free asymptotic chi-square null law. Under an additional differentiability condition on the selected scalar branch, the large-system characterization also gives a closed relation for the reconstruction error of the posterior mean. The analysis is stationary-point based and permits multiple stationary branches.
Read the full abstract

Number Theory

Methods to Find Integer Points on the Elliptic Curve of Factorizable Polynomial Equation

As a valuable theoretical and application problem, the integer points on two types of elliptic curve y^2=(x-a)(x-b)(x-c) and y^2 = (x-a)(x^2+ax+b) are studied. By using elementary number theory method, the solution of the original equations is reduced to the solution of simultaneous Pell equations or generalized Pell equation, which can improve the efficiency in searching integer solutions by computer. Effective methods are proposed to find the integer solutions of the equations, which are convenient for algorithm programming implementation. At the same time, the derivation of the methods leads to two sufficient conditions, which can determine the unsolvability of these two types of equation respectively. The methods proposed are for equations with undetermined coefficients, which are more general than the solutions of the equations with specific known coefficients, and more suitable for computer programming implementation.
Read the full abstract

Metric Geometry

Non-Separable Homothetic Triangles, Part I: Constructions and Lower Bounds

A finite family of planar convex bodies is called a non-separable family if no line disjoint from its union has at least one member in each open half-plane. In this paper, we prove that there exist finite non-separable families of positive homothetic triangles with covering factors strictly exceeding the sharp three-member bound $\mu = \frac{2}{3} + \frac{2}{3\sqrt{3}}$. This resolves negatively a question posed by K. Bezdek and Z. Lángi, who originally established this three-member bound after proving that the classic factor 1 covering theorem by A. W. Goodman and R. E. Goodman for disks fails for arbitrary positive homothets. Besides giving explicit algebraic examples with four, five, and six members having factors of approximately 1.0533161, 1.0551900, and 1.0572061 respectively, we provide a common cyclic recurrence that yields a 303-member family with the exact factor 250000000/235141779. Finally, we derive a continuous model suggested by increasingly fine recurrences, yielding a numerical candidate of 1.0633083; its attainability and optimality remain open.
Read the full abstract

Machine Learning

Hidden in Plain Sight: The Overlooked Significance of Canonical Elements for Extreme LLM Sparsity

Large language models (LLMs) are often considered fragile under aggressive sparsification, and maintaining reliable performance typically requires sticking to moderate sparsity levels. However, recent studies suggest that LLMs are more resilient to high sparsity than previously thought, reframing the problem as a design challenge rather than a fundamental limitation. In this work, we challenge the perceived limits of unstructured post-training LLM pruning by revisiting elementary pruning strategies that have remained relatively underexplored at this scale. Through a progressive sparsification framework with second-order saliency and continued training coordinated with sparsity progression, we show that pretrained LLMs can retain strong performance far beyond commonly studied sparsity regimes. Across LLaMA-2 and Qwen-3 model families, our approach improves perplexity and downstream accuracy up to 99% sparsity, surpassing both the current state-of-the-art and representative baselines. Precisely, on LLaMA-2-7B, our approach achieves WikiText-2 perplexities of 13.48 and 19.67 at 95% and 99% sparsity, respectively, while delivering 3.23$\times$ decoding speedup and 6.21$\times$ memory savings at 95% sparsity. Taken together, our results show that LLMs can be pushed into extreme sparsity while retaining strong performance, providing a foundation for further improving sparse models in this regime.
Read the full abstract

All authors Hyeondo Jang, Kwanhee Lee, Dongyeop Lee, Namhoon Lee

Classical Analysis and ODEs

Some constructions of restricted Kakeya sets

In this paper, we consider Kakeya sets with the additional restriction that centers of the unit line segments belong to a given set. In particular, for every uncountable Borel set $A\subset\mathbb{R}^d$, $d\geq 2$, we construct a compact subset of $\mathbb{R}^d$ of Lebesgue measure zero that contains, in every direction, a unit line segment whose center lies in $A$. Notice that every such Kakeya set (not even necessarily compact) must have positive Lebesgue measure if $A$ is countable. So our result shows that the countability is in fact the only obstruction.
Read the full abstract

All authors Cheng Chen, Jianbin Li, Longhui Li, Bochen Liu, Ruichen Sun, Haoran Wang, Saijie Zhou

Optimization and Control

Localize, Restart, Accelerate: Stochastic Optimization under Generalized Smoothness

We study stochastic convex optimization under asymmetric \((L_0,L_1)\)-generalized smoothness, a model motivated by machine-learning objectives whose local curvature may grow with the gradient norm. We assume an unbiased first-order oracle with additive norm-sub-Gaussian noise. Acceleration is difficult in this setting because momentum may enter regions of much larger curvature, while stochastic gradients cannot reliably certify an unrestricted trajectory. We propose ARC-SG, a two-phase accelerated method: Phase~I reduces excessively large gradients using a generalized-smoothness-aware stochastic step, then Phase~II solves strongly convex proximal subproblems by a restarted accelerated solver confined to certified smoothness balls. Exact proximal points do not increase the gradient norm, allowing these certificates to propagate through the outer loop. The contribution is a query-by-query certified-localization construction with explicit generalized-smoothness factors and a strongly convex restart extension. ARC-SG achieves, with high probability, an accelerated optimization contribution and smooth-subclass-optimal statistical dependence on accuracy, up to logarithmic and generalized-smoothness factors. Its convex accuracy exponents agree with a contemporaneous public stochastic-acceleration result under a broader smoothness and affine-variance model; our distinction is the certified geometry, explicit parameter accounting, and strongly convex guarantee. The results recover classical accelerated stochastic rates when \(L_1=0\). Experiments on objectives with unbounded gradients illustrate the two-phase mechanism and its finite-budget advantage.
Read the full abstract

All authors Darina Dvinskikh, Alexander Gasnikov, Aleksandr Lobanov, Ilgam Latypov

Number Theory

Fields of definition of $p$-torsion points of elliptic curves and their ramification

Let $E$ be an elliptic curve over $\mathbb{Q}_p$. We study the field $\mathbb{Q}_p(E[p])$ generated by the $p$-torsion points of $E$. When $E$ has good reduction, we determine not only $\mathbb{Q}_p(E[p])$ but also the field $\mathbb{Q}_p(P)$ for every point $P\in E[p]$. This classification yields criteria for the existence of $p$-torsion over unramified and Lubin–Tate extensions of $\mathbb{Q}_p$. As a global application, let $E/\mathbb{Q}$ be an elliptic curve and let $p$ be an odd prime of good reduction. Define $f_p(E)$ to be the multiplicative order of $a_p(E)$ modulo $p$ in the ordinary case, and set $f_p(E)=p^2-1$ in the supersingular case. We prove that $E(K)[p]=0$ for every number field $K/\mathbb{Q}$ with $[K:\mathbb{Q}]<f_p(E)$. When $E$ has bad reduction, we describe the ramified part of $\mathbb{Q}_p(E[p])/\mathbb{Q}_p$. For every reduction type, we determine the maximal upper ramification break of $\mathbb{Q}_p(E[p])/\mathbb{Q}_p$.
Read the full abstract

Metric Geometry

The Converse Problem for the Morley Tetrahedron: Counterexamples, Conjectures, and Partial Results

In a paper in Acta Mathematica Hungarica the author proved that the Morley tetrahedron of an isosceles tetrahedron, obtained by trisecting the six dihedral angles, is again isosceles, and proposed two converse conjectures. We show that both are false. There is a nonisosceles tetrahedron $T_1$ and an isosceles, nonregular tetrahedron $T_2$ whose Morley tetrahedra are regular, and there are nonisosceles tetrahedra, even a two-parameter family of tetrahedra without any symmetry, whose Morley tetrahedra are isosceles. In $T_1$ and in $T_2$ there is a pair of opposite edges such that the other four edges are equal, and we conjecture that a regular Morley tetrahedron always forces this. We prove the conjecture for every tetrahedron with a nontrivial symmetry, and we show that, up to similarity, the regular tetrahedron, $T_1$ and $T_2$ are the only tetrahedra with this edge pattern and a regular Morley tetrahedron. The tetrahedron $T_2$ has $AB=CD=1$ and $AC=AD=BC=BD=\sqrt{(21+4\sqrt6)/45}$, while $T_1$ is given by a root of a sextic with Galois group $S_6$ and cannot be expressed by radicals. We also prove that a tetrahedron with a regular Morley tetrahedron is regular if it is orthocentric, if it is isodynamic, if its three sums of opposite edges are equal, if it has three equal edges at a vertex, if it has an equilateral face, or if none of its dihedral angles is larger than $95^\circ$; the tetrahedron $T_2$ has two dihedral angles of about $98.7^\circ$. For isosceles Morley tetrahedra we conjecture that $(AB^2-CD^2)(AC^2-BD^2)(AD^2-BC^2)\ge0$ and that $AB=CD$ forces a second pair of equal opposite edges. We also conjecture that a tetrahedron with $AC=BD$ whose Morley tetrahedron satisfies $A'B'=B'C'=C'D'=D'A'$ has a nontrivial symmetry. Some proofs are computer assisted; they use exact rational arithmetic or interval arithmetic with outward rounding.
Read the full abstract

High Energy Physics (Theory)

Fermionic hidden zeros

We uncover and prove a general class of hidden zeros in tree-level amplitudes with massless fermions. For arbitrary even numbers and arbitrary arrangements of massless real adjoint fermions and gluons, color-ordered gauge-theory amplitudes in $D=4,6,10$ vanish on general rectangular kinematic loci supplemented by species-dependent bridge conditions. The fermion–fermion bridge is governed simply by the vector current $\chi_i\gamma^\mu\chi_j$, while mixed and gluonic bridges are fixed by the corresponding gauge-covariant contractions. A worldsheet analysis proves the result at arbitrary multiplicity and traces its universality to the local fusion channels $ff\to g$, $fg/gf\to f$, and $gg\to g$, with no new primitive bridge structures appearing at higher fermion multiplicity. The same mechanism extends to ten-dimensional amplitudes with gravitons and arbitrary even numbers of gravitinos in factorized gamma-traceless polarizations, and to single-trace Einstein-Yang-Mills amplitudes with adjoint gluinos and gravitons. These results expose a finite local structure underlying fermionic hidden zeros across gauge and gravitational amplitudes.
Read the full abstract

Distributed Computing

EStream: Fast and Memory-Efficient MoE Prefill through Expert Virtualization on Mobile NPUs

Mobile vendors and application developers increasingly deploy LLMs on smartphones for diverse prefill-only services. Yet current systems rely mainly on dense models whose regular computation maps efficiently to mobile NPUs, leaving more capable MoEs underused. MoE prefill does not fit mobile NPUs: NPU graphs are fixed at compile time, yet MoE picks experts at runtime; and one request touches most experts, more than a phone can hold in memory. We present EStream, which resolves both by separating what the NPU must fix from what MoE decides at runtime. A single compiled expert graph serves every expert, with each expert's routed tokens and weight address bound at call time, so dynamic MoE execution runs entirely on the NPU without padding or CPU/GPU fallback. Expert virtualization keeps the expert pool in UFS flash storage and pages it through a fixed-size NPU-addressable arena, group by group, with loading hidden behind computation, so memory is bounded by the arena rather than by the model. It further introduces a hardware-aware configuration algorithm that automatically configures the UFS–NPU pipeline and maximizes loading–computation overlap. Across 18 comparative settings covering three 7B–16B MoEs and 256–4,096-token prompts, we evaluate EStream on a commercial Snapdragon smartphone. Compared to the fastest baseline at each setting, EStream achieves a 2.25–27.57X pure-prefill TTFT speedup and reduces peak physical memory by 1.19–12.29X. EStream further scales to MoE models with up to 46.7B parameters.
Read the full abstract

All authors Junming Zhang, Zhenzhe Zheng, Fan Wu, Xiaoyao Huang, Jie Wu

Statistical Methodology

Graph-Based Change-Point Detection for Partially Observed High-Dimensional Data

Partial missingness is common in high-dimensional data, but most existing change-point procedures are developed for fully observed sequences. We introduce gMiss, a graph-based framework for testing and localizing a change in the observed-data distribution of a partially observed high-dimensional sequence. The method treats the observed values together with the missingness indicators as the object of inference, so the target alternative is a change in the induced observed data law. It is designed for general distributional changes and requires neither sparsity nor Gaussianity. When the augmented observations are independent, the full permutation test controls type I error in finite samples. The procedure combines graph scans based on elementwise imputation and distance imputation. The two scans capture complementary graph patterns. Simulation results indicate that gMiss maintains accurate null calibration across the MCAR and MAR designs considered, remains competitive under Gaussian location alternatives, and exhibits strong power and localization performance in many non-Gaussian location and scale settings. We further illustrate the practical utility of the method through an application to genomic copy-number data, where gMiss identifies additional candidate boundaries that are visually plausible in the raw heatmap.
Read the full abstract

Instrumentation and Methods for Astrophysics

Generating radio continuum survey maps of arbitrary size with latent diffusion models

Radio surveys provide exponentially increasing amounts of observational data, which requires the development of novel data reduction and analysis methods. To this end, realistic simulations of observational data provide controlled environments for testing and developing new methods. Diffusion models excel at synthesizing realistic image data, but are limited by size constraints and high computational demands. We implemented a latent diffusion model (LDM) to synthesize realistic radio survey map cutouts. Further, we developed a technique for sampling radio survey maps of arbitrary size with the LDM. This is done by sampling in multiple sequential steps, whereby consistency is provided through context vectors and image inpainting. We trained our model on observations from the LOFAR telescope obtained from the third data release of the LOFAR Two-Metre Sky Survey. We implemented a LDM composed of a vector-quantized variational autoencoder and a diffusion model operating on the resulting latent representations. We added information on source locations, brightness and sizes by extracting parameters from the public source catalog and encoding them into a vector format passed as context to the LDM. We trained the model for image inpainting to facilitate continuous sequential sampling. We were able to generate realistic cutouts of 512 pixel side length, corresponding to ~5.7 arcmin, with precise control over source locations and brightness. Control over source extension was achieved at lower precision. Sampling of arbitrary-sized maps was made possible, showing realistic results with seamless combination of individual samples and limited only by occasional sampling artifacts.
Read the full abstract

Classical Physics

Induced electromotive force of a thin metal rod in the alternating electromagnetic field of Helmholtz coil: experimental results and theoretical analysis

We apply a thin metal rod (copper rod) as a probe in the alternating magnetic field generated by a Helmholtz coil, and measure the variation of the induced electromotive force (EMF) on the metal rod at different radial positions of Helmholtz coil. Experimental results show that the induced EMF is zero when the center of the metal rod passes through the center of the cylindrical magnetic field inside the Helmholtz coil. When the metal rod is displaced from the center of field to different radial positions, the induced EMF gradually increases from zero, reaches a maximum at a certain position, and then decreases monotonically as the radial distance continues to increase. At the position where the induced EMF reaches its maximum, the metal rod intersects the radial cross-section of the internal magnetic field of the Helmholtz coil at two points, with a small central portion of the rod located inside the Helmholtz coil and the two end portions outside the coil. To explain the experimental phenomena, we construct four simplified models of the magnetic field distribution based on the actual field distribution of the Helmholtz coil to quantitatively investigate the radial variation of the induced EMF along the metal rod. Our theoretical results show that the four models yield similar results and can all qualitatively explain the experimental data curves, particularly reproducing well the variation trend of the induced EMF and the position of the extremum point. The result of piecewise function fitting model is quantitatively in good agreement with the experimental data. This work is also very much helpful and instructive for undergraduate-level students.
Read the full abstract

All authors Yilin Shao, Minghan Gao, Baiqing Li, Xiaoguang Li, Chengfu Mu

Robotics

SHIFT: Surface-aware High-speed Integration For TSDFs

Real-time 3D mapping is fundamental for autonomous robotic navigation, with Euclidean Signed Distance Fields (ESDFs) serving as the standard representation for online motion planning. While recent advancements in non- projective distance fields yield highly accurate maps, their computational overhead remains a severe bottleneck. Conventional integrators redundantly re-fuse millions of depth pixels every frame, even long after the corresponding voxels have converged, wasting significant computational resources in environments dominated by large planar surfaces. In this paper, we present SHIFT (Surface-aware High-speed Integration For TSDFs), an efficient mapping framework designed to reduce this per-frame update cost. By exploiting structural redundancy directly from 3D depth geometry, SHIFT compresses flat local regions into weighted super-rays and freezes flat-voxel gradients. A compact ESDF voxel layout further reduces the memory footprint of the remaining wavefront. Extensive evaluations across various RGB-D and LiDAR sequences show that SHIFT cuts TSDF cost by 1.42 to 4.07 times, while holding mesh error within millimeters, and reduces ESDF-layer memory by up to 28%
Read the full abstract

Numerical Analysis

Introductory Notes on Learning$^2$

Although machine learning can be used to predict the evolution of physical systems from data, a formulation that learns only the system state at each time leaves the temporal and dynamical structure of the solution to be resolved within a broad hypothesis space. We introduce Learning$^2$, a representation-level framework that structures this space by coupling a primary representation to a second representation through a known physical transformation. The resulting cross-representation constraint restricts the effective hypothesis space and provides an ante-hoc, physically interpretable criterion for excluding solutions that satisfy the primary representation alone. We instantiate Learning$^2$ through EuLaNet, an Eulerian–Lagrangian representation for fluid dynamics. Given the velocity state $u(\mathbf{x},t)$, EuLaNet constructs its induced Lagrangian flow map $X(\mathbf{a},t)$ through $\dot{X}(\mathbf{a},t)=u(X(\mathbf{a},t),t)$, from which material transport and finite-time deformation are derived. The resulting representation couples the predicted state to the dynamical consequences it induces, providing a second consistency criterion beyond state-level agreement. We formalize this construction through an effective hypothesis space $\mathcal{H}_{L^2}\subseteq\mathcal{H}$ and define the conditions under which a consequence representation provides discriminative constraints on candidate solutions. EuLaNet is implemented as a model-independent representation module, separating the physical constraint from the downstream learning architecture. This construction provides an ante-hoc mechanism for physically interpretable constraint in scientific learning and offers a basis for developing and evaluating broader classes of Learning$^2$ architectures. The implementation is open-sourced to support the development and extension of the architecture across scientific domains.
Read the full abstract

Computation and Language

LLMs Mirror Country-Specific Gender Patterns If Asked, but Skew Male When Generating Media in Local Languages

Large language models (LLMs) are increasingly used to generate media, but whether their content perpetuates gender stereotypes is unknown: standard benchmarks rely on selection-based formats rather than long-form generation, and surveyed baselines for local gender associations are scarce outside the West. We collect gender associations for 22 occupational and domestic roles from 695 respondents across the United States, India, Kenya, and Nigeria, and evaluate eight LLMs under two regimes: direct questioning and media generation. Models track the surveyed associations under direct questioning but skew substantially more male under media generation in major local-language cells, consistent with the male bias documented in human-produced media. Outside the US, the shift is much smaller and non-significant under English prompting, so English-only or country-agnostic evaluation would miss this bias in the languages where these models are most deployed. Instruction prompting reduces the shift directionally, but trades off against alignment with the surveyed associations. Evaluating LLM gender bias for global deployment therefore requires generation-format testing, local-language prompting, and locally-collected human baselines.
Read the full abstract

All authors Sharif Kazemi, Tanya Popli, Neil K. R. Sehgal, Sunny Rai, Niyati Malhotra, Victor Orozco-Olvera, Ana María Muñoz Boudet, Samuel P. Fraiberger, Sharath Chandra Guntuku, Manuel Tonneau

Geometric Topology

Unknotting orientable surfaces

It is shown that every locally flatly embedded genus $g \in \{1,2\}$ surface in the $4$-sphere with knot group $\mathbb{Z}$ is unknotted. The same proof establishes that any two genus $g \in \{1,2\}$ surfaces in $D^4$ with knot group $\mathbb{Z}$ and common boundary an Alexander polynomial one knot are isotopic rel. boundary. In previous work, the author and Powell reduced such unknotting problems to a question concerning the cancellation of $(-t)$-quadratic forms over $\mathbb{Z}[t^{\pm 1}]$, which was solved in genus $g \geq 3$ using work of Bass. In genus $g=2$, we observe that the same proof goes through using further work of Bass. In genus $g=1,$ the result instead follows from a statement in commutative algebra which was proved with the assistance of AI. Combined with earlier work of Freedman on locally flat spheres with knot group $\mathbb{Z}$, this shows that a locally flatly embedded orientable surface in $S^4$ is unknotted if and only if its knot group is $\mathbb{Z}$.
Read the full abstract

Artificial Intelligence

A Unified Policy Architecture (UPA): The Governance Kernel for Enterprise AI Operating Systems

Enterprise AI is evolving into an Enterprise Operating System where autonomous AI agents can plan, reason, use memory, invoke tools, execute workflows, and collaborate with other agents. This shift creates a new governance challenge: existing authorization, security, guardrails, and compliance mechanisms are fragmented and are not designed to govern autonomous AI as a unified system. This paper introduces the Unified Policy Architecture (UPA), a governance architecture for Enterprise AI Operating Systems. UPA provides a unified policy model for governing AI and agents, tools, workflows, memory, enterprise resources, and agent-to-agent interactions and enterprise business rules. It extends policy control beyond authorisation to include runtime obligations, human approvals, compliance, audit evidence, and governance evaluation. We present UPA's governance model, declarative policy language foundations, policy evaluation semantics, extensible plugins, industry policy packs, and an evaluation framework for enterprise governance. We also identify extensions for multi-agent coordination, provenance-aware policies, and stateful runtime governance. UPA provides a foundation for building secure, accountable, and governable Enterprise Operating Systems for autonomous AI.
Read the full abstract

All authors Prabhu Raghav, Balamurugan Pandi, Arul Vivek, Shek Mohammed, Sridhar S

Optics

Recovering topological information of light by topological learning

The evolution of modern-day communication networks towards enhanced capacity and robustness is driving interest in topological light wave as a next-generation information carrier. However, harnessing its potential is hindered by the lack of an effective topological reader, particularly when strong disorder renders conventional readout intractable. Here we address this by introducing TOPO$^{2}$, an artificial intelligence framework that leverages on topological learning to recover topological information from light. We demonstrate it on highly distorted optical fields with embedded Skyrmion topologies, showing that we can extract the topological numbers in a single shot with just a conventional camera. We showcase its capability in a TOPO$^{2}$-based communication scheme, sending and recovering information encoded in a topological alphabet, confirming that it outperforms conventional approaches. Our connection of topological photonics with topological AI as a powerful paradigm for robust high-capacity information encoding and processing opens a new path towards topological information optics.
Read the full abstract

All authors Benquan Wang, Trishita Das, Yuhan Peng, Tatjana Kleine, Shanshan Chang, Jinhui Chen, Nilo Mata-Cervera, Chunyu Li, Kelin Xia, Andrew Forbes, Yijie Shen

Algebraic Geometry

Disconnectedness of the Hilbert Schemes of $E_6/P_6$

In this note, we show that the Hilbert scheme $\text{Hilb}_{P_{d,4}(t)}(E_6/P_6)$ associated with the Hilbert polynomial $P_{d,4}(t)$ is disconnected by determining that it has exactly two connected components. This result adapts Seong's methods, successfully extending the disconnectedness of Grassmannians to the exceptional type $E_6$.
Read the full abstract

Cryptography and Security

SRD-GUARD: A Defense Framework of LLMs via Semantic Rewriting and Joint Multi-Model Scoring for Latent Intent Exposure

Large language models (LLMs) are increasingly deployed in safety-critical applications, yet jailbreak attacks can conceal harmful intent through role-playing, fictional scenarios, or seemingly benign motivations. Existing inference-time defenses may miss disguised attacks or excessively refuse legitimate requests. We propose SRD-GUARD, a parameter-free, black-box defense framework that exposes concealed intent through semantic rewriting and consensus-based risk assessment. Given an input prompt, SRD-GUARD generates five semantically related rewrites that preserve the underlying objective while removing unnecessary contextual packaging. The original prompt and rewrites are jointly evaluated by multiple independent LLM-based safety scorers on a continuous risk scale. A decision module combines absolute risk thresholds with relative risk changes between the original and rewritten prompts to adaptively intercept, preserve, or warn on requests. We evaluate SRD-GUARD against UNIATTACK, CIPHER, and DeepInception on Llama-3-8B-Uncensored and DeepSeek-V4-Flash using AdvBench and OR-Bench-Hard. SRD-GUARD achieves average DSRs of 91.44% and 100%, with ORRs of 8.00% and 12.00%, respectively. Compared with evaluated baselines, it provides a more favorable DSR–ORR trade-off. Ablation studies show that rewriting exposes concealed harmful intent, joint scoring improves robustness to individual evaluator behavior, and risk-adaptive decision making enables selective handling of ambiguous inputs. These results demonstrate that semantic intent exposure, consensus-based risk assessment, and relative-risk-aware routing provide an effective and selective approach to black-box jailbreak defense. The artifact is available at https://anonymous.4open.science/status/CICD-Guard-D648.
Read the full abstract

Cryptography and Security

Watch and Crack: Password Inference from Smart-Glasses Video

Typing passwords on smartphones in public places exposes users to video-based side-channel attacks, in which an adversary records the typing session and reconstructs the entered password by analyzing finger movements. Prior video-based keystroke inference attacks have targeted free-form text on tablets, numeric PINs, pattern locks, and passwords under unrealistically simplified conditions. We present the first general video-based keystroke inference pipeline that recovers rule-based alphanumeric passwords from smartphone QWERTY keyboards, covering all four keyboard layouts and requiring no assumptions about the victim or their device. Using the built-in camera of the popular Meta Ray-Ban smart glasses, our pipeline tracks the device and typing fingertips at sub-pixel resolution, predicts keystrokes via a self-supervised ensemble of neural networks, dynamically estimates the on-screen keyboard layout, and computes per-key probability distributions. These video-derived probabilities are combined with prior password-typing distributions based on 2.19 billion leaked passwords to estimate the rank, and therefore the crack time, of the observed password. In a user study using passwords that adhere to a typical enterprise password policy, human-chosen passwords of up to 16 characters can be cracked in hours to days, and password-manager-chosen random passwords of up to 13 characters in under an hour on a modern GPU, reducing password entropy by up to 60 bits relative to the prior baseline. For human-chosen passwords, combining video evidence with prior statistics yields an additional statistically significant reduction of approximately 20 bits compared to either source alone. The attack succeeds at distances up to 1.8 m, across diverse attacker-victim postures and viewing angles, and generalizes across three popular smartphones.
Read the full abstract

Numerical Analysis

Improved Inclusion-Exclusion Eigenvalue Localization Sets for Matrices and Matrix Polynomials

Recent developments have shown that eigenvalue localization regions can often be significantly sharpened by identifying and excluding subsets that are guaranteed to contain no eigenvalues, leading to the concept of inclusion-exclusion localization sets. In this paper, we introduce a new family of inclusion-exclusion eigenvalue localization sets based on the S-strict diagonal dominance framework and the corresponding CKV localization regions. For an arbitrary nonempty subset S of the index set, we construct novel exclusion regions and derive the associated S-SDD inclusion-exclusion localization sets. We prove that every eigenvalue of a complex matrix belongs to the proposed regions and define a refined localization set obtained by intersecting the corresponding inclusion-exclusion regions over all nonempty subsets S. The proposed framework unifies and extends several existing results. In particular, we show that the classical Gershgorin inclusion-exclusion localization set and the Dashnic-Zusmanovich inclusion-exclusion localization set arise naturally as special cases of our construction. Consequently, the new localization set provides, in general, a sharper eigenvalue inclusion region than both of these previously known localization regions. The theory is further extended to matrix polynomials, yielding corresponding inclusion-exclusion localization results for polynomial eigenvalue problems. Several numerical examples illustrate the effectiveness of the proposed approach and demonstrate the improvement achieved over existing localization sets.
Read the full abstract

Information Theory

UAV Fluid-Antenna Channel Acquisition under Intra-Scan Channel Aging

Sequential sounding in UAV fluid-antenna systems (FASs) provides additional spatial information but delays transmission, causing earlier channel observations to age. This paper addresses the resulting information–freshness tradeoff by jointly determining where to probe and when to stop under blockwise hardware constraints. A dynamic Karhunen–Loève estimator aligns asynchronous measurements with the transmission state, covariance information gain selects feasible probe locations, and an age-discount identity with a local one-more-slot condition characterizes the covariance-level balance between information and freshness. Paired simulations show that temporal alignment recovers most of the lower-tail reliability lost by static stacking, covariance-aware probing ranks highest numerically among the evaluated policies, and optimized one-slot sounding becomes statistically competitive with two-slot alternatives at the highest tested mobility. Within the evaluated schedule family, increasing mobility shifts the competitive operating region toward shorter scans, supporting joint probe-placement and sounding-duration design.
Read the full abstract

All authors Yuanhui Wu, Hao Jiang, Liang Wu, Zaichen Zhang

Accelerator Physics

Incoherent scattering of highly ultrarelativistic channeled particles on electrons

This article systematically examines the effects that must be taken into account when modeling the dechanneling of highly ultrarelativistic charged particles caused by incoherent scattering by electrons of crystal atoms. Changes in the particle electromagnetic field that occur in condensed matter at highly ultrarelativistic energies are taken into account. The excitation of both collectivized electrons and inner-shell electrons of atoms is considered, taking into account thermal vibrations and the inhomogeneous periodic distribution of atoms in crystals. Differences in the calculations of stopping power and mean square scattering angle by electron of channeled particles are described. The need to separate both of them into diffuse processes, accompanied by the transmission of a transverse momentum which does not exceed the transverse momentum of the channeled particles, and instantaneous dechanneling processes with a greater transmitted momentum, the variation range of which reaches several orders of magnitude, is substantiated. The main result of the present work is expressions for the mean square projected scattering angles per unit length in planes parallel and perpendicular to the atomic plane, which also allow for the introduction of effective minimum momenta for incoherent scattering. Expressions of both types take into consideration completely the nonlocal effects of momentum transfer from crystal electrons to particles moving along classical trajectories, and allow for the formulation of simple methods for modeling the incoherent scattering of ultrarelativistic positively charged particles.
Read the full abstract

Computer Vision

3DHarnessBench: Probing Agentic 3D-to-Code Capabilities of Frontier Vision-Language Models

We introduce 3DHarnessBench, a benchmark that evaluates the agentic ability of frontier vision-language models (VLMs) to recover 3D geometry as Blender Python code from a variety of inputs. Unlike previous frameworks that prompt the VLMs with a fixed input (e.g., a single rendering or a text description), 3DHarnessBench evaluates four separate harness settings that progressively enable active agentic exploration, facilitated by recent Blender MCP functionality. Our hierarchy from Single-view, Multi-view, Active Visual (arbitrary viewpoint access), and Full 3D Interaction (complete access to the target object through Blender function calls) probes the models' abilities in both visual perception and active inference, tool calling, and self-correction. We observe that the ability of all frontier models to recover 3D geometry improves significantly with richer function call access, although the improvements are strongly model-dependent, revealing highly uneven agentic 3D-to-code capabilities. We will release the benchmark, code, outputs, and agent trajectories for reproducible 3D evaluation.
Read the full abstract

All authors Ling Liu, Bingchen Gong, Amal Dev Parakkat, Maks Ovsjanikov