Data Structures and Algorithms
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
Navigability is a fundamental property of graph-based search structures and plays an important role in the analysis of nearest-neighbor algorithms. Informally, a graph is navigable if, from any current point and toward any desired target, there is always an outgoing edge that moves strictly closer to that target. While this property provides a strong guarantee for greedy search, it can be inherently expensive: in the worst case, navigable graphs require $\Omega(n^{3/2})$ edges, where $n$ is the size of the dataset. Recently, Avi and Musco introduced $(1-\epsilon)$-almost navigability, a natural relaxation in which, from every current point, such a progress-making edge is required for almost all targets, while an $\epsilon$ fraction of targets may fail this condition \cite{avimusco2026almost}. They showed that every dataset admits such a graph with $O(n/\epsilon)$ edges. In this work, we prove a matching lower bound, establishing the optimality of their construction and giving a complete characterization of the sparsity achievable by almost-navigable graphs. For most values of $\epsilon$, our hard instances lie in Euclidean spaces of polylogarithmic dimension, across the full worst-case range of $\epsilon $, dimension $d=O(\sqrt{n}\log^{3/2} n)$ suffices. The same construction also sharpens our understanding of ordinary navigability: in the latter dimension, we exhibit datasets for which every navigable graph has $\Omega(n^{3/2})$ edges. Our proof reveals a surprising connection between almost navigability and the classical Zarankiewicz problem of constructing dense graphs with limited pairwise neighborhood overlap. This connection lets us translate extremal graph constructions into hard geometric instances for navigation, linking two seemingly different notions of graph sparsity.
Machine Learning
RINSE: Robust Target-Time Normality Estimation for Zero-Shot Graph Anomaly Detection
Zero-shot graph anomaly detection seeks to deploy a detector trained on source graphs to unseen, unlabeled targets, yet domain shift can make source-derived notions of normality unreliable. We introduce RINSE (Robust Iterative Normality Self-Estimation), a gradient-free target-time framework that keeps the source-trained detector fixed while sequentially estimating target normality, representation calibration, and evidence reliability from the target graph. Its core idea is to identify a reliable subset of low-residual target nodes, use them to construct a trimmed target-aware normality model, and combine complementary anomaly evidence through reliability-gated rank fusion and encoder ensembling. Across eight unseen target graphs, RINSE achieves the highest average AUPRC among the evaluated methods under two separate preprocessing protocols, while block ablations and sensitivity analyses support the combined design. These results support robust target-time estimation as a practical approach to generalist graph anomaly detection without target labels, gradients, or per-target tuning.
Read the full abstract
Computation and Language
Debias-SparseGPT: Bias-Aware Pruning for Large Language Models
Model compression techniques such as pruning and quantization facilitate the efficient deployment and acceleration of Large Language Models (LLMs). However, recent studies show that weight sparsification methods, such as SparseGPT, can amplify existing biases in models, with outputs varying significantly depending on persona cues in the prompt. In this paper, we introduce Debias-SparseGPT, a post-training pruning method incorporating representational debiasing using a second-order term defined over demographically contrasting inputs. We perform empirical validation of our method over a wide range of generative LLMs. Across models and sparsity regimes (25%, 50%, and structured 2:4 sparsity), Debias-SparseGPT consistently reduces pruning-induced bias compared to SparseGPT while preserving model perplexity and zero-shot accuracy. Under the most restrictive 2:4 structured sparsity pattern, which most aggressively degrades model quality, augmenting the calibration set with long-context, content-rich examples further improves both downstream performance and fairness. Overall, Debias-SparseGPT advances the bias-performance trade-off while preserving the computational efficiency of sparse models.
Read the full abstract
Statistics Applications
Big data, differential privacy, and national statistical organisations
Differential privacy (DP) has emerged in the computer science literature as a measure of the impact on an individual's privacy resulting from the publication of a statistical output such as a frequency table. This paper provides an introduction to DP for official statisticians and discuss its relevance, benefits, and challenges from a National Statistical Organisation (NSO) perspective. We motivate our study by examining how privacy is evolving in the era of big data and how this might prompt a shift from traditional statistical disclosure techniques used in official statistics–which are generally applied on a cell-by-cell or table-by-table basis–to formal privacy methods, like DP, which are applied from a perspective encompassing the totality of the outputs generated from a given dataset. We identify an important interplay between DP's holistic privacy risk measure and the difficulty for NSOs in implementing DP, showing that DP's major advantage is also DP's major challenge. This paper provides new work addressing two key DP research areas for NSOs: DP's application to survey data and its incorporation within the Five Safes framework.
Read the full abstract
Optimization and Control
Learning Parametric Monotone Games
We study the problem of learning from data a parametric Nash equilibrium (NE) problem that is monotone (or strongly monotone) for all parameter values. In the presence of local and shared convex constraints, monotonicity enables efficient computation of generalized Nash equilibria of the learned game. We consider two learning scenarios: (i) direct learning of the NE problem from samples of the agents' costs, and (ii) inverse learning of surrogate agents' costs from samples of their best responses. We propose two methods to solve these tasks. The first is a penalty-based approach that promotes monotonicity of the learned game during training. The second, based on a representation theorem we introduce for a broad class of monotone games, parameterizes the agents' costs so that monotonicity of the NE problem is guaranteed by construction, for all parameter values, regardless of the training data used. We illustrate the applicability of the proposed methods on several numerical examples. A Python library and the examples reported in the paper are available at https://github.com/bemporad/learn_monotone_games.
Read the full abstract
Robotics
MS-MEM: Multi-Skill Manipulation-Enhanced Mapping via Uncertainty- and Disturbance-Aware Action Selection
Accurate scene understanding in confined, cluttered spaces such as shelves is essential for service robots, as many everyday tasks require them to locate and retrieve objects reliably. Yet, it remains challenging due to severe occlusions, restricted accessibility, and the need to avoid excessive scene changes. In this paper, we propose Multi-Skill Manipulation-Enhanced Mapping (MS-MEM), an evidential framework for uncertainty-aware mapping that integrates active viewpoint selection, object pushing, and grasping. MS-MEM combines scene-level metric-semantic evidential belief estimators with an uncertainty-aware grasp representation. This representation is learned using a novel full-evidential grasp estimator that models both grasp affordance and orientation uncertainty. In our framework, candidate perception and manipulation actions are evaluated within a unified action selection pipeline using a common information gain criterion. For manipulation actions, we further introduce a collateral disturbance constraint (CDC) that discourages excessive changes to confident regions of the scene belief. This enables MS-MEM to select actions that effectively reduce map uncertainty while limiting collateral scene changes. Experimental results show that, compared with single-skill and unconstrained baselines that ignore scene disturbance, MS-MEM achieves higher mapping accuracy while substantially reducing scene disturbance, highlighting the synergistic effects of active viewpoint selection, push, and grasp actions.
Read the full abstract
Materials Science
'pySNOW': a Python Suite for the NanO-World
In computational materials science, numerical simulations are indispensable tools for revealing atomic-scale processes. For building blocks of the nanoworld, such as nanoparticles and nanoalloys, atomistic simulations provide detailed insight into their behaviour under diverse conditions. These simulations enable the study of formation and growth mechanisms, transport phenomena, chemophysical stability, and chemical reactions, including catalytic processes. To unravel the complex structure–property relationships that characterise nanoobjects, it is crucial to develop robust and insightful representations of their atomistic structure at global and local scales. Such descriptions enhance our understanding of nanoparticle behaviour and play a key role in guiding their rational design in silico for targeted applications.
Read the full abstract
Probability
Generalised Random Parking for Trapeziums on a Strip
In this article, we study a generalisation of Rényi's car-parking problem in which isosceles trapeziums are sequentially deposited on a strip. We derive an explicit formula for the parking constant in terms of the lengths of the two bases, recovering the classical rectangular and triangular models as special cases. We further obtain quantitative finite-size asymptotics for both the expected number and the variance of deposited trapeziums, with convergence rates that depend explicitly on the geometry of the deposited particle. In particular, although the recursive construction involves two different substrate geometries, their variances have the same leading asymptotic density. Finally, we show that the parking constant depends non-monotonically on the ratio of the two base lengths and possesses a unique minimiser, so that the least efficient shape is a genuine trapezium rather than a triangle.
Read the full abstract
Quantum Physics
Engineering of Non-Hermitian Trajectories and Phase Structure in an Open Bose-Hubbard Model via Rate Operator Transformations
Non-Hermitian evolution can be realized through post-selection on stochastic pure-state trajectories arising in continuously monitored open quantum systems. The rate operator formalism provides a versatile and systematic framework for unraveling a master equation into stochastic pure-state evolutions, offering enhanced control over the resulting non-Hermitian dynamics. In the present work, we explore the applicability of the rate operator formalism as a tool for engineering non-Hermitian dynamics. Specifically, we apply this approach to the Bose-Hubbard model subject to environmental dephasing, examining its consequences for controlled state manipulation. Our analysis is framed within the broader contexts of quantum state engineering and measurement-induced phase transitions. We demonstrate that the rate operator formalism enables the construction of effective non-Hermitian Hamiltonians exhibiting a unique steady state-even in regimes where the standard Monte Carlo wavefunction method fails to produce one. Furthermore, we show that this framework facilitates transitions between distinct steady-state phases, governed by tunable parameters such as the interaction strength and a non-Hermiticity control parameter introduced via the rate operator formalism.
Read the full abstract
Computational Engineering
A meshfree solver for coupled bulk-surface problems with self-organizing surface geometry
In many systems, the interaction between a deformable surface or interface and the surrounding bulk fluid is coupled with intrinsic spatiotemporal dynamics within the moving surface. Examples include tumor growth, biological tissue morphogenesis, cardiac mechanics, multi-phase surfactant chemistry, additive manufacturing, clothing wear-and-tear, and reactive combustion flows. Solving such problems requires both geometric computing algorithms to track and resolve the surface and numerical methods to solve the coupled governing equations in the surface and the surrounding bulk phase. Here, we present a fully meshfree numerical solver for such coupled bulk-surface problems with deformable interfaces. The presented solver tracks the surface implicitly, solving for the dynamic surface geometry based on stress balance coupled to surrounding fluid phases. We show convergence for a mass-conserving case on a growing sphere and solve bulk-surface problems with incompressible Navier-Stokes fluids coupled to in-surface nonlinear reaction-diffusion dynamics. Finally, we show a model of biological morphogenesis, solving simultaneously for the dynamic surface shape and the fields on the curved surface with two-way coupling.
Read the full abstract
Mathematical Physics
Precise spectral asymptotics, exponential localization, and spectral gap estimates for the three-boson lattice Schrödinger operator
We study three identical bosons with contact attraction of strength mu on the square lattice at total quasimomentum K = 0 and K = pi. First, at K = 0, for all sufficiently large mu there are exactly two eigenvalues below the essential spectrum. The trimer branch follows from Kato perturbation theory at the simple isolated eigenvalue 3 of the pair-contact operator, uniformly in K; the atom-dimer branch follows from a Feshbach-Schur reduction whose limiting equation coincides with the second Birman-Schwinger (Faddeev) eigenvalue of the finite-rank principal part. The spectral gap between the two branches grows linearly in mu. Second, at K = pi the trimer branch is unchanged up to O(mu^-2), the two-particle threshold equals -mu + 4 exactly, and the gap to it is 2mu - 2 plus lower order corrections. The second bound state disappears because the exchange operator changes sign, S_pi = -S_0: the s-channel eigenvalue that exceeds 1 at K = 0 becomes negative, while the only positive atom-dimer channel at K = pi is the odd p-channel, bounded by 2 - 4/pi < 1. Consequently the operator has exactly one eigenvalue below the threshold minus 36/(mu - 10). Third, the ground state is exponentially localized in the relative coordinates. The decay exponent is positive unconditionally; under a non-cancellation hypothesis it is bounded above by log(3mu) plus lower order terms, while finite-volume computations indicate the slowest tail is the atom-dimer dissociation channel with decay rate one half log(2mu). A dictionary between the principal-part method, Kato theory, and the atom-dimer threshold matrix is given, together with the three-dimensional constants for comparison.
Read the full abstract
Robotics
An Adaptive Control Architecture for Slope and Terrain Compensation in Autonomous Navigation in Mediterranean Greenhouses
The ability to move stably over terrain with varying slopes and textures is essential for mobile agricultural robots operating in complex and dynamic environments such as greenhouses, where small terrain irregularities can lead to significant navigation errors. This article presents a novel terrain-adaptation strategy based on the carried payload, ensuring accurate and robust trajectory tracking. The proposed approach is based on: (i) the experimental characterization of the most common types of greenhouse soil, concrete, compacted sand, and gravel, and (ii) the direct measurement of terrain slope using the IMU, in order to estimate the force with which this angle affects the motor input. Based on this information, a cascade trajectory-tracking scheme has been designed, consisting of a model-based predictive controller (MPC) in the outer loop and a PI controller in the inner loop. The system incorporates an adaptive feedforward control through gain scheduling approach, capable of adjusting to disturbances caused by variations in slope and terrain type. Simulation results demonstrate that the differential-drive robot achieves a significant improvement both in error indices and in control signal efficiency, highlighting the effectiveness and robustness of the proposed approach.
Read the full abstract
Information Retrieval
ViSAR: Training-Free Adaptive-$k$ Retrieval for Document Visual Question Answering
Document Visual Question Answering (DocVQA) often leverages Retrieval-Augmented Generation (RAG), where late-interaction encoders are commonly used to identify document pages relevant to a user query, before answer generation by a Large Vision-Language Model (LVLM). Existing approaches typically retrieve a fixed top-$k$ number of pages regardless of query complexity, which increases LVLM latency and may degrade answer accuracy when fewer pages would be enough. We introduce ViSAR (Visual Semantic Activation Retrieval), a training-free, budget-aware adaptive-$k$ retrieval method for late-interaction visual document retrieval. ViSAR operates directly in the embedding space to construct a query-conditioned page-level similarity matrix that highlights query-relevant semantics and dynamically determines the number of pages to retrieve, within a given page budget. We evaluate our method across multiple datasets, encoders, and LVLMs. ViSAR retrieves compact, query-adapted page sets that reduce end-to-end RAG latency by up to 58.9%, with no statistically significant accuracy loss and significant gains in several settings, compared with fixed top-$k$ and adaptive retrieval heuristics. Furthermore, we show that the similarity matrix structure correlates with answer accuracy, suggesting future directions for retrieval quality-aware document understanding.
Read the full abstract
Systems and Control
Effective Range and Optimal Frequency of Through-the-Earth Magnetic Induction Communication
Magnetic induction communication (MIC) is a promising technology for through-the-earth (TTE) communication. Previous studies on the MIC range have often overlooked the impact of eddy losses caused by underground materials. For TTE MIC, significant eddy losses complicate the analysis of the effective MIC range, which is vital for optimizing performance but has never been addressed in the literature. Accounting for the conductivity and permittivity of the underground medium, this paper derives the effective MIC range in TTE MIC, along with a closed-from expression that predicts the optimal carrier frequency to maximize this range. Finite element simulations validate the analysis, demonstrating that the optimal carrier frequency can significantly enhance the MIC range. It is also revealed that optimizing the antenna radius is effective in extending the MIC range for TTE and vehicle MIC applications.
Read the full abstract
Materials Science
Spin wave freezing in Re/Co/Pt multilayers
The phenomenon of spin wave (SW) freezing occurs in the Damon-Eshbach mode in thin film magnetic systems, when SW phase and group velocities both go to zero, and the wave ceases to oscillate and move, preserving its shape as a domain structure pattern. This effect is related to the spin reorientation transition, where the magnetization configuration changes between the homogeneous in-plane state and domain structure with the out-of-plane magnetization component state. Here, we study the SW freezing effect in [Re/Co/Pt]$_{20}$ magnetic multilayers, induced by varying the in-plane external magnetic field. The studies were performed on nanostructures with the quality factor $Q$ (ratio of uniaxial anisotropy to demagnetization energies) greater and smaller than one. Domain structures with an out-of-plane magnetization component were observed in these multilayers. The critical field, visible as the saturation field $H_s^{||}$ in the parallel static magnetization curve measured by superconducting quantum interference device (SQUID), is also manifested in the field-dependent vector-network-analyzer ferromagnetic resonance (VNA-FMR) experiment, which measures the homogeneous magnetization oscillations. Brillouin Light Scattering (BLS) spectra, recorded for several values of wave vectors and several field values, probed the field-evolution of the dispersion relation. Micromagnetic simulations allow one to obtain a full dispersion, in good agreement with VNA-FMR and BLS results. Around $H_s^{||}$ the simulated dispersion relations approach the conditions for SW freezing. Below $H_s^{||}$ low and high frequency VNA-FMR modes are related to magnetization oscillations inside domain walls and within domains, respectively. The experimental results of static and dynamic behavior, together with micromagnetic simulations, create an overall consistent picture of the investigated multilayers.
Read the full abstract
High Energy Physics (Phenomenology)
Lepton-flavor violation and muon $(g-2)$ in the flavor-dependent $U(1)_F$ model
Lepton flavor violation (LFV) processes are forbidden in the standard model (SM), hence the observation of LFV transitions would represent a clear signal of new physics beyond the SM. In this work, we investigate the muon anomalous magnetic dipole moments (MDM) and LFV processes $l_{j}^{-}\to l_{i}^{-}\gamma $ and $l_{j}^{-}\to l_{i}^{-}l_{i}^{-}l_{i}^{+}$ in the extension of the SM with $U(1)_F$ local gauge symmetry (FDM). The muon anomalous MDM is one of the most precisely measured quantities in particle physics, which can be used to constrain the contributions from new couplings in the FDM. The newly incorporated $U(1)_F$ charges are correlated with the flavor properties of fermions, hence the newly added Yukawa couplings make contributions to these LFV processes. Considering the latest experimental constraints on the muon anomalous MDM, the new interactions in the FDM can make significant contributions to the LFV processes $l_{j}^{-}\to l_{i}^{-}\gamma $ and $l_{j}^{-}\to l_{i}^{-}l_{i}^{-}l_{i}^{+}$, the predicted branching ratios can well reach the future experimental sensitivity.
Read the full abstract
Computation and Language
How LLMs Build Fictional Worlds: Setting and Narrative Space in AI-Generated Creative Storytelling
In this paper, we analyze how Large Language Models (LLMs) employ worldbuilding strategies, focusing on setting as one measurable dimension of storyworld construction. We compare 1,000 AI-generated stories per model in English and German with human-authored fiction from Project Gutenberg. Building on prior work, we operationalize setting through five types of narrative space: "action", "perceived," "visual," "descriptive" and "no space", identified using fine-tuned BERT classifiers for German and English. We generate narratives using GPT 4.1, LlaMA 3.3, Mistral 3.2, and Gemma 3 and compare their spatial distributions to a human-authored baseline. We find that human-authored texts predominantly employ "action space," grounding narratives in embodied character-environment interaction, whereas LLMs systematically overproduce "perceived space," emphasizing atmosphere and affect. This divergence remains stable across narrative time. Overall, our findings show that LLMs exhibit worldbuilding patterns that differ consistently from human-authored fiction in ways that are both model-specific and language-sensitive.
Read the full abstract
Quantum Algebra
The Knot Invariant Associated to Two-Parameter Quantum Algebras II
Fan, Ma, and Xing constructed oriented-tangle invariants from finite-type two-parameter quantum algebras. In this paper, we construct an explicit parameter-transport comparison between two-parameter modules and their corresponding one-parameter modules, and we verify this comparison on every elementary oriented-tangle operator. After extending scalars to a common coefficient field, we prove that if $M_1$ is any finite-dimensional integrable type-1 simple highest-weight $U_{v,1}$-module whose weights lie in an admissible lattice and $M_t=\Phi_t(M_1)$ is its transported module, then for every oriented link $L$, the corresponding normalized invariants satisfy $I_{v,t}^{M_t}(L)=I_{v,1}^{M_1}(L)$. Consequently, the two invariants assign equal values to exactly the same pairs of oriented links and therefore have the same distinguishing power; this includes the vector representations of the finite classical types A, B, C, and D. Sean Clark's comparison of ordinary and super quantum knot invariants is obtained as a specialization of the same transport principle in which explicit scalar factors are allowed.
Read the full abstract
Computation and Language
PragAlign: Feedback-Guided Pragmatic Alignment for Controlled Synthetic Dialogue Generation
Synthetic dialogue generation can support research in privacy-restricted service settings, but generated conversations must preserve communicative intent, affective meaning, and natural dialogue flow. We introduce PragAlign, a feedback-guided framework for controlled synthetic dialogue generation conditioned on service context, target intent, and target emotion, with auxiliary trait-style controls. PragAlign uses a generate–evaluate–revise loop in which an LLM-based evaluator scores intent alignment, emotion alignment, coherence, fluency, and aggregate quality, then provides criterion-specific feedback for up to three refinement rounds. On 800 matched dialogue specifications, PragAlign achieves 99.50% evaluator-defined acceptance, compared with 72.25% for one-shot generation and 95.88% for repeated generation without structured feedback. This indicates that repeated attempts account for much of the gain over one-shot generation, while structured feedback primarily improves last-mile multi-constraint satisfaction rather than broad average quality. Refinement gains are concentrated in emotion alignment, which is also the dominant failure mode in ablations. A separate human evaluation of 1,200 generated dialogues shows that intent expression and dialogue flow are highly recognizable to annotators, while emotion appropriateness is less stable and more subjective. These results support PragAlign as a quality-control framework for improving evaluator-defined communicative constraint satisfaction, while showing that affective realization and independent human-perceived quality remain open challenges.
Read the full abstract
Optimization and Control
Accelerated Convergence of a Second-Order Dynamical System and its Application to Splitting Algorithms for Comonotone Inclusions
This paper introduces a novel second-order dynamical system driven by a forward-backward splitting operator for solving the structured inclusion $0\in(A+B)(x)$ in a real Hilbert space, where $A$ is a maximal $\rho$-comonotone operator and $B$ is a $\nu$-cocoercive operator. The well-posedness of the system is established, and Lyapunov analysis yields accelerated convergence rates of order $o(\frac{1}{t})$ for the velocity and $o(\frac{1}{t^2})$ for the forward-backward residual, together with weak convergence of the trajectories to $\operatorname{zer}(A+B)$. Temporal discretization further leads to a class of double inertial Halpern forward-backward splitting algorithms that encompasses the classical forward-backward splitting method and its inertial variants as special cases. Numerical experiments on split feasibility, sparse signal recovery, and image deblurring illustrate the effectiveness of the proposed algorithm.
Read the full abstract
Number Theory
Improved Weyl bounds on short intervals
For an integer $d\ge 3$, put $\Delta_d=\min{2^{d-1},d(d-1)}$. Let $a/q$ be reduced, let $P(X)=\frac{a}{q}X^d+\alpha_{d-1}X^{d-1}+\cdots+\alpha_0$, and let $\mathcal{I}$ be an interval of $H\le q$ consecutive integers. We prove $\left|\sum_{n\in\mathcal{I}}e(P(n))\right|\ll_{d,\varepsilon}q^{1/d}H^\varepsilon+H^{1-1/\Delta_d+\varepsilon}$. Consequently, for every prime $p>d$, every degree-$d$ polynomial $P\in\mathbb{F}p[X]$, and every interval $\mathcal{I}$ of $H$ consecutive integers with $p^{1/d}<H<p^{1/(d-1)}$, writing $H^d/p=H^u$, one has $\left|\sum{n\in\mathcal{I}}e_p(P(n))\right|\ll_{d,\varepsilon}H^{1-\min{u/d,1/\Delta_d}+\varepsilon}$. This strictly improves throughout the full natural short-interval window the best generic estimate obtained by combining classical Weyl differencing with the optimal Vinogradov mean value theorem.
Read the full abstract
Combinatorics
The Truncated Octahedral Graph Has Bondage Number Five
For a graph G, its bondage number b(G) is the minimum number of edges whose deletion increases its domination number. Dunbar, Haynes, Teschner, and Volkmann conjectured in 1998 that every nontrivial planar graph satisfies b(G) <= Delta(G) + 1. We show that the truncated octahedral graph T has gamma(T) = 8 and b(T) = 5. Since T is planar and cubic, this gives b(T) = 5 > 4 = Delta(T) + 1 and disproves the conjecture. The finite parts of the verification are exhaustive: the direct verifier checks candidate dominating sets of sizes six, seven, and eight and all 58,905 four-edge sets. The targeted discovery search and an independently written verifier are described, and the complete C++20 verifier is included in the source archive.
Read the full abstract
Computer Vision
UnCapsTSR: An Unsupervised Transformer-based Image Super-Resolution Approach for Capsule Endoscopy Images
Wireless Capsule Endoscopy (WCE) captures and streams video while passing through a patient's Gastrointestinal (GI) tract and is used to examine its irregularities. Although advantageous over conventional endoscopy, WCE suffers from limitations related to capsule size and wireless transmission, resulting in images with coarser resolution. This work presents UnCapsTSR, an unsupervised transformer-based Generative Adversarial Network (GAN) framework for improving the spatial resolution of Low-Resolution (LR) WCE images. The proposed method accomplishes SR without explicit degradation estimation of real-world LR data and eliminates the need for true LR-HR pairs. UnCapsTSR employs a Bilateral Total Variation (BTV) loss to ensure spatial continuity in SR images. A newly curated dataset from the Kvasir Capsule dataset is also presented for training WCE SR models. Generalizability is validated on KID and GIANA datasets that are not used during training. A new non-reference metric, Endoscopy Quality Metric (EndoQM), is introduced for quantitative evaluation of domain-specific WCE data. Experiments demonstrate consistent improvement over state-of-the-art unsupervised SR approaches using NIQE, BRISQUE, PIQE, and EndoQM. Statistical evaluation shows 40 to 80 percent improvement in EndoQM from LR to SR across the evaluated datasets.
Read the full abstract
High Energy Physics (Experiment)
Stringent limits on $C\!PT$- and Lorentz-invariance violation from $B_s^0$ meson decays
Tests of fundamental symmetries, such as $C\!PT$ and Lorentz invariance, provide sensitive probes of physics beyond the standard quantum-field-theory framework. Possible violations of these symmetries are investigated through interference effects in decays of $B_s^0$ mesons to $D_s^-\pi^{+}$ states. The analysis uses proton-proton collision data collected with the LHCb detector in 2015-2018 at a centre-of-mass energy of $13~\mathrm{TeV}$, corresponding to an integrated luminosity of $6~\mathrm{fb}^{-1}$. The results are interpreted within the Standard Model Extension framework, yielding sensitivities to the Lorentz-violating parameter $\Delta a_{\mu}$ at the ${\cal O}(10^{-14})\,\mathrm{GeV}$ level. Without assuming Lorentz-invariance violation, the $C\!PT$-violating parameter $z$ in the $B_s^0$ system is measured to be $\mathcal{R}e(z) = 0.018 \pm 0.016 \pm 0.003$ and $\mathcal{I}m(z) = 0.003 \pm 0.004 \pm 0.002$, where the first uncertainties are statistical and the second systematic. These results represent the most precise constraints on $C\!PT$ violation in the $B_s^0$ system.
Read the full abstract
Audio and Speech Processing
VAANI Noise Event Dataset: A curated spontaneous speech dataset annotated with timestamps for noise events
Most public sound-event corpora are optimized either for general audio tagging or for clean speech separation, and comparatively few provide strong timestamped noise annotations layered directly on top of spontaneous, real-world speech. We present the VAANI Noise Event Timestamp Dataset, a derived annotation layer built on Project VAANI field recordings of spontaneous speech collected across 165 Indian districts in 105 languages. Unlike synthetically mixed corpora, VAANI captures speech and ambient noise in situ and simultaneously, and annotates each recording with fine-grained start/end timestamps for overlapping background noise events organized into a compact seven-class semantic taxonomy: animal, traffic, baby/child, music, signal/alarm, appliance, and non-speech human. This combination of spontaneous multilingual Indic speech, authentic regional soundscapes, and span-level noise tags that may overlap with speech targets tasks that existing datasets address only partially: noise-robust Automatic Speech Recognition (ASR), sound event detection (SED), and speech enhancement. We position VAANI against nine widely used corpora and benchmarks, including WHAM!, AVA-Speech, MUSAN, FSD50K, CHiME-6, AudioSet, DESED, the India-specific iNoise noise database, and the Kathbath-Noisy noisy-ASR benchmarks, and describe the annotation protocol and quality-control procedure used to produce the timestamped tags.
Read the full abstract
Computation and Language
Learning to Fuse LLMs with Ontology Rankers for Rare-Disease Diagnosis
Ontology rankers remain useful for rare-disease diagnosis because each candidate can be traced to matched patient phenotypes. Large language models (LLMs) can generate differential diagnoses from the same patient description, but their predictions lack an equally clear evidence trail. Rather than asking which system should replace the other, we ask whether an LLM can improve the ranker without giving up its evidence. Our behavior-based fusion model examines the two ranked lists, their agreement, and the ontology support behind each candidate, and learns how much to rely on each system for the individual case. Before comparison, we remove a documented test-set leakage pathway caused by benchmark cases and ontology annotations being derived from the same publications. Across eight open LLMs, fusion improves Phenomizer Recall@1 by 7.86 percentage points on Phenopacket Store and 20.18 points on RAMEDIS. When paired with DeepSeek-V4-Flash through an API, a fusion model trained only on the other LLMs improves Recall@1 from 0.1657 to 0.2176, a 5.19-point gain, without retraining. For 90.8% of correct fused diagnoses, the disease retains candidate-level ontology evidence that can be inspected. These results show that LLMs can strengthen an established diagnostic tool without discarding the structured evidence that makes it useful.
Read the full abstract
High Energy Physics (Theory)
Localization and Abelianization of Strings on Group Manifolds: The Non-simply Connected Case
We study the partition functions of Wess–Zumino–Witten (WZW) models with compact connected simple Lie group manifolds that are not simply connected. Starting from the modular-invariant partition function of Felder–Gawędzki–Kupiainen (FGK), we derive a localization formula, which can also be obtained directly by supersymmetric localization of the corresponding supersymmetric WZW model. Our results reveal a variety of topological effects associated with the nontrivial topology of the target group. In particular, the Wess–Zumino amplitude is governed by FGK cocycles, while the fermion Pfaffians exhibit global anomalies associated with the holonomies of Pfaffian line bundles, captured by relative Rochlin invariants. Together, these results provide a unified description of the topological contributions to the semiclassical localization of WZW models with non-simply connected target groups.
Read the full abstract
Computer Vision
Learning to Track from Privileged Target Appearances
Target templates define what a visual tracker searches for, yet the templates available at inference trade off localization certainty with appearance freshness: the initial ground-truth template is exact but becomes stale, whereas recent templates better reflect the current appearance but are cropped from uncertain predictions. We quantify this bottleneck with a non-deployable oracle that supplies an exact current-frame target crop, improving AUC on LaSOT by 15.2 percentage points. This gap reveals a training-only opportunity: frame-level ground truths provide exact current- and future-frame target crops, although such crops are unavailable at deployment. We introduce Privileged Appearance Transfer for Tracking (PATT), a teacher-student training framework that transfers these privileged appearances to a deployable tracker through multi-level representation prediction. The privileged teacher observes exact target crops from past, current, and future frames, whereas the student receives only past-frame templates and learns to predict the teacher's search representations. To avoid transferring unreliable teacher signals, PATT weights this transfer by the teacher's relative localization advantage over the student and its absolute localization accuracy. After training, the teacher, latent predictor, reliability weights, and privileged crops are removed, leaving standard student-only inference. Across seven benchmarks at two model scales, PATT achieves consistent gains under both long- and short-term tracking protocols.
Read the full abstract
Hardware Architecture
Batch Before You Time: Decision-Scoped Proxy Execution for Timing-Aware Logic Rewriting
Standard Delay Format (SDF)-annotated switching simulation distinguishes delay-dependent activity among functionally equivalent rewrites, but evaluating every candidate repeats timing, compilation, and replay. A zero-delay proxy can remove timed evaluations, but generating that proxy candidate by candidate can cost more than the timed work it saves. We present Batch Before You Time (BBYT), which compiles all candidates of one rewrite decision into one scoped zero-delay image and either commits a well-separated proxy winner or invokes the unchanged timed chain. Across 12 counterbalanced holdout sequences, BBYT reduces complete candidate-selection time by 18.05% on average; the design-level reductions are 5.84% and 30.25%, with both confidence intervals above zero. On a counterbalanced 8,192-transition C6288 workload, BBYT is 9.24% faster than the same gate executed with candidate-wise proxy launches. In the five-workload corpus, BBYT removes 32.52% of timed candidate evaluations and matches exhaustive timed selection on all 250 evaluated decisions. For on-demand timing-aware rewrite selection, proxy execution and fidelity continuation should use the same decision scope.
Read the full abstract
Cryptography and Security
Evaluating ML-based Intrusion Detection Systems: The Illusion of Model Efficacy
Intrusion Detection has been revolutionized due to the integration of Machine Learning. Improved detection rates, reduced false alarms, and optimized algorithms contribute to the perception of improved systems with optimal accuracy and near-perfect performance, the illusion of model efficacy. However, the value of this effectiveness diminishes when confronted with unseen attacks. In this paper, we go beyond solely algorithmic enhancements and metric adjustments in ML-based Network Intrusion Detection Systems. We design an experiment to test the generalization capabilities of certain classifiers on unseen attacks. Our approach examines the dimensionality parameter's impact through two experimental methodologies, which are applied in two distinct settings. The experimental findings reveal how effectively the models could identify even a fraction of unseen attacks and underscore structural weaknesses in ML-based IDS research and evaluation techniques. Finally, seven evaluation criteria are outlined to address these challenges.