Statistical Methodology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
Adaptive Conformal Inference (ACI) extends conformal prediction to non-exchangeable settings by adjusting the nominal miscoverage level online in response to recent coverage errors. When forecasts are issued with horizon $\tau$, however, the outcome needed to evaluate a prediction is observed only $\tau$ steps later, so these adaptive updates must rely on delayed feedback. We study this setting and ask how the effect of delay depends on the persistence of the residual process. First, we show that the $\tau$-delayed ACI recursion can be decomposed into $\tau$ interleaved ACI-like sequences. This representation yields a finite-sample bound on long-run empirical coverage with explicit dependence on $\tau$. We also derive an approximate marginal coverage bound that relates coverage deviation to changes in the underlying environment across the forecast horizon and to the adaptation rate $\gamma$. We then introduce the delay-to-memory ratio $r=\tau/L$, where $L$ is the time scale over which the temporal signal driving non-exchangeability decays. Simulation results show that the usefulness of this ratio depends on the form of temporal dependence: it strongly organizes performance under AR(1) dependence, is less predictive of overall performance under GARCH(1,1) and Markov switching, but more clearly characterizes when scale normalization remains useful in those settings. Abrupt mean- and variance-shift experiments further show that the preferred adaptation rate depends on the residual dynamics. Overall, the results show that the effect of forecast delay is best understood relative to the time scale over which past residual information remains relevant.
Quantum Physics
Qubit-Based Benchmarking of InP HEMT LNAs: Readout Fidelity Versus Power Consumption
High-fidelity single-shot readout of superconducting qubits is essential for fault-tolerant quantum computation. Without a quantum-limited amplifier such as a Josephson parametric amplifier, the cryogenic high-electron-mobility-transistor (HEMT) low-noise amplifier (LNA) at the 4 K stage is the dominant noise source in the readout chain. HEMT LNAs are conventionally characterized by Y-factor measurements of the noise temperature $T_N$, independently of the quantum measurement they ultimately serve. Here we present a qubit-in-the-loop benchmarking method. The method uses the two-dimensional IQ histogram of single-shot readout as a direct figure of merit. We apply it to three state-of-the-art cryogenic InP HEMT LNAs with 53%, 60%, and 70% channel indium content, together with a commercial reference amplifier. The 60% and 70% devices have similar $T_N$ in Y-factor measurements, both lower than the 53% device. The 70% device has the highest gain, but qubit readout SNR and assignment fidelity $\mathcal{F}_a$ instead peak at 60%. Using this method, we map $\mathcal{F}_a$ against HEMT LNA dc power consumption for each device. $\mathcal{F}_a$ does not simply saturate with increasing power. For several devices it declines above a device-dependent power well below typical operating points. For the 60% device, which has the highest overall $\mathcal{F}_a$, about 1~mW is needed to maintain $\mathcal{F}_a > 85\%$. Across all four devices, $\mathcal{F}_a > 80\%$ is reached with as little as about 0.3~mW, roughly an order of magnitude below typical operating points. These results establish a qubit-referenced benchmarking methodology and provide practical guidance for amplifier selection and bias in power-constrained multi-qubit readout systems.
Read the full abstract
Distributed Computing
An Efficient Out-of-Core Tomographic Imaging Framework for Edge Devices
Computed Tomography (CT) is an essential 3D imaging technology widely used in medical diagnostics and scientific research. However, performing CT imaging on edge devices is challenging due to limitations in computational power, memory capacity, and energy budget. This paper presents an efficient CT reconstruction framework, called edgeFBP, designed for Nvidia Jetson System-on-Chip (SoC) devices. edgeFBP adopts an end-to-end pipeline design for efficient out-of-core image reconstruction under tight power and memory constraints. edgeFBP utilizes a mixed-precision strategy leveraging half-precision Tensor Cores (TCs) to accelerate the bottleneck back-projection (BP) kernel. edgeFBP achieves a 1.83x speedup over the widely used RTK library on Jetson Nano and a 2.56x speedup on Jetson AGX. Under a strict 25-Watt power budget, edgeFBP on Jetson Nano achieves up to 5-48x higher energy efficiency than an Nvidia DGX A100, enabling datacenter-scale imaging on constrained edge devices.
Read the full abstract
Fluid Dynamics
Weakly nonlinear dynamics of a follower-force active filament in simple shear flow
We employ weakly nonlinear theory to investigate how an externally imposed simple shear flow affects the onset of spontaneous dynamics of an inertialess active filament deforming in Stokes flow. The filament, clamped to a wall at one end, is subjected to a compressive "follower force" applied tangentially at its free end. By extending my earlier weakly nonlinear analysis of the shear-free case (J. Fluid Mech., 1007 A65, 2025), we derive a generalized amplitude equation governing the near-onset dynamics under weak shear. Analysis of the amplitude equation shows that, besides inducing a steady deflection, the shear damps the filament's intrinsic oscillations. This damping arises from a subtle nonlinear resonance between the shear and the intrinsic oscillations, scales quadratically with the shear rate, and is anisotropic—stronger in the flow direction than normal to it. Without shear, stable whirling states, where the filament tip traces a circular orbit in a plane parallel to the wall, and unstable planar-beating states are known to simultaneously emerge at a critical follower-force value, with circular whirling typically observed beyond this threshold. Shear breaks this degeneracy, driving a sequence of dynamical transitions: from circular to elliptical whirling, then to transverse beating (normal to the shear), and ultimately to steady deflection.
Read the full abstract
Artificial Intelligence
Elastic Horizon: Discovering the Effective Interaction Frontier in Agentic Reinforcement Learning
Scaling the interaction horizon-the maximum number of environment interactions per episode-improves LLM agents on long-horizon tasks, and curriculum-based methods that progressively expand the horizon outperform fixed-horizon alternatives. However, existing schedules are open-loop: they monotonically increase the horizon until a manually specified maximum, with no mechanism to detect when further expansion stops helping. We propose the effective interaction frontier hypothesis: a dynamic boundary beyond which additional interactions yield diminishing returns while cost grows linearly. We then introduce Elastic Horizon, a closed-loop controller that tracks this boundary via the 90th percentile of successful trajectory lengths. On AppWorld and BFCL, fixed-horizon sweeps reveal clear saturation plateaus; Elastic Horizon stabilizes the horizon inside the saturation band from both under- and over-capacity initializations, attains the best success rates across 7B and 14B backbones, and saves up to 25% of per-step trajectory tokens. Our work shifts the paradigm from how to scale interaction horizons to when to stop scaling.
Read the full abstract
Statistics Applications
Structure-Adaptive E-Value Filter for Detecting Regional Signals in Brain Imaging
Structural MRI provides a noninvasive view of the neuroanatomical differences associated with cognitive impairment and dementia. Using data from the Alzheimer's Disease Neuroimaging Initiative, we investigate which anatomical regions exhibit widespread gray-matter differences and how these regional patterns vary across the clinical spectrum. Addressing this goal requires translating spatially dependent voxel-level evidence into regional conclusions while controlling multiplicity across anatomical regions. We propose the Structure-adaptive E-value FilTer (SEFT), which uses flexible working models to construct spatially adaptive voxel-level scores and aggregates them into regional partial-conjunction e-values. When combined with the e-value Benjamini–Hochberg (e-BH) procedure, these e-values provide finite-sample control of the set-wise false discovery rate under arbitrary interregional dependence. The ADNI analysis reveals a coherent neuroanatomical pattern: the exploratory analysis shows that differences between normal cognition and mild cognitive impairment are concentrated in medial-temporal regions, whereas the differences between mild cognitive impairment and dementia extend more broadly into temporal–limbic and posterior association regions. Both patterns largely overlap the normal-cognition–dementia benchmark, identifying a shared anatomical core across the clinical comparisons.
Read the full abstract
Number Theory
Parameterized partial theta identities and a unified $q$-difference proof
We establish five families of integer-parameter extensions of Ramanujan's partial theta identities. The families follow from a common two-parameter specialization of Andrews' transformation, for which we give an independent proof based on a $q$-difference recurrence and a boundary estimate. Specializations of the integer parameter recover six identities from Ramanujan's lost notebook. As an application, a residue argument applied to the fifth family gives an integer-parameter extension of Lovejoy's residual identity, from which we construct a corresponding family of conjugate Bailey pairs.
Read the full abstract
Cryptography and Security
Towards a Resilience-Theoretic Foundation for Adversarial Robustness in Industrial Control System Anomaly Detection
Anomaly-based intrusion detection systems in industrial control systems (ICS) and operational technology (OT) environments are increasingly required to meet formal resilience criteria: absorbed adversarial disturbances, graceful degradation under sustained attack, and certified system-level guarantees. Existing resilience frameworks for cyber-physical systems define absorb-recover-adapt trajectories at the architectural level but do not treat machine learning anomaly detectors as first-class components, leaving a gap between component-level robustness evaluation and system-level resilience certification. In this paper, we establish that adversarial robustness in ICS anomaly detection is a specific instantiation of system resilience, and formalise this connection by mapping four resilience constructs, i.e. disturbance class, absorption capacity, recovery trajectory, and degradation function, onto the adversarial machine learning setting. We derive a compositional resilience bound for heterogeneous ICS detection networks, showing that the binding constraint on system-level resilience is the coupling-adjusted absorption capacity of each node along the attack path, not the per-node capacity – so the binding node need not be the weakest one. Empirical validation on the BATADAL water distribution system benchmark demonstrates that the resulting metrics surface operationally significant phenomena invisible to standard benchmarks: the absorption-degradation divergence under adversarial training, and the paradox that hardening the binding node in isolation reduces system-level resilience. Implications for ICS architecture design and certification standards are discussed.
Read the full abstract
Human-Computer Interaction
Living with AI Companions: Sustained AI Companionship Predicts Lower Well-Being Through Lower Human Interaction
AI chatbots are increasingly used for companionship, emotional support, and personal self-disclosure; however, how social engagement with these systems unfolds over time and shapes users' well-being remains unclear. To address this, we conducted a two-wave longitudinal study of CharacterAI users, surveying 1,182 participants at baseline and 439 after a mean follow-up of 12 months. We examined how social engagement with AI companions evolves and how these longitudinal engagement patterns may influence well-being through two hypothesized pathways: sustained social engagement over time and the displacement of human social interaction. We found that interaction intensity, companionship use, and self-disclosure all showed substantial continuity over time. Greater interaction intensity at baseline predicted greater subsequent interaction intensity, companionship use, and self-disclosure. Consistent with the longitudinal engagement pathway, sustained social engagement across these dimensions was consistently associated with lower well-being. Results further support the social displacement pathway, indicating that these links were mainly explained by lower in-person social interaction. These findings highlight the importance of designing AI companions that support human social relationships without displacing them.
Read the full abstract
Quantum Physics
Hudson's theorem fails for the SU(1,1) discrete series
Hudson's theorem states that a pure state of a bosonic mode has a non-negative Wigner function if and only if it is Gaussian. It underwrites the reading of Wigner negativity as a faithful signature of pure-state non-classicality. We show the statement has no analogue on curved phase space. For the positive discrete series of $SU(1,1)$, realised on the upper sheet of a two-sheeted hyperboloid, the Wigner-positive pure states form a strictly larger set than the Perelomov coherent orbit. Superpositions of the lowest weight state with the first excited state stay positive up to a mixing angle of $24.93^\circ$ at Bargmann index $k=1$, and the admissible set has positive volume, with a maximal width that is not attained in the two-state direction. We show analytically that the quadratic form controlling positivity degenerates in the far field onto a single mixing angle. That degeneracy bounds the window by $\arctan(1/\sqrt{2k})$ and leaves the threshold itself fixed at intermediate hyperbolic distance.
Read the full abstract
Systems and Control
A Continuous-Time Generalization of the LPV Fundamental Lemma
Controller design for physical systems directly from data is of tremendous interest in both the industry and academia. However, the research on direct data-driven control has thus far mainly focused on discrete-time linear time-invariant systems. To make the highly non-trivial step to continuous-time nonlinear systems, this paper explores an intermediate route through the framework of linear parameter-varying (LPV) systems. LPV systems can be used as a convenient surrogate for nonlinear systems to achieve systematic analysis and controller design. In this work, we generalize the LPV Fundamental Lemma for discrete-time systems towards a class of continuous-time LPV systems, achieving data-driven representations that can be used to design continuous-time LPV controllers.
Read the full abstract
Machine Learning
Kolmogorov–Arnold stability for discontinuous functions
Here we investigate the stability of the Kolmogorov–Arnold representation theorem (KART) under adversarial reparameterisations of the hidden layer for multivariate discontinuous and unbounded functions. Our results provide a rigorous mathematical foundation for the structural robustness of modern deep learning architectures, such as Kolmogorov–Arnold Networks (KANs), under adversarial configurations.
Read the full abstract
Probability
Critical and subcritical fusion asymptotics for Sine$_\beta$ correlation functions
We determine the first correction to the leading Vandermonde fusion law for the correlation functions of the Sine$*\beta$ process in the critical and and subcritical regimes $m\beta\leq1$. When $m\beta<1$, the normalized correction is of order $|\varepsilon|^{1+m\beta}$, with a strictly negative coefficient given by an explicit gamma-function ratio times an absolutely convergent arithmetic-geometric mean deficit integral. At $m\beta=1$, it is $-\frac{\sum*{i<j}(a_i-a_j)^2}{8m^2(2m+1)}\varepsilon^2\log(1/|\varepsilon|)+O(\varepsilon^2)$. For two merging points, the subcritical coefficient reduces to a gamma-function expression involving $\sec(\pi\beta)-1$, and the critical logarithmic coefficient is $-1/160$. The argument starts from a geometric interpolation of circular-Jacobi weights. Selecting one particle in the interpolation derivative increases the fused charge by $\beta$ and leaves a strict positive-power moment margin in the remaining stochastic-zeta expectation. This yields an absolutely convergent one-particle identity and uniform control at the collision scale. The results resolve the critical and subcritical conjecture in the author's earlier preprint and complement its supercritical second-order expansion.
Read the full abstract
Number Theory
A Proof of Bala's Congruence Conjectures for A158690
Let $a(n)$ be the sequence A158690 in the On-Line Encyclopedia of Integer Sequences (OEIS), defined by the exponential generating function $\sum_{n\ge0} a(n)t^n/n! = 1+\sum_{m\ge1}\prod_{j=1}^m(1-e^{-(2j-1)t})$. We prove two congruence conjectures of Peter Bala. The first states that, for every integer $k\ge1$, the sequence $a(n)$ modulo $k$ is eventually periodic with period dividing $\varphi(k)$. We prove the stronger statement that the Carmichael function $\lambda(k)$ is an eventual period. The second conjecture asserts the shifted Gauss congruences $a(np^r+i)\equiv a(np^{r-1}+i)\pmod{p^r}$ for every $i\ge0$, every prime $p$, and all $n,r\ge1$. Both results follow from a general theorem for exponential generating functions of the form $G(e^t-1)$ with $G\in\mathbb Z[[y]]$, together with the standard power-sum formula for Stirling numbers of the second kind.
Read the full abstract
Computation and Language
CEDAR: Error-Bounded Residual Routing for Efficient Long-Context Attention
Post-hoc sparse attention accelerates long-context prefill by routing each query to a small set of token-level interactions. Hard selection, however, assigns zero probability to every omitted chunk: a routing miss cannot be recovered, and a fixed expansion budget spends the same work on easy and ambiguous queries. We introduce Coarse-to-fine Error-aware Dynamic Attention Routing (CEDAR), a coarse-to-fine method that keeps the language model frozen while preserving global coverage. Each semantic chunk contributes a cheap key–value summary to a residual attention path; chunks with high estimated approximation error are then expanded to exact token attention. Exact and summarized contributions are combined in a single softmax normalization, so refinement replaces, rather than duplicates, coarse evidence. We derive an output-error bound governed by within-chunk key/value dispersion and use it to allocate a variable refinement budget. A controlled clustered-attention study shows that residual summaries reduce reconstruction error by more than 98% relative to hard dropping at equal exact-chunk budgets. Experiments on long-context benchmarks demonstrate that CEDAR recovers most of the quality lost by hard sparse routing while maintaining approximately $3\times$ kernel speedup at 128K context.
Read the full abstract
Machine Learning
Parallelism Strategy Chaining for Fast Training Convergence
Selecting a parallelism strategy - the configuration of data, tensor, and pipeline parallelism degrees together with micro- and global-batch sizes - largely determines the training efficiency of large language models. State-of-the-art methods search for a parallelism strategy offline and select the single strategy that minimizes per-iteration time. But we find that they neglect the target validation perplexity and time-to-perplexity (TTP). In particular, our analysis reveals that the best strategy yielding the fastest perplexity improvement changes multiple times during training. As a result, state-of-the-art methods are 1.8-11.4x slower in TTP than the strategy sequence that selects the best strategy at each iteration. This paper proposes CONA, a new training method that introduces online strategy chaining. Instead of a single strategy selected offline, CONA ranks candidate strategies during training using a surrogate metric built from compute throughput and gradient statistics, and switches the current strategy to a new strategy with a higher metric. In our evaluation with GPT-3 1.3B, BERT-Large, and Llama-3.2-1B, CONA reaches the target validation perplexity 1.4-9.6x faster than state-of-the-art methods. Moreover, CONA closely tracks the perplexity achieved by the sequence that selects the best strategy at each iteration, within 2.6%.
Read the full abstract
Quantum Physics
Asymmetric quantum error correction efficiently tackles application-specific noise effects
Noise is a major challenge for current quantum computers. It can be broadly categorized into bit-flip and phase-flip errors. These two types do not necessarily affect the executed algorithm, thus also the application, in the same way. We illustrate this general effect for the example of the quantum approximate optimization algorithm (QAOA) applied to a small instance of the flight-gate assignment (FGA) problem. We compare bit-flip and phase-flip Pauli noise under both layer-level and gate-level noise models, using two circuit decompositions of the same ideal QAOA unitary: a CNOT-based decomposition and a native-RZZ decomposition. For the six-qubit FGA instance considered here, bit-flip noise produces a larger degradation in the optimized QAOA performance across the investigated circuit depths and noise models. The asymmetry is most pronounced in the layer-level and native-RZZ simulations. We explain this behavior through the commutation and propagation properties of the errors and their effects on the final computational-basis measurements. Since these mechanisms are not specific to the considered FGA instance, we expect similar noise asymmetries to arise in other Ising-based QAOA applications, although this remains to be investigated. We then exploit these insights to tackle noise particularly efficiently using asymmetric error-correcting codes. As an illustration, we use the quantum parity code (QPC), a generalization of the 9-qubit Shor code, and show that a smaller asymmetric code can achieve nearly the same improvement as a larger symmetric choice. This suggests that allocating error-correction resources according to algorithmic noise sensitivity, rather than physical error rates alone, can be beneficial even when the physical noise is symmetric. Finally, we discuss how information about the noise obtained through calibration can be exploited in our approach.
Read the full abstract
High Energy Physics (Experiment)
GNN-based track reconstruction for MUonE experiment
A study of a Graph Neural Network-based model for track reconstruction in the context of MUonE experiment is presented, using simulated data corresponding to the test-run MUonE detector setup. The fully three dimensional model successfully addresses both the reconstruction and particle identification challenges essential for achieving the experiment's primary physics goal. It provides significantly faster pattern recognition than classical reconstruction algorithms, while maintaining comparable efficiency and resolution.
Read the full abstract
Quantum Physics
Power and Limits of Collective Local Measurements in Multicopy State Discrimination
More than two decades ago, Bennett et al. [Phys. Rev. A 59, 1070 (1999)] asked whether perfect local discrimination of orthogonal quantum states can require more than two copies. This question was subsequently answered for adaptive protocols that process the copies separately [Phys. Rev. Lett. 126, 210505 (2021)], but remained open when each laboratory is allowed to process its local copies collectively. Here we resolve this stronger setting and identify collective access across repeated local inputs as a distinct resource. For every fixed odd-prime local dimension, there exist complete maximal-stabilizer eigenbases whose copy complexity under individual-copy separable measurements diverges with system size. Under collective processing this behavior changes sharply: every maximal-stabilizer eigenbasis in odd-prime local dimension is perfectly decoded by one-round collective LOCC using at most three copies. Collective processing, however, does not remove multicopy hardness in general. For every fixed local dimension $d\ge2$, we prove the existence, within an explicit phase family, of complete bases whose copy complexity remains unbounded even under collective separable measurements, with a square root of the number of subsystems as lower-bound scale. Thus sample number, spatial measurement power, and coherent access across repeated local inputs are distinct resources in distributed quantum measurement.
Read the full abstract
Fluid Dynamics
Micro-convection mass transfer following bubble coalescence on a solid wall
The Volume-of-Fluid implementation in the \href{basilisk.fr}{Basilisk} flow solver is employed to study mass transfer after coalescence-induced jump-off of bubbles on solid substrates at four combinations of bubble radius ($R_m=150$ and 25 $\mu$m, hydrogen-water properties) and Schmidt number ($\text{Sc}=210$ and 1). The results show a relatively strong downward entrainment of low-concentration liquid, induced by a rapid movement of the bubble interface at approximately 0.5 to 1 inertio-capillary time units after the moment of coalescence. At $\text{Sc}=210$, this leads to a highly local increase of the Sherwood number at a core region (roughly an area of radius $R_m/2$) below the south pole of the merged bubble, which persists long after the bubble departure due to the slow diffusion at large $\text{Sc}$. The enhancement factor of the Sherwood number is highly dependent on the state of the mass-transfer boundary layer at the moment of coalescence, increasing with smaller boundary layer thicknesses. Shortly after the jump-off, the velocity of the bubble is considerably damped and rapidly approaches its free-rise terminal velocity. The effect of micro-convection on the wall mass transfer coefficient at this stage is insignificant when isolated, similar to what is reported in the literature for purely buoyancy-driven bubble rise – but slightly stronger.
Read the full abstract
Robotics
Generalizable 6D Pose Estimation of Textureless Objects with Planar-based Gaussian Splatting
Estimating the 6D pose of textureless objects without prior CAD models remains a critical challenge due to the lack of appearance features. While recent generalizable approaches alleviate the dependence on object-specific models, their performance on low-texture objects is often limited by insufficient geometric constraints in the underlying representations. In this work, we propose PG-Pose, a geometry-aware framework combining Planar-based Gaussian Splatting (PGS) reconstruction and Geometry-driven pose optimization. In the offline representation extraction stage, three distinct representations of the object are extracted from multi-view reference RGB images with known poses. PG-Pose reconstructs a 3D Gaussian representation and renders high-fidelity depth maps to generate 3D point clouds through back projection. In the online pose inference stage, the initial pose of the input image is estimated by 2D-3D correspondence matching between the input image and the reconstructed 3D point clouds, followed by a PGS-Refiner for iterative pose optimization. Evaluations on the OnePose-LowTexture datasets, PG-Pose achieves an average accuracy of 94.2% ADD(S)@0.1d, with a 2.1% improvement average accuracy compared with the state-of-the-art (SOTA) GS-based approach. To further demonstrate the effectiveness of PG-Pose for industrial robots in grasping tasks, we deploy it on a dual-arm industrial robot and successfully realize the grasping task on an unseen object.
Read the full abstract
Machine Learning
Robust Decentralized Federated Distillation via Multi-Modality Knowledge Collaboration
This paper propose a robust decentralized federated distillation method that enables clients with heterogeneous models to collaborate through predictions on shared unlabeled public data. In the proposed method, each client first evaluates the received predictions in three modalities of class prediction, boundary decision, and prediction correlation. It then filters unreliable clients, assigns reliability-based weights to the retained clients, and constructs a teacher for each type of knowledge. Finally, the corresponding distillation gradients are validated using a supervised gradient computed from private data. Conflicting prediction and boundary gradients are removed, and conflicting relation gradients are suppressed before the final model update. We prove the convergence of the proposed method by showing stable local optimization for honest clients under Byzantine distillation. Particularly, we show that our method ensures a bounded Byzantine influence on both distillation gradients and individual client private gradients after cross-modality fusion, thereby enabling stable local optimization for honest clienunder Byzantine distillation. Extensive experiments on CIFAR-10 and CIFAR-100 demonstrate that the proposed method improves the prediction accuracy of heterogeneous models of clients under non-IID data and Byzantine attacks. As the booming demands of federated learning in decentralized environments such as edge computing and mission-oriented UAV collaborations, our method has a great potential for adoption of DFL in unreliable real-world scenarios where clients are exposed to receiver-specific Byzantine messages of malicious predictions.
Read the full abstract
Computer Vision
Proximity-CLIP: Text-Guided Semantic Proximity Learning for Zero-Shot Anomaly Detection
Vision-language models offer a promising approach for zero-shot anomaly detection (ZSAD). However, due to object-centric bias, normal and anomalous text prototypes exhibit a high semantic overlap. While enforcing strict orthogonality between them improves discriminability, mapping highly contiguous visual inputs onto drastically orthogonal prototypes introduces a geometric dilemma, disrupting the pre-trained structural continuity. To address this problem, we propose Proximity-CLIP, a framework that visually calibrates the semantic margin to guide visual adaptation. First, we introduce a visually-calibrated semantic proximity learning mechanism that uses a bounded dynamic regularization to learn an appropriate semantic margin, ensuring discriminative separation while preserving structural alignment. Second, we design an Anomaly Query Module (AQM) driven by these text priors. Using the calibrated anomalous prototype as a semantic query, the AQM actively retrieves localized defect cues from contextual visual patches, mitigating the dilution of subtle anomalies during global pooling. Extensive experiments demonstrate that Proximity-CLIP outperforms current state-of-the-art methods across multiple ZSAD benchmarks with minimal architectural modifications.
Read the full abstract
Mesoscale and Nanoscale Physics
Lindbladian Phase Geometry and Hall Transport in Open Bloch Systems
Quantum geometry underlies a wide range of transport phenomena in Bloch systems. How quantum-geometric transport is modified when Bloch electrons are coupled to an environment, however, remains largely unexplored, even though the environment can alter both the electronic state and the physical current operator. Here we formulate dc linear response within a trace-preserving Lindblad kinetic theory by defining the physical velocity as the Liouvillian time derivative of the position operator. This construction reveals an environment-induced contribution to the current vertex whose momentum-space curl generates new Hall responses governed by the gauge-invariant phase geometry encoded by Lindblad jump amplitudes, which characterize electron-environment coupling. To leading order in the dissipative coupling, this geometry gives rise to interband shift-vector and diagonal-vorticity Hall responses arising from off-diagonal and diagonal jump amplitudes, respectively. Remarkably, both mechanisms can produce a finite Hall conductivity even when the conventional Berry-curvature anomalous Hall effect vanishes identically. Our work establishes Lindbladian phase geometry as an independent geometric origin of transverse transport in open quantum matter.
Read the full abstract
Optimization and Control
New Bounds for Limited Zarankiewicz Numbers from $K_{5t}$ Blocks
The restricted augmented Zarankiewicz number \(z_L(m,n)\) yields core combinatorial lower bounds for the maximal SOS rank of biquadratic forms. All previously known infinite admissible graph families rely on \(K_{4t}\) incidence graphs, attaining an asymptotic relative gap limit of \(1/4\). This work develops a new infinite family built from \(K_{5t}\) incidence bipartite graphs with \(\mathbb{Z}_5\) cyclic labeling for block partitions. We construct valid nondegenerate intra-block and inter-block 2-edges, derive a quadratic closed-form lower bound of \(z_L\), and prove its relative gap converges asymptotically to \(2/5\). Full enumeration for \(t=1\) verifies the exact value \(z_L(10,5)=23\). Under nondegenerate and generalized \(C_4\)-free constraints, the ratio \(2/5\) is shown to be the maximal asymptotic ratio attainable under this block framework. Our results expand the library of extremal bipartite graphs and sharpen lower bounds for biquadratic SOS rank, with further open problems for general \(K_{kt}\) constructions outlined in closing.
Read the full abstract
Sound
Iterative Audio Separation with Mixture Consistency via MIMO Model Extension
This paper proposes a general framework for stable and effective iterative audio separation with mixture consistency by extending source separation models to a multi-input multi-output (MIMO) configuration. In the field of audio separation, mixture consistency is an essential property for many applications that require accurate phase and timbral information of target sources. While iterative approaches such as diffusion models achieve perceptually superior results in speech enhancement or user-guided target source separation tasks, most existing methods focus on single-step separation with a single-input single-output (SISO) or single-input multi-output (SIMO) configuration through architectural improvements, since mixture-consistent audio separation is generally regarded as a regression problem that admits a unique solution. By extending these architectures to a MIMO configuration, we introduce iterative prediction without compromising the architectural advantages or the characteristics of mixture consistency. We conduct a comprehensive ablation study of combining the framework with discriminators and extending it to a generative model. Experimental results demonstrate significant performance improvements when applying the proposed framework to state-of-the-art separation models.
Read the full abstract
High Energy Physics (Phenomenology)
Pseudo-Dirac Inelastic Dark Matter in the Leptophobic $U(1)_B$ Model: Confronting the LUX-ZEPLIN High-Recoil Event with Collider Searches
Interpreting the $248$~keV nuclear-recoil candidate reported by LUX-ZEPLIN (LZ) as an endothermic transition needs two ingredients usually put in by hand: a stable dark state, and a coherent current that is purely off diagonal. Gauging baryon number supplies both. For the minimal dark charges $B(\chi_L)=-3/2$ and $B(\chi_R)=-9/2$, the scalars that generate the dark masses leave an exact residual parity $P=(-1)^{6B}$ stabilizing the lightest state, while the same Majorana masses make the vector current transition dominated as an identity rather than a choice. At $m_\chi=1$~TeV and $\delta=300$~keV the model is over-determined: the observed LZ interval, a leading-order relic estimate and the LHC dijet limit meet at the single perturbatively acceptable point $(M_{Z_B},g_B)\simeq(1.44~\mathrm{TeV},0.233)$. That point is allowed by currently existing searches but sits just below the trigger-level dijet boundary, so it is alive and not yet decided–and a re-run of that analysis on the Run-3 data at $\sqrt s=13.6$~TeV, already on tape, will exclude it or find it. Nor is the interpretation confined to that splitting: at $\delta=200$~keV, the same construction predicts a heavier mediator at comparable coupling, $M_{Z_B}\simeq2.4$-$3.0$~TeV with $g_B\simeq0.15$-$0.34$, a range the HL-LHC dijet program will probe.
Read the full abstract
Software Engineering
One Is Not Enough: The Untold Story of Multiple Security Patches for One Vulnerability
Security patches (SPs) are the main mechanism for fixing software vulnerabilities, yet a single vulnerability is not always resolved by a single patch: fixes may be completed incrementally, propagated across maintained branches, or replicated across related repositories. When patch records are incomplete, downstream users may observe only part of the required fix set and therefore apply only partial patching. However, comprehensive patch discovery remains difficult because the prevalence and causes of the multi-SP phenomenon are still poorly understood. In this paper, we present the first large-scale empirical study of multi-SP vulnerabilities. By merging four major vulnerability databases, we construct a dataset of 6,053 multi-SP CVEs with 16,260 SPs, showing that 20.6% of CVEs with patches involve multiple SPs and that merging databases increases recognized multi-SP CVE counts by 36-55% over any single source. We further analyze why a vulnerability is associated with multiple SPs and derive a two-level taxonomy with 6 categories and 16 sub-categories. Based on these findings, we develop SPectre, a taxonomy-driven prototype for comprehensive patch discovery. On 300 multi-SP CVEs, after manually verifying ground-truth SPs, SPectre improves multi-SP patch coverage over representative patch localization baselines, achieving 0.927 recall on same-repository cases and 0.873 recall on cross-repository cases after manual ground truth verification. On 100 recent CVEs recorded as single-patch by all public databases, SPectre further discovers 28 previously unreported SPs across 20 CVEs. Our results show that multi-SP vulnerabilities are both prevalent and systematically underreported, motivating stronger patch-completeness awareness, improved vulnerability database curation, and relation-aware security tooling.
Read the full abstract
Commutative Algebra
On the relations among algebraic models for the MinRank problem
In this article, we study the relations between algebraic models for the MinRank problem, which is a well-known NP-hard problem. We establish connections between the minors modeling, the Kipnis-Shamir modeling, and the support minors modeling, providing insights into their equivalences and differences. Our results contribute to a deeper understanding of the algebraic structures underlying the MinRank problem and may inform future research on efficient algorithms for solving it.
Read the full abstract
Artificial Intelligence
Distance-Aware Attention and Wall-Distance Expert Routing for Transformer-Based 3D Flow Prediction
Transformer surrogates for 3D flow prediction compress an industrial mesh into a small set of tokens from which every prediction point reads. Two operations follow: the retrieval step in which a point gathers information from the compressed representation, and the feed-forward layer that transforms what it retrieved. In current backbones both are blind to where the point sits in the flow. We condition both on wall-related physical signals. Distance-aware cross-attention (DA-CA) reshapes each volume query by its wall distance before retrieval, so that a point deep in the boundary layer draws different geometric information than one in the outer flow. Surface-volume mixture-of-experts (SVMoE) replaces the shared feed-forward layer with a small set of experts, routed by wall distance for volume points and by local geometry for surface points. Neither mechanism is tied to one architecture, so we apply both unchanged to AB-UPT and Transolver-3. On DrivAerML with 50 training cases, DA-CA reduces the volume pressure error by 10.1%, and DA-CA and SVMoE together reduce it by 12.5%; DA-CA improves the near-wall region at some cost in the far region, which SVMoE recovers, and the volume experts settle into near-wall, transition, and free-stream bands without routing supervision. Retrained on 300 cases, the conditioning improves every field quantity, reducing volume pressure and velocity errors by 33.1% and 18.6% on AB-UPT and by 21.4% and 21.3% on Transolver-3. Under Leave-One-Body-Out evaluation on DrivAerNet++, it reduces the volume pressure error on unseen body types by up to 14.2%.