Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Tuesday 8 September

Robotics

A Controlled Comparison of Manual and Teleoperated Intraocular Instrument Motion for an Input Device

Input devices for robotic microsurgery are frequently described as preserving the surgeon's trained technique, but the claim is rarely measured. We compared manual and teleoperated intraocular instrument motion with the trocar constraint, the instrument, the eye model and the tracking source common to both conditions, so that the control interface was the only factor varied. Prior comparisons cannot hold the instrument fixed, because a robotic instrument is not the tool used manually. Sixteen participants performed a navigation task on a commercial ophthalmic simulator by hand and through a three-degree-of-freedom input device commanding a five-joint robot. Task outcome was equal but at ceiling: every participant acquired all five targets under both interfaces with no retinal or lens injury. Execution differed on every measure. Teleoperated trials took three times as long at a quarter of the median speed, covered less than half the angular working range, and were broken into 3.5 times as many separate movements. Completion time and movement fragmentation improved substantially across four trials of practice and had not plateaued; the measures set by the configured rate ceiling and joint limit changed the least. Finger activity doubled and pinch variability tripled, so reducing instrument degrees of freedom redistributed manual effort rather than reducing it. The interface preserves the outcome and reshapes the execution.
Read the full abstract

All authors Korab Hoxha, Mirza Imamovic, Angelo Henriques, M. Ali Nasseri

Instrumentation and Detectors

Non-destructive 3D doping imaging of silicon sensors

Silicon sensors are the foundational detection medium for X-rays and charged particles. While their bulk dopant distribution determines device performance, it is conventionally assumed homogeneous because traditional profiling is destructive, spatially restricted, and insensitive at the relevant concentrations. Here we introduce a non-destructive 3D doping imaging technique that turns the readout electronics of a charge-integrating hybrid pixel detector into a massively parallelized capacitance-voltage profiler. With a few tens of micrometres of 3D resolution over wafer-scale areas at concentrations on the order of $10^{11}$ cm$^{-3}$, we image the bulk doping concentration of operational sensors. Macroscopically, we resolve depth-evolving concentric doping rings; microscopically, we uncover scattered doping anomalies that distort local electric fields. The rings modulate the depletion voltage, while the anomalies disrupt local charge collection, a previously overlooked cause of pixel yield and performance degradation. By bridging manufacturing signatures with microscopic defects, this approach provides a non-destructive framework for sensor characterization and yield optimization.
Read the full abstract

All authors Xiangyu Xie, Anna Bergamaschi, Maria Carulla, Roberto Dinapoli, Erik Fröjdh, Viktoria Hinger, Davide Mezza, Aldo Mozzanica, Jonathan Mulvey, Bernd Schmitt, Saverio Silletta, Jiaguo Zhang

Strongly Correlated Electrons

Examining Convergence of Cluster Perturbation Theory and Cluster Coupled Cluster for J1-J2 Heisenberg Spin Lattices

In previous work, it was shown that using the cluster mean field(cMF) wavefunction as the zeroth order wavefunction for perturbation theory and coupled cluster produces a reasonable approximation for the J 1-J 2 Heisenberg model in the thermodynamic limit(TDL). However, this work was limited to cPT4 and cCCSD. The central claim of cMF is that it takes strongly correlated systems and makes them weakly correlated so that PT weakly correlated methods can be used. To confirm that this claim is true, it is important to show that the PT and CC series converge. In this paper, we extend the previous calculations to cPT7 and cCCSDTQ5 where we show that the energy is converging. We also discuss how to perform cluster based calculations efficiently in the thermodynamic limit, which is crucial for these more expensive calculations.
Read the full abstract

Data Analysis and Statistics

Quantity, quality, and timing: Guiding glacier data assimilation strategies in the high Arctic

Accurate simulation of glacier surface mass balance is essential for predicting sea level rise and freshwater resources, but it is constrained by uncertainties in meteorological forcing and model parameters. Here, we deploy glacier data assimilation strategies to assess the value of observations for improving surface mass balance simulation, focusing on observation quantity, quality, and timing. We perform synthetic twin experiments on Kongsvegen glacier, Svalbard, using a Particle Batch Smoother with 1000 ensemble members. Synthetic observations of albedo, snow depth, and surface temperature are assimilated at two quality levels, under two climatic scenarios, and over 12 years. Assimilation benefit is measured as the percentage improvement in the continuous ranked probability score of the posterior glacier surface mass balance relative to the prior. A single optimally timed high quality observation yields mean improvements of up to 80%. Larger numbers of low quality observations partially compensate for lower improvement. In the accumulation zone, however, additional snow depth observations degrade performance through particle degeneracy. Optimal timing is governed by the seasonal transitions of the truth trajectory rather than by prior ensemble spread alone. The optimal windows shift by up to six weeks between early and late melting years. Joint assimilation adds value through temporal diversity rather than observational diversity, while independently timed observations outperform same day combinations. The asynchronously optimally timed combined assimilation of three variables sustains improvements of 85 to 97% across all years in the ablation zone. These findings provide guidelines for adaptive observation scheduling in glacier monitoring and reanalysis.
Read the full abstract

All authors Wenxue Cao, Kristoffer Aalstad, Louise S. Schmidt, Thomas V. Schuler

Computer Vision

Compensating for Scarce Historical Images in Cross-Domain Cultural Heritage Retrieval Using Synthetic Aging

Cultural heritage collections often contain contemporary and historical visual records of the same physical object. Linking these records is difficult because corresponding images may differ in viewpoint, acquisition conditions, color reproduction, framing, resolution, and degradation, while genuine historical images are frequently scarce. This study investigates whether synthetically aged contemporary images can replace or complement missing historical training data in bidirectional instance-level retrieval. Synthetic old-domain images are generated using degradation-oriented transformations. An EfficientNetV2-M model is evaluated on identity-disjoint training, validation, and test sets across three dataset partitions and three training seeds. Mixed real-synthetic training is compared with real-only baselines using proportionally scaled and fixed 300-batch-per-epoch schedules. Complete replacement of genuine historical images reduced bidirectional mean R@1 from 86.56% to 81.27%, showing that synthetic aging does not reproduce the full genuine old-domain variability. Increasing the number of independently generated synthetic variants provided no consistent improvement. Under controlled scarcity, however, synthetic completion improved mean R@1 by 3.69 percentage points at 25% genuine historical coverage and by 2.92 points at 50%, relative to the proportionally scaled real-only baselines. At 75%, the gain decreased to 2.00 points, while performance remained comparable to the complete-real-data reference. Fixed-schedule real-only controls did not reproduce these improvements. The results indicate that genuine and synthetic observations are complementary. Synthetic completion primarily benefits retrieval by extending cross-domain identity coverage rather than by increasing training exposure, with its contribution gradually decreasing as genuine historical coverage increases.
Read the full abstract

All authors Marcin Iwanowski, Adam Mazgaj, Ferdynand Gorski, Sabina Szymoniak

Cryptography and Security

Benchmark Scores Are Pipeline-Dependent: A Reliability Audit of Cybersecurity LLM Benchmarks

Large language model (LLM) benchmarks are often treated as fixed datasets with stable scores, yet their outcomes depend on configurable evaluation pipelines. We audit eight cybersecurity benchmarks across 10 proprietary, open-weight, and cybersecurity-specialized LLMs. By modeling benchmarks as measurement pipelines, we identify 15 systematic failure modes and show that a single pipeline choice can change a model's score by more than 80 percentage points and substantially alter model rankings. At the cross-benchmark level, two semantically similar task pairs rank the same models differently because of incompatible evaluation conventions. Under an evaluation harness that standardizes pipeline choices while preserving task semantics, nine of 10 models shift by at least three ranks on at least one benchmark. These results show that cybersecurity LLM benchmark scores are pipeline-dependent and motivate pipeline-aware auditing as a core requirement for reliable model evaluation.
Read the full abstract

All authors Aymene Berriche, Cathrine Shalby, Mohannad Alhanahnah, Yazan Boshmaf

Category Theory

On pushouts of strict symmetric monoidal categories

Toward modeling computational concurrency using the language of central idempotents in monoidal categories, we give an explicit construction of the pushout of strict symmetric monoidal categories with strong monoidal functors between them. We show that any braided strong monoidal functor strongly preserves central idempotents, and as a corollary, that the lattice of central idempotents of a symmetric monoidal category is isomorphic as a meet-semilattice to that of its strictification.
Read the full abstract

Cryptography and Security

ZK-Trace: Certified Collusion Tracing with Zero-Knowledge Credentials for Federated GNSS Interference Monitoring

Federated global navigation satellite system (GNSS) monitoring distributes a proprietary classifier to partly trusted stations, any of which may leak its copy. ZK-Trace combines public identity marks, recipient-specific Tardos fingerprints, and zero-knowledge credential verification. The registry supports offline tracing without the leaker's cooperation. We establish conditional false-accusation bounds for arbitrary recovered bit patterns, a finite completeness bound under a hidden-bias residual channel, and a deterministic tracing-score bound for correlated feature-distillation errors. An interval-arithmetic checker makes the conditional bound executable and allocates a common budget across accusation and tamper decisions. Under innocent-row independence, the certificate-based evaluation uses a false-naming budget of 0.001 per investigation. It isolates all 160 single-owner copies and traces 712 of 720 two-owner mixtures without naming an innocent. Experiments use a simulated GNSS federation and CIFAR-10. Feature matching preserves the feature mark in 20/20 runs and cross-architecture transfer in 19/20, at copy-accuracy costs of 4.8 and 6.1 percentage points on GNSS and CIFAR-10. Function-only distillation erases the feature mark, and distillation also removes weight-space marks. These results support verifiable tracing under explicit statistical and cryptographic assumptions. Credential knowledge and recipient evidence serve distinct roles.
Read the full abstract

All authors Redwanul Karim, Nisha L. Raichur, Lucas Heublein, Tobias Feigl, Christopher Mutschler, Felix Ott

Information Retrieval

PDMR: Passage-Driven Multi-ID Document Retrieval

Generative Retrieval (GR) models map queries directly to document identifiers, replacing conventional retrieval over external sparse or dense indexes with autoregressive identifier generation. However, most generative retrieval frameworks rely on a single-identifier assumption, mapping each document to a single target sequence. This forces the model to represent all document content with one sequence. Since documents are often multi-faceted, this can lead to lossy representations and reduced robustness to query variation, where multiple query intents must compete for a single generative access path. In this work, we introduce Passage-Driven Multi-ID Retrieval (PDMR), a generative retrieval framework that represents documents through multiple passage-level identifiers. PDMR segments each document and assigns one identifier to each selected passage, which provides multiple semantic entry points for retrieving the same document. This multi-entry representation allows the model to align queries with specific semantic facets, thereby reducing the dependence on a single document-level target. To address the supervision ambiguity of this one-to-many mapping, we formulate training as a multi-target learning problem and explore an objective function designed to distribute probability mass across multiple valid passage-level identifiers. We evaluate PDMR on NQ320K and MS MARCO Document. On NQ320K, PDMR improves over strong generative and non-generative baselines on Recall@1 and MRR@100. On MS MARCO Document, PDMR achieves the best Recall@1 and MRR@10 among the reported methods, while remaining competitive on Recall@10. Controlled ablations further show that passage-level supervision, identifier design, training-query augmentation, and multi-target learning contribute complementary gains.
Read the full abstract

High Energy Physics (Phenomenology)

Theory updates for parton distributions in Hessian formalism

We present a new extension to the toolbox of parton-distribution reweighting methods, which enables a general user to study the impact of an updated theory prediction on the results of a pre-existing parton-distribution global analysis. This new method is a combination of the well-known reweighting method with a new deweighting variant where a dataset is removed from the original analysis in an approximate way. Specific use cases of this method could include e.g. testing the impact of updating the treatment of an observable from N$^n$LO to N$^{n+1}$LO precision in the global analysis, or including previously ignored electroweak, mass, resummation, or higher-twist effects, or even testing the impact of some beyond-standard-model physics. We discuss the implementation of this method in the Hessian formalism, and show its use in a single case study, where we update the treatment of dimuon production in neutrino-induced DIS with the novel semi-inclusive DIS approach.
Read the full abstract

Combinatorics

Set-valued tableaux and cells of Gelfand-Zetlin polytopes

Two combinatorial rules are known for the Grassmannian Grothendieck polynomial $G^{(\beta)}_\lambda$: a sum over set-valued tableaux of shape $\lambda$, due to Buch, and a sum over the efficient cells of a cellular decomposition of the Gelfand-Zetlin polytope $GZ(\lambda)$, due to E. Presnova and the author. All coefficients in both sums equal $1$. We construct an explicit bijection between the two indexing sets which matches the summands term by term, carrying the number of excess entries of a tableau to the dimension of the corresponding cell; in particular the two rules are equivalent, either being deducible from the other. The efficiency condition on cells turns out to be the column-strictness of tableaux. We then transport Yu's square-root crystal operators to the cells and find that they respect dimension, along a double $i$-string the cells alternate between two consecutive dimensions, but not incidence: consecutive cells of such a string need not share a point, already for $\lambda=(2,1,0)$.
Read the full abstract

Information Theory

A Note on Scaling in Randomly Rotated Quantization and Its Connection to the CDEF +1 Pythagorean Relation

Quantization schemes based on randomized rotations have recently received renewed attention, including the roles of MMSE and unbiased reconstruction scalings. In this note, we point out the connection to classical results in statistical signal processing and communication theory. Specifically, the two reconstruction scales used in the EDEN line of work admit a natural interpretation as finite-dimensional, realization-dependent counterparts of the Wiener and unbiased coefficients in the classical CDEF formulation. At finite blocklength, the CDEF +1 relation holds pointwise for each rotation realization as an exact geometric (Pythagorean) identity, but does not hold after averaging the distortions over the rotation. The classical SNR relation $\sf{SNR}_{\rm MMSE}=\sf{SNR}_{\rm MMSE,U}+1$ is recovered as $d\to\infty$: once the overall scale is handled separately, the empirical coordinate statistics of a randomly rotated vector approach their i.i.d. Gaussian counterparts, and the rotation-dependent quantities concentrate. Importantly, EDEN goes beyond this classical correspondence: for every finite $d$, its Haar-rotation formulation guarantees exact conditional unbiasedness, a stronger property than the second-order notion of unbiasedness in CDEF. We further comment on two distinct roles random rotations play in quantization: one is approximate Gaussianization of the coordinates; the other is decorrelation of reconstruction errors across quantization branches.
Read the full abstract

High Energy Physics (Phenomenology)

Backward Compton scattering with three vortex particles

We investigate backward Compton scattering in which an incident vortex (vx) photon collides head-on with a plane-wave (pw) electron and both final-state particles are projected onto vortex states, $\gamma_{\rm vx}+e^-_{\rm pw}\to\gamma_{\rm vx}+e^-_{\rm vx}$. We derive analytically the scattering amplitude and differential cross sections in the energy and cone angle of either final particle. Rotational symmetry implies a selection rule associated with the conservation of the total angular momentum along the collision axis. A Bessel-Gaussian wave packet is adopted for the incident photon to provide a physical normalization and regularize the boundary singularities of ideal Bessel states. We present numerical results for a $10~{\rm MeV}$ electron colliding with a vortex photon of central energy $1~{\rm MeV}$ or $10~{\rm keV}$. The final-photon distributions exhibit strong energy–angle correlations, topological-charge-dependent interference fringes, and systematic shifts of their dominant peaks, allowing different topological charge sectors to be enhanced through angular or energy post-selection. For a longitudinally polarized incident electron, the dominant channels favor final photons of matching helicity. For the $1~{\rm MeV}$ photon benchmark, the final electron can likewise be produced as a MeV-scale vortex state with a sizable cone angle and a large angular-momentum projection. These results demonstrate that triple-vortex backward Compton scattering offers a potential means of generating and controlling high-energy vortex photons and electrons.
Read the full abstract

Complex Variables

A numerically flat rank-two bundle without a holomorphic connection on a $\partial\bar\partial$-threefold

We construct a numerically flat holomorphic vector bundle of rank two on a compact complex threefold satisfying the ordinary $\partial\bar\partial$-lemma and prove that it admits no holomorphic connection. This gives, in particular, a negative answer to a question posed by Cao–Deng–Matsumura. In contrast, for compact simply connected complex manifolds $X$, we prove that the answer is affirmative if $H^1(X,\mathcal O_X)=0$, and hence if the Frölicher spectral sequence of $X$ degenerates at $E_1$.
Read the full abstract

Geometric Topology

Cusp cross-sections of low-dimensional arithmetic hyperbolic manifolds

We study which compact flat manifolds of dimensions $3 \leq n \leq 6$ occur as cusp cross-sections in commensurability classes of non-compact arithmetic hyperbolic $(n+1)$-manifolds. Using the classification of low-dimensional flat manifolds together with the relationship between their holonomy representations and rational quadratic forms, we determine the possible arithmetic commensurability classes for every flat manifold in these dimensions. We show that every flat $n$-manifold for $n=3,4,5$ occurs as a cusp cross-section in infinitely many distinct arithmetic commensurability classes. In dimension six, the same holds with exactly eight exceptions: eight non-orientable flat $6$-manifolds occur in a unique arithmetic commensurability class. We also show that, for every $3 \leq n \leq 6$, there is a single commensurability class of arithmetic hyperbolic $(n+1)$-manifolds containing every flat $n$-manifold as a cusp cross-section.
Read the full abstract

Computer Vision

Kairos: A Dataset for Fine-Grained Video-Language Modeling over Space, Time, and Dynamics

Many emerging video language modeling tasks require systems to move beyond clip-level abstraction and model visual content as it unfolds over extended time horizons. However, most existing video datasets rely on coarse or sparsely aligned supervision, which compresses temporal variation and limits the ability of models to learn reusable representations of continuous visual dynamics. We introduce Kairos, a video dataset for video-language modeling with time-resolved annotations. Kairos consists of long-duration videos, ranging from ten minutes to half an hour, annotated with fine-grained temporal alignment. The annotations capture ongoing actions, entity appearances and attributes, interactions, and evolving contextual cues along the video timeline. This time-resolved structure supports fine-grained evaluation, long-range modeling and reasoning, instruction data construction, representation learning, and video generation. Kairos provides a general-purpose foundation for modeling visual experiences over time.
Read the full abstract

All authors Ruibo Ming, Lei Sun, Deheng Zhang, He Zhang, Jialu Li, Jian Wang, Zhendong Li, Mengshun Hu, Danda Pani Paudel, Luc Van Gool, Jinjin Gu

Functional Analysis

The linear scale in metric cotype for Alexandrov spaces of nonnegative curvature

We answer a question of Eskenazis, Mendel, and Naor by proving that the optimal universal scaling parameter in metric cotype $2$ for complete Alexandrov spaces of nonnegative curvature has order $n$. The upper bound follows from a dyadic application of the Lang–Schroeder inequality, and the lower bound follows from snowflake universality of $\mathcal{P}_2(\mathbb{R}^3)$.
Read the full abstract

High Energy Astrophysical Phenomena

A Two-Parameter Framework for the Diffuse Supernova Neutrino Background

Following important experimental developments, tests of the Diffuse Supernova Neutrino Background (DSNB) are entering a new phase that might lead to a discovery. This motivates the development of simple and broadly applicable tools for comparing theoretical predictions and interpreting experimental results. We show that, over the energy range relevant to current detectors, the DSNB is well described by an exponential spectrum, characterized by the differential flux at 20 MeV, $\phi_{20}$, and a spectral energy scale, $E_0$. We fit the spectra of 24 representative models and demonstrate that the exponential description provides an excellent approximation. We then recast the recent Super-Kamiokande results in the $(\phi_{20},E_0)$ plane, showing that model-specific best fits and upper bounds can be interpreted naturally within this framework. Our results indicate that, above realistic detection thresholds, and until the precision phase is reached, the observable DSNB is effectively a two-parameter phenomenon. We advocate that the $(\phi_{20},E_0)$ parameterization be adopted as a standard, to be used routinely to report future theoretical predictions and experimental results.
Read the full abstract

Quantum Physics

Quantum speed limits based on quantifiers of quantum-state texture

Quantum speed limits impose intrinsic lower bounds on the shortest time scale for quantum system evolution. As an emerging paradigm in quantum resource theory, quantum-state texture has attracted research interest amid the rapid advancement of quantum theory. Herein, we investigate the interplay between quantum speed limits and quantum-state texture via several canonical quantifiers, including trace distance, state rugosity and Jensen-Shannon divergence. To demonstrate our findings, we analyze the minimum evolution time of physical systems subject to dephasing and dissipative dynamics. For the Jensen-Shannon divergence, we further explore nonunitary dynamics described by completely positive and trace-preserving maps, taking the amplitude damping channel as a typical example. In addition, we explore the tightness of these bounds in the considered dynamical models. Our results reveal that quantum speed limits derived from quantum-state texture capture the fundamental constraints on quantum evolutionary speed, with promising applications in quantum computing, quantum control and quantum metrology.
Read the full abstract

All authors Yuhang Xie, Yanjun Chu, Chenyang Cui, Shao-Ming Fei

Optimization and Control

Optimal input design via Frank-Wolfe

We study optimal input design over a finite horizon for linear dynamical systems. The goal is to minimize a weighted inverse-covariance (information) criterion subject to an energy budget. The set of covariances achievable by causal policies is convex but lacks a tractable explicit description, ruling out projection-based methods. We show that Frank–Wolfe applies naturally: each linear minimization subproblem is a budget-constrained finite-horizon linear quadratic (LQ) problem, solvable by a Riccati recursion and one-dimensional bisection over a Lagrange multiplier. Using smoothness of the objective over the feasible set, we establish an $\mathcal{O}(1/M)$ convergence rate for the objective value, while strong convexity yields an $\mathcal{O}(1/\sqrt{M})$ rate for the iterates. We further extend the framework to input design for system identification with unknown dynamics and adaptive online LQR, and illustrate the approach numerically.
Read the full abstract

All authors Fethi Bencherki, Bruce Lee, Nikolai Matni, Anders Rantzer

Mesoscale and Nanoscale Physics

Decorated electronic kagome lattice in twisted bilayer germanene

Artificial kagome lattices provide a route to electronic flat bands, geometric frustration, and correlation driven phases, but their realization in atomically controlled two-dimensional materials remains scarce. Here, we show that commensurate twisted bilayer germanene on Ge2Pt produces two electronically distinct large-angle moiré phases. Scanning tunneling microscopy measurements and density functional theory calculations reveal that commensurate twisted bilayers that are odd under an exchange of sublattices are semiconducting, whereas the twisted bilayers with an even parity are metallic. The twisted bilayers with an even parity host an empty state resonance that exhibits an emergent decorated kagome structure with a C3 symmetry. These results establish large-angle twisted germanene as a platform for engineering kagome-like electronic states in a buckled two-dimensional material.
Read the full abstract

All authors Dennis J. Klaassen, Rian A.M. Ligthart, Andrés R. Botello Mendez, Lumen Eek, Esra van 't Westende, Paul L. de Boeij, Y. Wang, D. Vanmaekelbergh, Pantelis Bampoulis, Cristiane Morais Smith, Ingmar Swart, Zeila Zanolli, Harold J.W. Zandvliet

Functional Analysis

Sharp Metric Cotype Inequalities for $L_1$ via Nonlinear Cut Smoothing

For every $1\leq p<\infty$ and even integer $m\geq4$, we determine the optimal order of the $p$-moment torus inequality for $L_1$: it is $m^p n^{(1-p/2)_+}+n$, with comparison constants independent of $p,m,n$ after taking $p$-th roots. Consequently, for every $2\leq q<\infty$ and $1\leq p\leq q$, the corresponding metric cotype inequality holds at the sharp scale $m=O(n^{1/q})$. In particular, the quadratic inequality holds with $m=O(\sqrt{n})$, answering the $L_1$ sharp metric cotype question of Mendel and Naor. The proof combines finite cut representations with a nonlinear smoothing estimate and an exact ternary rounding identity.
Read the full abstract

Optics

Dynamic Chirality in Photonic Time Crystals

Temporal modulation offers a fundamentally distinct degree of freedom for active wave control beyond static spatial structuring. Photonic time crystals (PTCs), based on periodic modulation of electromagnetic parameters in time, have expanded photonic band engineering from space to time by enabling controlled energy exchange between light and the modulation. Yet, the use of PTCs to synthesize rotational dynamics and thereby control chirality and circular dichroism (CD) remains largely unexplored. Here, we propose a spatiotemporal PTC whose central cylindrical element is driven by an azimuthally traveling-wave permittivity modulation. Although the structure is geometrically static, its dielectric profile evolves as an effectively rotating pattern in time. This synthetic rotation lifts a static modal degeneracy and produces two nondegenerate counter-rotating states with opposite orbital angular momenta. These chiral modes selectively couple to left- and right-circularly polarized light, giving rise to tunable CD. In addition, the spatiotemporal modulation induces orbital angular-momentum conversion between the Floquet replica bands. Our work reveals the microscopic origin of dynamic chiral response and establishes a strategy for reconfigurable chiral photonics without mechanical motion.
Read the full abstract

Cryptography and Security

MemSentry: A Framework for Detecting Persistent Memory Poisoning in Agentic AI

Agentic AI systems with persistent memory introduce a distinct attack surface known as memory poisoning, in which adversarially crafted content is stored in long-term memory and subsequently influences future agent behavior. Such attacks can suppress security alerts, facilitate privilege escalation, alter trust relationships, or override security policies without modifying the underlying model weights or system prompts. To address this threat, we present MemSentry, a formal, configuration-driven framework that intercepts proposed persistent-memory writes and produces deterministic Accept, Review, or Quarantine decisions. MemSentry evaluates each write by jointly considering source trust, semantic risk, attack radius over a component-dependency DAG, access risk, and a signed security-state delta that captures whether an operation weakens or strengthens the system's security posture. We instantiate the protected environment using a 20-asset random dependency DAG and a 10 x 20 user access-control matrix, and evaluate the framework over 1,000 GPT-4-generated scenarios using a stratified 70/30 train/test split. Semantic classification is treated as a pluggable component rather than a primary contribution, and we compare four representative approaches: rule-based Regex, TF-IDF+SVM, SBERT+LR, and SetFit. SBERT+LR achieves the best overall performance with 91.7% accuracy and a 0.908 macro-F1 score, while all four methods detect 100% of external quarantine-class threats. For verified insiders, where source trust is maximal (T = 1), MemSentry does not automatically quarantine suspicious operations but instead escalates potentially dangerous writes for human review, making semantic classification important for accurately capturing insider intent.
Read the full abstract

Classical Analysis and ODEs

Wavelet orthonormal bases for nonexpansive dilations

We construct wavelet orthonormal bases for nonexpansive dilations and integer translations that do not admit a wavelet set. In addition, these orthonormal bases do not satisfy the Calderón sum formula. In particular, we show the existence of a wavelet basis for a dilation matrix with determinant one.
Read the full abstract

Quantum Physics

Uniqueness, Cramér-Rao Efficiency and Concentration Bounds for Quantum U-Statistics

We study unbiased estimation of scalar-valued polynomial functionals of quantum states from independent copies. We establish an equivalence between the first-order marginal of a permutation-invariant finite-copy observable and the functional gradient. We then prove that, among unbiased permutation-invariant estimators, the quantum U-statistic is the unique extension to an arbitrary number of copies. We further derive a universal variance expansion in which the leading $1/n$ term is determined by the variance of the functional gradient, while higher-order contributions are of order $O(1/n^2)$. This leading variance coincides with the multiparameter quantum Cramér–Rao limit, establishing asymptotic efficiency of quantum U-statistics. We also characterize the higher-order scaling at points where the variance of the first-order gradient vanishes. As an application, we analyze the Bures $\chi^2$-divergence and show that a spectral lower bound on the reference state is sufficient but not necessary for bounded-variance estimation. Beyond asymptotic variance, we establish variance-sensitive exponential concentration bounds, deriving a closed-form Bernstein-type inequality to capture finite-sample tail behaviour, and establish the Moderate Deviation Principle to characterize the intermediate asymptotic regime.
Read the full abstract

Complex Variables

Covariance property for a quaternionic fractional Cauchy-Riemann operator under affine transformation

In this paper, we continue the development of the foundations of a quaternionic function theory that is associated to a fractional proportional Cauchy-Riemann type operator acting on quaternionic functions. We introduce a new class of fractional hyperholomorphic functions adapted to affine transformations of the domain, and study the corresponding quaternionic right module structure. In particular, we establish versions of the Stokes, Borel-Pompeiu and Cauchy formulas for this function theory. A covariance property of the fractional operator under affine transformations is proved, showing that the composition with an affine map, weighted by a suitable quaternionic factor, preserves the class of fractional hyperholomorphic functions. The result is shown to include the case considered previously by the authors, and extends their covariance property to the setting of affine transformations.
Read the full abstract

All authors Isidro Paulino-Basurto, José Oscar Gonzáles-Cervantes, Juan Bory-Reyes, Hung Manh Nguyen

Robotics

FOCI Policy: Focus on Object-Centric Interactions for Relational Manipulation Policies

Object-centric manipulation policies improve generalization by modeling object motion instead of directly predicting robot actions. However, existing methods are often limited by representations which are either too simplistic to capture interaction dynamics or too dense to learn efficiently. We observe that many rigid relational manipulation tasks are governed by short interaction phases where the relative motion between task-relevant objects is tightly constrained. Based on this observation, we propose Foci Policy, an interaction-centric framework that achieves a two-fold abstraction: (1) temporally, by automatically extracting compact interaction segments from demonstrations;(2) spatially, by representing skills as relative $SE(3)$ motion between task-relevant objects, yielding invariance to scene configurations and robot embodiment. Experiments on RLBench, COLOSSEUM, and real-world tasks show that Foci Policy achieves strong performance with substantially less training data than prior object-centric and action-centric policies. These results suggest that modeling object-object interactions provides a simple and efficient inductive bias for rigid relational manipulation. Project page: \href{https://fitz0401.github.io/foci-page/}{fitz0401.github.io/foci-page/}.
Read the full abstract

All authors Ze Fu, Pinhao Song, Yutong Hu, Renaud Detry

Materials Science

The absence of a central metal ion destabilizes phthalocyanine on In$_2$O$_3$(111)

Metal phthalocyanines (MPc) are a versatile molecular platform for applications ranging from organic optoelectronic devices to single-atom catalysis (SAC). Their adsorption and layer formation on the prototypical transparent electrode substrates of organic optoelectronic devices is directly relevant for charge injection and transport across the organic-oxide interface. Moreover, the well-defined M-N$_4$ coordination of the metal cation defines their activity as SACs for (electro-)catalysis. Here, the adsorption of the metal-free phthalocyanine (H$_2$Pc) is characterized on In$_2$O$_3$(111) using low-temperature STM, nc-AFM, and STS. In$_2$O$_3$ is not only a model system of indium tin oxide (ITO) but also an active catalytic material for CO$_2$ reduction. H$_2$Pc adsorbs in the same site and configuration reported for copper phthalocyanine [J. Mater. Chem. C 13, 17650-17661 (2025)] and for the majority of cobalt phthalocyanine [Surf. Sci. 722, 122065 (2022)]. Despite this shared preference in adsorption site, H$_2$Pc cannot be organized into extended and ordered monolayer structures by gentle annealing: the molecule starts to decompose at $\approx$50$^\circ$C, well below the temperature used to grow monolayers of CoPc and CuPc. Self-metalation is not observed on stoichiometric In$_2$O$_3$(111). On the reduced surface where In$^0$ adatoms are present, new H$_2$Pc-related features appear but cannot be identified by imaging only. The comparison of H$_2$Pc with CoPc and CuPc identifies distinct roles of the central metal ion in the metal-Pc/In$_2$O$_3$(111) systems: it acts as a structural anchor that stabilizes the macrocycle against decomposition on the surface, and it modifies the frontier-orbital character in ways that determine whether a second adsorption configuration is populated.
Read the full abstract

All authors Viktoria Waidbacher, Sarah Tobisch, Faith J. Lewis, Moritz Eder, Michael Schmid, Gareth Parkinson, Ulrike Diebold, Margareta Wagner

Functional Analysis

On the pullback on spaces of distributions with prescribed microregularity with respect to a general Banach space

We consider the space $\mathcal{D}'^E_L(U)$ of all distributions on the open set $U$ whose wave front set measured with respect to a Banach space $E$ lies in a closed conic subset $L$ of $U\times(\mathbb{R}^n\backslash\{0\})$. The Banach space $E$ only satisfies mild technical assumptions. We show that the pullback by a diffeomorphism $f:O\rightarrow U$ is a topological isomorphism $f^*:\mathcal{D}'^E_L(U)\rightarrow\mathcal{D}'^E_{f^*L}(O)$. In the case when $E$ is the $L^p$-Sobolev space $W^{r,p}(\mathbb{R}^n)$ of order $r\in\mathbb{R}$, we study the pullback by a smooth map $f:O\rightarrow U$ of constant rank.
Read the full abstract