Peer Revenue Publish or profit

Papers

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

All of arXiv

Monday 7 September

High Energy Physics (Theory)

Tachyon-massless couplings at order $\alpha'$ in bosonic string theory

Recently, it has been proposed that the classical effective action of bosonic string theory should contain only couplings with an even number of tachyon fields. We employ the T-duality procedure to derive such couplings at order \(\alpha'\) (four-derivative order) for the tachyon and massless fields. We first observe that, through higher-derivative field redefinitions of the tachyon potential term, one can choose a scheme in which, apart from the tachyon potential itself, all remaining couplings involve only covariant derivatives of the tachyon and the massless fields. We then construct a minimal basis of such couplings at four-derivative order, consisting of 14 independent terms. Imposing T-duality reduces this set to 6 nonzero couplings, expressed in terms of two unfixed parameters. One of these parameters is determined by matching to the known effective action in the zero-tachyon limit, while the other is fixed by comparison with the sphere-level S-matrix element of four tachyon vertex operators. This latter comparison also establishes that the coefficient of the \(T^4\) term in the tachyon potential is positive. Remarkably, the tachyon mass term and this quartic term are consistent with a potential of the form \((2/\alpha')(-1+\cos T)\), which implies that the closed string tachyon condenses to the minimum of the potential at \(T=\pi\), thereby generating an Anti-de Sitter spacetime with cosmological constant \(\Lambda =-4/\alpha'\).
Read the full abstract

Disordered Systems and Neural Networks

Finite-rank multiplicative perturbations of rotationally invariant non-Hermitian random matrices

We study finite-rank multiplicative deformations of rotationally invariant non-Hermitian random matrices. More precisely, we consider models of the form $\mathbf{A}(\mathbf{I}+\mathbf{T})$, where $\mathbf{A}$ is a large rotationally invariant non-Hermitian random matrix, $\mathbf{T}$ is a finite-rank normal perturbation, and $\mathbf{I}$ denotes the identity matrix. We characterize the emergence of outlier eigenvalues, their fluctuations, and the associated eigenvector overlaps. Our results provide a multiplicative non-Hermitian counterpart to the classical Baik–Ben Arous–Péché framework.
Read the full abstract

Materials Science

Angular compliance, not amplitude, governs the dielectric response of BaTiO3

Soft-mode theory specifies a frequency, not what a local polar unit does. What real-space motion underlies the dielectric response of BaTiO3 therefore remains unclear. Using electric-field-induced molecular dynamics with a machine-learning force field, we show that the permittivity tracks the field-induced angular redistribution of local Ti-O off-centering, not its magnitude. Temperature and biaxial strain modify the local structure through different microscopic routes, yet both dielectric responses collapse onto a common relation with the same orientational descriptor, providing a real-space counterpart to soft-mode behavior.
Read the full abstract

Nuclear Experiment

Evolution of Spectroscopic Factors in Neutron-deficient $p$-shell Nuclei in connection with Short-Range Correlations

We report an uncertainty-controlled determination of neutron-removal spectroscopic factors in the neutron-deficient $p$-shell nuclei $^{12}\mathrm{C}$, $^{10}\mathrm{C}$, $^{9}\mathrm{C}$, and $^{8}\mathrm{B}$, all measured under uniform conditions through exclusive ground-state-to-ground-state $(p,d)$ reactions at about 50 MeV/nucleon in a liquid hydrogen target at the GANIL/LISE facility. The deuterons were detected in the highly-segmented MUST2 detector placed at forward angles and the excitation energy was reconstructed by the missing mass method. Several transitions, including a new state in $^7\mathrm{B}$, were observed. Differential cross sections, which display an $L=1$ pattern for all nuclei, were fitted with 416 sets of uncertainty-quantified optical-model potential parameters and considering various single-particle bound-state wavefunctions to derive $C^2S$ values. The ratio between experimental and shell-model calculated values, $R_S$, is found to be slightly decreasing as a function of increasing proton to neutron separation energy asymmetry $\Delta S$, with a slope of $-0.0049(36)_{\rm stat}(13)_{\rm omp}(8)_{\rm s.p.}$. The observed trend is compatible with the phenomenological expectation that the short-range correlation effect on $C^2S$ increases with the degree of nucleon minority. The present data set delivers a high-precision benchmark that will tightly constrain future microscopic descriptions of short-range correlations in asymmetric nuclei.
Read the full abstract

All authors S. Koyama, D. Suzuki, O. Sorlin, C. Hebborn, M. Assié, L. Lalanne, T. Abe, D. Beaumel, Y. Blumenfeld, L. Caceres, F. De Oliveira Santos, F. Delaunay, F. Flavigny, S. Franchoo, J. Gibelin, V. Girard-Alcindor, J. Guillot, F. Hammache, O. Kamalou, A. Kamenyero, N. Kitamura, V. Lapoux, A. Lemasson, A. Matta, B. Mauss, P. Morfouace, M. Niikura, H. Otsu, J. Pancin, T. Roger, T. Y. Saito, H. Sakurai, C. Stodel, J-C. Thomas

Cryptography and Security

Enhancing Privacy, Neglecting Harms: An Analysis of Real-World Digital Privacy Incidents

Privacy-enhancing technologies (PETs) have emerged as a technical means for providing individuals with greater control over their information. Yet despite the growing deployment of PETs, people continue to experience privacy harms. In this work, we revisit our understanding of privacy incidents and the realities of those experiencing privacy harms, to assess whether the goals and abilities of PETs are misaligned with the harms people face. For our study, we collect news articles that correspond to a sample of 257 real-world privacy incidents. We employ content analysis over the articles to develop a new information flow model that encompasses the complexity of data flows and their relation to resulting harms. We demonstrate that our model captures both established and novel aspects of privacy incidents and their mitigations. In particular, it captures why consent is often insufficient to prevent privacy violations, how harms emerge from complex interactions among multiple entities and actions, and reveals a flaw in our understanding of PETs: a focus on enabling functionalities still permits the harms inherent in those functionalities. Moreover, we find that the entities best positioned to implement harm-preventing measures for the incidents in our sample are the least incentivized to do so. Overall, our model and analysis identify limitations of privacy technology research for harm prevention and further identifies paths for transforming how we approach the advancement of these technologies.
Read the full abstract

All authors Shannon Veitch, C. Shem, Lena Csomor, Oleksandr Dudiy, Naone Kim, Khoi Le, Lina Saha, Alexander Viand, Anwar Hithnawi, Bailey Kacsmar

Computer Vision

The Price of Consistency: Exploiting Visual Anchors for Multimodal Jailbreaking in Video Generation

The rapid evolution of video generation has shifted the paradigm from pure text-driven to multi-conditional controllable generation, with reference images now widely adopted as conditional inputs to achieve superior spatiotemporal consistency. While these reference images serve as powerful visual anchors that significantly enhance controllability, their impact on safety remains largely unexplored. In this work, we reveal the visual anchoring effect: by enforcing consistency, the mechanism prevents the generated content from drifting away from the original harmful intent, thereby eliminating the model's natural safety escape route from harmful to benign content. Consequently, visual anchors inherently increase the safety risk—this is the price of consistency. Building on this insight, we propose Decoupling Intent via Visual Anchors (DIVA), a training-free multimodal jailbreak framework for video generation that exploits this vulnerability. DIVA decouples harmful intent into a static visual anchor image and a dynamic motion text prompt, and employs dual-criteria selection to balance attack stealthiness with semantic preservation. Extensive experiments across various leading commercial platforms and mainstream open-source video generation models demonstrate that DIVA achieves a substantially higher Attack Success Rate than existing text-only methods. To facilitate future research, we additionally contribute TI2VSafetyBench, the first safety benchmark for multi-conditional video generation.
Read the full abstract

All authors Peng Li, Qianqian Xu, Yangbangyan Jiang, Zhipeng Yu, Qingming Huang

Chemical Physics

First-order Degenerate Symmetry-Adapted Perturbation Theory

Degenerate electronic states govern the photophysics of excimers and the molecular dynamics near conical intersections. In regions where potential energy surfaces are degenerate or nearly degenerate, intermolecular interactions mix the corresponding electronic configurations. We introduce a first-order degenerate formulation of symmetry-adapted perturbation theory (dSAPT) with weak symmetry forcing that quantifies the mixing in terms of electrostatic and exchange (Pauli repulsion) contributions. We compare two alternative ways of resolving the degeneracy, in which antisymmetry is enforced either after or before diagonalization of the first-order eigenproblem. Using CASSCF monomer wave functions, we apply dSAPT to two model spatially degenerate systems, H$_2$–F(${}^2P$) and H$_2$–NO(${}^2\Pi$), and show that exchange effects contribute significantly to configuration mixing already at intermediate intermolecular separations. For the H$_2$–NO(${}^2\Pi$) complex, we further demonstrate that second-order dispersion energy is essential for qualitatively reproducing the angular dependence of the diabatic mixing angle. Finally, using water and benzene excimers with monomers described either by CASSCF or CIS wave functions, we show that Pauli repulsion controls delocalization of the excitation at short intermolecular separations.
Read the full abstract

All authors Dominik Cieśliński, Tijs Karman, Anthony Scemama, Michał Hapka, Piotr S. Żuchowski

Signal Processing

On the Removal of Artifacts of Known-Shape from Noisy Signals

A general method for the estimation and removal of quasi-periodic, artifact-like disturbances from single channel measurements is presented. The method is based on a wavelet template and data-driven template extraction from single channel, noisy signals. The method is tested on an example application in modern neurology. The method is compared to an autoencoder, trained and deployed under idealized conditions, thus acting as reference system. It is found that the proposed method yields signal estimates with median root mean squared error improvement of 33% compared to the baseline, which is 4% more than the autoencoder, while relying on fewer assumptions and parameters, and without the need for any training data.
Read the full abstract

All authors Alessandro Schaer, Henrik Maurenbrecher, George Chatzipirpiridis, Hamdi Torun

Artificial Intelligence

Unraveling the Real Working Mechanism and Inherent Flaws of GAE: A Method for Interpreting Transformer Processes from an Economic Perspective

We observe a phenomenon that current algorithmic research in the field of explainable artificial intelligence primarily pursues better performance on several proxy metrics. On the one hand, these proxy metrics themselves are more or less flawed and cannot properly measure the quality of methods. On the other hand, metric-oriented research approaches often lead to the neglect of the rationality and interpretability of the methods themselves. Explainable artificial intelligence is abbreviated as XAI. The metric-driven research paradigm has resulted in a lack of interpretability of the relevant XAI methods themselves. Accordingly, there is a need for interpretability research on XAI methods, which can be playfully referred to as XXAI. This paper is one of our works on XXAI. This paper takes Generic Attention-model Explainability (GAE), a widely influential model interpretation method , or rather, XAI method that represents an important technical route, as the research object, and explores the real working mechanism and flaws of this method as well as the technical route it represents. Based on the conclusions of this study, it may be necessary to re-examine or verify GAE-related methods and their domain applications. We argue that GAE is an interpretation method that focuses on the attention process. After pointing out the working mechanism and flaws of GAE, we propose Cumulative Asset Holdings (CAH), a more reasonable Transformer interpretation method integrating both process-based and feature-based ideas from an economic zero-sum games perspective. In addition, it is worth noting that our method is applicable to models with special tokens, where existing methods may suffer from limitations. The model simplification research method and the analysis of additive operations adopted in this study may provide inspiration for other research works in XAI.
Read the full abstract

High Energy Physics (Experiment)

Leakage current evolution in LHCb VELO sensors during Run 1-2 LHC data taking period

Silicon detectors operating in the harsh mixed-hadron radiation environment of modern high-energy physics experiments suffer progressive bulk damage, manifesting macroscopically as a steady rise in leakage current.
Read the full abstract

All authors M. Pycior, T. Szumlak, A. Oblakowska-Mucha, K. Akiba, W. Barter, S. Borghi, T. Bowcock, E. Buchanan, J. Buytaert, S. de Capua, S. Chen, P. Collins, F. Dettori, L. Eklund, T. Evans, M. Gersabeck, T. Gershon, T. Hadavizadeh, K. Hennessy, W. Hulsbergen, D. Hutchcroft, M. John, P. Kopciewicz, P. Koppenburg, T. Latham, M. Majewski, C. Parkes, A. Poluektov, W. Qian, K. Rinnert, E. Rodrigues, M. Schiller, M. Smith, M. van Beuzekom, J. Velthuis, M. Williams

Robotics

Phase-and-First-Arrival VLM Feedback for Sparse-Reward Reinforcement Learning in Surgical Manipulation

Sparse outcome feedback limits what robots can learn from unsuccessful attempts at complex manipulation. Failed multi-stage surgical attempts can contain grasps, lifts, or transfers worth reusing. In sparse-reward reinforcement learning, terminal rewards collapse such attempts to the same outcome, while scalar vision-language model (VLM) ratings reveal neither what progress merits credit nor when it occurred. We introduce phase-and-first-arrival feedback: one VLM query per recorded episode identifies the furthest visually verified task phase and when that phase is first reached, allowing the learner to reuse partial behavior and localize credit. We instantiate it in SurgPhaseBench, a phase-structured suite spanning rigid and deformable tasks, and evaluate it in simulation and hardware. Across five simulated tasks, our method reaches 75.2% mean success, compared with 52.1% for a reward based on Contrastive Language-Image Pre-training (CLIP) using the same visual input; the advantage persists when only the feedback representation changes. On hardware, the same record supports autonomous block picking and slip recovery. Together, these results show that trajectory-level visual supervision can preserve partial progress while providing the temporal credit needed for sparse-reward control.
Read the full abstract

All authors Wanli Liuchen, Fangyuan Wang, Bin Li, Anqing Duan, Yunhui Liu, Peng Zhou, David Navarro-Alarcon

Quantum Physics

From NISQ to Fault-Tolerance: Applications and Algorithmic Benchmarks for Spin Qubits

Motivated by recent breakthroughs in the development of spin-based quantum processing units based on exchange-only (EO) spin qubits, we provide a roadmap for the implementation of quantum algorithms on the EO platform, ranging from the NISQ to the fault-tolerant era. To provide an algorithm-driven perspective on the scaling of quantum chips, we consider a range of applications targeting different stages of hardware maturity and formulate requirements for a successful realization. We show that the compilation method Parity Twine perfectly complements the hardware's capabilities to perform tasks such as the quantum Fourier transform or QAOA. Furthermore, we describe an error detection technique native to Parity Twine, which EO qubits can leverage in a unique and advantageous way to improve algorithm performance. Finally, since both near-term algorithmic benchmarks and a long-term perspective can be found in digital quantum simulation, we specifically discuss the fermionic fast Fourier transform and the simulation of Fermi-Hubbard models. The latter is explicitly discussed in the context of quantum error correction and a partially fault-tolerant realization. By providing detailed resource estimates and identifying scaling bottlenecks on each level, our work offers a quantitative perspective on EO-based quantum computing and will inform future hardware design choices.
Read the full abstract

Materials Science

Groove-shaped defects in as-grown (001)-oriented $\beta$-Ga$_2$O$_3$ epilayers prepared by halide vapor phase epitaxy

Groove-shaped defects (GSDs) degrade the surface flatness of as-grown (001)-oriented $\beta$-Ga$_2$O$_3$ epilayers and necessitate chemical mechanical polishing before device fabrication, increasing processing costs and the risk of damage. We investigated the morphology, subsurface structure, and formation mechanism of GSDs in a homoepitaxial layer grown by halide vapor phase epitaxy using synchrotron X-ray topography and electron microscopy. The GSDs extended several millimeters along [010] and consisted predominantly of (-102) basal facets bounded by steep (100) sidewalls. Their wafer-scale distribution showed a spatial correspondence with variations in wafer curvature, suggesting that local surface orientation influences GSD formation. Careful alignment of surface images with transmission X-ray topographs revealed no one-to-one correspondence between GSDs and substrate defects, providing no evidence that substrate dislocations serve as their nucleation sites. Instead, transmission electron microscopy revealed planar defects localized near the terminal boundaries where the faceted GSD sectors met the surrounding (001) growth region; no such defects were observed in specimens extracted from the middle of GSDs. These defects exhibited {\alpha}-fringe contrast characteristic of inclined translational planar defects, with the dominant segments assigned to the (1-21) plane. The observations suggest that variations in local surface orientation and step supply may promote three-dimensional faceted growth, producing persistent (-102)/(100) sectors. The localized planar defects are therefore interpreted as consequences of growth-sector coalescence rather than the origins of GSD nucleation. These findings provide insight into the roles of wafer curvature and surface step supply in GSD formation.
Read the full abstract

All authors Yongzhao Yao, Daiki Katsube, Hirotaka Yamaguchi, Yukari Ishikawa

Numerical Analysis

Analysis of the Ill-Conditioning of the Discrete Inverse Laplace transform in Monte Carlo Simulations of Quantum Many-Body Systems

Analytic continuation of imaginary-time quantum Monte Carlo data to real-frequency spectra requires the inversion of a severely ill-posed two-sided Laplace transform and arises naturally in quantum many-body calculations of dynamic properties. In this work, we distinguish the intrinsic ill-posedness of the continuous inverse two-sided Laplace problem from the conditioning of its finite-dimensional discretization. For equidistant sampling and reconstruction grids, we express the discrete problem via a diagonally scaled monomial Vandermonde matrix with exponentially distributed nodes. Imposing the physical detailed-balance symmetry transforms the discretization into a diagonally scaled Chebyshev-Vandermonde system. Exploiting these structures, we derive explicit lower and upper bounds on the condition numbers in terms of the physical and discretization parameters. For the unconstrained discretization, our bounds reveal super-exponential growth of the condition number with the reconstruction dimension, which cannot be removed by increasing the number of imaginary-time samples alone. Detailed-balance substantially improves the conditioning, especially in the practically relevant pre-asymptotic regime, although the asymptotic super-exponential dependence remains. In both cases, our bounds identify a low-dimensional regime in which the super-exponential contribution is suppressed and stable reconstruction remains feasible. These results provide a mathematical explanation for the effectiveness of low-dimensional spectral representations and detailed-balance in analytic continuation. While they do not remove the fundamental ill-posedness, they substantially mitigate the ill-conditioning of its finite-dimensional discretization, delay the onset of its catastrophic super-exponential growth and thereby enlarge the range of numerically accessible reconstructions.
Read the full abstract

All authors Phil-Alexander Hofmann, Thomas Chuna, Tobias Dornheim, Michael Hecht

Econometrics

Filtering without recursion and some of its uses in financial economics

We develop a filter for time series, defined at each time $t$ as the minimizer of a discounted convex combination of observed and expected losses. The filter can be estimated by simulation to an arbitrary level of accuracy in $O(1)$ flops at each time point $t$ and can be run for all values $t=1,...,T$ in parallel. These methods are applied to robustly compute a preaveraged price process from the more than 1.5 million trades made on a single financial asset in a single day where the noise's variance is infinite. It yields a flat "volatility signature" plot, down to the 1 second level, so the microstructure noise no longer biases the volatility estimate. This is not true when linear methods are employed.
Read the full abstract

Machine Learning

REFINE: Trajectory Representation Learning via Closed-Loop Transcription – Extended Version

Trajectory representation learning underpins a wide range of trajectory analytics tasks; however, most existing self-supervised approaches, whether discriminative or generative, adopt an open-loop paradigm, relying on fixed data augmentations or random masking without feedback, which limits their ability to generalize and scale. We propose REFINE, a simple yet effective Representation lEarning Framework vIa closed-loop traNscription rEfinement for trajectory data. Drawing upon feedback control theory, REFINE tightly couples road-network-aware generative reconstruction with feedback-driven contrastive learning, enabling the model to capture fine-grained local movement semantics and global spatio-temporal dependencies without manually designed augmentation views. We further provide a control-theoretic analysis that establishes convergence guarantees for the proposed closed-loop optimization. Extensive experiments on four real-world datasets demonstrate that REFINE consistently outperforms state-of-the-art methods across multiple downstream tasks while remaining computationally efficient and scalable. This paper is an extended version of REFINE: Trajectory Representation Learning via Closed-Loop Transcription, to appear in KDD 2026.
Read the full abstract

All authors Sean Bin Yang, Ying Sun, Jilin Hu, Zongyi Xu, Kristian Torp, Hua Lu, Bin Yang, Christian S. Jensen

Data Structures and Algorithms

Dasgupta's Hierarchical Clustering Objective: Geometry and the Price of the Cardinality Constraint

The cost of a hierarchical clustering can be represented by an ultrametric whose lowest-common-ancestor labels are cluster cardinalities. We relate this known representation to the shortest-path geometry of a similarity graph. For a connected support graph $G$, let $d_G$ be its unit-length shortest-path metric and let the edge weights enter only the objective. We prove that the shifted Dasgupta optimum is exactly the minimum edge-weighted cost of a cardinality-realizable ultrametric that dominates $d_G$. Connectedification lemmas put this problem and its freely labeled dominating-ultrametric relaxation on the same class of connected binary hierarchies, labeled respectively by cardinality and graph diameter. As a sharp baseline, we determine the exact worst-case price of cardinality realizability: on every $n$-vertex instance the ratio of the two optima is at most $(2n-1)/3$, with equality on the unweighted complete graph; the sharp factor for the standard unshifted objective is $2(n+1)/3$. Our principal structural result bounds this gap by a hereditary weighted fragmentation profile defined through connected balanced cuts. Uniform local control gives an $O(\log n)$ gap, polynomial decay gives a constant gap, and the logarithmic order is tight even for unweighted trees of maximum degree $3$. On locally regular bounded-degree trees, the hierarchy can be constructed in $O(n\log n)$ time. An energy decomposition and a geometric density bound provide supporting instance-sensitive estimates. Thus the cardinality label has an unavoidable linear worst case but admits substantially smaller bounds on natural sparse graph classes.
Read the full abstract

Artificial Intelligence

Agentic Algorithm Engineering: Improving Shared-Memory Exact Minimum Cuts

The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. Over the last years, we engineered a range of fast algorithms for this problem. Our fastest exact algorithm uses an inexact algorithm to obtain a better bound for the problem, reductions that depend on this bound, improved data structures and parallel contraction routines. It is available in the open-source package VieCut and, on real-world instances, outperformed the previously fastest solvers by a factor of up to 2.5 sequentially and up to 12.9 when run in parallel. We improve this algorithm using agentic algorithm engineering (AAE), a methodology that we introduce here, in which autonomous large language model agents run the algorithm engineering cycle on an existing code base: they form hypotheses about where running time is lost, implement them, benchmark the result on a fixed instance set and keep or discard the change. Even though we had already tuned our algorithm by hand extensively, the agent finds significant optimizations, in particular on the DIMACS core instances: factors of 1.28 (sequential) and 1.63 (32 threads) on real-world k-cores, and 6.26 and 127 on the DIMACS core instances.
Read the full abstract

All authors David A. Bader, Adil Chhabra, Ernestine Großmann, Monika Henzinger, Alexander Noe, Christian Schulz

Quantum Algebra

A dual theory of twisted Zhu's theory

The notion of admissible $g$-twisted $V$-comodules is investigated for a graded vertex operator coalgebra $V$ and a finite order automorphism $g\in \Aut V$. We prove that $\mathcal {M}$ is an admissible $g$-twisted $V$-comodule if and only if its graded dual $\mathcal {M}'$ is an admissible $g^{-1}$-twisted $V'$-module for vertex operator algebra $V'$. Then we establish a dual theory of twisted Zhu's theory, i.e., there is a coassociative coalgebra $C_g(V)$ for a graded vertex operator coalgebra $V$, any admissible $g$-twisted $V$-comodule gives a $C_g(V)$-comodule, and vice versa. We also prove that $V$ is $g$-corational, which means every admissible $g$-twisted $V$-comodule is completely reducible, if and only if its dual vertex operator algebra $V'$ is $g$-rational.
Read the full abstract

Optimization and Control

$\mathrm M$-Eigenpairs of Partially Symmetric Tensors: Exact Reformulation and Perturbation Bounds

In this paper, we consider the computation of $M$-eigenpairs of fourth order partially symmetric tensors arising from elasticity theory. First, a lifted fourth order tensor is constructed, and the original $M$-eigenvalue problem is reformulated as a parameterized generalized tensor eigenvalue problem under the $\mathbf B_{\alpha,\beta}$-normalization. Then, an exact correspondence between the two eigenvalue problems is established, which provides a procedure for computing all real $M$-eigenpairs through the proposed reformulation. Furthermore, perturbation bounds for the largest $M$-eigenvalue are derived, and the lifted reformulation is shown to preserve these bounds without introducing any additional relaxation. Finally, numerical experiments are reported to show the effectiveness of the proposed method.
Read the full abstract

Software Engineering

Recompilation Is Not Enough: Test-Guided Decompiled-C Repair

Decompiled C often becomes recompilable only after repair, but recompilation alone does not establish test-observed behavior. A recompiled command-line binary can still parse options incorrectly, print different bytes, or return a different exit status. We present a few-step workflow for repairing decompiled C using compiler feedback and related official tests. Compiler and linker diagnostics first guide build repair. Once the repaired C recompiles into a binary, smoke checks and related official tests expose behavioral discrepancies for semantic repair. In a preliminary static-enriched evaluation on 104 Coreutils 9.5 binaries with available decompiler exports and deterministic exact-output smoke comparisons, 91 binaries (87.5%) recompile and pass the test gate; 9 do not recompile within the repair budget, and 4 recompile but still fail the test gate. The result suggests that test-gate feedback can make LLM-assisted repair of decompiled C more auditable than compile-only recovery.
Read the full abstract

Sound

KABURI-TTS: Phoneme-Keyed Activity-conditioned Bi-channel Utterance Rendering for Interaction

Realizing full-duplex spoken dialogue requires large amounts of two-channel, one-speaker-per-channel conversational speech data. Although conversational text-to-speech (TTS) engines have been developed, they are not necessarily robust to two-party simultaneous phenomena such as backchannels, interruptions, and overlaps that occur while the interlocutor is speaking. In this work, aiming at conversational speech synthesis that reproduces human-like overlap, we propose KABURI-TTS. KABURI-TTS takes a per-speaker phoneme raster as input and renders the speech of the two speakers on separate channels, conditioned on the per-frame phonemes and the voice activity derived from them. Because the phoneme raster is supplied by a separate module, the proposed method enables controllable generation of one-speaker-per-channel, two-party spoken dialogue. A user evaluation shows that, compared with strong baselines, the proposed method attains higher naturalness at both the utterance and the interaction level. Furthermore, an analysis of voice activity confirms that the proposed method produces more overlap and more frequent turn-taking.
Read the full abstract

Machine Learning

Protocol effects on feature-based hardware-Trojan detection across Trust-Hub families

Trust-Hub reuses host circuits: several files differ mainly in the inserted Trojan. When gates from sibling variants enter both training and test folds, a detector can benefit from host logic it has already seen. We measure that effect instead of proposing another classifier. The corpus contains 49,124 gates from 16 netlists grouped into five host families. We left the parser, 36 gate features, class weighting, model settings, threshold, and family-level aggregation unchanged and altered one choice: the test boundary. The three settings draw test gates from the pooled corpus, withhold a complete netlist, or withhold every variant of one host. The choice matters. Random forest records F1/AP of 0.914/0.978 with pooled gates, 0.636/0.851 with one netlist held out, and 0.460/0.577 with a host family held out. XGBoost falls from 0.946/0.976 to 0.464/0.544 across the same comparison. Logistic regression loses AP, although its fixed-threshold F1 is not monotonic. Each family shows the same pooled-to-family direction. Feature removal, repeated model and simulator seeds, score normalization, parser-related exclusions, and a smaller sample change the size of the gap without reversing it. Aggregation also matters: a gate-weighted average is dominated by the larger ISCAS files, so the headline values give each host family one vote. Bootstrap and jackknife summaries keep the gap positive, but their folds reuse training families. We treat the five family rows as descriptive evidence rather than independent trials. Five host families are too few for a population claim, and the experiment says nothing about transfer to a new cell library or an industrial design. It supports a narrower conclusion: sibling benchmark variants can inflate apparent transfer. Benchmarks with several variants of one host circuit should report family-aware holdouts and all five family results beside pooled scores.
Read the full abstract

All authors Hang Xiao, Chuhong Xu, Kainan Zhou, Gangzhen Qian, Lu Yi

Quantum Physics

Remote Flux Refocuses Nonadiabatic Excursions in Compact-State Quantum Transfer

Compact states embedded in a propagating band can carry quantum information, but finite-time transfer can populate modes outside their subspace. We show that a remote flux can refocus this amplitude without changing the transfer states or the motion-induced coupling out of their subspace. In a resonator ring, this separation is exact because both endpoints of the flux-bearing bond are nodes of every compact transfer state. For the same pulse, zero and refocusing flux both produce substantial excursions, but only the latter yields near-complete logical transfer. Interference between matrix amplitudes associated with different windings suppresses the endpoint error. Under matched control bounds, numerical optimization yields higher worst-input fidelity at the refocusing flux, providing a route to accurate transfer through coherent return.
Read the full abstract

Numerical Analysis

On Prior-to-Posterior Stability in the Wasserstein Metric for Bayesian Inverse Problems

Priors in Bayesian inverse problems are often approximated through discretization, hyperparameter estimation, or generative modeling. Understanding how prior approximation errors propagate to the posterior and subsequent predictions is therefore important. In this work, we study the stability of the prior-to-posterior map where both prior and posterior perturbations are measured in the same Wasserstein metric $W_p$, $p\geq1$. We identify verifiable conditions on likelihood regularity and admissible prior classes that ensure uniform, Hölder, and Lipschitz stability. For bounded likelihoods that are uniformly continuous on bounded sets, uniform stability holds over prior classes with uniformly integrable $p$-th moments and a common positive evidence lower bound. With global Hölder regularity of the likelihood and uniform bounds on higher prior moments, a coupling argument leads to a Hölder estimate with a sharp exponent. For $p>1$, a Lipschitz likelihood need not give Lipschitz stability, even for priors with bounded support. We establish Lipschitz stability through an interpolation argument under uniform Poincaré bounds and a globally Lipschitz potential with uniformly bounded essential oscillation under the priors. For Gaussian priors with additive Gaussian noise and bounded Lipschitz forward models, these estimates give posterior $W_2$ bounds even for mutually singular prior perturbations. Numerical experiments for a Darcy inverse problem illustrate the predicted Hölder and Lipschitz rates and the resulting control of errors in the posterior mean and standard deviation of a Lipschitz quantity of interest.
Read the full abstract

Combinatorics

A Resolution of the de Bruijn–Erdős Consecutive-Gap Problem

Let $(x_n)_{n\geq1}$ be a sequence of distinct points on the unit circle. An $r$-span is the total length of $r$ consecutive gaps determined by the inserted points. Write $M_n^{(r)}$ and $m_n^{(r)}$ for the largest and smallest $r$-spans after the first $n$ insertions. We prove that there is an absolute constant $c>0$ such that, for every sufficiently large $r$, \[ \limsup_{n\to\infty}\bigl(nM_n^{(r)}-r\bigr) \geq c\sqrt{\log r}, \qquad \limsup_{n\to\infty}\bigl(r-nm_n^{(r)}\bigr) \geq c\sqrt{\log r}, \] and \[ \limsup_{n\to\infty}\frac{M_n^{(r)}}{m_n^{(r)}} \geq 1+\frac{\log r}{100r}. \] Thus all three asymptotic conjectures made by de Bruijn and Erdős in 1949 are resolved. The ratio bound matches the upper bound of Clément and Steinerberger up to an absolute constant and answers a question of Brethouwer. The proofs compare interval counts at nearby times. Pointwise control leads to a one-dimensional sequence-discrepancy argument for the ratio, while averaged control and Halász's planar $L^1$ discrepancy theorem give the two one-sided conclusions.
Read the full abstract

Quantum Gases

Precision tests of nonlinear and stochastic modifications of quantum mechanics with a 1D quantum gas

We propose a cold-atom platform for precision tests of nonlinear and stochastic modifications to the Schrödinger equation, utilizing strongly correlated ultracold $^{133}$Cs in a uniform array of one-dimensional tubes formed by a two-dimensional optical lattice. Objective collapse models can be tested using the metastable super-Tonks-Girardeau gas. Based on a calibration test performed on our existing experimental setup, we project a sensitivity to the Continuous Spontaneous Localization collapse rate of $\lambda_c \simeq 1.8\times10^{-11}\,\mathrm{s^{-1}}$ at a correlation length of $r_c = 10^{-7}\,$m. This would establish a new bound an order of magnitude below the strongest existing constraint that remains robust against a cutoff in the collapse noise spectrum. Additionally, we can test deterministic nonlinear modifications by probing the symmetry-protected breathing mode frequency of the Tonks-Girardeau gas in harmonic traps. Crucial to both measurement schemes is the capability to independently tune the atom number and the linear density. By exploiting the different scaling laws associated with these parameters, we can cleanly distinguish genuine new physics signals from technical systematics.
Read the full abstract

All authors Yi Zeng, Angelo Bassi, Grigori E. Astrakharchik, Yanliang Guo, Manuele Landini, Hanns-Christoph Nägerl

Artificial Intelligence

EmoMed: An Emotionally-Aware Agent for Multimodal Medical Support with Real-Time Information Retrieval

We present EmoMed - a multimodal medical consultation agent that adapts its responses based on users' emotional states while maintaining clinical accuracy. The system processes text and medical images, detects affect indicators (anxiety, confusion, urgency) from user input, and adjusts response tone, structure, and detail level accordingly. To ensure factual reliability, the agent grounds clinical information through a dual retrieval mechanism: web-based fact-checking and an API-connected, continuously updated medical knowledge base. We evaluate our approach across seven state-of-the-art language models (GPT-4/5, Qwen3, Llama 4, Gemini 2.5, Grok4, Claude3) using comprehensive metrics including LLM-as-judge assessments, MedQA style accuracy tests, BERT Score, safety/helpfulness ratings, and multimodal medical benchmarks. The results demonstrate that emotionally adaptive responses consistently outperform neutral baseline across evaluation dimensions, without compromising clinical accuracy. A controlled user study validated these findings, with participants reporting improved perceived empathy and communication clarity, while maintaining trust in factual accuracy. Source code: https://github.com/NasonovIvan/EmoMed-Agent
Read the full abstract

All authors Ivan Nasonov, Nikita Glazkov, Ivan Makovetskiy, Mikhail Mozikov, Daniil Sukhorukov, Andrey Savchenko, Ilya Makarov

Data Structures and Algorithms

Maximum Matching-Match: Hardness and Approximation

In this paper, we study MaxMMP, an optimization variant of the Matching-Match Puzzle introduced by Iburi and Uehara (FUN 2024). Given a graph, a partial vertex coloring, and a multiset of colored sticks, the goal is to complete the coloring and assign the sticks to graph edges so as to maximize the number of satisfied edges. We first prove that MaxMMP is APX-hard by an reduction from Max-Cut. The hardness already holds with two colors, no precolored vertices, and only bichromatic sticks. We then give a simple deterministic $\frac{2}{c(c+1)}$-approximation for completely uncolored instances, improving to $\frac{2}{c(c-1)}$ when all sticks are bichromatic. Next, we obtain a randomized $\frac{1-\frac{1}{e}}{2c}$-approximation for arbitrary instances with $c$ colors by reducing the remaining coloring choices to monotone submodular maximization under a partition matroid. On bipartite graphs, the approximation ratio improves to $\frac{1-\frac{1}{e}}{c}$. For every fixed $c$, we further obtain deterministic $\frac{1}{2c}$ and $\frac{1}{c}$-approximations on general and bipartite graphs, respectively, in time $n^{O(c^2)}$. Finally, for every fixed number of colors, we show that MaxMMP can be solved exactly in time $n^{O(c^2)}$ on trees and on cographs.
Read the full abstract

Machine Learning

FedRAW: Preserving Rare-Label Influence in Asynchronous Federated Learning

Asynchronous federated learning improves scalability by updating the global model from a server-side buffer of client updates as they arrive, rather than waiting for all selected clients to finish. While efficient, this arrival-driven aggregation can silently distort representation learning under heterogeneous participation. We identify silent rarity failure, a hidden failure mode in which clients holding rare labels contribute too weakly to the global model even though its overall accuracy appears largely unaffected. This failure arises from two coupled effects: rare-label clients may submit updates less frequently when they are slower or less available, creating participation bias; and once their updates enter the buffer, standard asynchronous aggregation assigns them no compensating influence, creating aggregation bias. We propose FedRAW, a fully server-side aggregation method that preserves rare-label influence without changing local training, client objectives, or communication protocols. FedRAW combines client-level update deduplication, which prevents frequently arriving clients from repeatedly dominating the update buffer, with rare-label-aware weighting, which increases the influence of clients carrying low-coverage labels. We formalize silent rarity failure through participation and aggregation bias, and show that FedRAW increases rare-label client influence over uniform aggregation while preserving convergence. Across EMNIST Balanced, CIFAR-10, HAM10000, and ISIC-2019, FedRAW improves rarelabel accuracy while preserving comparable global accuracy and adding negligible server-side computation.
Read the full abstract

All authors Prashant Bajpai, Divya Saxena, Philippe Lalanda, German Vega