Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Wednesday 9 September

Databases

When Does Low-Bit Quantization Preserve the Decisions of Vector Search?

An orthogonal rotation improves the distance rank correlation of two-bit Cohere codes from 0.75 to 0.91, yet increases nearest-neighbour comparison flips by 51%. We analyse quantization through the comparisons made by graph search. A comparison changes only when its quantization error exceeds its exact margin, giving a flip bound that separates close calls from large errors. Shared endpoints induce correlated distance errors that partly cancel within a comparison. An exact replay identity connects candidate-level actions to the output of neighbour selection. A Gaussian model gives coordinate-code errors in closed form, and a rare-spike construction exposes heavy tails in the population-radius error. Held-out blocks give model-free certificates for acceptance rules based on exact or quantized margins. Across 24 dataset-code configurations, calibration-estimated risk correlates with held-out ranking and pruning flips at 0.97 and 0.99, compared with 0.91 and 0.99 for a margin-to-noise summary and 0.74 and 0.05 for distance rank correlation. Paired builds of 200,000-vector graphs connect rotation, query scoring, and topology to end-to-end recall and search work.
Read the full abstract

Artificial Intelligence

The Era by Eon Benchmark: A Generated Enterprise Estate with Exact Ground Truth for Benchmarking LLM Agents

LLM agents for enterprise systems of record cannot be evaluated on customer production data, and no existing substitute provides ground truth. We present the Era by Eon Benchmark for evaluating LLM agents that use enterprise tools. The benchmark is built around a complete fictional company. It includes product simulators, company-specific internal databases, benchmark questions, and computed answer keys. Industry, company size, business model, application portfolio, and a seed define each company. One seeded entity graph supplies shared company data to simulators of Salesforce, Zendesk, Slack, Gong, and other products. A questionconditioned generator creates the schemas and records for internal databases. It takes shared entities, keys, and values from the same graph before generating database-specific facts. Both mechanisms therefore describe one consistent enterprise estate. Every expected answer is computed from the final records, so grading is exact. Design and answer-key checks validate the internal databases. A realism scorecard and adversarial detector validate the entity graph. Across 23 generated companies, the mean realism score rose from 61.8 to 97.0, with zero records flagged as synthetic. In the reported simulator-track comparison, nine models answered the same 33 questions three times each. Accuracy estimates ranged from 42.4% to 76.8%, and three of 36 pairwise differences remained supported after correction.
Read the full abstract

All authors Benjamin Gruenbaum, Doron Porat, Assaf Natanzon, Roy Zavida, Chen Dinachi, Or Itzahary

Computation and Language

$S^3$-Bench: Evaluating Speech Interaction Models as Scientific Voice Assistants

The advance of multimodal large language models (MLLMs) has fundamentally reshaped the paradigm of human-computer interaction, especially speech interaction models capable of seamless conversations. Despite remarkable performance as general voice assistants, their performance in specialized domains remains underexplored, particularly in scientific areas. Scientific interactions introduce formidable challenges, involving rare technical terminology, spoken norms of abbreviations, and the natural verbalization of symbolic special expressions. In this paper, we introduce S$^3$-Bench, a systematic evaluation framework covering 10 major disciplines, consisting of a Knowledge set for speech question-answering and a Dialogue set for multi-turn progressive interactions with simulated user agents. By decomposing a complete atomic turn into stages of speech recognition, perception, knowledge utilization with reasoning, and response pronunciation, we systematically characterize the common challenges and performance tradeoffs of existing approaches. Furthermore, experiments on multi-turn interactions reveal persistent limitations in user adaptation and the generation of accurate, comprehensive, and efficient responses.
Read the full abstract

All authors Heyang Liu, Jiayi Huang, Wenyang Xiao, Ziyang Cheng, Lixin Zhang, Zhen Liu, Miao He, Ronghua Wu, Qunshan Gu, Yanfeng Wang, Yu Wang

Combinatorics

On the Vertices That Belong to All Minimum Identifying Codes

Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In this paper, we consider the vertices that are in every minimum identifying code in a graph. There are two types of such vertices: always-forced vertices that belong to all identifying codes (minimum or not) and min-forced vertices that belong to all minimum identifying codes. A vertex is called proper-min-forced if it is min-forced but not always-forced. We show an upper bound $2n/3$ for the number of such proper-min-forced vertices in a closed-twin-free graph of order $n$. Moreover, for integers $n$ divisible by three, we construct an infinite family of graphs in which there are $2n/3-1$ such vertices. In addition, we determine the maximum number of edges in a graph of even order such that the graph contains proper-min-forced vertices. We also show that the decision problem of determining whether a given vertex in a graph is proper-min-forced is co-NP-hard.
Read the full abstract

Quantum Physics

When Does a Quantum Speedup Survive End-to-End?

Primitive quantum speedups are interface-relative: they depend on the input access used to run the primitive and on the output contract used to consume its state or samples. This paper introduces a transcript-level admissibility relation \(A_M\preceq_{\mathrm{int}}A_Q\), defined relative to the declared implementation package of the quantum interface. It identifies which adaptive classical access transcripts that same package licenses, with all setup, transcript-generation, and precision overheads charged. The main application is an operational audit for normalized-Betti estimation in clique-complex TDA, separating three declared-interface regimes. Reversible indexed simplex interfaces certify matched classical simplex sampling and local Laplacian row access by evaluating their reversible routines on single computational branches. Membership-based preparations induce a rejection route of overhead \(\binom{n}{k+1}/|S_k|\). Abstract spectral or block-encoding interfaces require an accompanying implementation package, transcript reduction, or shared representation. Under the indexed certificate and interface closure, the end-to-end cost is fixed by the imported estimator's spectral dependence on the gap \(\gamma\); the concretely realized bounded-treewidth family already admits exact \(\mathrm{poly}(n)\) classical Betti computation by rank over \(\mathbb{Q}\). A low-rank separation supports the role of access and output contracts.
Read the full abstract

All authors Pablo Herrero Gómez, Antonio Jimeno Morenilla, David Muñoz Hernández, Higinio Mora Mora

Networking

Can AI Agents Detect and Repair Artifact Drift in Network Experiments?

In recent years, AI agents have evolved into capable assistants that carry out multi-step tasks in digital environments. The network systems community is beginning to explore these capabilities in operational and experimental settings. However, an agent operating in network systems should not be judged solely by whether it completes the immediate task. The experiment record it modifies must also remain trustworthy. We call this property artifact integrity: the record's claims must remain supported by the available evidence, confined to the scope established by that evidence, and traceable through the artifacts that encode their support. To make this property measurable, we introduce NetArtifactBench, which tests whether AI agents can repair inconsistent records derived from public network-system artifacts while preserving claims that remain supported. The benchmark contains 52 instances with injected inconsistencies ranging from direct contradictions to unstated relations spread across several artifacts. We evaluate 23 agent configurations across three general-purpose AI agent runtimes using deterministic scoring. The average contract pass rate is 65.3 % across 5,980 outputs, but no agent runtime exceeds 30 % when repair requires recovering implicit relations and propagating changes across artifacts. These results reveal a sharp boundary between local correction and complete record-level repair. Therefore, we argue that artifact integrity should become a first-class design and evaluation requirement for AI agents operating on network systems.
Read the full abstract

All authors Tianzhu Zhang, Weichen Tao, Changgang Zheng, Yusheng Zheng, Long Chen, Xiaoyi Fan, Meikang Qiu

Cryptography and Security

Subgroup Membership Inference Audits of Differentially Private Synthetic Text

Synthetic data releases are increasingly proposed in the literature as a means of sharing realistic data replicas in lieu of sensitive private datasets. Even when the worst-case privacy leakage of such releases is bounded by means of differential privacy (DP), in practice a residual risk remains. Membership inference attack (MIA) audits are conducted to empirically quantify this risk. However, existing methods only measure average-case risk for randomly drawn records, which might conceal the risk to vulnerable subgroups. To highlight this issue, we define a subgroup-targeted membership inference game in which the target pool is an explicit parameter, and instantiate it with an audit of 32 proxies under three scenarios with different levels of attacker knowledge, across four datasets, three generators (DP-SGD fine-tuning, API-based prompting, and activation steering), and five privacy budgets. The audit shows that synthetic releases leak subgroup membership and that prior attacks systematically underestimate this leakage. DP is effective at the aggregate level: it substantially reduces average leakage at every budget we test. Three observations temper this picture. First, the remaining leakage is concentrated rather than spread out: under DP, a tenth of the records carries roughly 40% of it. Second, the protection DP delivers in practice is uneven: within its worst-case guarantee, the noise removes more of the measured leakage from random records than from high-risk ones—and a merged-pool audit that scores both record types against shared negatives confirms this at the record level. Third, which records leak proves to be a property of the release mechanism rather than of the record alone, so record-level risk cannot be assessed independently of the release.
Read the full abstract

All authors Yidan Sun, Viktor Schlegel, Srinivasan Nandakumar, Siew Kei Lam, Anil Anthony Bharath

Quantum Physics

Simple QKD keyrate computations from tangent-line bounds

Recent work in quantum key distribution (QKD) has yielded finite-size keyrates based on convex optimisation problems, using the framework of entropy accumulation. Multiple solvers have been developed to address these optimisations in recent years, but have been based on a somewhat elaborate framework using sophisticated algorithms, in order to accommodate a broad range of QKD protocols. In this work, we note that for basic QKD protocols such as qubit BB84, the keyrates can be easily computed using off-the-shelf solvers instead, by obtaining suitable tangent lines to lower bound terms in the objective function. We compute the resulting finite-size keyrates and compare them to previous work. Moreover, we extend this approach to the six-state protocol, by deriving closed-form expressions for the single-round Rényi entropies in the protocol. This should facilitate subsequent study of the six-state protocol via entropy accumulation.
Read the full abstract

Atomic Physics

Miniaturized vacuum package for magneto-optical trapping of strontium

Quantum sensors, like optical lattice clocks, undergo a continuous development from lab-based towards mobile systems. A key aspect in the miniaturization of the experimental setups is the development of compact atom sources. Conventional atom sources for alkaline-earth-like elements consist of a high-power oven and a six-beam magneto-optical trap (MOT) inside of vacuum chamber with extensive flanges, viewports and electrical feedthroughs. Here we present a highly compact vacuum package utilizing key technologies for future quantum sensor systems: A chip-based low-power atomic oven, a planar grating MOT chip, and a miniaturized vacuum pump all held inside an additively manufactured titanium vacuum chamber, featuring custom-sized vacuum flanges. In this miniaturized setup, spanning a volume of only 750 ml, we trap up to $10^5$ Sr atoms in a MOT, requiring an oven heating power below 1 W.
Read the full abstract

All authors Julian Pick, Eric Henker, Florian Löwinger, Rick Vogt, Sebastian Hüttl, Andreas Trützschler, Julia Voß, Simon Hirt, Malte Schulz-Ruhtenberg, Aleksandra Buchta, Alexander Kassner, Folke Dencker, Marc Wurz, Stephan Hannig, Simone Callegari, Saskia Bondza, Jens Kruse, Tobias Leopold, Roman Schwarz, Carsten Klempt

Analysis of PDEs

Logarithmic Stability for an Inverse Source Problem in a Coupled Nonlinear Helmholtz System

We study an inverse source problem for a two-mode nonlinear Helmholtz system motivated by second-harmonic generation. The datum is the full first Fréchet derivative of the nonlinear Dirichlet-to-Neumann map at one fixed, common, small boundary state, which need not be zero. For real-valued small data, a known susceptibility bounded away from zero, and sources supported in a fixed compact subset of the domain, we prove uniqueness and a conditional single-logarithmic stability estimate. The first boundary variation is the Dirichlet-to-Neumann map of a symmetric $2\times2$ matrix Schrödinger operator. Absorbing the two known Helmholtz energies into its matrix potential permits the use of standard zero-energy complex geometrical optics solutions with a common null phase geometry. A bilinear Alessandrini identity then gives a uniform Fourier estimate for the two entries containing the background fields. Zero extension below the exponent $3/2$, a low/high frequency splitting, and interpolation between $H^{-2}$ and the a priori $H^s$ source bound yield the stated stability modulus.
Read the full abstract

Systems and Control

Semi-Cooperative Passive Integrated Sensing and Communication by Utilizing Physical Layer Information of 5G Signals

In recent years, integrated sensing and communication (ISAC) has attracted significant attention towards future cellular networks. Currently, various works have demonstrated sensing performance in existing wireless communication systems. Most of the demonstrations are based on passive type due to the radio regulatory. However, because of the difficulty in access to the communication protocol stacks in commercial cellular systems, the evaluation of the cellular communication signals for semi-cooperative passive ISAC is limited. In this paper, a semi-cooperative passive ISAC system is developed with open-source 5G framework and software-defined radio devices. And the performance is experimentally evaluated by utilizing the physical layer information of actual 5G signals from the developed system. In this system, communication is established with 5G signals and physical layer information are obtained and extracted for analysis. The performance of the system is verified by conducting experiments under several communication scenarios including the synchronization, pinging, and data transmission. Different physical layer information is collected, and the propagation characteristics are analyzed by a multi-path configuration. The experiment results demonstrated that variable bandwidths were utilized for different communication scenarios and the multipath was successfully detected with two different approaches. These results show that the developed system is promising for semi-cooperative passive ISAC in wider application fields
Read the full abstract

Instrumentation and Detectors

Operation of a negative ion gas time projection chamber without electronegative fill gases

The high fidelity reconstruction of particle tracks in micropatterned gaseous time projection chambers renders this technology ideal for future rare-event searches, including direction-sensitive dark matter experiments. Large drift distances are typically required for such experiments, so that the overall spatial resolution is limited by diffusion. Negative ion drift exhibits lower diffusion than electron drift and is thus an attractive option for realising a large-scale detector. The use of electronegative gases to create negative ions introduces technical challenges, most notably a reduction in gain when compared to conventional gas mixtures. In this study, we demonstrate a new method for negative ion generation via dissociative electron attachment using the conventional molecular fill gas CF$_4$. Our optical measurements of negative ion drift indicate electron attachment lengths of $<$1 mm and comparable gain to electron avalanches. The individual negative ion avalanches were also time-resolved, allowing the number of ions reaching the readout to be counted. We measure an improved energy resolution by single ion counting, relative to an integrated electron avalanche signal measured under identical gain conditions.
Read the full abstract

All authors Lachlan J. McKie, Lindsey J. Bignell, Nicholas Adams, Victoria U. Bashu, Ferdos Dastgiri, Gregory J. Lane

Metric Geometry

Length distortion of volume-preserving Lipschitz mappings

We show that every area-preserving Lipschitz map between metric surfaces distorts the length of almost every curve by at most a multiplicative factor, answering a question posed by the first author and Ntalampekos. We give two different proofs. The first is entirely intrinsic and extends to higher dimensions under additional assumptions. The second relies on non-smooth uniformization theory and yields the conclusion that the family of curves intersecting the purely 2-unrectifiable part of a metric surface in a set of positive length is exceptional.
Read the full abstract

Analysis of PDEs

A Sharp Sobolev Inequality on Compact CR Manifolds

For any \(n\geq 1\), let \((M,\theta)\) be a compact strictly pseudoconvex hypersurface type CR manifold with dimension \(2n+1\), \(Q=2n+2\) be its homogeneous dimension. We prove the sharp Folland–Stein Sobolev inequality on \(M\): if \(Q^*=2Q/(Q-2)\), then there exists a constant \(A>0\), depending only on \((M,\theta)\), such that \[ \|u\|_{L^{Q^*}(M)}^2 \le K(n)^2\|\nabla_b u\|_{L^2(M)}^2 + A\|u\|_{L^2(M)}^2, \qquad u\in S^{1,2}(M). \] Here \(K(n)\) is the sharp constant in the Folland–Stein Sobolev inequality on the Heisenberg group \(\mathbb H^n\).
Read the full abstract

Machine Learning

TempTPI: Informer-Based trajectory prediction for maritime vessels

Accurate long-term trajectory prediction for maritime vessels is essential for safety and logistical efficiency. While deep learning models, particularly Transformers, have shown promise in processing Automatic Identification System (AIS) data, they often struggle with the quadratic computational complexity of self-attention and the loss of accuracy over extended forecasting horizons. This study proposes TempTPI, a novel prediction framework that integrates an Informer-based encoder with a multi-channel temporal encoding mechanism. The Informer architecture leverages a ProbSparse self-attention mechanism to reduce computational overhead and focus on the most significant dependencies, while the temporal encoder utilizes Fourier-like frequency expansions to capture cyclic patterns (hourly, daily, and seasonal) in vessel behavior. We evaluate our model against the state-of-the-art TPTrans architecture using AIS data from Danish waters. Experimental results demonstrate that TempTPI consistently outperforms existing methods across prediction windows of 1 to 5 hours. Notably, at a 5-hour horizon, the proposed model achieves a 55% improvement in Mean Squared Error (MSE), offering a robust solution for long-range maritime situational awareness.
Read the full abstract

All authors Kevin Ferneding, Veronika Lietavcova, Aleksandra M. Blachowiak, Peder Heiselberg

Quantum Physics

Minimax games for quantum channel discrimination

Quantum channel discrimination is a primitive task for identifying, verifying, and benchmarking quantum dynamics. Previous studies have primarily considered either the best-case tester-input setting or the worst-case jammer-input setting. Here, we introduce a game-theoretic framework in which both the tester and jammer control separate inputs. Combining three input structures, characterized by whether the tester and jammer use entangled inputs or IID inputs across channel uses, with four information patterns, determined by the visibility of the jammer's strategy and its knowledge of the true hypothesis, yields twelve game models. We provide exact finite blocklength hypothesis testing characterizations of all twelve models in terms of nine minimax hypothesis testing divergences and derive their asymptotic Stein exponents. Notably, for entangled jammers, neither the visibility of the jammer's strategy nor its knowledge of the true hypothesis affects the asymptotic Stein exponent, whereas the information pattern remains consequential for IID jammers. As an example, we study the discrimination of a general channel from a replacer channel and show that all asymptotic Stein exponents coincide with the same additive, single letter quantity. We further develop a general argument that upgrades achievability results to strong converse results, thereby establishing strong converse properties for several game models, resolving an open problem in composite hypothesis testing posed by Berta et al. [Commun. Math. Phys. 385, 55 (2021)], and strengthening several recent results of Lami [arXiv:2510.06340]. The framework and techniques developed here may support future studies of quantum information tasks involving competing roles.
Read the full abstract

All authors Kun Fang, Michael X. Cao, Hao-Chung Cheng, Li Gao, Masahito Hayashi

Information Theory

Proximity Gaps for Gabidulin Codes and Applications

Proximity gaps are central to the soundness of interactive oracle proofs of proximity (IOPPs) and polynomial commitment schemes (PCSs). An $[n,k,d]$ linear code $C\subseteq\mathbb F^n$ has a $\delta$-proximity gap with error $\epsilon$ if, for every $u_0,u_1\in\mathbb F^n$, either all points on $\ell_{u_0,u_1}=\{u_0+\alpha u_1:\alpha\in\mathbb F\}$ are $\delta$-close to $C$, or at most an $\epsilon$ fraction are. Although proximity gaps for Hamming-metric codes are well understood, their rank-metric counterparts remain largely unexplored despite their applications in coding theory and cryptography. In this work, we study proximity gaps for linear rank-metric codes and their cryptographic applications. First, we show that every $[n,k,d]$ linear rank-metric code $C$ over $\mathbb F_{q^m}$ admits a proximity gap for every $\delta\le(d-1)/(3n)$, with error at most $q^{e+1}/q^m$, where $e=\lfloor\delta n\rfloor$. For Gabidulin codes, we improve the gap to $(d-1)/(2n)$ with error $10q^{n-1}/q^m$. These two proximity gaps match those for general linear Hamming-metric codes and Reed–Solomon (RS) codes, respectively. We prove the $(d-1)/(2n)$ bound is tight by constructing an infinite family of constant-rate Gabidulin codes and affine lines $\ell_{u_0,u_1}$ on which a $1-o(1)$ fraction of points are $d/(2n)$-close to the code, while $u_1$ is at least $3d/(4n)$-far from it. At $\delta=(d-1)/(2n)$, a further counterexample gives a lower bound of order $q^{n-1}/q^m$ on $\varepsilon$, matching our upper bound up to a constant factor. As applications, we construct an IOPP for interleaved Gabidulin codes by adapting the Ligero IOPP for interleaved RS codes. We then adapt the Ligero-based PCS for ordinary polynomials to obtain a $q$-linearized polynomial commitment scheme. To our knowledge, this is the first PCS framework based on rank-metric error-correcting codes.
Read the full abstract

All authors Songsong Li, Chaoping Xing, Chen Yuan, Ruiqi Zhu

Computational Complexity

On the Parameterized Complexity of Coloring Discovery

Coloring Discovery asks whether a possibly improper initial coloring can be made proper within a prescribed number of allowed changes. We study the parameterized complexity of three modification step models that were studied previously in the literature: recoloring one vertex (color flipping), swapping the colors of arbitrary vertices (color swapping), and swapping colors only across an edge (color sliding). For color flipping, we give exact fixed-parameter algorithms for the parameters vertex cover and distance to complete. For color swapping, we obtain fixed-parameter tractability for the parameter vertex cover plus the number of colors. Our lower bounds show W[1]-hardness for treedepth plus feedback vertex set in the color flipping model and for the number of colors plus bandwidth or distance to disjoint paths in the swapping and sliding models. All three variants remain NP-complete with four colors on graphs of diameter two.
Read the full abstract

Quantum Physics

Robust Device-Independent Certification of Boolean-Phase Gates

Device-independent certification of a quantum gate requires the input and output tests to identify the same reference qubits. Self-testing the output Choi state alone does not guarantee this consistency. We develop a robust certification scheme for Boolean-phase gates, a broad family of computational-basis diagonal gates specified by Boolean functions. Boolean derivatives convert the target-dependent phase information into classical signs that can be evaluated from local measurement outcomes. This leads to Bell tests built from CHSH blocks using two binary measurements per party and no entangling measurements. At maximal violation, the tests self-test the normalized Choi state and the measured observables. Away from the maximum, they give an explicit affine lower bound on the extracted-state squared fidelity that is uniform over all Boolean functions and valid in arbitrary local dimensions. We then combine an identity test and a gate-output test in an independent-source network in which the reference devices use the same physical observables, obtaining a closed-form Choi-fidelity bound for an effective \(n\)-qubit channel. For CCZ, a joint six-party analysis gives a stronger robustness bound without changing the Bell expression or measurement settings. The construction shows how the algebraic structure of a gate can shift target-dependent information from quantum measurement design to classical processing of local outcomes.
Read the full abstract

All authors Yunguang Han, Xingyuan Bu, Aleksandra Gočanin, Jiabing Yuan

Computation and Language

HyperTrace: Hypothesis-Based Preference Tracing for Online LLM Personalization

Personalized language models aim to adapt responses to individual users, whose preferences are often latent and revealed gradually through interaction. Existing training-free methods rely on stored histories or retrieved memories, but they often struggle to reconcile long- term preferences with short-term topic-specific needs. To address this issue, we propose HyperTrace, a training-free framework that formulates online personalization as latent preference tracing. HyperTrace maintains interpretable natural-language hypotheses over short-term intent and long-term preferences, and updates them through an SMC-style reweight process using an LLM-based surrogate choice model. By updating these hypotheses across turns and sessions, HyperTrace enables personalization without parameter updates. Experiments on PRISM and PersonaMem-v2 show that HyperTrace improves response alignment, preference prediction, and profile consistency over strong online baselines, demonstrating the effectiveness of tracing latent user preferences for robust personalization. Code and scripts are available in the repository: https://github.com/jiseshen/HyperTrace.
Read the full abstract

All authors Jianzhi Shen, Keyu Mao, Minghao Shao, Chuanyang Jin, Yusong Wang, Ailiang Lin, Kotaro Funakoshi, Manabu Okumura, Tianmin Shu, Muhammad Shafique

Graphics

Semi-Implicit Pairwise Descent for Nonlocal Continuum Mechanics

We propose Semi-Implicit Pairwise Descent (SIPD), a unified nonlocal pairwise framework for simulating large-scale hyperelastic materials involving complex contact and friction. By reformulating the Finite Element Method (FEM) equations of motion into a pairwise force representation from a nonlocal perspective, our approach avoids costly Hessian computations, leading to a reduction in per-iteration computational overhead. Furthermore, we propose an analytical projection strategy for projecting our Hessian-free coefficient matrices to positive semi-definiteness. And we treat contact and friction as a unified anisotropic elastic energy, allowing for a seamless integration into the elastic solver framework. We mathematically prove that our method is unconditionally stable and numerically convergent.Experimental results demonstrate that SIPD achieves real-time performance for million-scale simulations even under intricate contact and friction conditions.
Read the full abstract

All authors Xukun Luo, Xiao Cheng, Yuzhong Guo, Ying Qiao, Wencheng Wang, Xiaowei He

Operating Systems

Violet: Enabling Full Virtualization for M-mode RTOS on RISC-V

In embedded systems, complex configurations may be required, such as the simultaneous execution of a real-time operating system (RTOS) and a general-purpose operating system (GPOS), or the operation of multiple RTOS instances. Embedded system hypervisors have been studied and developed to meet these requirements for architectures like ARM and x86. RISC-V is experiencing growing adoption in embedded systems and faces similar needs. However, RISC-V's virtualization support targets only U-mode (where applications run) and S-mode (where general-purpose OSs run) as virtualization levels. The M-mode, where RTOSs like FreeRTOS or Zephyr run, is excluded from virtualization. This means that, similar to architectures like ARM, running an RTOS on a Virtual Machine (VM) using methods based on virtualization support features is impossible. Therefore, this paper proposes the Violet hypervisor. Violet combines RISC-V's virtualization features with software-based emulation, enabling the execution of unmodified M-mode RTOSs. Evaluation verified the validity of the M-mode emulation functionality using RISC-V architecture tests. Furthermore, this was implemented on the SiFive HiFive Premier P550 hardware, demonstrating that existing RTOSs can run on Violet's VM and that coexistence with GPOSs like Linux is also possible. The performance evaluation also quantified the overhead introduced by M-mode emulation on M-mode CSR accesses, timer interrupt latency, and context switching.
Read the full abstract

All authors Taro Kito, Ryosuke Yamamoto, Keisuke Horii, Hiroki Masuda, Koichi Mouri

Computer Vision

SkNeXt enables topology-guided neuronal reconstruction from petabyte-scale microscopy data

Recent advances in high-resolution fluorescence and electron microscopy have enabled nanoscale imaging across increasingly large brain volumes, but the resulting terabyte- to petabyte-scale datasets make complete neuronal reconstruction prohibitively expensive in computation, data movement, and manual proofreading. Here, we present SkNeXt, a topology-first framework for scalable neuronal reconstruction from large volumetric microscopy datasets. Instead of densely processing entire image volumes, SkNeXt first converts neuronal morphology into compact SWC skeletons that preserve long-range connectivity. Proofreading is therefore focused on sparse neuronal trees, allowing branch, continuity, and connectivity errors to be corrected before high-resolution reconstruction. The corrected skeletons then serve as persistent structural priors for recovering detailed morphology while preserving neuronal identity and topology. Crucially, SkNeXt also uses neuronal skeletons as spatial indices for selective data access, retrieving high-resolution image regions only along reconstructed trajectories and bypassing most background and signal-free volumes. This substantially reduces I/O and computational overhead, allowing reconstruction cost to scale with neuronal morphology rather than total dataset size. Using SkNeXt, we reconstructed neurons from a petabyte-scale super-resolution fluorescence dataset of the mouse brain on a single GPU within one week, without requiring exhaustive dense inference across the complete imaging volume.
Read the full abstract

Statistics Theory

Proportional-limit asymptotics for Diaconis-Ylvisaker-penalised logistic regression with fitted intercept

This paper develops estimator-level asymptotic theory for maximum Diaconis-Ylvisaker prior penalised likelihood for logistic regression with a jointly fitted intercept and nonzero prior slope direction in the proportional-limit regime. For $\mathrm{N}(\mathbf{0}_p, p^{-1}\mathbf{I}_p)$ Gaussian covariates and $p/n\to\kappa\in(0,1)$, a conditional convex Gaussian min–max analysis yields almost-sure convergence of the fitted intercept and a pseudo-Lipschitz empirical law for the slope estimator. This estimator-level law gives asymptotic limits for out-of-sample scores, classification error, optimal thresholding and oracle calibration. It also yields oracle-adjusted fixed-block $Z$-statistics under isotropic Gaussian covariates, and yields the main ingredient in establishing the limiting distribution of the penalised likelihood-ratio test statistic and identifies the rescaling to recover the nominal chi-square distribution. We extend these results to Gaussian designs with arbitrary deterministic mean and positive-definite covariance via affine centering and whitening and discuss extensions to subgaussian covariates. Finally, we propose a consistent response-moment estimator of the oracle parameters entering the state equations that govern the slope limiting law and are required for feasible inference.
Read the full abstract

High Energy Physics (Phenomenology)

Radiative Corrections to the Direct Detection of Inelastic Scattering of Higgsino-like Neutralino Dark Matter

The direct detection (DD) of Higgsino-like dark matter (DM) through inelastic scattering processes may provide a promising avenue, along with the elastic scattering, when the mass splitting between the neutral Higgsino pairs is extremely tiny. The mass splitting can be reduced further by adopting the on-shell renormalization for the neutral and charged Higgsinos in the MSSM. Moreover, all the one-loop electroweak (EW) corrections to the three-point vertices for the neutralino(s)-Higgs interactions have been considered, while both elastic and inelastic DM-nucleon scattering cross-sections have been calculated primarily through Higgs exchange. Subsequently, the expected number of scattering events in the latest LUX-ZEPLIN (LZ) DD experiment are also computed. Our results highlight a few scenarios in which the inelastic component may exceed the corresponding elastic component, leading to enhanced direct detection scattering rates.
Read the full abstract

All authors Arindam Chatterjee, Debottam Das, Syed Adil Pasha, Alexander Pukhov, Rahul Puri

Systems and Control

Entropy-Regularized Optimal Transport for Time-Varying Multi-Agent Coverage Control

This paper addresses time-varying coverage control for multi-agent systems, formulated as the tracking of an evolving target density via entropy-regularized semi-discrete optimal transport. Unlike the hard Laguerre partition of the unregularized formulation, entropic regularization assigns fractions of the mass at each point to all agents, simplifying the design and numerical implementation of the control law. We derive a feedback-feedforward controller that tracks the evolving first-order optimality conditions with exponential convergence, and we investigate the role of the regularization parameter, which, above a critical threshold, renders the fully collapsed configuration locally optimal. Numerical experiments validate the theory: for moderate regularization, the proposed approach has performance comparable to the unregularized formulation and outperforms the corresponding Voronoi-based coverage baseline.
Read the full abstract

Graphics

RealSimLoop: Online Real-to-Sim Adaptation via Differentiable Reduced-Order Simulation with Vision Feedback

Real-world observations of deformable objects are often sparse or surface-level, while downstream tasks require hidden physical quantities such as internal deformation, stress fields, and interaction forces. Physics-based simulation can recover these quantities, but online real-to-sim adaptation remains challenging due to costly full-space optimization, limited feedback, and time-varying material properties. To address these challenges, we propose RealSimLoop, a differentiable framework for online real-to-sim adaptation using vision data as physical feedback. Our approach achieves quasi-real-time performance by executing differentiable simulation within a reduced-order neural subspace, drastically accelerating the optimization loop. We couple this efficient dynamics model with differentiable rendering, enabling direct gradient backpropagation that leverages high-fidelity pixel data to refine physical parameters such as material stiffness. Furthermore, by employing a sliding-window objective function, RealSimLoop enables robust online adaptation, allowing the system to track time-varying material properties and effectively bridge the real-to-sim gap arising from model reduction or unmodeled dynamics. Extensive experiments demonstrate that our method outperforms conventional offline methods, and we validate the framework's versatility in downstream applications, including external force prediction and 3D stress field reconstruction with novel view synthesis.
Read the full abstract

All authors Zhihao Cen, Chuhua Xian, Hailin Sun, Yuliang Liufu, Zhen Zhang, Xiangyu Chu, Hongmin Cai, Yunbo Zhang, Guoxin Fang

Computer Vision

Layerwise Tunable Lifting Scheme for the Convolutional Neural Network

This work introduces a family of tunable lifting schemes for biorthogonal wavelet filter banks. We propose three lifting strategies: low-pass tuning (LS-LayLatt-LP), high-pass tuning (LS-LayLatt-HP), and a sequential lifting scheme that jointly adapts low- and high-frequency branches (LS-LayLatt-Sequential). All proposed designs are formulated using a lattice-based lifting structure, which guarantees invertibility and stability for arbitrary parameter values within the lifting functions. We evaluated the proposed methods by integrating them into a ResNet-18 backbone for image classification on the Describable Textures Dataset (DTD), as well as for anomaly detection on hazelnut images from the MVTec-AD dataset and private KRC102S dataset. Experimental results demonstrate consistent performance improvements across all evaluated tasks.
Read the full abstract

All authors Abdumannon Yovkochov, An Le, Sungbal Seo, You-Suk Bae, Truong Nguyen

Computer Vision

Freezing of Gait Prediction Under Spatial Occlusion: An IMU-Supervised Cross-Modal Distillation Approach

Parkinson's disease is a progressive neurodegenerative disorder characterised by gradual deterioration of movement control. Automated freezing-of-gait (FOG) detection supports the objective assessment of gait-related motor impairment. Two common approaches are used for FOG prediction: (i) analysing video recordings of the patient's movements and (ii) analysing data collected using inertial measurement unit (IMU) wearable sensors attached to the patient's lower limbs. Video-based approaches may suffer detection errors during continuous turning-in-place tasks because the lower limbs undergo substantial geometric self-occlusion, degrading pose-estimation accuracy. IMU-based approaches are generally less affected by visual occlusion; however, they are difficult to deploy outside clinical or laboratory settings, as the sensors must be attached securely and remain in place throughout the assessment. Motivated by this, we propose a cross-modal subspace distillation framework to mitigate the limitations of unimodal FOG detection by combining IMU accuracy with video-based practicality. We extract invariant latent topologies from a pre-trained kinematic oracle to structurally supervise a non-encoded visual architecture during training. To resolve periods of severe spatial occlusion, a dual-stream visual model probabilistically fuses skeletal graph nodes and continuous spatial pixels, dynamically shifting reliance to uninterrupted pixel boundaries as joint tracking confidence drops. Evaluated against a public, multi-modal sequence dataset of Parkinson's individuals executing continuous $360^\circ$ turns, empirical results demonstrate that applying sensory boundary topologies strictly mitigates tracking evaluation entropy. Our constrained optimisation confirms that highly precise FOG prediction bounds can be achieved over zero-wearable inference environments.
Read the full abstract

Optics

Stable vortex soliton arrays in disclination-fractal systems

Vortex light fields carry orbital angular momentum and have attracted significant attention because of their wide applications in light field manipulations, optical communications, and quantum information processing. In nonlinear media, the balance between diffraction and self-action enables the formation of vortex solitons. However, achieving the stability of vortex solitons remains challenging due to radial and azimuthal modulation instabilities. Here, we report stable vortex solitons and vortex-soliton arrays in disclination-fractal configurations with different rotational symmetries, constructed by applying disclination operations to fractal lattice structures. The stable vortex-soliton arrays—composed of several vortex solitons—can exist along domain walls, resulting from the disclination operation applied to the topologically trivial phase. Their stability is verified through both linear stability analysis and direct simulations of perturbed propagation. For comparison, vortex-soliton arrays in conventional disclination configurations are found to be completely unstable, demonstrating the significance of the fractal configuration in stabilizing these nonlinear states. These findings reveal a new nonlinear excitation mechanism arising from the interplay between fractal geometry and disclination defects, thereby providing theoretical underpinnings for both the improved understanding of multi-field excitation phenomena in complex geometric systems and opening new avenues for the design of photonic devices based on fractal disclination structures.
Read the full abstract

All authors Shuang Shen, Milivoj R. Belić, Ce Shang, Yongdong Li, Yiqi Zhang