Quantum Gases
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 10 September
We investigate condensation and finite-temperature magnetic phase transitions in a coherently (Rabi) coupled Bose gas confined in a three-dimensional harmonic trap. For the noninteracting system, we derive analytical expressions for the critical temperature and condensate fraction using a semiclassical description of the single-particle spectrum and density of states. At fixed particle number, coherent coupling enhances the critical temperature relative to the uncoupled system, and this enhancement decreases with increasing particle number $N$. The finite-size correction, in contrast, lowers the transition temperature, with its effect diminishing for larger $N$. We then incorporate repulsive interactions within the Hartree–Fock–Bogoliubov–Popov framework to investigate the finite-temperature phase diagram in the temperature–Rabi coupling plane. The system undergoes successive transitions from a ferromagnetic to a paramagnetic condensate and, at higher temperature, to a thermal gas. The transition boundaries obtained from the vanishing of the condensate fraction show excellent agreement with the analytical Hartree-Fock predictions. We find that the interactions substantially suppress the variation in the condensation temperature with an increase in the coherent coupling.
Numerical Analysis
Tolerance-driven close evaluation of the Stokes double layer potential on axisymmetric surfaces
We consider boundary integral methods for Stokes mobility and resistance problems involving smooth axisymmetric particles. A primary numerical challenge is the accurate and efficient evaluation of layer potentials at off-surface points close to particle surfaces. We present a tolerance-driven workflow for evaluating the Stokes double layer potential at such evaluation points (targets) to prescribed accuracy while avoiding unnecessary computational cost. For each target–particle interaction, a fast classifier selects the least costly option estimated to meet the tolerance among standard, upsampled, and special quadrature. Geometry-dependent unit-density error indicators are precomputed and tabulated in reduced cylindrical coordinates, then combined on the fly with a local layer-density modifier, making its cost negligible relative to evaluating the potential. Targets requiring special quadrature are treated using a stabilized version of singularity swap surface quadrature: the periodic azimuthal integral is evaluated first using translated singularity swap quadrature to prevent severe cancellation near the surface, followed by adaptive Gauss–Legendre quadrature in the polar direction guided by error indicators. We integrate this workflow into a boundary integral solver with precomputed quadrature by expansion for on-surface self-interactions and demonstrate the workflow's performance for challenging configurations of spheroidal particles. Numerical results show that target classification is highly accurate. The prescribed tolerance is met for nearly all target–particle interactions and the error remains within a modest factor of the tolerance in the few remaining cases. Although the experiments focus on the Stokes double layer potential for spheroids, the off-surface framework applies to general smooth axisymmetric surfaces and can be easily adapted to other Stokes layer potentials.
Read the full abstract
Cryptography and Security
Differentially Private EEG Feature Anonymization: A Privacy-Utility Case Study in Clinical Neurophysiology
Clinical electroencephalography (EEG) data are valuable for healthcare research and for developing artificial intelligence (AI)-based clinical decision-support systems, but EEG recordings and derived features may contain sensitive patient-specific information. This creates privacy risks when data are reused, analyzed, or shared across clinical and research environments. Conventional anonymization methods are often insufficient for high-dimensional biomedical signals, since removing direct identifiers does not necessarily prevent re-identification, linkage, or inference risks. At the same time, strong privacy protection may distort clinically relevant signal characteristics and reduce data utility. This paper studies subject-level differential privacy for protecting clinical EEG-derived feature representations using Gaussian and Laplace perturbations. The proposed framework considers three deployment scenarios: client-side anonymization, centralized server-side anonymization, and decentralized local training. Following EEG preprocessing and feature extraction, Gaussian and Laplace perturbations are applied to the resulting patient-level EEG feature representations. The Laplace experiments evaluate the implemented noise scales, while the scales required for formal full-vector calibration are derived separately. The effects of both perturbations are assessed using statistical utility measures and a downstream machine-learning-based utility check. The results show that differentially private perturbation can be integrated into EEG processing workflows, but the selected mechanism, privacy parameters, and sensitivity calibration strongly influence data utility. The study highlights the practical privacy-utility trade-off in DP-based EEG feature anonymization and the challenges of preserving downstream utility in small and imbalanced clinical EEG datasets.
Read the full abstract
Fluid Dynamics
A Conservative Hybrid Eulerian-Lagrangian Method with Persistent Structure Tracking for Multiscale Cavitation
Hybrid Eulerian Lagrangian methods for multiscale cavitation represent grid resolved vapor structures in an Eulerian formulation and unresolved bubbles in a Lagrangian description, requiring transitions between the two representations as structures evolve. Existing approaches typically treat these transitions as local geometric operations, while resolved structures are identified independently at each time step, limiting the use of temporal history in representation changes. This work presents a conservative hybrid Eulerian Lagrangian framework with embedded, on the fly persistent structure tracking. Resolved vapor structures are detected using connected component labeling and reconciled across processor boundaries through a deterministic parallel procedure. Successive observations are associated using physics informed predictions of structure position and size, maintaining persistent identities and histories through birth, death, breakup, coalescence, and representation transitions. The retained history enables history aware Eulerian to Lagrangian transition criteria and initialization of Lagrangian bubbles with the radius and radius rate information required by the bubble dynamics model. Conservative bidirectional transfer operators preserve vapor mass and linear momentum while preventing simultaneous representation of the same vapor volume. Canonical tests verify persistent tracking through fragmentation, coalescence, and close crossings, repeated representation switching, conservation of mass and momentum, and deterministic parallel behavior.
Read the full abstract
Robotics
Rapid Learning of Dexterous In-Hand Pen Writing through Real-Time Jacobian Estimation
Dexterous in-hand manipulation of a grasped object with an anthropomorphic hand is an unsolved frontier for robot dexterity. The contact-richness and highly dynamic nature of object-hand interactions tend to require extensive modeling or data-collection efforts for learning-based approaches. Modern simulators used for reinforcement learning (RL) cannot fully replicate the required contact complexity, while collecting dexterous demonstrations for imitation learning (IL) remains an open problem. In this research, we present an embodied control approach based on real-time task Jacobian estimation of the combined hand and object system on the physical robot. Using only the CPU on a laptop, the proposed controller begins in-hand pen writing after approximately 18 s of initialization and continues to adapt online, without an analytic hand–object kinematic/contact model, simulation training, or precollected task demonstrations. We demonstrate that the same estimator/controller formulation works on three anthropomorphic robotic hand systems (one physical, two simulated) to show human-like, in-hand articulation of a grasped pen by an embodiment-independent formulation. Sub-millimeter in-plane precision (mean 0.6 mm across runs) is achieved across letters and shapes written in the air and on paper on a physical robot. To our knowledge, this is the first demonstration of an anthropomorphic hand writing arbitrary single-stroke trajectories with a grasped pen through purely in-hand motion, and it showcases an alternative to compute- and data-heavy approaches such as RL and IL for achieving dexterous manipulation through computationally simple and data-efficient algorithms.
Read the full abstract
Combinatorics
Circular Rearrangement Inequality and Optimal Cyclic Birth and Death Chains
We prove a generalized circular rearrangement inequality: among all circular arrangements of a finite collection of positive numbers, the greedy arrangement simultaneously maximizes the sums of products of $k$ consecutive entries for every $k$. This resolves a 2023 conjecture of Holmes-Holroyd-Ramírez and extends the classical circular rearrangement inequality for products of adjacent entries. As an application, we show that the greedy ordering minimizes the speed of a cyclic birth-and-death chain, resolving another conjecture of the same authors.
Read the full abstract
Analysis of PDEs
Positive radial ground states for nonlinear biharmonic equations: maximum principles and expanding-domain approximation
We prove the existence of nonnegative radial ground states for a class of nonlinear biharmonic equations in $\mathbb R^N$, covering subcritical and critical nonlinearities. The solutions are obtained as limits of clamped ground states on expanding balls. The Cassani-Tarsia homogeneous maximum principle in [D. Cassani. A. Tarsia, Adv. Nonlinear Anal. 11 (2022)] makes the approximating states positive. A variational decomposition on the radial Nehari manifold then excludes every zero sphere of positive radius, so the limiting ground state is positive on $\mathbb R^N\setminus\{0\}$. When the fourth order operator factorises into two second-order operators with positive resolvents, the conclusion upgrades to $u>0$ throughout $\mathbb R^N$, including at the origin. We also give an explicit counterexample showing that the tempting extension of the homogeneous maximum principle to super-solutions with arbitrary nonhomogeneous boundary data is false, even with an arbitrarily large positive zeroth-order coefficient.
Read the full abstract
Audio and Speech Processing
Whisper-Based Speech Transcription from Videos Across Multiple Languages for Cross-Cultural Understanding
Cross-cultural understanding has become increasingly important in today's highly connected, cross-national world. The success of LLM-based technologies is now driving the development of automated tools to aid understanding for nonnative people trying to succeed in cross-cultural environments. Building such automated tools is often done by leveraging in-thewild text, audio, and video data. This paper presents techniques for improving speech recognition-based transcript creation in multiple languages from videos to better train these automated tools. The focus is on processes and speech tools that can easily be used by cross-cultural tool builders without requiring deep speech processing expertise. Using publicly available videos from YouTube and Whisper-based tools, average transcription error rate across seven languages (Spanish, Japanese, Korean, Mandarin, Turkish, Russian, and Hebrew) of 30% are observed. With a modest amount of fine-tuning data, the average error rate can be reduced to 20% making such output much more usable for downstream processing. Speech and metadata associated with these videos that can be used by the community to further refine these experiments are released as well.
Read the full abstract
Quantum Physics
Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata
A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver–environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.
Read the full abstract
Computation and Language
The widening evaluation gap in medical large language model research 2023 to 2026
Large language models are superseded every few quarters; clinical evidence takes years. We asked whether medical research is keeping pace with the systems it evaluates. PubMed returned 11,628 records for January 2023 to June 2026 across fourteen clinical domains, growing 45-fold; 2.5% used a randomised, controlled or prospective design. Evaluation lag, from a study's newest named model release to its own publication, widened from 1.33 to 6.08 quarters. Because discontinued models age mechanically, we benchmarked this against a counterfactual holding model composition fixed: migration to newer systems offset only 56% of the drift (95% CI 50-65). Randomised trials evaluated models a median 4.6 quarters older than other designs (P = 3 x 10^-19), yet among studies naming a model still under development no design differed from any other; 62% of randomised trials evaluated a discontinued family. Rigour and currency are in tension, and that tension reflects model selection rather than research timelines.
Read the full abstract
Computation and Language
Recognizing Is Not Reversing: A Controlled Inversion Test of Fact-Preserving News Framing
Large language models (LLMs) are increasingly used to analyze and rewrite news, yet current framing studies mainly evaluate generation, detection, or whether rewritten text appears more neutral. They do not directly show whether a model can undo a known framing transformation while keeping the facts fixed. We introduce a controlled inversion test over three established textual realizations of framing: evaluative lexis, agency realization, and information salience. Across 60 news articles and three intervention strengths, this yields 540 paired variants with preserved atomic facts and recorded edits. Across Qwen, DeepSeek, and Kimi, factual preservation remains near 0.84, whereas intervention reversal is 0.044–0.068. Even when both framing type and direction are recognized correctly, pooled reversal reaches 0.071. These results reveal a clear separation between factual fidelity, framing recognition, and framing inversion: recognizing how an article is framed does not imply that the framing can be undone.
Read the full abstract
Artificial Intelligence
A Unified Per-Token Gating Family for On-Policy Distillation: FKL/RKL Mixing with Multi-Channel and Bias Coefficients
Per-token gating of forward/reverse KL losses has become a standard technique for on-policy knowledge distillation (OPD), but existing methods such as EOPD (Jin et al., 2026) and ToDi (Jung et al., 2025) each fix a single gating signal and a single gating direction, and the two have never been compared directly. We introduce a four-coefficient parameterization lambda_t = sigma(a * h_t + b * u(x) + c + d * gap_t) in which direction-aligned proxies of EOPD and ToDi appear as one-dimensional (1D) restrictions, and which adds multi-channel composition and an explicit bias as further degrees of freedom. On TweetEval (Barbieri et al., 2020) emotion and hate, with a Qwen3-32B teacher and a Qwen3-4B student, configurations in the full family reach higher accuracy than the matched-magnitude single-channel (entropy-only / gap-only) 1D restrictions in 33 of 36 comparable cells, and a 26-cell mean-match isolation experiment places dynamic gating ahead of effective-KL-matched static baselines in 19 of 26 cells. Because cells share training data, models, and parameter substructure, we report both counts as exploratory aggregate directional evidence rather than as independent hypothesis tests. Targeted three-seed paired replications of the nine headline comparisons singled out by that sweep – including a third task, offensive – are directionally consistent, but individually smaller than the single-seed estimates and not significant at n=3. We therefore present the parameterization primarily as a shared coordinate system for comparing per-token gating designs in short-output classification OPD.
Read the full abstract
High Energy Physics (Phenomenology)
Massless-Massive Amplitude Correspondence III: Massive Amplitude Bases in the SMEFT
We develop a systematic correspondence between massless contact amplitudes in an unbroken theory and massive contact amplitudes after spontaneous symmetry breaking. Our construction employs the spin-transversality (ST) massive amplitude basis, with the systematic high energy expansion through minimal-helicity-chirality (MHC) amplitudes. The resulting $U(2)=SU(2)\times U(1)_t$ description of a massive particle makes the semi-standard Young-tableau construction of massless Lorentz structures directly applicable to massive amplitudes. When the leading-order MHC component has a massless contact limit, it is one-to-one matched directly to its UV amplitude. Otherwise, five exceptional classes of ST amplitudes are identified, their first non-zero descendant components are matched through conserved current couplings to the massless contact amplitude. We apply the framework to the one-flavor electroweak sector of the Standard Model Effective Field Theory (SMEFT) through dimension eight, obtaining explicit relations between unbroken-phase Wilson coefficients and broken-phase ST amplitude coefficients for amplitudes with three to eight external particles.
Read the full abstract
Robotics
Visual-SLAM for the detection of hidden tomatoes in greenhouses by Hierarchical Localization and GLOMAP for robotized harvesting
Advanced crop monitoring inside greenhouses is becoming one of the primary objectives of research centers. High-performance sensors, such as LiDAR or stereo cameras, have traditionally been employed for this purpose, though these often have a high cost. This work proposes a Visual-SLAM system using a monocular camera, which is significantly more cost-effective and specifically tailored for agricultural applications, such as mapping tomato crops in a greenhouse. Tests were carried out on a real tomato bunch, located in the Agroconnect experimental greenhouse. A ROS 2 Humble node was developed to run on the robot in order to capture images of these crops, which were then stored for offline processing. To generate a 3D mapped model for the crop in the greenhouse, the GLOMAP mapper, based on Structure-From-Motion, was integrated with the Hierarchical Localization toolbox. This initial mapping is a foundation for future, more advanced algorithms to analyze growth patterns, and optimize agricultural management. The system leverages a hierarchical localization paradigm based on a coarse-to-fine strategy: it first performs global retrieval to generate location hypotheses, then combines local features within the identified candidate regions. The results show a correct identification of the tomato cluster, correctly characterising the tomato that is occluded and inaccessible by classical vision technologies. The reconstructed 3D model was further validated against manual ground-truth measurements of fruit size, centroid position, and orientation, confirming the geometric accuracy of the proposed low-cost monocular pipeline.
Read the full abstract
Numerical Analysis
Some theoretical and practical results on noisy signals recovery
We discuss some theoretical results and their applications to specific practical problems from wireless communications. We assume that we know the noisy version of the signal, which is sparse with respect to a given system of elements (dictionary), at a finite number of points and we want to approximately recover it. This problem of recovery of a noisy signal is closely related to the problem of establishing the Lebesgue-type inequalities for the corresponding algorithms and it motivates us to prove such inequalities. Under certain conditions on a dictionary (RIP-type condition, coherence condition) we obtain different kinds of the Lebesgue-type inequalities for the OMP and its version WOMP algorithms. The most important feature of our new theoretical result is the assumption that the dictionary has the RIP-type property instead of the assumption that it is the Riesz basis, which was used in the previous results. Our approach allows us to treat redundant (overcomplete) systems, which is important in applications. We consider the setting of sparse recovery for highly-coherent dictionaries that appear in OFDM setting for wireless communication. Our main example is the oversampled Fourier dictionary and the recovery of the frequency response of a sparse channel. We develop a general approach to such problems and we prove that under certain conditions the OMP algorithm recovers all dictionary elements with large coefficients, and estimate its accuracy (in NMSE metric) in terms of signal-to-noise ratio.
Read the full abstract
High Energy Astrophysical Phenomena
Relativistic hydrodynamics of a charged fluid from Myers-Pospelov Lorentz-Violating Electrodynamics
We derive the equations of relativistic hydrodynamics for a charged fluid from Lorentz-violating Myers–Pospelov electrodynamics. Starting from the modified fermionic and electromagnetic equations of motion, we employ the covariant Wigner formalism to establish the semiclassical spectral constraints and distribution function, which, combined with Noether's theorem, yield the energy-momentum tensor, particle current, and corresponding conservation laws in the presence of Lorentz violation. The resulting hydrodynamic description contains Lorentz-violating corrections to the thermodynamic quantities and to the fluid currents. In the purely timelike sector, these corrections can be absorbed into effective thermodynamic quantities, preserving the isotropic structure of the fluid equations. In contrast, spacelike backgrounds introduce explicit contributions along the preferred direction, which cannot be absorbed into the standard hydrodynamic variables and give rise to anisotropic forces and torques. These effects lead to departures from standard relativistic charged-fluid hydrodynamics and provide a direct macroscopic manifestation of the Lorentz-violating background. Our results establish a first-principles framework for investigating the macroscopic consequences of Lorentz violation in relativistic charged fluids and provide a starting point for the development of a consistent Lorentz-violating relativistic magnetohydrodynamic theory.
Read the full abstract
Audio and Speech Processing
Not All Attacks Are Learned Equally in Speech Deepfake Detection
Speech deepfake detection (SDD) models are trained on multi-attack datasets containing diverse spoofing systems, such as text-to-speech (TTS) and voice conversion (VC). In standard classifier training on multi-attack datasets, all attacks are treated as one spoofed class, and performance is reported using overall Equal Error Rate (EER). This aggregate view obscures how individual attacks shape learning and generalization. To better understand this attack-level behavior, we first balance TTS and VC exposure using sample and attack omission. We then measure attack-wise EER at inference and analyze attack-wise training loss and predictive entropy to characterize optimization. Results show that attacks contribute unequally: some attacks have high EER sensitivity and concentrated entropy with low loss, indicating strong influence on the decision boundary. We define these as high-impact attacks. To reduce uneven generalization across attacks, we propose a replay-regularized, attack-aware curriculum that steps exposure based on measured attack influence. Experiments on ASVspoof 2019, 2021, ASVspoof 5, and Fake-or-Real show improved overall robustness and reduced attack-level imbalance compared with standard multi-attack training.
Read the full abstract
Computation and Language
Component-Aware Differential Privacy for Federated Multilingual Speech-LLMs
Per-layer differential privacy (DP) clipping improves gradient fidelity in federated learning by allocating per-matrix clipping budgets proportional to parameter count. We show that this recipe breaks for speech large language models (speech-LLMs), when the acoustic encoder and the language decoder differ by an order of magnitude in update norm. Single-pool per-layer methods suffer cross-component budget collapse, dragging word error rate (WER) far from flat global clipping or collapsing training entirely. When the norm imbalance is milder, adaptive single-pool methods partially recover, confirming that collapse severity scales with the inter-component norm ratio. We empirically diagnose the root cause across six per-layer methods and three speech-LLM architectures. We then propose \emph{$\alpha$-split}, a two-pool allocation that normalises encoder and LLM parameters into independent pools, and show that joint $\ell_2$ sensitivity and the original $(\varepsilon,\delta)$-DP guarantee are unchanged. At architecture-calibrated $\alpha$, our method recovers WER utility compared to flat DP, while granting the encoder $4.47{\times}$ tighter per-component noise protection against speaker voice-based gradient-inversion attacks at only $+2.6\%$ LLM noise overhead.
Read the full abstract
Probability
Fourier decay of Gaussian multiplicative chaos and boundary geometry
In this paper, we develop a new approach to studying the Fourier transform of Gaussian multiplicative chaos. We determine the Fourier dimension of these random measures on tori for every smooth log-correlated covariance and in every dimension, and prove sharp bounds and exact formulas for chaos on natural classes of bounded sets and hypersurfaces in Euclidean space. These results highlight how boundary geometry and multifractal concentration jointly govern Fourier decay, including regimes in which the boundary strictly reduces the Fourier dimension. In the circle setting, this gives a substantially simpler new proof of a conjecture of Garban and Vargas.
Read the full abstract
Differential Geometry
Local classification of chsc Kähler metrics with cone singularities
Let $B\subset\mathbb{C}^n$ be a ball centred at the origin and $D=\{z^1=0\}$. Let $g$ be a Kähler metric of constant holomorphic sectional curvature (chsc) on $B\setminus D$, uniformly equivalent to the model cone metric of angle $2\pi\beta$, with $0<\beta<1$, and polyhomogeneous along $D$. We prove that, in suitable holomorphic coordinates $(w^1, \ldots, w^n)$ centred at the origin, the metric $g$ is the pullback of the corresponding complex space form by the map $(w^1,w^2,\dots,w^n)\longmapsto \bigl((w^1)^\beta,w^2,\dots,w^n\bigr)$.
Read the full abstract
Category Theory
A model structure for cartesian 2-fibrations
Cartesian 2-fibrations provide a way to understand indexed categories, but their classical “straightening” construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.
Read the full abstract
Computation and Language
RAG-Safety-Bench: Reliable Evaluation of Retrieval-Augmented LLM Safety
Allowing large language models (LLMs) to retrieve information from a set of trusted documents can increase reliability and reduce hallucination. However, recent work has demonstrated that retrieval-augmented generation (RAG) can have unintended side effects on the overall safety of the generated responses, when prompted for harmful or dangerous content. A clearer understanding of the mechanisms leading to this result is needed, as increasing numbers of end users turn to RAG to incorporate corporate documents and knowledge bases into LLM-based systems. We introduce RAG-Safety-Bench, a benchmark to measure the safety impact of RAG on LLM models. By removing the confounding effect of retriever quality, and cleanly separating the problem into four conditions – non-RAG, RAG with an oracle document containing the answer to the harmful request, RAG with documents related to the harmful request but without the specific answer, and RAG with random, safe documents – the benchmark isolates the impacts of different factors in the observed safety degradation. We report results across five open-source LLMs, showing an inverse relationship between benign and unsafe capability, strong evidence that baseline safety guardrails do not lead to downstream safety guarantees in the RAG case, and model-specific support for previous findings that even benign documents can lead to unsafe generation in retrieval-enabled systems.
Read the full abstract
Cryptography and Security
Signing the Transaction but Not the Decision: Whisper Attacks and a Binding Defense for AP2
Software agents are beginning to shop and pay on a person's behalf. Agent payment protocols such as AP2 produce cryptographically valid signatures for completed purchases, yet do not constrain the decisions that lead to them. Consequently, ordinary product-description text can steer a shopping agent into forming a cart that passes every protocol check but no longer matches the user's request. In this paper, we show that this vulnerability enables three related attacks. In the first attack, the agent is steered into fetching another user's payment credentials. In the second, it assembles a cryptographically valid cart whose contents do not match what the user was shown. In the third, a single factual claim about stock or product lineage moves the agent from the cheaper displayed item to a more expensive one, while the resulting cart remains fully consistent with the listing. In experiments using the Gemini Flash-Lite models that AP2's sample agents specify by default, the three attacks succeeded at rates of 90%, 56%, and 73.3%, respectively. The same vulnerability appears across seventeen Google models, three unrelated agent frameworks, two cross-vendor anchors, and Google's own consumer assistant. To address this attack vector, we introduce A-VIP (AP2 Verified-Intent Protection), a protocol-layer defense that treats the signed intent as a capability grant rather than judging the merchant's description. The defense binds every credential lookup to the session that requested it and every cart line to the listing seen, while flagging unauthorized spending. The first two attacks leave structural traces that these bindings block with zero false positives. The third attack leaves no trace, so A-VIP surfaces unauthorized spending for user confirmation. Finally, we release the A-VIP code, machine-checked invariants, and AP2-WhisperBench, a suite of 1,544 evaluation scenarios.
Read the full abstract
Probability
Coupling for one-dimensional subcritical and critical CBI processes with jumps
We develop a cluster representation for one-dimensional CBI processes with jumps. Using this representation, we establish total variation convergence under conditions on the branching Lévy measure. In the subcritical case, we obtain polynomial and exponential rates under distinct regularity assumptions, while the strong Feller property is also established. In the critical case, we derive an explicit bound involving the cumulant integral. Our proofs use a coupling method that has proved effective for establishing ergodicity of Ornstein–Uhlenbeck processes.
Read the full abstract
Materials Science
Device Engineering and Performance Optimization of Cu2NiGeS4 Thin-Film Solar Cells with In2S3/MoTe2 Charge-Selective Layers: A Computational Study
The pursuit of efficient and sustainable thin-film photovoltaics increasingly demands absorber materials that combine strong optical absorption with earth-abundant and environmentally benign constituents. Cu2NiGeS4 (CNGS) has emerged as a promising quaternary chalcogenide absorber owing to its favorable optoelectronic properties and high absorption coefficient, yet its photovoltaic potential remains comparatively underexplored, particularly in conjunction with optimized charge-selective layers. Here, we introduce and comprehensively investigate an CNGS-based solar-cell architecture using SCAPS-1D, with In2S3 and MoTe2 serving as the electron and hole-transport layers respectively. The analysis of energy-band profiles, electric fields, carrier distributions, and generation-recombination characteristics reveals the mechanisms governing carrier separation and extraction across the heterojunctions. Systematic optimization of layer thickness, doping density, bulk and interface defect densities, recombination coefficients, parasitic resistances, temperature, and illumination intensity identifies the key factors limiting device performance. The optimized device is predicted to achieve a power conversion efficiency (PCE) of 28.44% with a open-circuit voltage (VOC) of 0.984 V, short-circuit current density (JSC) of 34.39 mA/cm2, and fill factor (FF) of 84.04%, under AM1.5G illumination at 300 K. This simulated efficiency exceeds the previously reported 6.25-21.17% range for CNGS-based solar cells considered in this study. The findings establish In2S3/CNGS/MoTe2 as a promising platform for next-generation thin-film photovoltaics and provide physically grounded design guidelines for absorber optimization, interface engineering, and future experimental realization.
Read the full abstract
Combinatorics
Fort Abundance in Zero Forcing
This paper paper concerns the study of forts, the sets that obstruct zero forcing. We show that every block graph on $n$ vertices has at least $n/3$ minimal forts, extending a recent bound for trees by Cameron and and Li (arXiv:2512.12874). The number of forts, and with it the number of compatible collections, grows exponentially for every tree, every connected non-star graph of bounded degree, and every connected graph of linear minimum degree, answering a question in the negative by Hicks et al. (INFORMS Journal on Computing 2022) for these graph classes. We finish by counting the minimal forts of a tree exactly, in linear time and space.
Read the full abstract
Robotics
SEED-UMI: Sharing the Exoskeleton between human and robot for onE-to-one Dexterous demonstration
Imitation learning for dexterous hands is bottlenecked by the difficulty of collecting contact-rich demonstrations that transfer faithfully to the robot. Prior wearable-exoskeleton systems record only on the human side and retarget via open-loop mappings calibrated in free space, which degrade under contact. We present SEED-UMI, a framework in which both the human and the robot wear the same exoskeleton: joint encoders become a physically shared measurement, and wrist cameras mounted to the exoskeleton observe the same outer mechanism during both human data collection and robot policy rollouts. This turns retargeting into paired cross-embodiment supervision and lets policies train directly on raw exoskeleton-centric wrist images, without segmentation or inpainting. On five contact-rich tasks, SEED-UMI achieves 3.0x greater data collection efficiency than exoskeleton-based teleoperation and a 70.0% average rollout success rate.
Read the full abstract
Artificial Intelligence
SIRF: A Spec-Internalized Risk Foundation Model for Industrial Content Risk Control
For industrial content risk control, the real deployment constraint is not average accuracy but how much risk can be auto-handled under high precision and second-level latency. We present SIRF (Spec-Internalized Risk Foundation Model), which internalizes a platform's complex policies, synthesized without additional human annotation via EntiGraph, MAGA rewriting and account-level chain-of-thought (CoT), into the weights via continued pretraining (CPT), so rules are applied at high precision under an ultra-low-latency, verdict-only deployment. A controlled same-source comparison (Qwen3-8B-SFT vs. SIRF-8B-SFT, identical policy injection and verdict-only output form, differing only in policy-grounded CPT) attributes the gain to internalization: SIRF-8B-SFT reaches 71.3% Black Recall@P95, +15.1pp over the baseline, using only ~70M CPT tokens without harming general ability, and among included, logprob-available models under this interface it matches or exceeds far larger systems. SIRF is deployed as a tree-model adjudication layer (20% more mis-penalized samples recovered) and transfers to a freezing scenario at low cost (~70% relative mis-penalization reduction).
Read the full abstract
Optimization and Control
Stochastic Gradient Methods with Online Scaling
This paper introduces Stochastic Online Scaled Gradient Methods (SOSGM), a generalization of the recently developed adaptive preconditioning framework in arXiv:2505.23081 and arXiv:2509.11007 to stochastic optimization. Under standard assumptions, we establish convergence guarantees for SOSGM using large batchsize or variance reduction. SOSGM is compatible with popular diagonal and/or low-rank preconditioners as well as heavy-ball momentum, while maintaining memory and computation cost comparable to Adam. Extensive numerical experiments demonstrate the strong empirical performance of SOSGM. Using a diagonal preconditioner, SOSGM and its variants substantially outperform existing adaptive first-order methods across a range of statistical learning tasks.
Read the full abstract
High Energy Physics (Phenomenology)
Might the radiation era extend back to the Big Bang? On dark matter production and the relic graviton background in quadratic gravity
Naive estimates based on Einstein gravity with Lagrangian $\frac{1}{2}M_{pl}^{2}(R-2\Lambda)$ suggest that, if the radiation era extended back to the Big Bang (i.e., as far back as the classical spacetime background makes sense), this would result in an over-production of dark matter and a relic cosmic background of thermal gravitons. Here we revisit these conclusions in quadratic gravity, the minimal renormalizable completion of Einstein gravity, whose Lagrangian also includes the terms $\frac{1}{6}f_0^{-2}R^2-\frac{1}{2}f_{2}^{-2}C^{2}$. Assuming the radiation era does extend back to the bang, we find a novel relation between the coefficient $f_{2}$ and the dark matter mass $m_{dm}$, needed to obtain the correct dark matter abundance. This yields a new gravitational production mechanism for dark matter (e.g., stable right-handed neutrinos). Moreover, the presence or absence of the relic graviton background (detectable by forthcoming CMB experiments via its small imprint on $N_{{\rm eff}}$) will place new constraints on $f_{0}, f_{2}$.