Group Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
We show that every faithful, transitive, and generically $(n+2)$-transitive action of a connected group $G$ on an irreducible variety $X$ of dimension $n > 0$, all defined over an algebraically closed field $F$, is isomorphic to the natural action of the projective linear group $PGL_{n+1}(F)$ on the projective space $\mathbb{P}^n(F)$. More precisely, we establish the Borovik-Cherlin conjecture for permutation groups $(G,X)$ definable in models of $ACF$.
Probability
Paracontrolled approach to the stochastic Cahn-Hilliard equation
We prove the existence and uniqueness of a local-in-time solution to the stochastic Cahn-Hilliard equation in space dimensions 1, 2, 3, 4 and 5. Our method relies on the Da Prato-Debussche trick for $d=4$ and paracontrolled distributions for $d=5.$
Machine Learning (Statistics)
Schrödinger Bridges on Lie Group Manifolds for Probabilistic Intrinsic Generation
Generative modeling directly on geometric manifolds can avoid errors introduced by flattening non-Euclidean data, repeated ambient projection, and coordinate inconsistency in Euclidean representations. Schrodinger bridges provide a probabilistic generative framework for entropy-regularized transport between prescribed endpoint distributions. We study Schrodinger bridges for kinetic dynamics on Lie group manifolds with state X_t = (g_t, xi_t) in G x g, allowing endpoint observations to constrain only the variables that are actually measured. In particular, the entropy projection determines the conditional law of the unobserved endpoint velocities. For the same observed endpoint bridge, we develop two computational realizations: Wrapped-Kernel Bridge Calibration (WKBC) uses an explicit periodized kinetic kernel on compact Abelian groups, whereas Reciprocal Conditional-Control Bridge Matching (RCCBM) handles compact non-Abelian groups through two-sided endpoint calibration and mollified conditional-control matching. The canonical teacher-mixture path law is itself a Markov reciprocal law, so forward generation uses a calibrated initial law and one learned Doob controller. Moreover, we establish a modular error bound in the bounded-Lipschitz path metric that provides a clean separation of errors due to endpoints, control regression, initialization, discretization, and related approximations. Experiments on multiple Lie group manifold datasets validate the feasibility and consistency of our proposed method, covering protein and RNA torsions, SO(3), U(n), and the Protein Conformational Transition Pathway Generation task using mdCATH trajectories in a compact reduced representation. The source code is publicly available at https://github.com/cafferyzhang12/Schr-dinger_Bridge_on_LieGroup.
Read the full abstract
Neural and Evolutionary Computing
Memory as an Energy Landscape—Hopfield
This chapter reconstructs the Hopfield network as a physical theory of memory rather than merely an early neural-network algorithm. It begins with the problem as it stood before 1982-threshold logic, Hebbian association, correlation memories, and recurrent binary networks-and isolates what Hopfield's synthesis added: a dynamical definition of content-addressable memory, a symmetric recurrent architecture with a Lyapunov function, a Hebbian embedding of patterns in its couplings, and a physical account of basins, robustness, and graceful degradation. The binary and graded-response energy functions are derived in full, together with the signal-crosstalk decomposition governing pattern stability, the mean-field theory of retrieval at extensive load, and the zero-temperature retrieval spinodal at (alpha 0.138) established by Amit, Gutfreund, and Sompolinsky. The energy-based program is then followed through analog optimization networks, polynomial dense associative memories, exponential interactions, and modern continuous Hopfield updates, including the precise conditions under which the update becomes scaled dot-product attention. Throughout, capacity claims are tied to their disorder ensemble, scaling limit, and success criterion, showing why numerically different storage limits need not conflict. A closing assessment distinguishes established results from surviving principles, assumption-bound limitations, and open problems, treating the Hopfield network as an effective theory whose symmetry, locality, and point-neuron assumptions delimit its biological reach. Fixed-seed numerical experiments expose the mechanisms discussed but do not substitute for analytical results.
Read the full abstract
Machine Learning
Learning the Constitutive Behavior of Materials via Neural Operators and Causal Attention: Case Studies in Plasticity and Damage
Classical constitutive modeling of path-dependent inelastic materials relies on internal state variables whose evolution equations must be postulated based on domain knowledge and calibrated against experimental data. However, in many practical settings, the relevant internal variables are typically not measurable in experiments, and the constitutive response must be inferred entirely from measured strain-stress data without any prior knowledge of the material's internal state. We propose a data-driven constitutive modeling framework based on the concept of a material operator, which treats a deforming material as a functional mapping from its entire strain history to the corresponding stress response. In contrast to traditional autoregressive or recurrent formulations, the model is trained directly on full loading paths as function-to-function mappings, predicting complete stress trajectories in a single parallel forward pass. Temporal path dependence is enforced through a causally masked attention mechanism embedded within the operator, which restricts the model's attention to past material states while preserving computational parallelizability. Spectral convolutions provide discretization-invariant representations in the frequency domain, while causal attention captures highly adaptive, non-local history dependence. Furthermore, sinusoidal activation functions are used to resolve the strong nonlinear transitions inherent in inelastic regimes. The framework is evaluated across multidimensional, rate-independent material models exhibiting complex phenomena, with an emphasis on nonlinear plasticity and ductile damage accumulation. The results demonstrate accurate and robust predictions of irreversible deformation mechanisms while simultaneously achieving resolution invariance and excellent parallel efficiency.
Read the full abstract
Probability
State-law dynamics of McKean-Vlasov stochastic reaction-diffusion equations on $\mathbb R^n$: pullback random attractors and zero-noise stability
Distribution dependence generally prevents McKean-Vlasov state solution maps from satisfying a cocycle identity, while the relevant Sobolev embedding is noncompact on unbounded domains. For a class of stochastic reaction-diffusion equations with a dissipative polynomial reaction, a one-sided monotone state-law coupling and finite-dimensional additive noise, we combine the deterministic law semiflow with the pathwise state evolution to construct a continuous random dynamical system on the product of the state space and its quadratic Wasserstein law space. An abstract product-space criterion, mixed-energy estimates, local regularity and uniform far-field estimates yield a unique pullback random attractor without global law contraction. Its law projection is the global attractor of the law semiflow, and its state fibers need not be singletons. Under an additional strict contraction condition, the law attractor reduces to the unique invariant law and the corresponding state fiber to a self-consistent random equilibrium. We also establish zero-noise upper semicontinuity and, in the contractive regime, quantitative convergence of the invariant laws and random equilibria with bounds linear in the noise amplitude.
Read the full abstract
Differential Geometry
Asymptotics of holomorphic torsion on orbifolds and an equivariant arithmetic Hilbert-Samuel theorem
We compute the $\log p$-part of the asymptotic expansion of the holomorphic torsion of the $p$-th power of a positive line bundle in terms of characteristic classes. This is done for orbifold and equivariant torsions. In the equivariant case the exponents in the expansion are less than or equal to the dimension of the fixed point set. We deduce a corresponding equivariant arithmetic Hilbert-Samuel theorem in Arakelov geometry.
Read the full abstract
Artificial Intelligence
Examining the Vulnerability of Multi-Agent Medical Systems to Human Interventions for Clinical Reasoning
Human interventions at fault points can alter the diagnostic accuracy of multi-agent medical systems. We defined fault points as moments in AI agent conversations, in which an agent's reasoning became most vulnerable to external influence. Using the MedQA dataset, this study analyzed simulated doctor-patient conversations to measure how interventions shifted reasoning and accuracy. Correct intervention methods showed an improvement in baseline diagnostic accuracy of up to 40%, while incorrect or bias-related interventions degraded performance by up to 6% and increased diagnostic drift and uncertainty. Beyond performance changes, our analysis revealed behavioral similarities between cognitive biases in simulated agent environments and real-world clinical practice. Examples included premature closure and susceptibility to misleading cues. Overall, these findings demonstrate that identifying and guiding fault points with human interventions may provide a mechanism for improving diagnostic robustness in multi-agent medical systems.
Read the full abstract
Computational Engineering
A physics-enhanced bidirectional multi-order graph fusion network for interpretable bearing remaining useful life prediction
Accurate prediction of bearing remaining useful life (RUL) is a key challenge for intelligent maintenance. Although deep learning-based prediction methods have showed effectiveness, existing methods still have limitations in learning nonlinear bearing degradation processes and model interpretability. Especially in engineering applications, the "black box" nature of deep learning models can easily raise concerns about their reliability. Therefore, we propose a physics-enhanced bidirectional multi-order graph fusion network for interpretable bearing RUL prediction. Our network mines complementary information from both forward and backward degradation sequences. Specifically, our network introduces a multi-order graph propagator to capture the local-global degradation dependencies. A gated cross-fusion mechanism is further designed to dynamically balance the feature contributions from both forward and backward directions. Then, our network stores representative historical degradation prototypes in dynamic memory, so that the final RUL prediction no longer depends solely on the current latent features, but is guided by reusable historical degradation knowledge. To reveal how our model learns the nonlinear degradation process, the feature mapping parts utilize the Kolmogorov-Arnold network, which allows the nonlinear mapping to be visualized using learnable functions. Finally, a physics-enhanced dynamic loss function is developed to help our network learn effective and reliable degradation representations. Extensive experiments on two public datasets show that our method achieves the lowest error while providing more conservative estimates than existing methods. Our code is available at https://github.com/IMGresearcher/PE-BMGN.
Read the full abstract
Earth and Planetary Astrophysics
Double Gravity-Assist Rendezvous Trajectory to Halley's Comet Using Deep-Space Low Thrust
The perihelion of comet 1P/Halley in 2061 is an excellent chance to revisit this object of outstanding scientific and cultural relevance. During its 1986 approach to the Sun, it was targeted by several flyby missions. Due to its retrograde, highly-inclined orbit, the relative velocities during the encounter were large, limiting the scientific return due to the short time spent inside the coma. A rendezvous trajectory would overcome this limitation, but the design is challenging due to the limitations of current propulsion technology. Given the lead times of spacecraft development and the long duration of the interplanetary transfer to the comet, it is imperative to start mission planning as soon as possible. We present a novel rendezvous strategy, combining unpowered Jupiter and Saturn gravity-assists with deep-space low-thrust arcs. It minimizes launch energy and propellant budget, constraining the arrival to occur before the onset of high activity. The double flyby strategy reduces the otherwise prohibitive cost of the plane change maneuver. Closed expressions for the optimal flyby geometry, together with an explicit low-thrust transcription technique, reduce the number of design parameter to three, improving computational efficiency. Crucially, this is the first rendezvous mission concept achievable with well-proven technology (standard radioisotope thermoelectric generators and a Hall-effect thruster) and compatible with several existing launchers. We describe the trajectory optimization strategy and perform a comprehensive exploration of the design space. Finally, we present two promising proof-of-concept trajectories in detail.
Read the full abstract
Information Retrieval
Group-Aware Adaptive Retrieval for Evidence Navigation
Reasoning-intensive retrieval addresses queries whose relevance cannot be identified by surface-level matching, thereby requiring multi-step reasoning. Because relevant documents rarely appear in the initial candidate set, retrieval systems suffer from the bounded recall problem. Existing methods iteratively expand a candidate pool at the document level over a corpus graph, examining each neighbor in isolation and drifting toward a narrow region of the corpus. To address this problem, we propose Group-Aware Adaptive Retrieval for Evidence Navigation (GAREN), which explores the corpus graph through group-level expansion. GAREN organizes documents into semantically coherent and distinguishable groups based on their connections in the corpus graph. The information in each group indicates what can be accessed by expanding through it, providing guidance beyond individual document-level signals. At each iteration, GAREN uses a group-level navigator to identify promising expansion directions, retrieves documents from the selected groups, and applies a document-level reranker to evaluate the updated candidate set. Extensive experiments show that GAREN achieves up to 8.0% improvement over the strongest baseline on BRIGHT. The source code is available at https://github.com/KJ12124/GAREN
Read the full abstract
Computer Vision
Lightweight Adaptation of General-Purpose VLMs for Multispectral and SAR Image Understanding
General-purpose vision-language models (VLMs) now support strong visual recognition, instruction following, and generation. However, most pretrained visual encoders are built around three-channel natural images and do not directly accommodate observations such as native multispectral measurements or synthetic aperture radar (SAR). Adapting VLMs to these sensors typically requires dedicated encoders and domain pretraining, slowing the reuse of stronger general-purpose checkpoints. We show that the multi-image interface of general-purpose VLMs offers a lightweight alternative. Our protocol renders each observation as five optical views and one SAR view, names them in the prompt, and adapts the language network and selected visual transformer blocks with LoRA. This exposes band composites, spectral indices, and radar backscatter through an existing visual interface. For land-cover recognition, structured supervision couples predicted classes with sensor evidence. We further construct preference pairs in which a true label is omitted while its supporting evidence is retained, encouraging complete predictions that remain consistent with the observations. On a balanced six-class land-cover benchmark derived from BigEarthNet-v2, the adapted Qwen3-VL reaches 0.8275 micro F1. The same input and adaptation protocol improves all four tested VLM architectures and transfers to Sen1Floods11 flood verification and BigEarthNet.txt captioning. Image removal and mismatch controls show that the adapted models use the supplied sensor observations. Together, these results demonstrate that VLMs can be repurposed for multispectral and SAR tasks through rendered inputs and compact LoRA adaptation, without training a new foundation model.
Read the full abstract
Quantum Physics
Quantum MeanFlow: single-shot generative sampling on NISQ hardware
Quantum generative models offer a promising framework for exploring whether quantum computation can enhance generative machine learning. Flow matching is a generative method in which samples are generated by transporting a simple, known distribution to the target data distribution with a learned velocity field. Its quantum counterpart, known as quantum flow matching (QFM), was introduced recently, and, like its classical counterpart, requires integrating an ordinary differential equation over many time steps during inference. As each step requires the output from the previous step, the circuit submission is sequential and a drawback on quantum computers as they have high input/output costs. To alleviate this problem, we introduce Quantum MeanFlow (QMF), the quantum analogue of the MeanFlow formulation, which allows single-step sample generation. While the QFM learns an instantaneous velocity field at each time step, QMF learns the average velocity over a time interval. We use a parameterized quantum circuit to learn these velocity fields and benchmark the two methods on the MNIST dataset. We show that while single-step QMF has lower image quality compared to multi-step QFM, it performs better than the single-step QFM sampling at every shot count. Both of our models are executed on IBM quantum computers and best-of-N rejection sampling recovers most of the accuracy lost to device noise without modifying the circuit. This is especially advantageous for QMF which has only one circuit evaluation per image. Here, We establish QMF as a viable method for single-step quantum generative sampling, saving on quantum circuit evaluations per generated sample.
Read the full abstract
Astrophysics of Galaxies
Disc-Based Estimation of the Local Dark Matter Density and Velocity Distribution in IllustrisTNG50
We study the dark matter (DM) density and velocity distribution in the solar neighborhood of Milky Way-like galaxies using the TNG50-1 run of the IllustrisTNG simulation suite. Milky Way-like galaxies are selected according to both their halo mass and their bulge-to-total stellar mass ratio, and the solar-neighborhood region within each galaxy is identified from the positions and number density of stars, so that DM particles associated with the galactic disc are extracted while contributions from the halo component are suppressed. Averaging over the selected galaxies, we obtain a local DM density of $\rho \simeq 0.47\pm0.02~{\rm GeV\,cm^{-3}}$, consistent with the range inferred from observations. The disc-based extraction gives a higher peak density, $0.41\pm0.02~{\rm GeV\,cm^{-3}}$, than the value $0.34\pm0.02~{\rm GeV\,cm^{-3}}$ from a simple distance-based extraction, probably because it excludes the low-density DM in the halo. The width of the density distribution, on the other hand, is nearly unchanged. The velocity distribution is well described by an isotropic Maxwellian with a peak velocity of about $226~{\rm km~s^{-1}}$, close to the value assumed in the standard halo model. The differences in the density and velocity distributions between our disc-based and simple distance-based extractions are not so large as to significantly affect the interpretation of direct-detection experiments.
Read the full abstract
Computer Vision
CC-4DGS: Computational Deformation and Point-Cloud Compression for Storage-Efficient Dynamic Gaussian Splatting
Dynamic four-dimensional (4D) Gaussian Splatting has emerged as a powerful explicit representation for high-quality view synthesis, yet existing methods still require tens to hundreds of megabytes per scene due to their heavy reliance on large multi-resolution hash tables and high-dimensional Gaussian attributes. This paper presents CC-4DGS, a storage-efficient and scalable framework that rethinks both deformation modeling and canonical attribute storage. First, we introduce a computational deformation field (CDF) that replaces large multi-resolution learnable hash tables with deterministic dense hash encoding and compact neural decoders, enabling on-the-fly synthesis of deformation features while reducing deformation storage to only 1–3 MB per scene. Second, we propose a compression of canonical point-cloud attributes (CCA) pipeline that compresses high-dimensional spherical harmonic appearance terms and auxiliary Gaussian attributes via conditional autoencoding, selective quantization, and residual codebooks, achieving 3–5$\times$ point-cloud reduction with negligible quality loss. Together, these components yield a unified representation that preserves real-time rendering performance while reducing total storage to 20–30 MB. Extensive experiments across the N3DV and Technicolor Light Field datasets demonstrate that CC-4DGS achieves reconstruction accuracy comparable to state-of-the-art methods such as Swift4D, while offering significantly improved storage efficiency and favorable runtime-memory trade-offs.
Read the full abstract
Neurons and Cognition
Neural Logic, Invariance, and the Retina—McCulloch and Pitts
This chapter reconstructs the McCulloch-Pitts program as a physics of neural computation rather than the familiar cartoon of a binary neuron. The 1943 logical calculus is developed in both directions: given a net, characterize the propositions realized by its activity; given an admissible logical expression, construct a net that realizes it. We recover the original distinction between thresholded excitatory summation and absolute inhibitory veto-one the weighted-threshold form cannot preserve for arbitrarily large excitatory inputs-and read unit-time delay as the physical realization of logical depth. Recurrence is treated exactly: an autonomous, deterministic network of finitely many binary units has a finite state space, so every trajectory eventually enters a periodic orbit-a fact about finite-state dynamics, not unbounded Turing computation. A single threshold element realizes only linearly separable Boolean functions, whereas finite feedforward networks of them synthesize any Boolean function on a finite domain. We then follows McCulloch and Pitts beyond threshold logic. The 1945 heterarchy paper turns cyclic preference into an obstruction to representation by a scalar utility. The 1947 work on universals asks how a physical network can identify inputs related by nuisance transformations, developed here via group averaging and feedback canonicalization. The 1959 frog-retina study makes the adequate-stimulus question experimental, revealing parallel invariant operations before the brain proper. Spike-triggered analysis shows how a nonlinearly driven neuron can have a vanishing first-order average while second-order statistics recover its hidden selectivity: methodological failure can masquerade as physiological absence. Modern mathematical tools are used without projecting their notation onto the historical papers, and limitations of the idealization are stated explicitly.
Read the full abstract
Plasma Physics
A Hybrid Simulation Code for Hall Thrusters and its Sensitivity to Numerical Parameters
Hybrid methods offer an attractive balance between computational efficiency and physical accuracy, playing an important guiding role in the design and optimization of Hall thrusters. In this work, a hybrid simulation code, named HYSCH, is developed, utilizing a 1D-MFAM as the mesh framework for the electron submodel. HYSCH enables decoupling of the two submodel meshes, providing a higher degree of flexibility in spatial resolution settings. The sensitivity of the simulated results to numerical parameters is analyzed to validate the model's numerical robustness and physical consistency. The analysis shows that the temporal resolution of the heavy-species submodel and the spatial resolution of the electron submodel exert a more pronounced influence in the agreement with measurements than the heavy-species macroparticle weight and spatial resolution, confirming that the decoupled formulation enables more efficient resource allocation than coupled discretizations.
Read the full abstract
Astrophysics of Galaxies
Constraints on the Intranight Optical Variability of Intermediate-Mass Black Hole Candidates
Intermediate-mass black holes (IMBHs) provide a unique regime for studying accretion variability at the low-mass end of the black hole population, yet their intranight optical variability (INOV) remains poorly constrained. We present a systematic investigation of INOV in an optically selected sample of IMBH candidates using high-cadence observations from the Zwicky Transient Facility (ZTF). From a parent sample of 1,447 broad H$\alpha$-selected candidates, we identify 64 IMBH candidates (median $f_{\mathrm{AGN}}\sim0.06$) with 163 intranight monitoring sessions. Apparent INOV signals identified by conventional ZTF PSF-fit photometry are largely associated with seeing-dependent changes in the relative contributions of compact nuclear and extended host components, which can mimic intrinsic short-timescale variability. In contrast, no robust INOV is detected with difference-image analysis. An ensemble structure function spanning $\Delta t\sim0.003$–$1600$ days reveals long-term variability in a small subsample of sources, whereas intrinsic variability remains unresolved at intranight timescales. Monte Carlo simulations further show that ZTF-like single-night monitoring has a low INOV recovery probability ($\sim1.2%$) for the variability amplitudes inferred from the long-term analysis. The recovery probability is primarily controlled by source brightness, AGN contribution, intrinsic variability amplitude, and photometric precision. These results demonstrate that the absence of detected INOV does not imply the absence of rapid accretion variability, but can reflect the limited detectability of low-amplitude signals under current observing capabilities. Our findings highlight the importance of robust photometric methodologies for future high-cadence variability studies of low-mass accreting black holes.
Read the full abstract
Combinatorics
Helly-Type Theorems for Splitting Point Sets
Let $0 < \alpha \leq 1/2$. We say that a finite point set $P$ in $\mathbb{R}^d$ is $\alpha$-split by a hyperplane $h$ if each of the closed half-spaces determined by $h$, contains at least $\alpha |P|$ of the points of $P$. We further say $P$ is $\alpha$-split by a $k$-dimensional flat $\tau$ if $P$ is $\alpha$-split by any hyperplane through $\tau$. In the standard notation (which coincides with Tukey depth for $k= 0$), the $k$-flat $\tau$ has depth $\alpha$ with respect to $P$. We establish interesting Helly-type theorems for splitting families of finite point sets in $\mathbb{R}^d$. Unlike the classical sufficient Helly-type criteria for transversals to families of compact convex sets, which exist only for point and hyperplanes, our results extend to splitting families of point sets by collections of $k$-flats of arbitrary dimensionality $ 0 \leq k \leq d-1$.
Read the full abstract
Astrophysics of Galaxies
The Intermediate-Mass Black Hole Reverberation Mapping Project: Scientific Overview and Sample Characteristics
Recent discoveries with the James Webb Space Telescope of massive black holes at high redshift have highlighted fundamental questions about black hole seed formation and the coevolution of black holes with their host galaxies. Because the initial seed population cannot yet be observed directly, nearby intermediate-mass black holes provide a complementary fossil record of black hole formation and early growth. Motivated by this opportunity, we present the Intermediate-Mass Black Hole Reverberation Mapping (IMBH-RM) project and construct a homogeneous Sloan Digital Sky Survey sample of active broad-line IMBHs by uniformly reanalyzing literature candidates with consistent spectral decomposition and black hole mass estimation. Our sample contains 192 reliable IMBH candidates at $z\lesssim0.3$ with $\log(M_{\rm BH}/M_\odot)<6$, including four particularly compelling sources with $\log(M_{\rm BH}/M_\odot)<5$. The primary goal of IMBH-RM is to obtain reliable black hole masses from direct measurements and characteristic sizes of the broad-line region and accretion disk for a carefully selected subsample. These measurements will provide robust low-mass anchors for calibrating single-epoch black hole mass estimates and extending black hole–galaxy scaling relations into the IMBH regime. By building a statistically meaningful reverberation-mapped sample spanning $10^4-10^6\,M_\odot$, we aim to constrain the local IMBH mass distribution and place observational constraints on competing black hole seed formation scenarios. The future Multi-Channel Imager aboard the Chinese Space-station Survey Telescope provides a particularly promising platform for achieving these goals.
Read the full abstract
Numerical Analysis
Error estimate of the nonuniform BDF3-L2 method for subdiffusion equations via multiscale solution decomposition
Numerical experiments reported by Quan and Wu [SIAM J Numer Anal 61 (2023) 2106-2132] show that the observed temporal convergence rates of nonuniform L2 methods for subdiffusion models are not consistent with the theoretically predicted order $3-\alpha$. This discrepancy suggests that a more refined analysis is needed and motivates the development of a nonuniform BDF3-L2 method for the subdiffusion equation. To account for the initial solution singularity, we employ the multiscale solution decomposition to decompose the original solution and approximate a smoother unknown variable that satisfies the subdiffusion model with a smoother source term. The resulting formulation, however, involves restrictive high-order boundary conditions on the source term and initial data. To overcome this difficulty, we introduce a spectral truncation technique that requires only slightly stronger regularity of the data and a controllable truncation error. We establish high-order regularity estimates of the solution to the truncated problem and develop a nonuniform BDF3-L2 method for its numerical approximation, based on which we derive a rigorous error estimate of temporal convergence order $2+\alpha$. Numerical experiments are carried out to substantiate the theoretical findings.
Read the full abstract
Cryptography and Security
WeaveMark: Robust and Scalable Multi-bit LLM Watermarking via Coded Payload Spreading
Multi-bit watermarking for large language models enables content source tracing by embedding user-identifiable messages into generated text. Existing methods face a fundamental trade-off among extraction accuracy, text quality, and payload capacity. We propose WeaveMark, a robust and scalable multi-bit LLM watermarking scheme based on coded payload spreading. WeaveMark shifts this trade-off frontier by improving payload capacity through multi-bit-per-token spreading (weaving), improving extraction accuracy through soft-decision error-correcting codes, and preserving text quality through unbiased multilayer reweighting. It further introduces dedicated zero-bit layers for reliable watermark presence detection. Extensive experiments demonstrate substantial gains in extraction performance, especially for long messages and edited text, without degrading text quality. WeaveMark achieves an 89.8% match rate for 32-bit messages at 200 tokens, compared with 20.8% for BiMark. Under 10% substitution attacks on 16-bit messages at 200 tokens, it maintains 86.0% versus 30.7%. Code is available at https://anonymous.4open.science/r/WeaveMark-ED6F.
Read the full abstract
Representation Theory
A Serre-type presentation for $\imath$quantum supergroups of type A
We establish a Serre-type presentation for $\imath$quantum enveloping superalgebras arising from quantum supersymmetric pairs of type A. We first prove, in arbitrary type, that evaluating a quantum Serre polynomial on the coideal generators produces a correction of strictly smaller weight in the natural filtration using the projection technique. We then compute these remainder terms for all type A super Satake diagrams. In particular, we determine the new degree-four relations associated with isotropic odd simple roots of the relevant local Satake diagrams.
Read the full abstract
Analysis of PDEs
Inverse Semiclassical Scattering at Fixed Energy
We investigate inverse scattering at a fixed energy for semiclassical Schrödinger operators with smooth potentials. For compactly supported potentials satisfying a natural virial condition, we prove that, under the sharp condition, $\liminf_{h\to0}\|S_1(\lambda,h)-S_2(\lambda,h)\|<2$ implies $V_1=V_2$, provided the fixed energy $\lambda$ lies above both potentials. We then consider radial short-range repulsive potentials. Under a monotonicity assumption on the radial force, we show that the semiclassical differential cross section at a fixed energy, up to $o(1)$ as $h\to0$, determines the potential in the classically accessible region. Finally, we obtain an analogous rigidity result for nontrapping compactly supported perturbations of the Euclidean metric under a strict convexity assumption.
Read the full abstract
Systems and Control
Prosumer Synchronisation Risk: Impacts of Time-Varying Tariffs on Distribution Network Expansion
The rapid deployment of distributed energy resources, including heat pumps, electric vehicles, photovoltaics, and battery storage, is reshaping the operation of low-voltage networks. While distribution system operators often aim to develop time-varying tariffs to incentivise network-friendly behaviour and defer reinforcements, they risk triggering prosumer synchronisation. As prosumers follow price signals, their behaviour may synchronise, avoiding existing load peaks while creating undesirable peaks at other times. This paper quantifies the impact on low-voltage network reinforcement needs when shifting from flat tariffs to two time-varying tariffs: Time-of-Use and Real-Time Pricing. Applying a mixed-integer linear model across 471 low-voltage reference networks in Switzerland, we evaluate expansion requirements under projections of distributed energy resource deployment for 2050. In the model, prosumers operate their distributed energy resources in accordance with their subscribed electricity tariff to minimise costs, and the distribution system operator subsequently optimises reinforcements. Our results demonstrate that while adopting time-varying tariffs can reduce reinforcement investment costs by more than 50%, high adoption rates can reverse this declining trend. Specifically, once prosumer adoption exceeds the optimal thresholds of 50% for Time-of-Use and 40% for Real-Time Pricing, reinforcement needs increase by 39% and 134%, respectively, for an additional 20% of tariff adoption.
Read the full abstract
Number Theory
Bounding Selmer Groups of Superelliptic Jacobians via Class Groups
Let $K$ be a number field containing a primitive $p$-th root of unity $\zeta_p$. Let $f(x)\in K[x]$ be a monic integral polynomial, and let $f_0$ denote its radical. Let $C/K$ be the superelliptic curve defined by $y^p=f(x)$, and let $J$ be its Jacobian variety. The variety $J$ admits multiplication by $\zeta_p$ over $K$; in particular, the endomorphism induced by $\Pi:=1-\zeta_p$ gives an isogeny of $J$ over $K$. Let $\operatorname{Sel}_\Pi(J)$ denote the Selmer group associated to $\Pi$. Under suitable hypotheses, we obtain bounds for $\operatorname{Sel}_\Pi(J)$ in terms of the $p$-torsion subgroup of the class group of $L:=K[x]/(f_0)$. Several examples illustrating the results are also discussed.
Read the full abstract
Computation and Language
Breadth Beats Depth: Improving GCG-Based Jailbreak Optimization with Breadth-Oriented Suffix Search
Optimization-based jailbreak attacks such as Greedy Coordinate Gradient (GCG) achieve strong effectiveness and transferability by optimizing adversarial suffixes on white-box source models. However, existing GCG-based methods rely on averaged adversarial loss and deep greedy search, which can over-emphasize easy-to-jailbreak behaviors and overlook promising regions of the suffix space. We propose BOSS, a plug-and-play framework that improves GCG-based jailbreak optimization through breadth-oriented suffix search. BOSS uses Tail-Focused Adversarial Loss (TFAL), standard source loss, and behavior coverage to select terminal suffixes, then explores multiple short trajectories and selectively continues promising suffixes. Experiments on public benchmarks show that BOSS improves attack success rates across multiple GCG-based methods while reducing optimization time.
Read the full abstract
Computer Vision
Progressive Pseudo-Label Optimization for Point-Supervised Change Detection
Point-supervised change detection (PS-CD) aims to identify pixel-level changes between bi-temporal images using only sparsely annotated points. Although point annotations substantially reduce labeling costs, their limited spatial coverage often results in incomplete and noisy pseudo-labels. To address this issue, we propose a two-stage framework that introduces SAM2 priors into PS-CD and progressively adapts them to the target task. In Stage I, SAM2 generates object-aware candidate masks from point annotations on the bi-temporal images, and a bi-temporal mask selection strategy is designed to convert generic segmentation responses into more reliable change pseudo-labels. Subsequently, a lightweight CNN refinement module with an uncertainty-aware loss is employed to improve boundary quality and local structural consistency. In Stage II, we construct a teacher-student self-training framework in which the teacher is updated by exponential moving average and periodically refreshes the pseudo-labels. This design establishes a closed-loop optimization process that alternates between pseudo-label refinement and model re-optimization. Experiments on three benchmark datasets, including WHU-CD, LEVIR-CD, and SYSU-CD, demonstrate that the proposed method outperforms previous weakly supervised approaches on most benchmarks and remains competitive with several fully supervised methods.
Read the full abstract
Machine Learning
DMRL: Document-Mediated Reinforcement Learning for Skill Optimization in Advertising Recommendation
Advertising recommendation requires continuously tuning complex system parameters while balancing commercial returns and user experience. Recent work has introduced large language models (LLMs) with skill documents to assist this labor-intensive process, but skill optimization remains largely prompt-driven, lacking a principled mechanism to attribute rewards to specific document edits. To address this limitation, we propose Document-Mediated Reinforcement Learning (DMRL), a skill self-evolution framework that models skill document optimization as a sequence of structured editing actions. In DMRL, an upper-level agent performs controlled document edits, while a frozen lower-level task agent evaluates their effects through A/B testing. To address credit assignment and long-term outcomes, we introduce two key components: (1) Dual-Relative Policy Optimization (DRPO), a post-training policy optimization method for robust and risk-aware advantage estimation; and (2) Long-term Reward Predictor (LRP), which estimates long-term outcomes by modeling population heterogeneity with disentangled representation learning and cross-attention transfer. DMRL was deployed on a large-scale short-video ads platform and extensive empirical evaluation shows that DMRL outperforms state-of-the-art baselines across key advertising metrics
Read the full abstract
Algebraic Geometry
Degree of irrationality of abelian surfaces
Let $A$ be a complex abelian surface. We prove that $A$ admits a dominant rational map of degree three to $\PP^2$ if and only if it admits a polarization of type $(1,1)$, $(1,2)$, $(1,3)$, or $(1,6)$. Consequently, the degree of irrationality of $A$ is $3$ precisely in these four cases and is $4$ otherwise.