Peer Revenue Equity in science

Papers

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

All of arXiv

Saturday 29 August

Computation and Language

When Patients Cut In: Extending Clinical Conversational AI Safety to Interruptions

Clinical voice agents are now deployed in routine care, where real patients do not wait their turn: they interrupt. These systems typically use a cascaded architecture (speech-to-text -> LLM -> text-to-speech), so when a patient cuts the agent off mid-utterance, clinically required content can be lost even when the model handles cooperative transcripts well. Yet clinical conversational-AI benchmarks almost universally assume patients wait for the agent to finish, missing interruption-induced loss of required content. We present a transcript-based evaluation of interruption recovery, adapting conversation-analytic overlap categories into three operational types (recognitional, competitive, transitional sub-unit) and testing four deployment-oriented, non-reasoning LLM configurations across four cells spanning history-taking (information gathering) and FAQ (information provision), scored on whether the agent preserves the clinically required content. In the gathering cells, target-question failure varied across models; in the provision cells, where arms are directly comparable, failure rose for every model. Rankings differ across cells, and competitive FAQ interruption produced 30/30 provision-coverage failures for all four models (Wilson 95% CI: 88.6-100.0%; baseline 0/30 for three, 4/30 for Llama). A brief apology marker ("sorry to interrupt") shifts recovery by tens of percentage points, inconsistently across models, and for one it reduces recovery. Interruption robustness therefore cannot be a single score: evaluation must be content-grounded, reported per cell, and matched to the deployment's interruption profile.
Read the full abstract

All authors Zachary Ellis, Spencer Hazel, Adam Brandt, Yajie Vera He, Ernest Lim, Jared Joselowitz

Fluid Dynamics

From localized dryout to convective elongated vapor structures: Reynolds number effects on boiling transition in a rectangular mini-channel

Three-dimensional conjugate simulations were conducted to investigate saturated flow boiling in a rectangular mini-channel, with particular emphasis on the role of inlet Reynolds number on boiling mode selection and transition. A C++ based open-source numerical framework was employed, incorporating a physically informed multi-site nucleation model by coupling a nucleation site density correlation with a Halton-sequence based spatial allocation strategy. Two distinct Re-dependent transition pathways were identified. At low Re, boiling transition is mainly associated with localized dryout development associated with upstream active boiling and progressive downstream liquid starvation. At high Re, the transition is characterized by convective stretching and reorganization of vapor structures, through which elongated vapor slugs evolve into localized vapor films and eventually approach full surface vapor coverage. The global heat transfer characteristics and peak heat transfer capacity are further interpreted in conjunction with boiling mode transition, clarifying the respective roles of wall dryout and volumetric vapor fraction in heat transfer deterioration. Among all cases, Re=2000 provides the most favorable overall thermal response. Overall, within the rectangular mini-channel configuration and operating range considered in this study, Re is closely associated with vapor organization, boiling transition, wall dryout, and global heat transfer performance.
Read the full abstract

All authors Qi Wang, Xin Wang, Mingze Wang, Yifei Guan, Kang Luo, Jian Wu, Wei Wang, Alberto T. Perez

Computation and Language

Anchoring Speech with Semantics: A Multimodal Adapter Mechanism for Automatic Speech Recognition in Low-Resource Languages

Low-resource ASR remains difficult because scarce transcripts provide limited supervised evidence for target-side generation. To address this gap, we propose SAMA-ASR, a lightweight adapter mechanism that augments the decoder with semantic anchors from auxiliary translations and an acoustic anchor from speech; in principle, the mechanism can be applied to similar encoder–decoder multitask speech models. Through cross-modal adaptation, SAMA-ASR conditions decoder states on translation-derived semantic embeddings and a speech embedding, combining utterance-level meaning with speech-grounded evidence before token prediction. At evaluation time, these semantic anchors can be generated automatically by an upstream speech-to-text translator rather than supplied as oracle translations. Experiments on two 30-hour datasets covering the low-resource Sinitic varieties Taiwanese Hokkien and Hakka show that SAMA-ASR improves over acoustic, prior prompt-based, and semantic-only translation-guided baselines and remains effective in practical automatic semantic-anchor settings; translator-capacity analyses show that useful semantic anchors can be produced by a compact ST model.
Read the full abstract

All authors Kuan-Tang Huang, Cheng-Yeh Yang, Chien-Chun Wang, Hung-Shin Lee, Hsin-Min Wang, Berlin Chen

Optimization and Control

Exploiting Micro-Structure in the Generalized Riccati Recursion for Optimal Control

Optimal Control Problems (OCPs) have been applied to a variety of applications. Such problems are often transcribed into a Nonlinear Program (NLP) for which solution methods typically solve a Linear Quadratic (LQ) subproblem. To efficiently solve this LQ subproblem, the Riccati recursion exploits the block-diagonal structure that arises from discretizing an OCP using a Multiple Shooting method. However, reformulating general dynamics constraints to fit the required problem structure to use the Riccati recursion introduces additional micro-structure within these block matrices that remains unexploited. This work demonstrates how structure-exploiting solvers such as Fatrop can benefit from exploiting not only the block-diagonal structure but also the micro-structure within those blocks. We propose a structure-exploiting LU decomposition algorithm and integrate it within the Riccati recursion. Numerical results on randomized linear systems and two OCP examples demonstrate a reduction in computation time of the search direction of up to 20%, with the largest speedup observed for relative zero block sizes around 0.25 and large stage-wise equality constraint jacobians.
Read the full abstract

Computer Vision

AGRICAM: A Track-Mounted Crop Pollination Monitoring Robot

Insect pollination is critical for global food production, yet monitoring pollinators at commercial farm scale remains a challenge. Recent advances in computer vision and deep learning have enabled detailed analysis of pollinator behaviour, but monitoring must trade-off detail against spatial coverage and human or technological resources. This paper presents the Automated Guided Robot for Insect and Crop Activity Monitoring (AGRICAM), a purpose-built robotic system designed to meet the requirements of large-scale pollination monitoring in protected cropping systems. AGRICAM operates autonomously on low-cost, easily installed track for movement along crop rows, without disrupting farm operations or insect behaviour. The platform integrates two RGB cameras, microclimate sensors, GPS and RFID modules, motion sensors, and 4G cellular network connectivity for data transmission. A web interface enables remote device configuration and scheduling. The system autonomously captures video and image data of insects' locations and local environmental conditions. These are transferred to the cloud and analysed using computer vision models to quantify pollinator visitation and spatio-temporal activity variation. We deployed the system on a commercial blueberry farm to demonstrate and test its capability. It successfully mapped insect pollination patterns across 80 m long industrial polytunnels over 30 hours. This data enabled spatial analyses of insect activity we used to confirm a uniform pollinator distribution within polytunnels, as desired by the farm management team. The data also highlighted variation of insect activity associated with time of day and microclimate. AGRICAM therefore has been shown to be a scalable, automated crop pollination monitor that can support data-driven decisions to enhance pollination management, thereby improving crop productivity and food security.
Read the full abstract

All authors Malika Nisal Ratnayake, Adel N. Toosi, James Cook, Romina Rader, Alan Dorin

Analysis of PDEs

Stable $C^{7/9}$ cusp formation for the Novikov equation

We establish stable cusp formation for the Novikov equation, a cubically nonlinear Camassa–Holm-type equation. We identify an open set of smooth initial data for which the first gradient blow-up produces a cusp with sharp Hölder regularity $C^{7/9}$. This result shows that, in nonlocal wave-breaking problems, the sharp regularity of the cusp is not determined by the nonlocal or nonlinear structure alone. While the conserved $H^1$-type quantity excludes the $C^{1/3}$ cusp associated with Burgers-type gradient blow-up, the precise Hölder exponent is selected by the coupling between the nonlocal term and the algebraic structure of the nonlinearity. In the Novikov equation, this coupling yields the exponent $7/9$, rather than the $3/5$ exponent known for the Camassa–Holm and Hunter–Saxton equations. The main difficulty is that the naive high-frequency limit retains the cubic character of the equation and therefore does not exhibit a self-similar leading flow. We overcome this by introducing a Galilean-type change of variables around a nonzero background, which reveals a quadratic Hunter–Saxton-type leading equation. Its self-similar profiles determine the $C^{7/9}$ cusp, while the nonlocal and cubic remainders are controlled perturbatively in modulated similarity variables.
Read the full abstract

All authors Yunjoo Kim, Dowan Koo, Bongsuk Kwon, Wanyong Shim

Computer Vision

Uncertainty-Aware Multimodal Anti-UAV Detection via Evidential Fusion and Conflict-Discounted Belief Aggregation

Anti-UAV perception systems must remain reliable when sensor streams degrade under occlusion, fast motion, or modality-specific failure. Existing multimodal anti-UAV systems fuse RGB and thermal streams deterministically, without modeling predictive uncertainty, and cannot express doubt when streams disagree. Evidential Deep Learning (EDL) produces calibrated per-class uncertainty in a single forward pass. EDTC already exploits this for thermal-only perception, yet cross-modal evidential fusion remains unaddressed. This paper extends EDTC to multimodal RGB-Thermal perception via Discounted Belief Fusion (DBF), which converts inter-modal conflict into uncertainty mass before aggregating stream opinions. Bounding boxes are resolved by selecting the lower-uncertainty modality. On the Anti-UAV benchmark, multimodal fusion consistently outperforms either single stream (test Acc 0.670 vs. 0.604 IR, 0.598 RGB) at real-time speed (at least 38 FPS). However, DBF is empirically indistinguishable from undiscounted averaging: near-zero inter-modal conflict on this presence-dominated benchmark leaves the discounting step inert. The fused uncertainty is well-calibrated (ECE 0.057) yet expectedly a weaker localization failure detector than spatial variance (AUROC 0.626 vs. 0.739). The null result is structural: the benchmark's near-universal presence and vacuous miss-encoding jointly suppress inter-modal conflict, a diagnosis that delimits where conflict-aware fusion provides measurable benefit.
Read the full abstract

General Relativity and Quantum Cosmology

Resonant bound orbits and kludge waveforms in rotating Konoplya-Zhidenko black hole spacetime

We investigate timelike bound motion, resonant periodic orbits, and their gravitational-wave signatures in the rotating Konoplya-Zhidenko (KZ) black hole spacetime. Using the separability of the Hamilton-Jacobi equation, we parameterize eccentric and inclined bound orbits by $(p,e,z_1)$, derive the corresponding constants of motion $(E,L_z,Q)$, and use the orbital frequencies to identify resonant configurations. We study a range of resonances, including radial-polar resonances of inclined orbits and radial-azimuthal resonances of equatorial eccentric orbits. We further construct physically scaled quadrupole-kludge waveforms for representative equatorial resonant orbits and analyze their frequency-domain characteristics. Our results show that the KZ deformation shifts the resonance locations and modifies both the orbital trajectories and the resulting gravitational-wave signals. The corresponding characteristic strain lies predominantly in the millihertz band, placing these signals in the frequency range relevant to space-based gravitational wave detectors.
Read the full abstract

All authors Qiyu Dai, Xiongjun Fang, Xiao-Mei Kuang, Jiliang Jing

Computer Vision

Generalization over Memorization: Generalization-Aware Diffusion Adaptation for Single-Image Multi-View Synthesis

We present the winning solution to the ACM Multimedia 2026 Grand Challenge on Single-Image Guided Multi-Angle Image Synthesis. It ranks first among 293 registered teams; 56 teams obtained at least one scored submission on the public Phase-A leaderboard. With only 40 training scenes, the challenge requires 26 target views from one RGB model and one forward pass per view; it prohibits explicit geometry, external rendering, chained generation, candidate selection, and post-processing. We identify a critical model-selection failure: shared training and validation scenes make memorization appear as transferable view control. We therefore introduce GoM. Short for Generalization over Memorization, the framework combines scene-disjoint validation, exposure-matched selection, and targeted diffusion adaptation. Its synthesis model adapts a 4B rectified-flow DiT using rank-32 LoRA, optimizer restarts, late-checkpoint averaging, and VAE decoder tuning. More than 300 offline experiments and 24 online submissions show that validation design and training-trajectory control can matter as much as architecture scale in small-data generative modeling.
Read the full abstract

Computer Vision

Background-Free Objectness Learning for Class-Agnostic Detection

Object detectors are typically trained under closed-set supervision, where unlabeled regions are implicitly treated as background. Under incomplete annotations, this assumption introduces objectness bias: visually valid but unlabeled objects are used as negatives, tying objectness to the annotated taxonomy rather than generic object structure. This limitation is particularly problematic for class-agnostic and open-world detection. This paper proposes Background-Free Objectness Learning (B-FOR), a dense class-agnostic detection framework that learns objectness without explicit background supervision on unlabeled regions. B-FOR formulates detection as the prediction of dense multi-scale object-center and scale fields, from which object hypotheses emerge as local spatial structures. Supervision is confined to reliable annotated regions through spatially structured soft targets, avoiding foreground-background discrimination. To support decoding from emergent local maxima, the paper further introduces displacement-aware scale fields that model object extent as a spatially varying property of the learned objectness field. Experiments on PASCAL VOC, MS-COCO, and Open Images demonstrate strong generalization to unseen categories and cross-dataset object distributions. B-FOR improves recall by more than +10 AR points over prior class-agnostic baselines. Ablation studies show that both localized objectness supervision and displacement-aware scale fields are critical for class-agnostic localization under incomplete annotations. Code available at: https://github.com/Daniaawan/B-FOR.
Read the full abstract

All authors Dania Batool, Liliana Lo Presti, Marco La Cascia, Filippo Vella

Combinatorics

Polyomino Density

A de Bruijn polyomino has colored cells and includes exactly one instance of each possible coloring of another polyomino with those colors. This generalizes the notion of a de Bruijn sequence. We are interested in the de Bruijn polyominoes of minimum size. As a step toward finding these, we introduce the problem of finding the smallest polyominoes containing at least $N$ translated copies of the polyomino $p$, allowing overlaps. We say these are $(p,N)$-dense and have size $a_{p,N}$. For certain pairs of polyominoes $p$ and $q$ of equal size, we show there are polyomino transformations relating $a_{p,N}$ and $a_{q,N}$. Using these transformations, we identify classes of polyominoes which share the sequence $(a_{p,N})_{N=1}^\infty$. We give closed forms for $(a_{p,N})_{N=1}^\infty$ for most polyominoes with up to five cells. Leveraging these results we introduce novel de Bruijn polyominoes, as well as other colored polyforms with de Bruijn-like properties.
Read the full abstract

All authors D. M. Condon, Eli B. Dugan, Laney M. Goldman, Emily R. Williams

Computer Vision

Compact Snapshot Spectral Imaging with Calibration-Free Aperture Diffraction

Snapshot Spectral Imaging (SSI) provides high-dimensional temporal-spatial-spectral observation to uncover intrinsic physical characteristics. However, its complex system and repetitive calibration requirements hinder edge applications. Here, we propose a compact, cost-effective, calibration-free SSI method, Aperture Diffraction Imaging Spectrometer (ADIS), which consists only of a diffractive lens with a binary mask and a Bayer-filtered sensor, requiring no additional physical footprint compared to standard RGB cameras. ADIS disperses and multiplexes wavelengths, mapping energy to distinct sensor locations, enabling full-resolution recovery from superpixel-level encodings. ADIS directly leverages theoretically computed PSFs to enable calibration-free spectral reconstruction, while tolerating lens-dependent variations across different optical configurations and bridging the gap between simulation and reality. To achieve SSI by solving a sparsely-constrained inverse problem, we introduce the Orthogonal Diffraction-Aware Unfolding Framework (ODAUF) with Voxel Shift Transformer (VST) for improved orthogonal diffraction perception. Integrating VST into ODAUF forms the efficient Orthogonal Diffraction-Aware Unfolding Voxel Shift Transformer (ODAUVST), delivering excellent recovery and reduced parameters. By elaborating on theory, systematic and comprehensive comparing, and demonstrating real SSI results, we validate the superiority of ADIS, achieving calibration-free full-resolution SSI within a commercial camera footprint.
Read the full abstract

All authors Tao Lv, Quan Yuan, Shiqiao Li, Chenglong Huang, Linsen Chen, Chongde Zi, Shuming Wang, Xun Cao

Numerical Analysis

Entropy-Stable and Physical-Constraint-Preserving DGSEM for Symmetry-Reduced General-Relativistic Hydrodynamics on Stationary Spacetimes

We develop an entropy-stable and physical-constraint-preserving discontinuous Galerkin spectral element method for symmetry-reduced general-relativistic hydrodynamics on prescribed stationary spacetimes. Using a local orthonormal transformation, the fluid variables are expressed in a form for which the relativistic hydrodynamic algebra and the admissible set are independent of the spatial metric, while the spacetime geometry enters through stationary coefficients. This separation allows entropy-conservative special-relativistic fluxes to be combined with a compatible discretization of the geometric source terms. On affine tensor-product meshes, the resulting DGSEM is conservative and satisfies a semidiscrete entropy inequality, while the transformed variables provide a convex framework for physical-constraint preservation. For practical stabilization, we use a geometry-only causal speed that is sufficient for both classical local Lax–Friedrichs entropy dissipation and the physical-constraint-preserving Lax–Friedrichs splitting. The fully discrete method combines this stabilization with SSP Runge–Kutta time stepping, oscillation elimination, and conservative local-orthonormal-state scaling. Numerical experiments cover smooth and strongly shocked special-relativistic flows, an axisymmetric jet, stationary Michel accretion, Schwarzschild Bondi–Hoyle flow, and four Kerr accretion cases. The results demonstrate the designed high-order accuracy in smooth regimes and robust performance for demanding relativistic flows on curved stationary backgrounds.
Read the full abstract

Artificial Intelligence

Localizing Emergent Failures in Agentic AI: Recovering Minimal Repair Families via Counterfactual Replay

Failures in agentic AI systems can arise from interactions among messages exchanged by multiple large language model (LLM) agents. Pointwise attribution cannot distinguish a jointly necessary repair from alternative singleton repairs. We formulate Minimal Repair Family Recovery (MRFR): recovering all inclusion-minimal event sets whose counterfactual replay restores task success within a declared size bound. We propose Graph-Constrained Joint Replay (GCJR), which slices failure-relevant events from an execution dependency graph, constructs graph-feasible singleton and pair candidates, and verifies them by replay with paired clean counterparts. For fixed replay outcomes, GCJR is exact within its declared graph domain. On 90 in-scope cases from a 120-DAG controlled benchmark, GCJR achieves 1.000 Family Exact Match while reducing mean replay calls from 56.3 to 25.3 (55.1%) relative to exhaustive search. On a 24-case, four-agent LLM pilot, it again achieves 1.000 Family Exact Match and reduces mean model calls from 21.0 to 10.0 (52.4%); single-event replay misses jointly necessary repairs.
Read the full abstract

All authors Bingjie Li, Yumeng Song, Zhongming Yao, Tianyi Li

Computer Vision

Using Channel Representations in Regularization Terms: A Case Study on Image Diffusion

In this work we propose a novel non-linear diffusion filtering approach for images based on their channel representation. To derive the diffusion update scheme we formulate a novel energy functional using a soft-histogram representation of image pixel neighborhoods obtained from the channel encoding. The resulting Euler-Lagrange equation yields a non-linear robust diffusion scheme with additional weighting terms stemming from the channel representation which steer the diffusion process. We apply this novel energy formulation to image reconstruction problems, showing good performance in the presence of mixtures of Gaussian and impulse-like noise, e.g. missing data. In denoising experiments of common scalar-valued images our approach performs competitive compared to other diffusion schemes as well as state-of-the-art denoising methods for the considered noise types.
Read the full abstract

All authors Christian Heinemann, Freddie Åström, George Baravdish, Kai Krajsek, Michael Felsberg, Hanno Scharr

Statistical Mechanics

Ornstein-Uhlenbeck Process Driven by Multiple Dichotomous Noises

We study a generalized Ornstein-Uhlenbeck process driven by a superposition of $K$ independent dichotomous noises with arbitrary fixed amplitudes and switching rates. Unlike the classical Ornstein-Uhlenbeck process driven by equilibrium Gaussian white noise, the present system is governed by bounded nonequilibrium fluctuations with finite correlation times. We obtain exact expressions for the stationary position distribution and all cumulants, and show that the stationary state possesses an unexpectedly rich structure, including compact support, algebraic branch-point singularities, edge divergences, and multiple extrema. We establish a mapping onto a heterogeneous random-flight process with bounded jumps, yielding a transparent probabilistic interpretation of the stationary measure. We further analyze several limiting regimes, including the crossover to Gaussian statistics for large numbers of noise sources. For ensembles with exponentially-distributed quenched amplitudes, we derive exact disorder-averaged stationary distributions and show that disorder fundamentally alters the stationary state, producing exponential tails decorated by algebraic prefactors with non-trivial exponents.
Read the full abstract

All authors Silvio Kalaj, Dongho Lee, Enzo Marinari, Jae-Hyung Jeon, Pascal Viot, Gleb Oshanin

Programming Languages

Fine-grained Causal Reversibility for Asynchronous Channel-based Programming

Causal reversibility has emerged as an effective technique for debugging concurrent systems. In particular, rolling back and replaying a concurrent program with causal consistency has been found very helpful in debugging concurrency bugs. In channel-based communication, queue ordering creates dependencies that prevent causally independent actions from being rolled back and replayed. To enable efficient rollback and replay without being constrained by queue dependencies, it is necessary to analyse causal dependencies between messages in queues and reorder independent messages. This paper presents revGo, a core of the Go programming language assuming unbounded asynchronous channels. Our rollback-and-replay semantics allows us to reorder messages in the queue if they are not causally related in the forward execution. It is shown that reordering independent messages generates no configuration with non-reachable processes. By reordering independent messages, rollback and replay are implementable with minimality by assigning unique keys to communications.
Read the full abstract

All authors Shunya Oguchi, Shoji Yuen, Nobuko Yoshida, Claudio Antares Mezzina

Combinatorics

Eulerian triangle is totally positive of order 3

Brenti conjectured that the Eulerian triangle is totally positive. In this paper, we prove that the Eulerian triangle is totally positive of order 3, thereby providing a partial affirmative answer to Brenti's conjecture. In addition, we establish total positivity of order 3 for several families of generalized Eulerian triangles.
Read the full abstract

Artificial Intelligence

Computational Depth Measurement in Thermographic Video: Overcoming Spatial Overfitting via Spatio-Temporal Decoupling

Accurate through-thickness measurement of subsurface delamination depth in Carbon Fiber Reinforced Polymer (CFRP) is important for structural assessment because defect location determines affected load-bearing layers. Optical pulsed thermography (OPT) provides a two-dimensional thermal video rather than volumetric measurements, so depth must be inferred from temporal heat-diffusion responses. A challenge is spatial dataset bias: when calibration defects follow regular grids, regression models may memorize their geometry instead of learning physical relationship between thermal decay and depth. This work introduces a spatio-temporal decoupling architecture that separates spatial defect localization from temporal depth measurement. Defect regions are first localized using segmentation methods, after which thermal responses are spatially averaged and converted into sixteen physics-informed temporal, energy, statistical, and geometric features. These features expose the one-dimensional heat-conduction relationship while withholding pixel coordinates from the depth model. Four regression models are evaluated using specimen-level cross-validation: Random Forest (RF), Gradient Boosting Machine (GBM), Advanced Multi-Layer Perceptron (Adv-MLP), and XGBoost. Unregularized trees and over-parameterized Adv-MLP exhibit calibration collapse under geometric shifts, with errors exceeding 0.5 mm. In contrast, regularized XGBoost with L1/L2 penalties and column sampling maintains cross-specimen calibration, achieving a mean absolute error (MAE) of 0.056 mm and root mean square error (RMSE) of 0.085 mm. Predicted depths are merged with masks to generate Delaunay-triangulated three-dimensional defect models in three to five seconds per specimen. Results show that mathematical regularization and spatio-temporal decoupling reduce spatial memorization in thermal-video depth regression.
Read the full abstract

Optimization and Control

Risk-averse design optimization with CVaR constraints via multifidelity tail-region correction

Risk-averse design optimization with conditional value-at-risk (CVaR) constraints requires accurate tail estimates, but repeated high-fidelity (HF) evaluations are costly. We propose a multifidelity (MF) tail-region correction method that uses dimensionally decomposed generalized polynomial chaos expansion (DD-GPCE) as a global surrogate and directs a limited HF budget to responses that most strongly influence CVaR. Covariance of the estimated DD-GPCE coefficients quantifies finite-sample prediction uncertainty and defines a confidence-interval-based tail region. Within this region, a two-stage strategy explores locations with high prediction uncertainty and then exploits locations with large correction-induced shifts. A Tikhonov-regularized residual expansion using the same polynomial basis yields a unified tail-corrected surrogate. For a ten-bar truss, the method produced a design close to the crude-MCS reference with approximately 72 to 274 times fewer HF evaluations than the considered MF importance sampling configurations. For a suction valve, it reduced mass by 1.05% and bending and bulging CVaR by 17.68% and 21.53%, respectively, while satisfying the valve-opening requirement. The results demonstrate accurate, HF-sample-efficient CVaR-constrained design through localized MF correction.
Read the full abstract

Representation Theory

A pre-$(n+2)$-angulated category which is not $(n+2)$-angulated

We construct an explicit pre-$9$-angulated category which is not $9$-angulated, thereby giving a genuinely higher counterexample to the implication from pre-$(n+2)$-angulated to $(n+2)$-angulated. The underlying additive category is the category of finitely generated projective right modules over the preprojective algebra $\Pi(A_5)$ over $\mathbb F_2$. The construction is obtained by taking an odd power of the twisted complete comparison used by Chen-Liu-Lu-Zhang in their pre-triangulated counterexample and by showing that the resulting pre-$9$-angulation fails the higher mapping-cone axiom.
Read the full abstract

Computer Vision

SGPDFuse: Semantically-Guided Physics-Disentanglement General Multi-Modal Image Fusion

Multimodal image fusion (MMIF) aims to integrate complementary sensor data into a single representation that preserves intrinsic scene reality while eliminating environmental interferences. Most existing approaches rely on blind feature aggregation, which excels at signal accumulation but fails to distinguish essential content from physical degradations. We propose SGPDFuse, which bridges this gap by mapping inputs into a physics-disentangled structural representation via a Semantic-Physical Parametric Bridge (SPPB) built on pretrained vision foundation models, utilizing the Intrinsic-Variation principle to decouple invariant scene attributes from transient environmental factors. To guide this decomposition, we introduce a Semantic Alignment mechanism: we explicitly anchor the fused representation to salient semantic features in the same foundation model feature space via cosine similarity to preserve critical targets, while enforcing physical texture fidelity through Gram-matrix regularization to strictly eliminate unnatural artifacts. Extensive experiments demonstrate that SGPDFuse achieves state-of-the-art performance across infrared-visible, multi-focus, and multi-exposure benchmarks using a single architecture.
Read the full abstract

All authors Haozhen Wei, Chengjun Jiang, Yutong Guo, Xinrui Ju, Xingyuan Li, Xiang Chen, Jinyuan Liu

Group Theory

On Some More Problems from the Kourovka Notebook

We give solutions to several problems in combinatorial group theory recorded as open in the literature. Our main source is the Kourovka Notebook, although we also consider questions from elsewhere. All solutions were found with the assistance of large language models and checked by the authors.
Read the full abstract

Classical Analysis and ODEs

A Littlewood-Type Theorem for Harmonic Functions in Euclidean Half-Spaces

In 1927 J.E. Littlewood proved that, for bounded harmonic functions on the unit disc, the Fatou-type result, on the existence of almost everywhere boundary values through approach regions that are nontangential, will fail for any system of tangential approach regions that has the following two additional properties: It consists of curves ending at the various boundary points, and it is rotationally invariant. However, in 1984 A. Nagel and E.M. Stein, elaborating results of Rudin (1979) and Nagel, Rudin and Shapiro (1982), proved the existence of rotationally invariant systems of tangential sequences along which a Fatou-type result holds, i.e., along which every bounded harmonic function converges a.e. to its nontangential boundary values. Moreover, they extended their result to higher-dimensional Euclidean half-spaces. The Nagel-Stein result has prompted the question of formulating and proving a Littlewood type theorem that can also be applied to tangential approach regions which are sequential. In this paper we prove a Littlewood-type theorem for bounded harmonic functions in higher-dimensional Euclidean half-spaces, for systems of tangential approach regions which includes the sequential ones. This is the first result of this kind, apart from a recent result of ours whose setting is the unit disc. Indeed, in all the other results of Littlewood type, the tangential approach regions were required to be curvilinear or at least to possess a certain topological property that excluded the possibility that they could be sequential.
Read the full abstract

Functional Analysis

Fourier sampling on a lattice

We characterize the ambiguity in reconstructing bounded measurable sets from their Fourier transforms sampled on a lattice. For a full-rank lattice \(\mathcal L\subset\R^d\), we prove that two bounded measurable sets have identical indicator Fourier transforms on \(\mathcal L^*\) if and only if they are equidecomposable, modulo null sets, into finitely many measurable pieces by translations in \(\mathcal L\). If the sets are connected finite unions of convex bodies and no two distinct points of either set are congruent modulo \(\mathcal L\), we show that this equidecomposition reduces to a single translation by a vector of \(\mathcal L\). In particular, two such sets that are symmetric about the origin must coincide. We also construct counterexamples in dimensions two and three to a conjecture of the second author, which had a similar hypothesis, but lacked the anti-aliasing hypothesis. Together with the first author's counterexamples in dimensions at least four, these show that the conjecture fails in every dimension $d\geq 2$. The positive results here are an outgrowth of refinements of this conjecture.
Read the full abstract

Dynamical Systems

Maximizing Families and Typical Periodic Optimization for Almost Additive Sequences

In this paper, we study typical periodic optimization (TPO) for almost additive potentials in two perturbation spaces. Our main setting is the Banach quotient $\mathcal E_{\rm orb}(X,T)$ of orbit-Lipschitz almost additive potentials, where we extend the theory of maximizable sets and countable maximizable families developed by W. Huang, O. Jenkinson, L. Xu and Y. Zhang [Typical periodic optimization for dynamical systems: symbolic dynamics, Invent. Math. 245 (2026), 1–63], and establish a global structural theorem. For a countable maximizable family, global TPO holds if every non boundary member has $X$-extendable TPO and the boundary region has empty interior. As an application, we construct a compact system with global TPO for which $\mathcal E_{\rm orb}(X,T)$ is infinite-dimensional and the maximizing periods in open locking regions are unbounded. For a fixed almost additive potential $\Phi$, we also develop relative TPO theory on its Lipschitz leaf. When $\Phi=0$, this framework reduces to classical Lipschitz TPO. We prove the corresponding leafwise structural theorem and give a non additive rank-one matrix example on a full shift.
Read the full abstract

Computation and Language

Attribute-Based Activation Steering of LLMs for Group-Specific Explanation Generation

To effectively enable people to understand new topics, explanations should be tailored to their backgrounds and abilities. Prompting alone has been shown to be insufficient for creating such explanations, and other computational methods are missing so far. Therefore, this paper investigates whether LLMs can be steered to generate explanations that are tailored to a specific group of people. To this end, we propose an approach that first identifies group-specific attributes in terms of explanatory style and knowledge of a specific target group. Building on activation engineering, it then computes attribute-based steering vectors and adds them to the internal activations of an LLM during inference to enable a fine-grained steering. In our experiments, we assess the steering effectiveness in terms of specificity and factuality of the generated explanations. Additionally, we evaluate the explanations in a study with human experts from different target groups. Compared to prompting and state-of-the-art steering baselines, our approach tailors the explanations significantly better to the target group while maintaining the best specificity-factuality balance.
Read the full abstract

Signal Processing

Sound Analysis for Speed Estimation of Induction Motors Under Non-Stationary Conditions

This paper presents a novel methodology for the estimation of the rotational speed of induction motors operating under non stationary conditions, using acoustic signals acquired by a low cost microphone. The proposed approach integrates multi rate digital signal processing with advanced time frequency analysis to extract speed dependent harmonic components from motor acoustic emissions, while effectively suppressing electrical interference and electromagnetic noise. Numerical simulations and experimental validations are conducted under both steady state and transient operating conditions, considering a wide variety of speed profiles, including slow ramps and abrupt speed variations. The experimental results demonstrate that the proposed method is capable of accurately tracking rapid and dynamic speed changes caused by load disturbances and mechanical irregularities. The estimated instantaneous speed exhibits a high degree of agreement with reference measurements obtained from a conventional speed sensor. The results confirm that the proposed acoustic based technique provides a reliable, noninvasive, and cost effective solution suitable for speed monitoring of induction motors.
Read the full abstract

High Energy Physics (Theory)

One-loop renormalization group flow of the translation-invariant noncommutative Yukawa theory

We study the one-loop renormalization group flow of the translation-invariant noncommutative pseudoscalar Yukawa theory on four-dimensional Euclidean Moyal space. The two inequivalent orderings of the Moyal-star Yukawa vertex give rise to two independent couplings $g_{1}$ and $g_{2}$, whose beta functions form a coupled nonlinear system; every one-loop divergence is absorbed by a counterterm already present in the action, establishing one-loop renormalizability of the theory. We solve the one-loop system analytically: it decouples in the variables $u=g_{1}^{2}+g_{2}^{2}$ and $v=g_{1}^{2}-g_{2}^{2}$, the quartic coupling is obtained by a Riccati reduction on the symmetric surface $g_{1}=g_{2}$, and the generic asymmetric flow is reduced to a single quadrature by the exact invariant $\mathcal{I}=(g_{1}g_{2})^{3}/(g_{1}^{2}-g_{2}^{2})^{4}$. Two dynamical consequences follow. The ratio $r=v/u$ has a UV-attractive symmetric surface $r=0$ and IR-attractive asymmetric directions $r=\pm1$, so that the flow restores the symmetry between the two Moyal orderings towards the ultraviolet and amplifies any initial ordering asymmetry towards the infrared, as a fractional power of the logarithm. In consequence the Yukawa-induced coefficient of the non-planar $1/(\theta^{2}p^{2})$ structure is dynamically suppressed towards $p\rightarrow 0$; the singularity itself is not removed, and remains the task of the IR-improving term. We also solve the dimensionful sector ($M^{2}$, $m$, $a^{2}$ and $b$) in closed form on the symmetric critical trajectory, and compare throughout with the commutative theory.
Read the full abstract

Cryptography and Security

Asymmetric Phase Coding Video Watermarking

Existing video watermarking systems are symmetric: the party that can verify a mark holds the extractor weights or generator secret and can therefore also embed one. Benchmarks confirm the consequence, reporting that white-box forgery defeats all evaluated methods. We present a training-free video watermark that removes the shared secret. The signer embeds a complete Ed25519 signature into the phase spectrum of the chroma plane; any party holding the 32-byte public key and public per-video metadata verifies offline, with no model, no registry, and no network. The payload, 1024 bits of signed message with error correction, is an order of magnitude above common learned payloads and is carried by three design elements: a run-length temporal layout whose decoder identifies payload groups by correlation and never reads a frame index, a payload-free search that recovers scale, rotation, and translation from the carrier itself, and a closed-loop signing procedure that selects each video's embedding strength by self-verification through the unchanged public verifier. On 1000 uncurated real-world clips the system ships a verifying signature for 99.3% of the corpus and accepts a wrong public key zero times in 1000 attempts. An attack-aware acceptance gate yields embeddings that survive H.264 re-encoding at 100% and 50% rescaling at 97.4% on gated clips. The signature also verifies through a real display and capture loop, an axis absent from published evaluations.
Read the full abstract