Nuclear Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 6 September
We investigate the level shifts in protonium using the framework of non-relativistic effective field theory (NREFT). Our study is prompted by the PUMA collaboration's plans to probe the neutron-to-proton ratio in the nuclear density tail using antiprotonic atoms – a method for which light atoms provide an important benchmark. We calculate the corrections to the Deser-Goldberger-Baumann-Thirring formula for the complex level shift of S-wave states from the unitary cusp and Coulomb photon exchange. Structure dependent corrections enter at the next order. For higher-partial-wave states, they enter already at leading order. Using input from chiral NNbar interactions, we compare to other calculations and measurements from LEAR.
Robotics
CAVEAT: Recurrent Multimodal Diffusion Planning for Mapless Aerial Exploration
Can exploratory UAV waypoint sequences be generated from multimodal onboard observations and a fixed-dimensional recurrent internal state without maintaining a persistent global map in the deployed policy? We investigate this question through CAVEAT, a diffusion policy conditioned on a recurrent internal state updated from fused LiDAR, visual, and pose features and trained from trajectories generated by the map-based FUELv2 expert. Rolling inference partially warm-starts consecutive predictions, while a temporary local signed distance field provides heuristic obstacle guidance. Simulation results evaluate both inference mechanisms and compare CAVEAT with its demonstration-generating expert. Proof-of-concept experiments on a Flyability Elios 3 demonstrate partial exploration of a previously unseen indoor environment and target-directed visual servoing using a separately trained policy.
Read the full abstract
Superconductivity
Superconductivity in a Bulk Moire Superlattice Material
Moire materials provide a versatile platform realizing emergent electronic states arising from enhanced correlation due to flat bands. A variety of phenomena including superconductivity, low dimensional ferromagnetism, Mott insulating phase, and topological phenomena have been reported in such systems. To date, moire phenomena have been predominantly explored in artificially assembled low dimensional van der Waals structures, where relative twist and lattice alignment are controlled during device fabrication. Recently, intrinsically grown bulk moire crystals have emerged as a complementary materials platform, in which lattice mismatch between constituent layers generates a coherent moire superlattice throughout the bulk crystal. Here, we report the evidence of bulk superconductivity in single crystals of a recently reported bulk Moire material [Sr6TaS8]1+x[TaS2]8 at ambient pressure. The material exhibits a bulk superconducting transition at Tc = 2.5 K, evidenced consistently by electrical transport, magnetic susceptibility, and heat capacity measurements on single crystals. Structural characterization by X-ray diffraction and atomic resolution electron microscopy establishes the composite, incommensurate crystal structure and scanning tunnelling microscopy reveals a long-wavelength surface modulation due to the incommensurate structure. The observation of bulk superconductivity establishes superconductivity as an emergent phase in this intrinsically synthesized moire material and highlights bulk moire crystals as a promising platform for investigating correlated quantum phenomena beyond artificially assembled two-dimensional structures.
Read the full abstract
Systems and Control
A Control Philosophy for Multiplexed Power Converters in Active Distribution Systems
Reconfigurable, multiplexed power electronic devices (M-PEDs) can provide more effective, flexible operation for applications in active distribution networks, enabling the mitigation of thermal constraints and voltage violations. To-date, operational approaches of these M-PEDs have not been described, a significant issue as a result of their relative complexity as compared to conventional PEDs. This work proposes a state machine-based control philosophy that can be used to manage the mutually exclusive selector- and current-control signals for M-PEDs. Two control approaches are described using this philosophy: an Off-Load approach, suitable for systems without time-critical network constraints; and a Hot-Swap approach, implemented when the impact of transients must be minimized. Simulations illustrate the evolution of the state machine for a back-to-back voltage source converter topology. It is concluded that the proposed state machine-based control philosophy enables M-PED operation whilst managing the additional complexity of this promising converter topology.
Read the full abstract
Mathematical Physics
Novel computational formulas and relations for special numbers and functions: approach to analysis of Debye functions
The first goal of this paper is to give a new family of special function related to the Debye functions. By using these function and generating function method, we derive many novel formulas and relations involving the Debye functions, multiple Hurwitz Lerch zeta function which interpolate the Apostol-Bernoulli numbers of higher order at negative integers. Proof method of theorems in this paper are different from those of theory of analytic numbers. The second goal of this paper is to show that special values and integral presentations of this function are closely related to unification of the Debye functions, the moment generating function for the negative binom distribution, the generating functions for the Apostol-type numbers of higher-order, and the Frobenius-Euler numbers, the Bernoulli numbers, and the Stirling numbers etc. Moreover, we give recurrence relations, Maclaurin's series expansion, and approximation formula for unification of the Debye functions. Finally, we give further remarks, observations and applications in mathematical physics on the results of this paper.
Read the full abstract
Computer Vision
GAN-Blot: A Controllable Structure-Style Synthesis Benchmark for Western Blot Forensics
Western blot (WB) images are widely used as key evidence in biomedical research. Recent scientific misconduct cases reveal that WB imagery is increasingly fabricated, making WB forensics a major concern for research integrity. However, while the progress of forensic detection techniques often relies on advances in forgery-generation techniques, the development of WB forensic techniques has been hindered by the lack of standardized appearance attribute definitions, image datasets, and controllable generation frameworks for WB imagery. To address this limitation, we present a controllable WB image synthesis framework, named GAN-Blot, for generating realistic synthetic WB images. We introduce a formulation that decomposes a WB image into a structure component and a style-reference component, enabling independent control over local protein-band geometry and the global visual appearance of a synthetic WB image. GAN-Blot integrates a dual-path autoencoding design with several style-alignment loss terms to enable implicit control over structure-style synthesis without predefined semantic appearance attributes. We further contribute a synthetic WB dataset containing more than 46K images and propose four evaluation protocols for controllable WB synthesis. Extensive experiments show that GAN-Blot can generate WB images with high fidelity in both protein-band structure and visual style. Under blind inspection, the generated images can fool domain experts and are not reliably distinguished from authentic WB images by existing detectors and screening platforms. These results demonstrate their utility as challenging controlled cases for validating and developing WB forensic methods.
Read the full abstract
Soft Condensed Matter
Structure and dynamics of interface around a quenched impurity in a colloidal liquid film
The interfacial structure and dynamics around a quenched impurity is far from understood till date. Here we explore the structural and dynamical properties of interface between colloidal fluid film and a quenched impurity by using computer simulation. We tune the size($\sigma_{imp}$) of a quenched pinned impurity and observe that the impurity surface is wetted by a fluid layer, giving rise to a finite-width interfacial region for sufficiently large impurities. Beyond this interfacial region, the host fluid exhibits quasi-long ranged orientational order(QLRO) due to the fluid- crystal phase coexistence. We find that the mean diffusivity becomes very low in the QLRO phase where the self van Hove function shows an exponential tail, signature of dynamic heterogeneity within the system. In the presence of second impurity the orientational order is suppressed if the fluid layers around the impurity particles overlap.
Read the full abstract
Quantum Physics
Spectral bounds for the partial transpose
Among the various entanglement measures, the negativity stands out not only for its clear physical meaning but also for being directly computable from the spectrum of the partial transpose. However, the negativity captures only the total weight of the negative eigenvalues, whereas the finer structure of the negative spectrum remains largely unexplored. In this work, we fill this gap by introducing a hierarchical generalization of the negativity, the Ky Fan $k$-negativity, and developing a unified analytical framework for deriving spectral bounds on the partial transpose. To obtain the absolute bounds, we reduce the maximization problem to a spectral graph optimization, whose solution yields the exact bound for every $k$ through a single cubic equation. We further investigate these spectral bounds both analytically and numerically under a fixed-purity constraint. In particular, we solve the $k=1$ case completely and uncover a simple underlying graph structure. As two direct applications, we show that the Ky Fan $k$-negativity robustly certifies genuine multilevel entanglement and that it converts the $p_3$-PPT condition into a quantitative lower bound on the negativity.
Read the full abstract
Probability
Fluid and Diffusion Approximation of a Multiclass Proportional Processor Sharing Queue with Reneging and General Distributions
In this paper, we resolve the long open problem of the diffusion approximation for a generally distributed processor sharing queue with reneging. In particular, we first extend the known fluid limit for a single class processor sharing queue with reneging to the multiclass proportional processor sharing queue with reneging. We prove uniqueness of fluid model solutions and convergence of fluid scaled models to fluid model solutions. Next, we show that, under diffusion-scaling, the models are tight, and that subsequential limits can be uniquely characterized by a certain system of SDEs driven by a Gaussian sheet on $\R_+^2$ with a nontrivial covariation structure.
Read the full abstract
Robotics
MemCorr-DP: Counterfactual Correspondence Conditioning for a Diffusion Policy Guided by a Reference
Behavior-cloned visuomotor policies can remain accurate near their training distribution yet fail when object position and camera viewpoint change together. A successful reference trajectory contains the geometry needed to transfer the same interaction, but the policy must align that geometry with the current scene and remain sensitive to it during denoising. To address these challenges, we present MemCorr-DP, a diffusion policy that lifts frozen RoMa v2 matches into explicit 3D relations between the current scene and the reference trajectory. A counterfactual paired objective assigns opposite behaviors the same physical state and noisy action while retaining reference-specific denoising targets. Mixed-condition fine-tuning then adapts the policy from ground-truth geometry to measured correspondence errors. Our strongest evaluation places the Door in the outermost position bands beyond the training support and changes the query camera by $\pm15^\circ$. Under this combined shift, MemCorr-DP achieves 96.67% closed-loop success, compared with 88.00% for a visual Transformer with the same action architecture. Objective ablations and reference interventions show that behavior responds to the selected reference, while matched controls favor the complete relation set over future motion or centroid geometry alone. These results support explicit 3D reference relations as a robust conditioning interface when spatial and viewpoint changes are compounded in the evaluated task.
Read the full abstract
Functional Analysis
Convex-Hull Instability of the $\gamma_2$-Functional in $L^p$
For every $2<p<\infty$ and every integer $r\ge2$, we construct a finite set $T\subseteq S_{L^p[0,1]}$ such that $|T|\le2^{Cr^2}$, $\gamma_2(T)\le Cr$, and $\gamma_2(\conv T)\ge c r^{3/2-1/p}$. Consequently, for every fixed $p>2$, both estimates in Talagrand's Research Problem~2.11.3 fail in each of the spaces $L^p[0,1]$ and $\ell_p$. The lower bound follows from a multilevel product principle applied to a scale-separated product of Euclidean simplices. The same construction gives the sharp convexification profile of $\ell_p^r(\ell_2^{2^{128r}})$ for $2<p\le\infty$ and, by finite representability, quantitative failure in every infinite-dimensional Banach space with cotype index greater than $2$.
Read the full abstract
Soft Condensed Matter
Coupling and decoupling between translational and rotational dynamics in a tetrahedral molecular liquid
The translational dynamics usually decouples earlier than the rotational in supercooled liquids as the temperature decreases, whereas the inverted scenario remains scarce reported. In this work, starting from the coarse-grained ortho-terphenyl model, we build a rigid tetrahedral structure model. It exhibits an earlier decoupling in rotation than in translation. The Stokes-Einstein-Debye relation breaks down while the Stokes-Einstein relation remains intact. The decoupling happens at approximately 2Tg similar as that observed in supercooled water. The rotation shows more heterogeneous dynamics than the translation at all temperatures. Our results suggest that the steric hindrance plays an important role in determining the decoupling between the translational and rotational dynamics.
Read the full abstract
Cryptography and Security
MechAudit-40: White-Box Auditing across 40 LLM Attack Mechanisms
While LLM attacks span prompt optimization, multi-turn context manipulation, retrieval poisoning, and model backdoors, white-box defenses are typically evaluated on isolated attack families. Consequently, whether heterogeneous attacks leave internal representation shifts that generalize to unseen threat mechanisms remains unknown. We present MechAudit-40, a systematic evaluation of 40 attack mechanisms across five open-weight model architectures. Threat-specific success criteria, 100,000 matched clean-attack representation pairs, predefined categories, and grouped holdouts isolate genuine attack-induced displacement from target scale, corpus bias, and data-leakage shortcuts. Across this testbed, attacks induce structured multi-depth trajectories rather than isolated layer spikes. While raw peaks are non-portable across architectures, target-calibrated profiles preserve transferable geometric signatures: under complete mechanism holdout, hidden states alone recover the threat category of unseen attacks with 82.5% accuracy. Guided by this finding, we design MechAudit, a runtime auditor that operates under strict zero-oracle constraints without requiring clean baseline traces or attack metadata. MechAudit detects 81.1% of held-out attack executions at a 0.70% false-positive rate and maintains 78.1% recall when an entire functional category is withheld. In matched comparisons, MechAudit is the only detector that avoids mechanism-level coverage collapse, maintaining over 50% recall across all 40 mechanisms. Internal representations thus support cross-mechanism attack-exposure auditing against calibrated benign references, but decouple from downstream task compromise and parameter integrity.
Read the full abstract
Computation and Language
SAGE: A Hierarchical Framework for Evaluating Interpretive Literary Quality in Narratives
Assessing the literary quality of narratives requires evaluating interpretive dimensions (cultural representation, emotional depth, and philosophical engagement) that existing NLG metrics cannot measure. We introduce SAGE, a six-layer evaluation framework that separates rule-based assessment of observable textual properties from LLM-based evaluation of interpretive qualities drawn from cultural theory, affect theory, and existentialist philosophy. Each interpretive layer is assessed through multi-round iterative LLM evaluation with independent cross-validation, achieving measurement-grade reliability (98.8% convergence, >94% inter-rater agreement) stable across evaluator models. Validated on 600 evaluations across 100 short stories, our central finding is a systematic capability boundary: emotional-psychological representation approaches human levels, while cultural critique and philosophical depth exhibit approximately double the gap. LLM-generated narratives score below even commercial genre fiction on all three layers. We interpret this as a boundary between pattern-reproducible literary capacities learnable from training corpora and stance-requiring ones demanding cultural positioning and philosophical engagement that pattern matching alone cannot provide.
Read the full abstract
Machine Learning
A Statistical and Machine Learning Framework for Quantifying Offensive Impact in Professional Box Lacrosse
Professional box-lacrosse statistics summarize outcomes but provide limited information about shot quality or the roles behind scoring opportunities. This study develops a documented framework for estimating expected goals (xG) and attributing recorded offensive involvement using 1,006 manually annotated Rochester Knighthawks shot attempts, including 151 goals, from 13 consecutive 2025-2026 National Lacrosse League games. Logistic regression, random forest, and extremely randomized trees were evaluated across three nested feature sets using Leave-One-Game-Out cross-validation and a training-fold base-rate benchmark. The contextual baseline random forest had the lowest observed pooled log loss (0.4189) and Brier score (0.1260), improving on the benchmark by 1.22% and 1.50%; five of nine specifications did not beat the benchmark. Adding two-man-action and pick-type fields did not improve the primary metrics. Core Offensive Impact attributes recorded involvement through shooter xG and shot-based expected assists for final passers. Expected Pick Value (xPV) compares a qualifying pick's observed-state probability with a no-pick counterfactual. Its magnitude was indistinguishable from model noise. Its directional pattern exceeded 200 row-permutation replicates, but limited tail resolution and failure to preserve game-level pick composition make the diagnostic descriptive rather than inferential. Accordingly, xPV is reported only as an exploratory augmented component. Given the single-team, 13-game sample, the results are an initial case study rather than league-wide or causal estimates.
Read the full abstract
General Relativity and Quantum Cosmology
Semilinear wave equations on the Witten bubble spacetime
We initiate the study of nonlinear wave equations on the Witten bubble spacetime (also known as the "bubble of nothing"), which is an $\mathrm{SO}(3,1)\times \mathrm{U}(1)$-symmetric solution to the Einstein vacuum equations in $(4 + 1)$ dimensions. This spacetime was introduced by Witten to model the semiclassical instability of the Kaluza–Klein spacetime $\mathbf{R}^{3+1}\times S^1$ (which is classically stable by work of Huneau–Stingo–Wyatt (arXiv:2307.15267)). We prove a small-data global existence result without symmetry assumptions and an improved decay result for $\mathrm{U}(1)$-symmetric solutions to a class of semilinear equations satisfying a version of the null condition. Key to the proof are novel estimates for the linear wave equation, which has been studied in the physics literature by Bhawal and Viveshwara and in the mathematics literature by Bachelot (arXiv:1601.03682).
Read the full abstract
Statistical Methodology
A Likelihood-Ratio Test for Verifying Weak Stochastic Transitivity
This paper proposes and studies a likelihood-ratio test of the null hypothesis that weak stochastic transitivity (WST) does not hold. This is the reverse of the formulation commonly used in the literature, where WST is set as the null hypothesis. We show that, even when the number of items grows with the number of comparisons per pair, the uniform size converges to the nominal level, with the critical value determined by a chi-bar-square distribution. We further establish that the Type II error converges uniformly to zero under a sufficient signal-strength condition. Simulation studies demonstrate good finite-sample Type I error control and show that power increases with the sample size and signal strength.
Read the full abstract
High Energy Astrophysical Phenomena
CoportSL: A Contribution-constrained Hybrid Slow-light Framework for Time-dependent Polarized GRMHD Imaging
Fast-light approximations neglect fluid evolution along rays, whereas slow-light modeling is indispensable for recovering the true magnetohydrodynamic state. However, full slow-light radiative transfer for extended general relativistic magnetohydrodynamic (GRMHD) sources requires simultaneous access to many fluid snapshots and is memory-intensive. We introduce CoportSL, the first contribution-constrained hybrid slow-light framework for time-dependent full-Stokes imaging. It uses emission, absorption, and Faraday contributions to identify where fluid evolution must be retained, applies fast light elsewhere, and loads only snapshots spanning the relevant delays. Tests with M87*-like magnetically arrested disk GRMHD data show that the contribution-based region and delay-based snapshot restrictions each keep normalized full-image Stokes differences below $4\times10^{-3}$ relative to the corresponding complete calculation. At this accuracy, CoportSL requires 75.3% and 44.7% fewer snapshot layers for near-horizon and jet images, respectively; its per-frame slow-light transfer time remains comparable to fast light. For the two configurations, source-code estimates place the capacities of the principal data structures at 255-657 GiB for a fixed public ipole version and 20.2-37.3GiB for CoportSL, bringing both configurations within workstation-scale memory. Fast–slow comparisons further show close agreement in near-horizon variability, whereas jet variability follows similar overall trends but differs in local peaks and amplitudes; in both cases, fast light misses substantial full-Stokes spatial structure. As the next-generation Event Horizon Telescope (ngEHT) advances toward dynamical imaging and spatially resolved polarimetry, CoportSL provides a computationally practical way to model full-Stokes finite-light-travel-time signatures in extended black hole systems.
Read the full abstract
Probability
Rough backward stochastic differential equations
We develop an intrinsic well-posedness theory for nonlinear backward stochastic differential equations (BSDEs) driven simultaneously by Brownian motion and a (level-$2$) rough path of finite $p$-variation. Unlike earlier approaches based on smooth approximation or transformation methods, we formulate the equation directly by viewing its solution as a rough semimartingale (in the sense of \cite{friz2023rough}). This framework is particularly suited to BSDEs, whose Brownian martingale component is only implicitly defined and lacks the a priori time regularity required by stochastic-sewing-based controlled rough path methods \cite{fhl21,allan2024rough}. We establish comparison, existence, uniqueness, and stability under the natural regularity condition $H\in C_b^\gamma$, $\gamma>p$. The main analytical difficulty, namely, the loss of integrability arising from nonlinear composition, is overcome through conditional $p$-variation norms with BMO-type properties. Finally, by randomizing the rough driver as a Brownian rough path, we establish a direct correspondence between rough BSDEs and backward doubly stochastic differential equations (BDSDEs).
Read the full abstract
Quantum Physics
Solution-phase fluorination of nanodiamond: near-surface NV$^-$ activation and spin relaxation
Nanodiamonds hosting luminescent point defects, known as fluorescent nanodiamonds (FND), are a leading platform for quantum technology. The nitrogen-vacancy (NV) centre is the most intensively studied of these; its negatively charged state (NV$^-$) can serve as a qubit at room temperature, and its stability is governed by surface functional groups. We present two solution-phase fluorination routes for stabilising NV$^-$: direct C-F bond formation by decarboxylation with xenon difluoride via a radical mechanism, and the Balz-Schiemann reaction, which replaces surface amino groups with fluorine. The two routes were compared by infrared, X-ray photoelectron, energy-dispersive X-ray, Raman and photoluminescence spectroscopy. Both gave a high NV$^-$ fraction, up to $\sim$85% on average, which to our knowledge is among the highest reported for surface-terminated nanodiamonds of this size and, in particular, for fluorine termination. We attribute the stabilisation to the fluorination treatment, which removes acceptor-like carboxyl groups and forms C-F bonds that give the surface a positive electron affinity. Frequency-domain relaxometry shows that the fluorinated particles retain a long spin-lattice relaxation time, $733\pm56$ and $712\pm20$ $\mu$s for the XeF$_2$ and Balz-Schiemann routes, several times the values reported for commercial HPHT nanodiamonds, although shorter than the $1173\pm123$ $\mu$s of the as-received material. Fluorination thus activates near-surface NV$^-$ centres, which dominate relaxometric sensing, at the cost of a moderate shortening of $T_1$.
Read the full abstract
Information Retrieval
TaxoConf: Taxonomy-Guided Automatic Conference Program Organization
Conference program organization, the task of assembling accepted papers into a technical program, is labor-intensive. Papers must be grouped into topically coherent sessions under hard operational constraints, and existing methods rarely achieve both at once. To address this problem, we present TaxoConf, a system that organizes conference programs around a conference-specific topic taxonomy. TaxoConf constructs a canonicalized multi-parent taxonomy over the accepted papers and represents each paper by its frontier of most specific topics. It derives a specificity-weighted optimal-transport distance between papers from this taxonomy, then solves a binary integer programming problem that assigns papers to sessions by minimizing within-session distance subject to all hard constraints. On benchmarks built from four 2025 conferences, TaxoConf attains the highest session coherence (4.62 out of 5) and the closest agreement with human-curated sessions (NMI 0.761) while incurring no constraint violations. TaxoConf has also been deployed to generate the technical program of SIGIR 2026, where the organizers accepted the initial output with only a few edits, preserving 91.8% of oral assignments and the entire poster program while requiring no correction of hard-constraint violations, and an on-site survey of 47 attendees rated the overall program quality 4.26 out of 5. The system is publicly available at https://taxoconf.com.
Read the full abstract
Networking
Measurement-Device Placement in MDI-QKD Networks with Minimal Trusted Relays
Measurement-Device-Independent Quantum Key Distribution (MDI-QKD) removes detector side-channel vulnerabilities by delegating measurements to an untrusted relay that, when shared by several user pairs, acts as a Bell-state measurement (BSM) hub. Channel loss still limits the reach of MDI-QKD links, so long-range services rely on trusted relays for key forwarding. As MDI-QKD moves toward metropolitan deployment, a key network-planning question arises: how should BSM hubs be placed on existing fiber infrastructure to minimize the use of trusted relays? In this work, we formalize this challenge as the MDI-QKD Hub Deployment (MHD) problem. We first prove that the MHD problem is NP-hard, and then formulate it as a Mixed-Integer Linear Programming (MILP). To the best of our knowledge, this is the first formulation for MDI-QKD network planning that captures the structural features specific to MDI-QKD, namely a shared BSM hub, two-link user-to-hub routing, and loss-balancing constraints, while jointly determining hub placement, user-to-hub assignment, and trusted-relay demand allocation. Our solution accounts for realistic budget and capacity constraints, including practical insights from real-world deployments of commercial MDI-QKD solutions. Numerical evaluations on three metropolitan topologies (12 to 50 nodes) at realistic geographic distances show that topology structure governs trusted-relay demand: hub placement alone eliminates all trusted relays in compact urban meshes, while in sparse topologies, relaxing the loss-balancing constraint removes the dominant source of trusted-relay usage at no additional infrastructure cost. The key-rate threshold at which trusted relays first appear shifts monotonically with the network diameter, i.e., the largest shortest-path distance between any node pair in fiber kilometers, delineating the feasibility boundary of pure MDI-QKD deployment.
Read the full abstract
Computer Vision
Multi-History-Step SDE Inversion for Image Editing with Superior Regional Awareness
In recent years, diffusion stochastic differential equation (SDE) inversion and inversion-free methods have become prevalent for training-free image editing, as they can achieve faithful reconstruction without tuning. However, existing approaches remain inefficient, exhibit limited plasticity, and struggle to accurately preserve unedited regions. To address these issues, we propose MIEdit, a training-free editing framework based on SDE inversion. MIEdit introduces a predictor-corrector multi-history-step scheme to achieve superior editing quality with fewer steps. We further mitigate heterogeneity and conflict between the multi-conditioned noise residuals and gradient terms during sampling, improving stability and editing plasticity under large edits. MIEdit also includes Inversion-Time Automatic Semantic Angle Masking (IASM); it leverages classifier-free guidance to automatically generate semantic angle masks during inversion and applies them throughout the sampling process for regional constraints, without extra user inputs. We additionally construct EditEval++ (30 fine-grained tasks, 1,000+ image-text-mask triplets) for comprehensive evaluation; experiments show that MIEdit outperforms state-of-the-art techniques. Project page: https://whywwwzzzg.github.io/MIEdit/.
Read the full abstract
Representation Theory
A hereditary theorem for rigid and pseudorigid components of Lusztig's nilpotent varieties in type $A$
For irreducible components $C_\sigma$ of Lusztig's nilpotent varieties of type $A$ with graded dimension $(1,2,\dots,n,n-1,\dots,1)$ arising from permutations $\sigma\in S_n$, we characterize the property that $C_\sigma\oplus C_\sigma$ is an irreducible component combinatorially in terms of $\sigma$. The permutations that occur, which we call pseudosmooth, are described by a recursion on direct sums and deleting suitable corners, whose terminal cases are the permutations obtained from \[ 3412,\quad 4231,\quad 35142,\quad 42513,\quad 45312,\quad 426153,\quad 463152,\quad 526413 \] by inflating the entries into consecutive decreasing blocks. The main new input is a hereditary property valid for decompositions of multisegments with disjoint extreme points.
Read the full abstract
Optics
Shortcuts to adiabaticity for rapid soliton compression in nonlocal media
We investigate shortcut-to-adiabaticity protocols for the rapid compression of optical solitons in nonlocal media. Using a variational approximation, we derive an effective Ermakov-like equation for the soliton width and employ inverse engineering to design propagation-dependent control parameters. Three control strategies are compared, based respectively on modulation of the characteristic nonlocal length, the Kerr nonlinearity, and the external parabolic confinement. We show that all three protocols enable high-fidelity compression over strongly reduced propagation distances. By comparing control smoothness and final fidelity, we find that the relative performance of the protocols in the very short-distance regime depends on the chosen criterion, revealing a trade-off between implementation smoothness and target-profile accuracy. These results establish a practical and general route to fast soliton manipulation in nonlocal media.
Read the full abstract
Optimization and Control
Input-to-State Stabilization of a Coupled ODE-PDE System with Time-Varying Coefficients via Composite Boundary Control
This paper proposes a novel composite boundary feedback control law that ensures input-to-state stability (ISS) for a coupled ODE-parabolic PDE system with time-varying coefficients in both subsystems. In controller design, we circumvent the need to directly solve coupled time-varying parabolic-hyperbolic kernel equations by employing an analytic pre-defined gain function and a time-varying Volterra kernel function to design the control law explicitly. In stability analysis, to address the simultaneous challenges of Dirichlet boundary disturbances and time-varying coefficients, we employ the square root of a time-varying positive definite matrix and a superlinear function to construct a nonquadratic Lyapunov function for the ODE and a generalized Lyapunov functional for the PDE, respectively, in the target system, thereby establishing the ISS in the $L^2$-norm of the closed-loop system. Numerical simulations are presented to illustrate the effectiveness of the proposed control scheme.
Read the full abstract
Machine Learning
Deep Barycentric Regression for Optimal Transport Map Estimation and Its Statistical Optimality
The optimal transport (OT) map provides a geometric transformation for aligning probability distributions and has become a useful tool in machine learning. However, existing estimators of the OT map still exhibit a gap between sharp statistical guarantees and practical parametric estimation based on stable training objectives. Theoretical estimators achieve minimax optimal convergence rates, but they are typically nonparametric and can incur demanding implementation design or inference costs. Practical estimators are parametric and scalable, but their statistical guarantees remain underexplored, and their min-max, adversarial-like training objectives can be sensitive to optimization algorithms. We propose BROT (Barycentric Regression for Optimal Transport), a simple two-step method that first computes the unregularized OT plan and then fits a deep neural network (DNN) to the induced barycentric targets by least-squares regression. Under standard regularity conditions, we prove that the DNN estimator of BROT attains the minimax convergence rate, when the ground-truth OT map is Lipschitz. Numerical studies on synthetic datasets and an image dataset show that BROT provides accurate map estimates, strong target distribution matching, and competitive transport costs, compared to existing estimation methods. Experiments on two downstream tasks, single-cell perturbation prediction and unsupervised domain adaptation, further suggest that the accurate estimation of BROT can translate into stronger task performance.
Read the full abstract
Algebraic Geometry
Permutation Representations on Cohomology of Toric Varieties
Let $G$ be a finite group acting properly by lattice automorphisms on a complete simplicial fan $\Sigma$. An open question due to Stanley asked whether the (ungraded) representation carried by the cohomology $H^*(X_{\Sigma})$ of the associated toric variety $X_{\Sigma}$ is isomorphic to a permutation representation of $G$. We prove that Stanley's question has an affirmative answer for all smooth projective toric varieties without the properness assumption on the action. The proof is inspired by toric mirror symmetry.
Read the full abstract
Data Structures and Algorithms
Reportable Shortcuts with RLBWTs
Backward search over a run-length compressed Burrows-Wheeler transform (RLBWT) takes one step per pattern character, even when long stretches of the pattern match material that recurs throughout a highly repetitive collection. We describe shortcuts: for a precomputed set of pairs $(\alpha,\beta)$ of strings, a backward search that has just matched $\beta$ and finds $\alpha$ immediately to its left in the pattern can cross $\alpha$ in one step. Since a shortcut is taken only after its pair has been recognized in the pattern, the search returns a report of the shortcuts it took along with the usual BWT interval. Our motivation is pangenome graphs, where such pairs mark the places where a pattern passes through a vertex, so the report gives the path a match takes through the graph. We work out the case of a single linear reference $R$, with $\beta$ ranging over the length-$\ell$ windows of $R$ starting at multiples of $\ell$, and $\alpha$ over the $2^t \ell$ characters preceding such a window. We show that the search counts correctly, that under stated conditions it crosses a stretch of the pattern matching $m$ consecutive windows of $R$ with $O(\log m + m / 2^\tau)$ shortcuts, where $2^\tau \ell$ is the longest shortcut, and that the shortcuts can be built efficiently from the RLBWT. On the Pizza&Chili cere collection of 37 genomes, shortcuts make backward search 2.3 to 4.2 times faster on exact patterns of length 200 to 1000, and 1.7 to 2.0 times faster with 1% of the characters substituted, for 86% more space. On 11 gigabases of genomes of seven bacterial species, they make it 1.6 to 1.9 times faster on exact patterns for 32% more space. On whole chromosome 19 haplotypes against 16 to 64 others from the Human Pangenome Reference Consortium, shortcuts in both directions make Boyer-Moore-Li search for maximal exact matches of length at least 1000 about 8 times faster.
Read the full abstract
Cryptography and Security
Federating Trust Perimeters: Extending Industry IAM with DLT-Based Governance
Digital systems are becoming more integrated, autonomous, and cooperative. AI agents, future mobile networks, and machine-to-machine economies point to one trend: spontaneous, cross-organizational, unplanned interactions between non human entities (NHEs). Trust establishment for them remains an open problem. Federation is the natural candidate, but established approaches, from OpenID Federation 1.0 and SAML to Federated Identity Management, presuppose what this setting denies them: manual, ahead-of-time configuration and a common trust anchor, whether pre-established members or a shared provider. Trust domains must therefore federate without being prefigured to do so: plan for unplanned interactions. This paper examines whether prominent Identity and Access Management (IAM) approaches, namely SPIRE, Workload Identity Federation (WIF), and OpenID Federation 1.0, can support such federation. Drawing requirements from disparate fields (medical, mobile networks, agentic AI), it argues that SPIRE is the most promising starting point, but needs three extensions to meet them all: token exchange, letting a home domain mint scoped, audience-bound tokens from a foreign workload's SPIFFE Verifiable Identity Document (SVID); remote attestation, so a trust decision targets a specific workload rather than a whole domain; and a distributed-ledger layer that anchors trust roots, carries federation governance, and publishes the shared keys the other two depend on.