Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Saturday 12 September

Computer Vision

A Voxel-Spacing-Aware Extension of PyRadiomics for Anisotropic Texture Analysis

Radiomic texture features are commonly extracted from anisotropic CT and MRI acquisitions, where identical voxel offsets may represent different physical distances. We implemented and validated a voxel-spacing-aware extension of PyRadiomics that incorporates spacing information without generating interpolated gray levels. The framework operates across the Python frontend, C wrapper, and computational backend. GLCM uses anisotropy-relative feature-level angular aggregation, NGTDM uses anisotropy-relative weighted neighborhood averaging, and GLRLM, GLDM, and GLSZM are computed on a finite-volume zero-order-hold representation derived from the native anisotropic grid. Synthetic 3D phantoms were used for software validation. The modified implementation reproduced standard PyRadiomics exactly when spacing-aware mode was disabled and remained equivalent under isotropic spacing across 75 texture features. Under anisotropic spacing, the method selectively modified texture families and was numerically distinct from nearest-neighbor, linear, and B-spline resampling. Computational profiling showed moderate runtime and memory increases, while sensitivity analyses quantified finite-volume rounding effects and confirmed that spacing-aware differences persisted across binWidth settings. The framework provides a backward-compatible technical basis for future evaluation of spacing-aware radiomics in heterogeneous medical imaging datasets.
Read the full abstract

All authors David Corral Fontecha, Juan Miranda Bautista, Pablo Menendez Fernández-Miranda, Andrea Trapote Fernandez, Lara Lloret Iglesias, Jose A. Vega

Combinatorics

On the Number of Distinct Topological Bases of a Finite Set of Size $N$

For a finite set $S$ with $\lvert S\rvert = N$, the number of families $\mathcal{B} \subseteq \mathcal{P}(S)$ that are topological bases is $\#(N) = \sum_{\mathcal{T} \in \operatorname{Top}(S)} 2^{\lvert\mathcal{T}\rvert - \lvert\mathcal{M}_{\mathcal{T}}\rvert}$, where $\mathcal{M}_{\mathcal{T}}$ is the canonical minimal basis of minimal open neighborhoods. The identity is proved in Lean 4 / Mathlib (`CARDB.lean`): bases generating $\mathcal{T}$ are exactly the sets with $\mathcal{M}_{\mathcal{T}} \subseteq \mathcal{B} \subseteq \mathcal{T}$. The small-$N$ table and the discrete-dominance sandwich are proved in `CARDB/SmallN.lean` and `CARDB/Asymptotics.lean`.
Read the full abstract

Computational Complexity

On the Complexity of Finding Fixed Points for Set-Valued Contractions

We study the computational complexity of finding fixed points of set-valued contractions. We first formulate a computational problem for Nadler's fixed-point theorem, PROJECTED-NADLER, and prove that it is CLS-complete by showing its equivalence to CONTINUOUS-LOCALOPT. We then establish a stronger converse to Nadler's theorem, which can be applied as a tool to analyze the convergence rate of the set-valued basic iteration procedure. Finally, we reduce the large-margin triplet stationarity problem to PROJECTED-NADLER. Combining the argument for CLS-hardness of exact triplet stationarity problem [Yan et al. 2025] with the CLS-hardness of approximate KKT points of quadratic programs [Fearnley et al. 2025], we obtain CLS-completeness of large-margin triplet stationarity at any prescribed accuracy.
Read the full abstract

Computer Vision

RA-CoA: Training-free Fashion Image Captioning via Retrieval-Augmented Chain-of-Attributes

Fashion Image Captioning (FIC) plays a vital role in enhancing user experience and product search in e-commerce platforms. Unlike natural scene image captioning, FIC requires fine-grained visual reasoning and knowledge of domain-specific terminology to capture subtle attributes such as neckline and closure types, graphic patterns, and dress silhouettes. Moreover, as fashion inventories evolve rapidly with new trends, styles, and frequently emerging vocabulary, developing training-free captioning solution becomes essential for scalability and real-world adaptability. Instruction-tuned vision-language models (VLMs) offer a promising solution to fashion image captioning dueto their strong zero-shot capabilities and natural language fluency. However, these general-purpose models often lack attribute-level coverage and precision, and tend to hallucinate or misidentify fine-grained fashion details, making them less suitable for high-fidelity applications like product cataloging or personalized recommendations. To address this, we propose RA-CoA (Retrieval-Augmented Chain-of-Attributes), a novel, training-free framework that disentangles fashion image captioning into two interpretable stages: (i) retrieval of relevant attribute sets from a product knowledge base, and (ii) attribute-level reasoning to generate the final caption. RA-CoA is a model-agnostic approach that works with frozen VLMs to improve fine-grained attribute precision in product captions without the need for fine-tuning. Extensive evaluations across diverse VLM model families under different prompting paradigms demonstrate that RA-CoA significantly improves caption quality, achieving an average gain of 26.3% METEOR score over zero-shot captioning. We make our code publicly available.
Read the full abstract

Logic in Computer Science

Neuron Activation-based Computation of Logical Explanations for Deep Neural Networks

Formal explainability of classifying neural networks (NNs) is an active area of research, providing explanations with provable guarantees of the classification within continuous regions of the input feature space. However, the existing techniques are either limited to individual input features without guarantees on their relations or the provided solutions fail to scale to deep architectures. This paper addresses these issues by introducing a flexible symbolic framework for an efficient, guided computation of explanations of the NN behavior, parametrized by the activations of internal neurons, and using logical engines such as SMT solvers. Unlike prior methods that rely on specialized NN verifiers, our method yields explanations that are not restricted in shape. Our algorithm is implementable on top of a general-purpose logical solver, isolating the NN-specific encoding from the algorithmic framework. We experimented with a wide range of benchmarks from the domains of image recognition and medicine, illustrating the advantages of the new method, particularly in computational efficiency. Notably, our approach enables logical explanation of deep networks not amenable to prior logic-based methods.
Read the full abstract

All authors Tomáš Kolárik, Faezeh Labbaf, Fabrizio Leopardi, Grigory Fedyukovich, Michael Wand, Natasha Sharygina

Cryptography and Security

The Deception Delta: Adversarial Evaluation of LLM-Based Smart Contract Bytecode Forensics

Large language models are increasingly used in blockchain forensic investigations to interpret unverified smart contract bytecode. Their robustness has not been systematically tested against contracts adversarially designed to mislead analysis. We evaluate 22 frontier models on 13 purpose-built contracts (9 deception vectors, 4 controls) across six prompt strategies, yielding 8,528 analyzable non-refusal runs against contracts with documented ground truth. A calibrated LLM-as-judge pipeline, supported by two judge-independent metrics and 50 human gold-standard labels, shows that adversarial deception reduces drain detection by 20.0 percentage points (95% CI: [17.2, 22.8]) relative to functionally matched controls. Structural camouflage via multi-hop call chains, XOR-masked selectors, and storage-loaded drain parameters resists detection across nearly all models. Beyond non-detection, we identify rationalization: models correctly describe the hidden drain mechanism but accept the contract's deceptive framing and dismiss it as benign, yielding positive but incorrect evidence of safety. Simple guard instructions provide no aggregate benefit and destabilize individual models in both directions. Structural deception is largely insensitive across the six tested prompt strategies, more consistent with a capability limitation than with a simple prompting problem. Only five models from two providers exceed 50% detection. Under our single-shot, raw-bytecode-only protocol, current LLMs are not reliable standalone forensic tools. Our central claim does not extend to multi-turn, tool-augmented, source-aware, or decompiler-in-the-loop workflows; a source-code boundary check is reported as an explicit subset analysis rather than as part of the main evaluation.
Read the full abstract

Computer Vision

Bridging the Synthetic-to-Real Gap for Few-Shot Cryo-ET Classification

Subtomogram classification in cryo-electron tomography (cryo-ET) is a challenging problem due to the scarcity of labeled examples. While cryo-ET simulators can be adopted to generate unlimited synthetic data, the substantial domain gap between synthetic and real subtomograms hinders its practical utilization. In this work, we propose a novel synthetic-to-real adaptation framework with a learnable transformation module, bridging this gap at both the input and feature levels. Extensive experiments demonstrate that our method consistently outperforms existing transfer learning baselines in few-shot settings.
Read the full abstract

All authors Siddhant Bharadwaj, Ashish Vashist, Rashi Singh, Pranav Vinodh, Nishanth Artham, Runmin Jiang, Xingjian Li, Min Xu

General Relativity and Quantum Cosmology

Extended Generalized Uncertainty Principle Corrections to Five Dimensional Einstein Gauss Bonnet Black Hole Thermodynamics

We study the thermodynamics of asymptotically flat five dimensional Einstein Gauss Bonnet black holes within the framework of the extended generalized uncertainty principle (EGUP). The geometry dependent localization scale is fixed by requiring the undeformed relation to reproduce the surface gravity temperature. The resulting expression consistently recovers the GUP, EUP, and semiclassical limits, while imposing a joint constraint on the minimum length and minimum momentum parameters. Due to the nonmonotonic behavior of the effective localization scale, the reality condition does not generically yield a unique minimum horizon radius. Depending on the parameter values, the admissible domain may remain connected, develop a degenerate critical radius, or split into two disconnected branches. We derive the entropy, heat capacity, and Helmholtz free energy, and analyze their behavior numerically. The Gauss Bonnet coupling shifts and suppresses the near horizon temperature maximum, whereas the EUP sector induces a temperature minimum followed by linear growth at large radius. In the two branch regime, the outer endpoint exhibits finite temperature and vanishing heat capacity but is approached from the locally unstable side, and should therefore be interpreted as a limiting thermodynamic configuration rather than a dynamically established remnant. Finally, we show that the perturbative entropy deviates from the exact result at large radius, and that the leading GUP entropy correction persists in the Einstein gravity limit.
Read the full abstract

Combinatorics

A Rigidity Property of the Deformed q-Exponential Function

The deformed \(q\)-exponential function \[ e_q(z,u) = \sum_{n=0}^{\infty} u^{\binom{n}{2}} \frac{z^n}{(q;q)_n} \] provides a common framework containing several classical \(q\)-exponential functions as particular cases, including the Jackson \(q\)-exponentials \(e_q(z)\) and \(E_q(z)\). In this paper we investigate the multiplicative inversion problem \[ e_q(z,u)e_q(-z,v)=1, \] and determine all pairs of deformation parameters \((u,v)\) for which this identity holds. To this end, we introduce a family of coefficient polynomials whose common zeros characterize the inversion property. A geometric analysis of the first nontrivial coefficients reduces the problem to two parameter branches. The symmetric branch is excluded through a parity phenomenon, while the nonsymmetric branch is completely determined by the first two coefficient constraints. As a consequence, we prove a rigidity theorem showing that \[ e_q(z,u)e_q(-z,v)=1 \] if and only if \[ (u,v)=(1,q) \qquad\text{or}\qquad (u,v)=(q,1). \] Thus the classical Jackson inversion identity is rigid within the deformed family and no new multiplicative inversion identities arise from the deformation parameter.
Read the full abstract

Materials Science

Exchange-Driven Chiral Magnons and Weyl States in Room-Temperature Metallic XCoB$_2$ (X= Ta, Zr and Hf) Altermagnets

Metallic altermagnets remain rare, particularly in low-symmetry three-dimensional crystals where spin-split electronic bands and chiral magnon excitations can coexist. We report a family of metallic $d_{yz}$-wave altermagnets in the orthorhombic ternary borides XCoB$_2$ (X = Ta, Zr, Hf), which crystallize in the centrosymmetric $Pnma$ structure with G-type collinear magnetic order. Symmetry analysis within the magnetic space group $Pnm'a'$ (BNS No.~62.447) predicts a nonrelativistic spin splitting proportional to $k_yk_z$, with symmetry-enforced degeneracy on the $k_y$ and $k_z$ nodal planes, consistent with first-principles calculations. On the $k_x=0$ plane, the momentum-averaged spin splitting reaches 88.4, 52.3, and 70.6~meV at the Fermi level in TaCoB$_2$, ZrCoB$_2$, and HfCoB$_2$, respectively, with maxima exceeding 200~meV in all three compounds. Exchange analysis shows that the altermagnetic magnon splitting originates from symmetry-inequivalent sixth-neighbour inter-sublattice interactions. The chirality splitting reaches 1.51, 2.03, and 3.10 meV below 50 meV in TaCoB$_2$, ZrCoB$_2$, and HfCoB$_2$, respectively, making it accessible to inelastic neutron scattering. Monte Carlo simulations yield N'eel temperatures of $67\pm1.1$, $330\pm5.7$, and $307\pm5.0$~K, placing ZrCoB$_2$ and HfCoB$*2$ above room temperature. With spin-orbit coupling included, all three compounds host symmetry-protected Weyl points near the Fermi level, Fermi-arc surface states and sizable intrinsic anomalous Hall conductivities $\sigma*{zx}$ of $+342$, $-392$, and $-221$~S/cm at the Fermi level, reaching maximum magnitudes of $763$, $942$, and $924$~S/cm for TaCoB$_2$, ZrCoB$_2$, and HfCoB$_2$, respectively. $X$CoB$_2$ therefore provides a single compensated platform carrying both magnonic and electronic chirality, one in the spin waves and the other in the Berry curvature, without any stray field.
Read the full abstract

Group Theory

The dual of the Tits cone and dominance of Coxeter groups

In this paper we introduce a potentially infinite process of reflections applied to a sequence of points in the dual of the Tits cone associated with an arbitrary finitely generated infinite Coxeter group. This process is infinite whenever the starting point is not in the imaginary cone of the given Coxeter group. We show that this process exhibits well-defined asymptotic behaviour. We study the resulting limits, and give a characterisation of these limits. We then apply the techniques developed from this asymptotic process to the study of infinite sequences of roots totally ordered by the dominance partial ordering.
Read the full abstract

All authors Xiang Fu, Jiaqing Gu, Mengfan Lyu, Lawrence Reeves, Linxiao Xu, Shuyang Zhao

Hardware Architecture

NeuroFlex: Lossless Element-Level ANN-SNN Co-Execution for Efficient Sparse Inference

Sparse DNN accelerators specialize in ANN or SNN execution, leaving energy or latency on the table when workload characteristics vary within a layer. Hybrid accelerator designs that switch modes at layer or tile granularity suffer from low PE utilization since one core type idles whenever the other is active. NeuroFlex is the first accelerator to assign every output element independently to ANN or SNN execution mode with zero accuracy loss. We extend integer-exact ANN-SNN equivalence from layers to individual output elements, thereby enabling mode switching with no conversion error. An offline cost-guided scheduler scores each element by its marginal energy-delay trade-off and packs work across PEs, achieving 97-99% PE utilization compared to 40-45% for layer-wise hybrids. NeuroFlex reduces EDP by 57-67% over a strong ANN-only baseline and delivers up to 2.5x speedup over a dual-sparse SNN-only baseline. Our cost-guided scheduler improves throughput by 16-19% over random element assignment across vision, language, and transformer workloads.
Read the full abstract

Statistics Theory

The Minimax Rate of Denoising Flows on Trees

Isotonic regression and mean estimation over a simplex are among the most classical denoising problems under geometric constraints. Chatterjee and Lafferty generalized both to the recovery of a flow on a rooted tree from Gaussian noise, with isotonic regression on a path and the simplex on a star. Their results reach only special trees; on a general tree the minimax risk remained unknown for a decade. We settle the question in full. On every tree with $n$ vertices, at every budget $V$ and noise level $\sigma$, the minimax risk is of order $\min\{V^2H_T,\ \sigma^2k_0\}$, with $H_T$ the diameter and $k_0$ the crossing index of a truncated ancestor profile. A deterministic estimator, an exponentially weighted aggregate over integer states, attains it in $O(n^2\log(n+1))$ arithmetic operations. Least squares at a known budget, the natural convex program for the model, is suboptimal in the worst case by a factor of order $(\log n)^{2/5}$. One functional, the truncated ancestor profile, carries the rate, the estimator, and the least squares comparison. It serves as covering radius, as packing entropy in the positive cone, and as the range of the one-dimensional state behind the exact computation. Two classical theories become one on trees, sharp and computable throughout.
Read the full abstract

Algebraic Geometry

The cylinder over the Russell cubic threefold is flexible

The Russell cubic threefold is the hypersurface $\mathcal X\subset\mathbb A^4_{\mathbb C}$ defined by $x^2y+z^2+x+t^3=0$. We prove that its cylinder $\mathcal X\times\mathbb A^1$ is flexible. More precisely, after replacing its standard embedding in $\mathbb A^5$ by an equivalent one, we construct four explicit algebraic $\mathbb G_a$-actions on the ambient affine space whose restrictions generate a group acting transitively on the cylinder.
Read the full abstract

Computational Geometry

The optimal-transport cartogram: world population as a Brenier map

A contiguous cartogram is a map whose area is proportional to a quantity such as population. The defining condition, that the Jacobian determinant of the deformation equals the density, is one equation for two unknown functions, so every cartogram method adds a tie-breaker, usually implicitly. Optimal transport makes the tie-breaker explicit: among all density-equalising maps of the frame onto itself, take the one that moves the population least in the mean-square sense. By Brenier's theorem that map is the gradient of a convex potential, so it has no local rotation anywhere and cannot fold. We compute this map for the world population of 2025 on a 4096 by 4096 Mercator grid (10 km cells) from the GHS-POP raster, using the fixed-point Monge-Ampère iteration of Benamou, Froese and Oberman with spectral Poisson solves, continuation in the population share and an ocean-only buffer, on a laptop GPU. Against a Gastner-Newman diffusion cartogram of the same density we find the same transport cost to within 0.4 per cent and density errors of a few per cent for both, but a median local rotation of 8.8 degrees for diffusion against 0.01 for transport, and a median anisotropy of 6.30 against 3.93. The construction extends to local refinement, by transporting a city's 100 m population onto the area measure the global map assigns to it, and to a semi-discrete counterpart: 8,192 Laguerre cells of 1.00 million people each. Code, data provenance and every figure's inputs are public.
Read the full abstract

Game Theory

Consistency-Robustness Tradeoffs for Strategyproof Scheduling with Predictions

We study strategyproof scheduling on \(n\) unrelated machines with predictions. Each machine is controlled by an agent with privately known processing times, while the mechanism receives a public prediction of the processing-time matrix before the agents report. The objective is to minimize the makespan subject to strategyproofness. We measure performance by consistency, the approximation guarantee for correct predictions, and robustness, the worst-case guarantee for arbitrary predictions. We introduce EdgeSkip, a deterministic strategyproof member of the class of job-wise weighted mechanisms. Such mechanisms allocate each job independently using prediction-dependent weights. Using a polynomial-time \(2\)-approximate reference schedule computed from the prediction and a standard tradeoff parameter, EdgeSkip is \(4\)-consistent and \((2n-2)\)-robust, improving on the \((6,2n)\) guarantee of Balkanski, Gkatzelis, and Tan. Without computational restrictions, EdgeSkip with an optimal reference schedule is \(C\)-consistent and \(\max\{n,(n-1)C/(C-1)\}\)-robust for every \(C>1\). We prove a matching information-theoretic lower bound for all job-wise weighted mechanisms, thereby determining the exact consistency–robustness tradeoff for this class. For arbitrary deterministic strategyproof mechanisms, we establish the robustness lower bound \(\max\{n,C/(C-1)\}\) for every \(C>1\). We also study an error-tolerant variant and improve upon prior guarantees. Experiments demonstrate that our mechanisms achieve good empirical performance.
Read the full abstract

Robotics

Gradient-Free Neural Hamilton-Jacobi Reachability for Scalable Safety-Critical Control

Hamilton-Jacobi (HJ) reachability provides a principled framework for synthesizing safety certificates and robust controllers for safety-critical robotic systems. However, applying reachability analysis to high-dimensional nonlinear systems remains challenging: classical grid-based solvers suffer from the curse of dimensionality, continuous-time neural solvers require accurate spatial value gradients, and reinforcement-learning-based approaches often suffer from weak boundary anchoring and non-stationary adversarial policy optimization. We propose a discrete-time neural reachability framework for control-disturbance-affine systems that learns backward reachable tubes (BRTs) and backward reach-avoid tubes (BRATs) through Bellman-Isaacs value propagation. Our key idea is to combine equation-driven self-supervision with structured policy learning: rather than computing explicit PDE-gradients, we exploit the bang-bang structure of optimal safety interventions to construct approximate teacher actions from gradient-free value probes, converting adversarial actor learning into supervised policy learning. To stabilize long-horizon value propagation, we leverage the learned actor to train the value function backward from the terminal boundary using a windowed temporal curriculum, where each window is used as the boundary condition for the next window. Across benchmark problems up to 80 dimensions, our method learns accurate reachability value functions while improving stability over existing learning-based solvers. We further demonstrate observation-space scalability on F1-tenth racing with over 16,000-dimensional egocentric inputs. The learned safety filter generalizes zero-shot to unseen tracks and transfers to a physical RC car, achieving real-time robust collision avoidance.
Read the full abstract

All authors Zeyuan Feng, Ali Fuat Sahin, Santiago Thorup, Somil Bansal

Systems and Control

Behavior of Nonlinear Opinion Dynamics over Large Networks

Opinion dynamics have been studied for decades across disciplines, with much of the theoretical literature focusing on behaviors such as consensus, polarization, and clustering. Although classic models can exhibit more complex opinion patterns in simulations, quantifying such distributions is not fully understood. To address this question, in this paper, we study the behavior of nonlinear opinion dynamics over large-scale networks using graphons, which capture the underlying network structure. In the model, agents update their opinions according to a nonlinear rule that includes saturation effects in interactions. The network is represented by random graphs generated from a graphon, and a corresponding nonlinear dynamical model is introduced over the graphon. We show that the graphon dynamics approximate the finite-dimensional system, when the network size is large. Leveraging spectral approximation results for random graphs, we further show that the equilibria of the nonlinear model can also be approximated by those of the continuum limit. This result enables a quantitative characterization of the opinion distribution based on the underlying graphon structure. The theoretical results are illustrated by numerical simulation.
Read the full abstract

Cosmology and Nongalactic Astrophysics

A comprehensive assessment of weak-lensing inferred circular velocity profiles of isolated galaxies

We fit the circular velocity data, derived from weak lensing observations of isolated galaxies selected from the KiDS survey in four baryonic mass bins, using three different dark matter profiles. These include NFW, Burkert, and pseudo-isothermal profile. We find that the NFW and Burkert profiles cannot adequately fit the circular velocity data for all the four baryonic mass bins, whereas only the pseudo-isothermal profile can fit the data for all the four bins.
Read the full abstract

Commutative Algebra

On a question of Nori: The high-codimension conductor case

Let $R$ be an affine domain of dimension $d$ over an infinite field, with normalisation $\tilde{R}$ smooth, and let $\mathfrak{c}$ be the conductor. We answer a question of Nori in the affirmative when $R$ is singular only in high codimension.

Machine Learning (Statistics)

Just add noise: Debiasing tree-based variable importance in mixed data

Variable importance scores from tree-based methods such as random forests favor continuous predictors over categorical ones. We present a theoretical analysis of this bias and propose a simple remedy: add a small amount of noise to each categorical predictor. The correction is demonstrated on a variety of simulated and real-world datasets and combined with integrated path stability selection to perform variable selection with false discovery control for mixed data.
Read the full abstract

Statistical Methodology

Dangers of Bayesian analyses and how to address them

In light of the US FDA announcement supporting the use of Bayesian methods in clinical trials, we present a nontechnical review of problems with Bayesian analyses and methods to address them. Our focus is on the well-known sensitivities of Bayesian results to biases embedded in their prior distributions. This vulnerability calls for special safety features, including detailed justification of informative priors based on empirical-research literature rather than on singular expert opinions. Crucially, the information contributed by priors should be realistic in light of actual background data rather than merely judged so by available experts. We illustrate our recommendations with using a textbook clinical-trial example which covered these points. We then use the example describe basic diagnostic procedures and safety recommendations for Bayesian analyses and their presentation. These include reference analyses which exclude informative priors, and justification for informative priors based on empirical-research literature rather than on philosophical arguments. We also critique some common priors that violate our realism requirements. One strategy to aid judgments about priors is to translate them into data to be added to the study data. The source of these prior data should be examined with the same critical attitude as the source of study data. We illustrate some simple summary methods for comparing prior and data information, including prior predictions of data, variance ratios, and their translation to effective sample sizes (ESS). Finally, we argue that Bayesian analyses should be treated as extensions or supplements to conventional analyses, rather than replace them, for that treatment puts prior construction and justification at the fore of the transition from frequentist to Bayesian analyses in teaching and practice.
Read the full abstract

Quantum Physics

Broadband Purcell Filter for Fast Superconducting Qubit Reset and Readout

Rapid reset and readout of qubit states are essential for quantum error correction, yet accelerating these operations through stronger coupling to a dissipative environment inevitably increases qubit decay via the Purcell effect. Here we present a broadband Purcell filter that decouples the reset and readout paths, enabling both operations to be independently optimized without compromising qubit coherence. The filter employs two engineered notches - an intrinsic notch and a bandstop notch - to provide broadband Purcell protection, together with an additional reset stub that creates a reset mode below the protected band. To enable fast reset while suppressing filter-mediated interactions between qubits, we couple each qubit to a dedicated reset resonator. We experimentally demonstrate Purcell-limited relaxation times exceeding 1 ms across a 1.2 GHz bandwidth, simultaneously with 500 ns readout without a Josephson parametric amplifier and 100 ns reset with 99.6% efficiency. The reset resonator is designed with a deliberate kappa-chi mismatch, which suppresses photon-shot-noise-induced dephasing by a factor of 70 compared to the readout resonator. Our work provides a scalable hardware solution that resolves the traditional trade-off between fast qubit operations and qubit protection, advancing the prospects for fault-tolerant quantum computing.
Read the full abstract

All authors Yu Zhao, Zhixu Chen, Hanxian Liu, Mingze Liu, Zixing Liu, Hao Pang, Meiyan Wan, Changkun Wu, Liuzhu Zhong, Sai Li, Yuefeng Yuan, Yuxuan Zhou, Ji Jiang, Ji Chu, Song Liu

Computer Vision

Adapting Open-Weight MLLMs to Generate Point Prompts for Electron Microscopy Segmentation

Promptable models such as microSAM segment electron microscopy (EM) images from point prompts, but automation requires generating prompts without user input. We ask whether open-weight multimodal large language models (MLLMs) can generate them from natural-language requests by returning coordinates to a frozen segmenter. To that end, we convert masks from three mitochondria datasets into training examples, pairing images and instructions with centroid coordinates, then train LoRA adapters while freezing the MLLM backbone and microSAM. We find that Qwen3-VL reaches segmentation AP$_{50}$ $0.736$ after supervised fine-tuning and reward optimization, up from $0.247$ without adaptation, while automatic prompt generation (APG) achieves $0.773$. In addition, two other MLLMs improve, reaching or exceeding APG. When compared with a supervised centroid-heatmap detector that reaches AP$_{50}$ $0.904$ for this mitochondria task, Qwen3-VL more closely matches the annotated point set and instance counts. Moreover, training on two public datasets transfers to an unseen third, while training on all three transfers to an independent EM volume. Robustness tests show stable performance under unseen formulations of the natural-language request, while the coordinates can be reused by a second segmenter. To our knowledge, this is the first feasibility study of open-weight MLLMs as EM point generators, providing an inspectable, language-directed link between localization and mask decoding.
Read the full abstract

Cryptography and Security

SkillSecurer: Detecting and Patching Prompt-Injection Vulnerabilities in AI Agent Skills

Agent skills extend AI agents with reusable instructions, scripts, and configuration, but are also open to new attacks to influence an agent's decisions and actions. To address these risks, we present SkillSecurer, a fully agentic framework for generating, detecting, localising, and remediating security risks in agent skills. Its red agent generates context-compatible injections across nine threat types while recording the exact modification; its blue agent analyses complete skill packages, produces grounded evidence, and proposes patches. For controlled instances, a verifier compares findings and patches with the recorded injection, enabling injection-level evaluation. We thoroughly evaluate SkillSecurer by selecting the best backend LLM, comparing it with competitors, and manually cross-validating each evaluation stage. With its best performing backend, SkillSecurer is the only scanner to achieve a 100% injection detection rate. Next, we analyse popular skills from skills.sh, finding latent vulnerabilities in more than 17% of the skills examined. Testing some of those skills, we trigger actual incidents, showing the risks of running unverified skills. Our results show that context-aware LLM analysis can provide reliable injection localisation and actionable remediation beyond skill-level flagging alone.
Read the full abstract

All authors Donato Mecca, Alberto Verna, Youness Bouchari, Nikhil Jha, Marco Mellia

Computational Engineering

Ensemble generative filtering for sequential data assimilation in dynamical systems

Sequential data assimilation (DA) faces a fundamental trade-off: particle filters capture non-Gaussian cycling priors but require prohibitively large ensembles, whereas the ensemble Kalman filter (EnKF) is computationally efficient but constrained by its Gaussian assumption. As machine learning enables rapid model forecasts, exploiting non-Gaussian prior features via moderately large ensembles has become increasingly viable. To exploit this opportunity, we propose the ensemble generative filter (EnGF), a simple yet effective method for non-Gaussian filtering. The key idea is to fit a generative model to the forecast ensemble at each DA cycle and harness its defining strength, inexpensive sampling, to draw a much larger particle population for Bayesian analysis without any additional model forecasts; we adopt a Gaussian mixture model as a lightweight instance that can be fit cheaply from a moderate ensemble. To address practical challenges, we further extend the EnGF by introducing (i) a tempered EnGF using likelihood tempering to prevent particle degeneracy under informative observations and (ii) a latent EnGF that performs prior modeling and Bayesian updates in a reduced latent space for high-dimensional systems. Across chaotic systems (doubling map, Lorenz-63, and Lorenz-96) and a challenging shock-tube problem, the EnGF delivers clear and often substantial improvements over the EnKF, in some cases even approaching the filtering accuracy of a massive-ensemble particle filter at a small fraction of its cost.
Read the full abstract

Numerical Analysis

IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries

Quantum computing offers the potential to solve computational mechanics problems with a more favourable complexity scaling than classically possible. To realise this potential, a quantum-compatible formulation of the finite element method is essential. We present such a formulation for Poisson problems with spatially varying coefficients on general domains discretised by an immersed uniform Cartesian grid. The resulting banded sparse system matrices are encoded as the sum of diagonal matrices with polynomial entries and their products with shift matrices. The sum of the matrices is formed using the linear combination of unitaries (LCU) technique. The resulting block-encoded system matrix can be implemented using a polylogarithmic number of elementary gates. For immersed boundaries, the block-encoded system matrix is further processed using a diagonal indicator matrix with zeros and ones. The indicator matrix is defined in terms of an integer-valued level-set function composed of simple geometric primitives via Boolean set operations. The required integer operations are computed on the fly using quantum arithmetic. The resulting block-encoded linear system of equations is solved using quantum singular value transformation (QSVT). The overall gate count, including the QSVT, is $O(N_{\text{tot}}^{2/d} \operatorname{polylog}(N_{\text{tot}}))$, where $d$ is the problem dimension and $N_{\text{tot}}$ the number of grid points. In numerical examples that confirm the theoretical complexity estimates, the solutions converge approximately linearly for immersed problems and quadratically for simply connected domains.
Read the full abstract

Systems and Control

SafePG: Safe and Globally Optimal Reinforcement Learning with Hard Constraints

We present an optimal and convergent model-free policy gradient (PG) reinforcement learning (RL) framework for controlling nonlinear dynamical systems under hard safety constraints. We first construct a class of stochastic wrapper policies centered around a deterministic controller, thereby enabling exploration in unknown environments while preserving the underlying deterministic control structure. We then define a class of parameterized safe-by-construction control policies by truncating these stochastic policies onto hard safety constraints. We next establish, via measure-theoretic arguments, that the potentially nonconvex RL objective under the truncated policy class, as well as its policy gradients, are well-defined. We then develop a model-free PG algorithm based on stochastic gradient ascent that directly searches over these truncated policies and leverage gradient dominance to establish convergence and optimality guarantees. Finally, we validate this framework through simulations on a safe quadrotor navigation problem.
Read the full abstract

Systems and Control

Predefined-Time Integral Reinforcement Learning for Saturated Unknown Nonlinear Multi-Agent Systems Under FDI Attacks and Disturbances

This paper addresses secure leader-follower formation of unknown nonlinear multi-agent systems under actuator constraints, external disturbances, and false-data-injection (FDI) attacks. The graph-coupled coordination-error dynamics are formulated as local zero-sum differential games, where a nonquadratic input utility yields saturation-compatible secure policies and actuator-channel FDI and disturbances act as adversarial inputs. To eliminate explicit dependence on the unknown nonlinear drift, an integral Bellman-Isaacs identity enables critic-only learning from finite trajectory data. A two-power state-cost structure and a deadline-parameterized critic update connect optimal learning with predefined-time stabilization. Unlike fixed-time methods whose settling-time bound is determined by preselected gains, the proposed framework assigns the overall deadline first and allocates it among data informativity, critic learning, the reinforcement window, and formation convergence. Practical predefined-time convergence of the critic and formation errors to bounded residual sets is established independently of initial conditions, while secure actuator constraints are satisfied by construction. Simulations validate the framework under FDI attacks, disturbances, input constraints, and different initial conditions.
Read the full abstract

Functional Analysis

Duality and Baire like properties in topological abelian groups

This article investigates the duality of abelian topological groups by delving into the interplay between the algebraic and topological properties of a group $G$ and those of its dual group. In particular, extending the notion of a $g$-barrelled group, we introduce and study the classes of $\kappa$-barrelled and $\omega$-barrelled groups. Our first main result establishes that every $\omega$-barrelled group is $\aleph_0$-barrelled (i.e., if every weakly convergent sequence in the dual group is equicontinuous, then every metrizable weakly compact subset of the dual group is also equicontinuous). From this, we deduce that the free topological abelian group $A(K)$ over a metrizable compact space $K$ is determined by the subgroup generated by any of its dense subsets. Furthermore, we prove that if $G$ is a $\sigma$-compact, $\omega$-barrelled group, then its dual group $\widehat{G}_\kappa$ equipped with the compact-open topology is sequentially complete (complete if $G$ is hemicompact). We also solve an open question posed by Trigos-Arrieta by constructing an explicit example of an $\omega$-barrelled metrizable group that fails to be $g$-barrelled. Finally, we investigate the dualization of groups lacking infinite compact subsets, proving that for a totally bounded abelian group $G$, every compact subset of $G$ is finite if and only if its dual group $\widehat{G}$, endowed with the finite-open topology, is unordered Baire-like.
Read the full abstract