Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Monday 31 August

Computer Vision

MCSeg: Pre-training and Fine-tuning Volumetric Pyramid Transformer for Multi-modal Cardiac Image Segmentation

Automatic cardiac image segmentation is pivotal for diagnosing and treating cardiac diseases. In this work, we introduce MCSeg, a volumetric transformer-based network tailored for multi-modal cardiac segmentation. To overcome the architectural mismatch inherent in existing hybrid networks, we propose a novel Scaling Feature Pyramid (SFP). Unlike conventional skip connections, the SFP effectively bridges the single-scale 3D Vision Transformer (ViT) encoder and the multi-scale CNN decoder by transforming the ViT's output into a hierarchical feature pyramid, ensuring that global contextual information is effectively leveraged. For the training paradigm, the ViT encoder first undergoes self-supervised pre-training via masked image modeling. Subsequently, the network is fine-tuned on downstream tasks, during which a regional mutual information (RMI) loss is integrated to improve boundary segmentation accuracy. In experiments, MCSeg consistently outperforms eleven SOTA methods on CT dataset ImageCHD, multi-modal dataset MM-WHS, MRI dataset HVSMR-2.0 and MSD Heart, highlighting the effectiveness of our MCSeg for multi-modal cardiac segmentation tasks. Furthermore, MCSeg's superior performance in few-shot experiment showcases its significant potential in adapting to limited data scenarios. Codes and pre-trained ViT-B weights are open-sourced at https://openi.pcl.ac.cn/OpenMedIA/MCSeg
Read the full abstract

Quantum Physics

Marginal spectral distributions on regular bipartite unitary orbits

Fix the spectrum of a bipartite density matrix and randomize its eigenbasis according to Haar measure. We study the probability distributions induced on the spectra of the two marginal states. For arbitrary subsystem dimensions $m$ and $n$, the joint characteristic function of the reduced density matrices is expressed as a Harish-Chandra-Itzykson-Zuber integral whose external eigenvalues are the pairwise sums $x_i + y_j$. Repeated external eigenvalues are handled by confluent determinant limits. In the two-qubit case, we derive an explicit alternating-spline formula for the joint density of the two marginal Bloch radii. Its support is the Bravyi-Klyachko compatibility region. We also obtain a compact truncated-power formula for the Bloch-radius density of either individual qubit marginal. In the qubit-qutrit case, we derive a truncated-power formula for the qubit Bloch-radius density and a bivariate spline formula for the joint density of the largest and smallest eigenvalues of the qutrit marginal. The latter two variables determine the full qutrit spectrum because the trace is fixed. The derivations combine confluent HCIZ integrals, distributional Fourier inversion, orbital measures, and the SU(2) and SU(3) derivative principles. The resulting densities are piece-wise polynomial on chambers determined by subset sums of the fixed global eigenvalues, in agreement with the Duistermaat-Heckman description of projected coadjoint-orbit measures.
Read the full abstract

Artificial Intelligence

Augmenting Human Performance with an XR Agent Learning from Online Behavior and BCI Evidence

We present OLIVE, a framework for adapting a foundation model to provide real-time assistance in temporally demanding, high-stakes, and dynamic tasks. We show that passive EEG, fused online with behavioral evidence, can meaningfully extend the number of targets users detect and engage beyond their unaided action bandwidth. OLIVE learns from both explicit behavioral signals (the targets the user shoots down in an XR first-person shooter game) and implicit physiological signals (fixation-locked EEG) to provide timely guidance, continuously adapting a frozen vision-language model's inference on which items are task-relevant by jointly estimating per-source reliability without manual labels or offline training. Through three user studies, including two live deployments of an assistive agent driven by OLIVE in XR, we show that OLIVE Pareto-dominates prior test-time adaptation frameworks, achieving the highest convergence rate at comparable convergence speed. Combining implicit physiological and explicit behavioral signals, the OLIVE agent produces the largest and most reliable within-session improvement to a user's ability to detect and engage targets, largely independent of the individual's skill. When the target switches silently, the agent that uses both behavioral and physiological signals reconverges significantly faster than the behavior-only agent (1.27 times faster on average, p = .008), restoring trustworthy guidance at the moment the task changes, precisely when reliable assistance matters most.
Read the full abstract

All authors Ziheng Li, Xichen He, Haoyan Chen, Charlie Zou, Sheng Bai, Benjamin Yang, Mengyuan Wu, Jake Ledner, Yi-Jie Cheng, Akito Yamauchi, Dishita G Turakhia, Steven Feiner, Paul Sajda

Robotics

SpectraTac: A Compact Camera-Free Optical Tactile Sensor with Distributed Color Sensing

Tactile sensing is essential for physical interaction in robotics and human–machine systems. However, combining rich tactile information with compact hardware, low cost, and low computational overhead remains challenging. This work presents SpectraTac, a compact, camera-free optical tactile sensor that combines active red–green–blue (RGB) illumination with spatially distributed color sensing. Contact deforms a compliant transparent elastomer and modulates its internal light field, producing spatially differentiated changes in color and intensity. Three distributed color sensors capture these responses as low-dimensional spatio-spectral features, avoiding cameras, imaging optics, and high-dimensional image processing. The device measures 19.2 mm in diameter and 4 mm in height, with a material cost below USD~5. A data-driven decoding framework simultaneously estimates three-dimensional (3D) force and the contact region from the optical measurements. For 3D force prediction, the sensor achieved mean absolute errors (MAEs) of 0.161, 0.164, and 0.429 N along the x-, y-, and z-axes, respectively. The nine-region contact-classification accuracy was 99.9%. We further evaluated real-time 3D force tracking and contact-region-based human–machine interaction through an interactive control task. These results indicate that distributed color-resolved optical sensing offers a compact, low-cost alternative to camera-based tactile sensing for robotics, wearable sensing, and interactive systems.
Read the full abstract

All authors Hao Wu, Haotian Guo, Yu Feng, Yutong Wang, Yanzhe Wang, Jianshu Zhou

Machine Learning

Beat-Synchronous Tokenization for ECG Transformers

Transformer-based electrocardiogram (ECG) models commonly tokenize waveforms into fixed temporal patches. Though convenient, fixed patching can split heartbeat structures across token boundaries. We study beat-synchronous tokenization as a physiologically grounded alternative, comparing fixed patches with three beat-aligned strategies: resampled beats, adaptive pooled beats, and resampled beats augmented with R–R interval information. Experiments span two settings: 10-second 12-lead diagnostic classification on PTB-XL after MIMIC-IV-ECG masked pretraining, and 60-second single-lead rhythm classification on Icentia11k after patient-level contrastive pretraining. On PTB-XL, resampled beat tokens achieve the highest mean macro Area Under the ROC Curve (AUROC; 0.8945) and nearly match the best fixed-patch macro Area Under the Precision-Recall Curve (AUPRC; 0.7414), reducing average sequence length from 100 to 11.2 tokens. On Icentia11k, beat-synchronous tokenizers obtain comparable AUPRC to fixed patching with better stability across runs. These results suggest morphology-preserving beat tokenization is a compact, competitive alternative to fixed temporal patching.
Read the full abstract

All authors Ahmed Sameh, Nolan Wilson, Max Enderlein, Yogatheesan Varatharajah

Machine Learning

Mode Connectivity Beyond Classifiers: Evidence from Generative and Contrastive Models

The loss landscape of Deep Neural Networks (DNNs) exhibits highly complex and non-convex properties. Recent studies have revealed the phenomenon of mode connectivity, demonstrating that independently trained network modes can be connected via a continuous low-loss path. However, existing mode connectivity research is predominantly confined to classifier-based models, leaving it an open question whether similar geometric properties exist in modern complex models. In this paper, we extend the boundaries of mode connectivity to generative and contrastive domains (specifically DDPM and NanoCLIP). Addressing the unique architecture of DDPM and CLIP, we propose an architecture-aware connection building algorithm. Extensive empirical results demonstrate for the first time that we successfully discover mode connectivity between independently trained DDPM and NanoCLIP modes. Our work provides a novel perspective for understanding the geometric properties of the loss landscapes in modern generative and contrastive models.
Read the full abstract

Metric Geometry

Continuity of the magnitude for finite metric spaces with nonnegative weightings

For finite metric spaces, magnitude is an invariant known to be discontinuous everywhere with respect to the Gromov-Hausdorff distance. While much of the literature focuses on positive definite metric spaces, here we consider finite metric spaces admitting a nonnegative weighting. In this paper, we focus on the class of finite metric spaces that admit a nonnegative weighting. This class includes ultrametric spaces, for which specific bounds on magnitude are known. We generalize these bounds by proving that, for any two finite metric spaces with nonnegative weightings, the ratio of their magnitudes is exponentially bounded by their Gromov-Hausdorff distance. Consequently, we show that within this class, the logarithmic magnitude function is Lipschitz continuous, and the magnitude function itself is locally Lipschitz continuous, but not Lipschitz continuous.
Read the full abstract

Machine Learning

Beyond Churn: Predicting Financial Fragmentation in Retail Banking with Temporal Machine Learning

Retail banking attrition is usually represented as a terminal binary event, even though client relationships often weaken earlier through partial movements of deposits, investments, and recurring activity to external financial institutions. This paper defines that preceding state as financial fragmentation and presents an end-to-end temporal machine-learning system for predicting it before complete disengagement. Using anonymized multi-source data from a large retail bank, the framework predicts whether a valid external transfer or investment event will occur within 90 days. The study uses 595,220 client-month observations, with 346 engineered features combining monthly client profiles, balances, product relationships, prior flow-of-funds behavior, macroeconomic conditions, and competitor activity. A four-stage XGBoost cascade estimates (1) whether an external outflow will occur within 90 days, (2) the expected amount, (3) the originating product, and (4) the destination financial institution. The primary classifier achieved a test precision-recall area under the curve of 0.823. At the validation-selected threshold, it produced 86.4% precision, 75.1% recall, and an F1 score of 0.803. Ranking test observations in descending Stage 1 fragmentation score, the top 1% of clients yielded 95.3% precision, while the top 5% captured 78.7% of observed outflow cases. The amount model placed 94.9% of predictions within an adjacent amount bucket. Destination prediction reached a macro-F1 of 0.81 across 27 classes; source-product prediction achieved a weighted F1 of 0.92. By moving the analytical focus from terminal churn to earlier fund migration, the proposed approach provides a practical foundation for proactive, explainable, and economically informed client-retention decision support.
Read the full abstract

All authors Ananyaa Chopra, Brandon Xu, Brendan Yuen, Lauren Zung, Sarabroop Aulakh

Quantum Physics

Quantum Imaginary Time Evolution on an Infinite 1D Chain

We introduce a quantum-circuit algorithm for performing imaginary-time evolution on infinite one-dimensional lattice systems. The method uses a parameterized quantum circuit to represent a uniform matrix product state ansatz. We derive the ITE algorithm using the time-dependent variational principle and employ the quantum Lanczos algorithm to improve the ground-state energy estimate. As a benchmark, we simulate the transverse-field Ising model using both classical simulators and IBM Quantum devices. Our analysis includes a statistical study of the distributions of the cost function and energy density obtained from quantum measurements, illustrating the effects of finite-sampling noise on convergence.
Read the full abstract

Artificial Intelligence

Will the User Ever Know? Covert Indirect Prompt Injection Attacks on Tool-Using LLM Agents

As LLM agents take real-world actions through tools, indirect prompt injection (IPI) has emerged as a serious threat. The standard metric, Attack Success Rate (ASR), counts whether an injection succeeds but ignores what the user notices in the agent's final response. Looking at successful injection traces, we find two distinct outcomes: the agent executes the injection while returning an otherwise normal response, or reports the injected action in its final response, giving the user a chance to notice. We call these covert and overt successes. From the user's perspective, we decompose ASR into the Covert Success Rate (CSR), counting successes leaving no trace in the final response, and the Overt Success Rate (OSR), counting successes the user can detect. To understand what drives the gap, we analyze successful trajectories and find that the agent's behavior after the injection separates covert from overt: covert traces hand control back to the user task before ending, while overt traces end at the attack itself. This split follows from the ReAct format, where the final response summarizes the most recent action. Building on this observation, we propose ICoA (Induced Covert Attack), an IPI attack designed to induce covert outcomes by steering the agent back to the user task after executing the injection. Across four target models on AgentDojo, ICoA achieves the highest CSR, with gains of 3.79-12.01 percentage points over the strongest baseline.
Read the full abstract

High Energy Physics (Experiment)

Search for proton decay into a single charged antilepton and a massless invisible particle using the full pure water data set of Super-Kamiokande

A search for proton decay via $p\rightarrow l^{+}+X$, where $l^{+}$ is a positively charged lepton and $X$ is an invisible, massless, neutral particle, was performed using a 401~kton$\cdot$years exposure representing the entire pure water phase of Super-Kamiokande. No significant indication of a proton decay was observed beyond the expected atmospheric neutrino background. Lower limits on the partial lifetime of the proton were set to at $1.72\times10^{33}$ years for $p\rightarrow e^{+}+X$ and $0.61\times10^{33}$ years for $p\rightarrow \mu^{+}+X$ at the $90\%$ confidence level. These results improve on previous limits by factors of 2 and 1.5, respectively.
Read the full abstract

All authors Super-Kamiokande Collaboration: Y. M. Liu, K. Terada, K. Abe, Y. Asaoka, M. Harada, Y. Hayato, K. Hiraide, T. H. Hung, K. Ieki, M. Ikeda, J. Kameda, Y. Kataoka, S. Mine, M. Miura, S. Moriyama, K. Nakagiri, M. Nakahata, S. Nakayama, Y. Noguchi, G. Pronost, K. Sato, H. Sekiya, R. Shinoda, M. Shiozawa, Y. Suzuki, A. Takeda, Y. Takemoto, H. Tanaka, S. Chen, Y. Itow, T. Kajita, R. Nishijima, K. Okumura, T. Tashiro, T. Tomiya, X. Wang, F. J. de Garay Arcones, P. Fernandez, L. Labarga, D. Samudio, C. Yanagisawa, B. Jargowsky, E. Kearns, J. Mirabito, L. Wan, T. Wester, B. W. Pointon, J. Bian, B. Cortez, N. J. Griskevich, Y. Jiang, M. B. Smy, H. W. Sobel, V. Takhistov, J. Hill, B. D. Xu, D. Jung, D. H. Moon, R. G. Park, B. S. Yang, K. Scholberg, C. W. Walter, O. Drapier, A. Ershova, M. Ferey, Z. Hu, E.~Le Blévec, T. Leplumey, Th. A. Mueller, P. Paganini, C. Quach, R. Rogly, T. Nakamura, J. S. Jang, R. P. Litchfield, L. N. Machado, F. J. P. Soler, J. G. Learned, K. Choi, S. Cao, T. V. Ngoc, L. H. V. Anthony, N. W. Prouse, M. Scott, Y. Uchida, V. Berardi, N. F. Calabria, M. G. Catanesi, N. Ospina, E. Radicioni, A. Langella, G. De Rosa, G. T. Burton, G. Collazuol, M. Feltre, M. Mattiazzi, L. Ludovici, M. Gonin, L. Périssé, B. Quilain, M. Fukazawa, S. Horiuchi, A. Kawabata, Y. Maekawa, Y. Nishimura, A. Oka, H. Tanigawa, R. Akutsu, M. Friend, T. Hasegawa, Y. Hino, T. Ishida, T. Kobayashi, T. Matsubara, T. Nakadaira, Y. Oyama, A. Portocarrero Yrey, K. Sakashita, T. Sekiguchi, N. Bhuiyan, F. Di Lodovico, T. Katori, R. Kralik, N. Latham, R. M. Ramsden, V. Siccardi, S. Aoyama, H. Bambara, Y. Inaba, H. Ito, M. Nishigami, T. Sone, A. T. Suzuki, Y. Takeuchi, S. Wada, H. Zhong, J. Feng, L. Feng, N. Fujimoto, S. Han, J. Hikida, M. Kawaue, T. Kikawa, F. Nakanishi, T. Nakaya, R. A. Wendell, S. J. Jenkins, N. McCauley, M. Fanì, M. J. Wilking, Z. Xie, Y. Fukuda, H. Menjo, Y. Yoshioka, J. Lagoda, J. Zalipska, T. Yano, M. Mori, J. Jiang, Y. Asano, K. Hamaguchi, H. Ishino, Y. Koshio, S. Ohshita, T. Tada, T. Ishizuka, G. Barr, D. Barrow, D. Wark, A. Holin, F. Nova, M. Jo, S. Jung, J. Yoo, L. Kneale, T. Peacock, P. Stowell, H. Okazawa, S. M. Lakshmi, S. Hong, E. Kwon, M. W. Lee, J. W. Seo, I. Yu, Y. Ashida, A. K. Ichikawa, S. Kobayashi, K. D. Nakamura, S. Abe, W. Cai, Y. Endo, S. Goto, S. Kodama, Y. Kong, H. Hayasaki, Y. Masaki, Y. Mizuno, T. Muro, K. Nakagiri, Y. Nakajima, M. Sekiyama, N. Taniuchi, T. Yamazumi, M. Yokoyama, P. de Perio, S. Fujita, C. Jesús-Valls, K. Martens, Ll. Marti, A. D. Santos, K. M. Tsui, M. R. Vagins, S. Izumiyama, M. Kuze, R. Matsumoto, C. Ise, M. Ishitsuka, M. Sugo, M. Wako, K. Yamauchi, Y. Nakano, A. Yankelevich, F. Cormier, R. Gaur, M. Hartz, A. Konaka, X. Li, B. R. Smithers, S. Chen, Y. Wu, A. Q. Zhang, B. Zhang, H. Adhikary, M. Girgus, P. Govindaraj, M. Posiadala-Zezula, Y. S. Prabhu, S. B. Boyd, R. Edwards, D. Hadley, M. O'Flaherty, B. Richards, A. Ali, B. Jamieson, C. Bronner, D. Horiguchi, A. Minamino, Y. Sasaki

Applied Physics

Arctic Dispersion Interruption Phenomenon and Sound Source Depth Estimation

The sound speed profile in the deep Arctic Ocean causes the surface layer to form a normal mode waveguide. When the depth of the sound source or receiver is near a node of the eigenfunction, the source cannot excite the mode, or the receiver cannot detect it, resulting in the modal amplitude at the receiver being approximately zero. This manifests as a dispersion interruption in the dispersion structure, which can be observed through time-frequency analysis of the received acoustic signal. Based on the interruption frequency identified from the received signal, combined with the relationship between node depth and modal frequency calculated from the ocean sound speed profile, the source depth can be estimated if the receiver depth is known. The phenomenon of dispersion interruption and the method of estimating source depth have been validated through simulations and experiments.
Read the full abstract

All authors Weng Jinbao, Yang Yanming, Chen Benqing, Xu Dewei, Zhou Hongtao

Materials Science

Real-space overlap is not enough: ambiguity in nanobeam iterative ptychography

High-resolution iterative ptychography typically relies on a well-aligned, high-convergence-angle electron probe. Here we explore whether it can instead be performed at small convergence angles, relaxing the need for probe correctors and enabling experiments at low accelerating voltages or with a de-excited objective lens, as in Lorentz mode. Through experiments and simulations, we show that once the convergence angle is small enough that no diffracted disks overlap, the resulting reconstruction is ambiguous, posing a significant challenge for robust interpretation of results. This challenge arises because of the lack of interference between Bragg disks in the recorded diffraction pattern intensity, leading to no phase information for each reflection. Reconstructions with these data lead to degenerate objects in which rigid translations of the lattice and reversals of contrast of the object produce the same error between experimental data and the ptychography forward model. Increasing the real-space overlap between probe positions does not lift this degeneracy. An amorphous substrate can supply the missing phase relationships by giving the Bragg beams support in the gaps between disks. This phasing is fragile, however, and survives only where the forward model matches the experiment. At fixed dose, either constraining the object to be a pure phase object or introducing thermal motion into the forward model is enough on its own to make the solution non-unique, highlighting why our experimental reconstructions below the overlap threshold are ambiguous despite ample dose and real-space redundancy. Most troublingly, the lattice spacing and orientation are always recovered correctly, so a non-unique reconstruction looks convincing and can be diagnosed only by repeating the reconstruction from different starting points.
Read the full abstract

All authors Stephanie M. Ribet, Mohsen Danaie, Willem P.M. de Kleijne, Arthur R. C. McCray, Frederick Allars, Christopher S. Allen, Colin Ophus, Georgios Varnavides

High Energy Astrophysical Phenomena

Hunting the nature of the Seyfert 1 galaxy GRS 1734-292: can it be a gamma-ray emitter?

It has been proposed that the radio-weak Seyfert galaxy GRS 1734-292 is the counterpart of 3EG J1736-2908 and of the nearby Fermi/LAT source. I examine this identification, considering that the radio weakness could result from free-free absorption of a relativistic jet. An association with the EGRET detections is plausible, whereas the latest Fermi/LAT localization no longer favors GRS 1734-292. New observations, especially at radio frequencies of tens of GHz, would help to settle the issue.
Read the full abstract

Probability

Mean convergence for Banach space-valued random elements indexed in measure spaces

This article studies mean convergence of Banach space-valued random elements indexed in a family of finite measure spaces. We derive $L^p$-convergence theorems under (compact) uniform integrability in two regimes: a decaying-index-mass regime and a bounded-index-mass regime, the latter requiring a new dependence structure which is called diagonal negative dependence for the random elements and expressed via the self-product of the index measure. We provide examples showing that the conditions to obtain the results are sharp and strictly weaker than related conditions in the literature. As a further illustration for the index measure space framework, a functional law of large numbers in $L^p$ on the space of continuous functions is derived, where the random elements are solutions of stochastic differential equations driven by Brownian motions extracted from a common Brownian sheet.
Read the full abstract

Nuclear Theory

Quantum information in neutron-proton scattering from the $M$ matrix

We study quantum-information aspects of neutron–proton scattering in the spin-space $M$-matrix framework. Four representative classes of input states are considered, namely diagonal mixed states, separable pure states, general two-qubit pure states, and a special Schmidt-like entangled subclass. For each class, ensemble-averaged output mutual information, reduced-state linear entropy, negativity, and geometric quantum discord are calculated in the relative momentum– scattering angle plane. The results show that the outgoing spin correlations are governed jointly by scattering kinematics and by the structure of the incoming quantum ensemble. Input states with stronger intrinsic coherence or entanglement give larger maxima and higher minima in the mutual information, negativity, and geometric quantum discord. The enhanced regions of the mutual information and geometric discord depend on the input states, while the negativity maximum remains concentrated in the high-momentum backward-scattering region. These results extend earlier studies based on product-state entanglement power and provide an ensemble-based description of how spin correlations in neutron–proton scattering arise from the interplay between input-state structure and scattering dynamics.
Read the full abstract

All authors Linjun Xie, Jinniu Hu, Ying Zhang, Hong Shen

Computer Vision

Seeing the Unseen: Camouflaged Object Detection Beyond the Visible Spectrum

Recent advances in camouflaged object detection (COD) have led to substantial progress in challenging low-visibility scenarios, with pioneering studies demonstrating notable success in localizing objects in camouflaged scenes. Despite these achievements, existing approaches predominantly rely on conventional three-channel RGB imagery, thereby constraining the available visual information to a limited spectral range. Multispectral images offer a wide range of information about a scene by capturing fine-grained spectral signatures. Hence, by leveraging multispectral images for COD, we introduce a novel approach to detect camouflaged objects from the corresponding multispectral inputs. In particular, we propose an end-to-end framework, \textbf{MSFormer}, that takes a multispectral camouflaged image as input and predicts a binary mask for it. Additionally, we also provide empirical justification for integrating multispectral bands for this complex low-vision task. Our extensive experiments demonstrate the effectiveness of our method, which outperforms existing methods.
Read the full abstract

Combinatorics

Maximal anti-Ramsey problems for posets

We study the forbidden poset analog of the maximal anti-Ramsey problem introduced for graphs by Burr, Erd\H os, Graham, and Sós. For integers $m\le 2^n$ and poset $P=(P,\preceq)$, we introduce $\mathrm{ar_m}(n,m,P)$ (and $\mathrm{ar^*_m}(n,m,P)$) to denote the minimum integer $k$ such that there exists a family $\mathcal{F}\subseteq 2^{[n]}$ with $|\mathcal{F}|=m$ and a coloring $\mathcal{F}\rightarrow [k]$ with all weak (strong) copies of $P$ being rainbow. As long as there exist $P$-free families of size $m$, these parameters equal 1. It is known that the largest size $La(n,P)$ ($La^*(n,P)$) of weak (strong) $P$-free families has order of magnitude $\Theta(\binom{n}{\lfloor n/2\rfloor})$ unless $P$ is the antichain $A_k$ on $k$ elements. In this paper we study $\mathrm{ar_m}(n,m,P)$ and $\mathrm{ar^*_m}(n,m,P)$ in two regimes of $m$. We determine the asymptotics of these parameters for all posets $P$ when $m=2^n$. We also consider the case $m=\Theta(\binom{n}{\lfloor n/2\rfloor})$. It is shown that for any connected poset $P$ and integer $k$, there exist integers $m_{P,k}$ and $m^*_{P,k}$ such that to color the middle $k$ layers of the Boolean lattice with all weak or strong copies of $P$ being rainbow, one needs $\Theta(n^{m_{P,k}})$ or $\Theta(n^{m^*_{P,k}})$ colors. For tree posets $T$, one has $m_{T,k}=m^*_{T,k}$. We conjecture that for any tree poset $T$, and positive real $\varepsilon$, $\mathrm{ar_m}(n,m,T),\mathrm{ar^*_m}(n,m,T)=\Omega(n^{m_{T,k}})$ holds provided $m\ge (k-1+\varepsilon)\binom{n}{\lfloor n/2\rfloor}$. We prove our conjecture on $\mathrm{ar_m}(n,m,T)$ for an infinite class of tree posets.
Read the full abstract

Combinatorics

An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision

Smith's conjecture asserts that in every $k$-connected graph with $k\geq 2$, any two longest cycles intersect in at least $k$ vertices. In this work, we establish an $\Omega(k^{8/11})$ bound for this conjecture, improving upon the $\Omega(k^{2/3})$ bound of Ma and Zhao. Our proof combines a Ramsey theoretic refinement of the traditional Turán-type approach with computer search.
Read the full abstract

Artificial Intelligence

Co-Annotator: Expert-Distilled ViT and VLM for Visual and Documentation Guidance in Age-Related Macular Degeneration

Clinical AI often optimizes predictive performance without engaging how clinicians decide where to look and what to write. We present Co-Annotator, which distills expert gaze and dictation into two guidance components: a gaze-aligned Vision Transformer producing fixation-aligned areas of interest (AOIs), and an ontology-bounded vision-language model (VLM) that pre-fills editable biomarker summaries for retinal optical coherence tomography (OCT). We first collect expert gaze and dictations (US1) to train the models, significantly improving diagnostic accuracy and biomarker generation. We then deploy the system with ophthalmology residents: a controlled resident study (US2) confirmed each modality is safe and independently beneficial, with AOI guidance producing lasting perceptual efficiency gains through post-guidance carryover and VLM guidance more than doubling biomarker documentation breadth. In a combined deployment across two academic institutions (US3), providing both modalities simultaneously produced efficiency gains that substantially exceeded either modality alone: correct diagnoses per minute increased by 40% and comment editing time fell by 67%, without compromising diagnostic accuracy. Notably, neither modality improved efficiency during guidance in US2, which makes the in-guidance efficiency gain under combined guidance in US3 the more striking result. Expert-distilled multimodal guidance can remove two distinct clinical workflow bottlenecks at once (visual search overhead and documentation burden) without compromising the diagnostic accuracy clinicians already achieve.
Read the full abstract

All authors Ziheng "Leo" Li, Benjamin Freeman, Akshay Raman, Kavin Aravindhan Rajkumar, Xinxin Fang, Rishabh Srivastava, Steven Feiner, Kaveri A. Thakoor

Computational Complexity

An Optimal Separation Between Certificate Complexity and Approximate Degree

We prove that certificate complexity can be quartically larger than approximate degree. More precisely, we construct a family of total Boolean functions $G$ with $$ C(G) = \tilde{\Omega}(\tilde{deg}(G)^4), $$ where $C$ denotes certificate complexity and $\tilde{deg}$ denotes $1/3$-approximate degree. This is optimal up to polylogarithmic factors, since every total Boolean function $f$ satisfies $C(f)\le O(\tilde{deg}(f)^4)$ by the classical block-sensitivity bounds of Nisan and Nisan–Szegedy. Thus the result closes the gap between these two measures and improves the previously best known separation $C(f)=\tilde{\Omega}(\tilde{deg}(f)^3)$ by Balodis, Ben-David, Göös, Jain, and Kothari. The construction starts from the partial function they used to quadratically separate $0$-certificate complexity from unambiguous $1$-certificate complexity. It already has the required certificate hardness, but its $0$-certificates are unstructured, which blocks the derivation of a low-degree verifier. We keep its $1$-condition and restrict the $0$-inputs to those certified by a structured family whose validity admits a low-degree approximant, while preserving the quadratic hardness. The partial function with its low-degree verifier is then fed through the cheat-sheet framework to yield the total function $G$ with the claimed separation. The main technical ingredient is an approximate polynomial that verifies the certificate in degree $\tilde{O}(\sqrt n)$. The verifier forms a low-degree count $W$ of the candidate $1$-certificates that remain compatible with the asserted $0$-certificate, and tests whether this count is zero. Crucially, the construction ensures that $W$ never exceeds $\tilde{O}(n)$, instead of the $\Theta(n^2)$ candidate pairs it counts bringing the verification down to degree $\tilde{O}(\sqrt n)$.
Read the full abstract

Representation Theory

GIT for root stacks and 3d mirror symmetry

Using window theory, Bodzenta–Donovan showed that the derived category of a root stack $\sqrt[n]{X/D}$ has a $2n$-periodic $2$-term semiorthogonal decomposition. We define a categorical generalization of the root stack construction and interpret this as a pullback on the B-side of the 3d mirror symmetry equivalence of Gammage–Hilburn–Mazel-Gee. We analyze this pullback using categorical representation theoretic results of Ben-Zvi–Francis–Nadler and Ben-Zvi–Nadler–Preygel applied to SODs. We also show that the pullback is equivalent to a pushforward of perverse schobers on the A-side, allowing us to deduce periodicity from a simple decomposition of an A-side Lagrangian skeleton. Additionally, we adapt the construction of Bodzenta–Donovan to a new GIT problem, which yields an embedding of Coh($\sqrt[m]{X/D}$) into Coh($\sqrt[n]{X/D}$) for $m<n$ coprime, and prove $2n$-periodicity of the resulting $2$-term SOD.
Read the full abstract

High Energy Physics (Theory)

Generalised Symmetries, Anomalies, and Maximal Branches of 3d Chern-Simons Matter Theories

The generalised symmetries, 't Hooft anomalies, and their interplay with maximal branches are analysed for linear unitary three-dimensional $\mathcal{N}\geq 3$ Chern-Simons Matter quiver theories realised in Type IIB brane configurations. The 1-form symmetry, its self-anomaly and its maximal anomaly-free subgroup are determined independently from Wilson-line screening and from the string lattice. Fractional monopole endpoints of the generating Gukov-Witten defect are used to extract the anomaly data, while centre charges of integer monopoles determine the faithful 0-form symmetry group, its connected cover and possible 2-group structures. Mixed anomalies with non-abelian 0-form factors are found to cancel in the linear unitary theories considered. The effect of 1-form gauging on maximal branches is related to frozen D3-brane sectors, which flow to Chern-Simons TQFTs whose anyonic lines obstruct the required defect endpoint. This yields a criterion for affected branches and implies that at most two can be affected simultaneously. In such a case, a magnetic-quiver extension by non-simply laced edges is proposed, wherein the 1-form symmetry and its mixed anomaly with the branch isometry are reproduced.
Read the full abstract

Sound

Perceptually Better, Semantically Worse: Measuring Speech Enhancement Impact on LLM-Based Voice Systems

Speech enhancement (SE) is commonly applied as a preprocessing step in spoken AI pipelines under the assumption that better audio quality improves downstream task performance. Whether SE-induced distortions propagate to downstream LLM task performance remains an open question. We introduce Output Divergence Rate (ODR), which measures how often SE changes an LLM's intent classification relative to clean speech, and benchmark five conditions on 2,974 SLURP clips using Whisper large-v3 and wav2vec2-large cascades. Every condition produces ODR significantly above zero ($p < 0.001$, binomial test). MetricGAN{+} more than doubles ODR versus unenhanced noisy speech (0.318 vs. 0.135) despite improving PESQ, and unmitigated echo reaches an ODR of 0.836 through speaker substitution, a failure WER cannot capture. Audio quality metrics range from near-zero to moderate correlation with ODR (SQUIM-MOS $\rho=-0.068$, PESQ $\rho=-0.467$). The MetricGAN{+} and echo results replicate across ASR architectures, indicating that standard audio quality metrics are insufficient for LLM pipeline quality.
Read the full abstract

Combinatorics

Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization

Perfect state transfer on graphs has attracted extensive attention due to its application in quantum information and quantum computation. Explicit characterizations of connection sets admitting perfect state transfer in Cayley graphs are rare and, so far, are known only for a few abelian Cayley graphs. In this paper, we characterize the conjugation-closed connection sets of connected Cayley graphs over dihedral groups that admit perfect state transfer. By applying Ramanujan sums, Möbius inversion, and arguments based on the $p$-adic exponential valuation of rational numbers, we convert the eigenvalue constraints imposed by perfect state transfer into explicit structural conditions on the connection set. This yields a complete and practical characterization, which gives an effective criterion for recognizing and constructing such Cayley graphs and also determines the exact minimum perfect state transfer time.
Read the full abstract

Logic

Classification complexity of homeomorphism group actions

In this paper, we study how the classification complexity of natural orbit equivalence relations changes when the full homeomorphism group of a compact metrizable space is replaced by a dense non-closed subgroup. For a compact space $X$ and a subgroup $G \leq \mathcal{H}(X)$, we consider three canonical actions: the left shift action on $\mathcal{H}(X)$, the induced hyperspace action on $\mathcal{F}(X)$, and the conjugation action on $G$ We first analyze subgroups of the group $\mathcal{H}^+([0,1])$ of increasing interval homeomorphisms, focusing on bi-Lipschitz homeomorphisms, diffeomorphisms, and bi-absolutely continuous homeomorphisms. We show that, in contrast to the behavior of closed subgroups, passing to these subgroups strictly increases the complexities of the associated classification problems or makes them incomparable with the corresponding full-group relations. In the second part, we investigate hyperspace actions of bi-absolutely continuous homeomorphisms on the Cantor space and the Hilbert cube with respect to some Borel probability measure and show that a similar behavior occurs on these spaces as well.
Read the full abstract

Artificial Intelligence

Answer Probing-Guided Search for Diverse Solution Exploration of LLMs

Generating multiple diverse and high-quality solutions is valuable for many applications, such as code-test generation and drug discovery. However, Large Language Models (LLMs) tend to converge on a single high-confidence solution during inference, limiting exploration of alternative valid solution paths. Existing test-time methods promote diversity through tree-like search and prune semantically similar branches using response-level semantic embeddings. However, we find that such embeddings are easily confounded by linguistic and stylistic similarities, making it difficult to distinguish genuinely distinct solution paths. To address this, we introduce Answer Probing, which probes the potential answer an LLM would reach from an intermediate reasoning path. We demonstrate that the hidden states of probed answers more effectively differentiate distinct solution paths than semantic embeddings, and the perplexity of probed answers serves as a practical proxy for reasoning correctness. Based on these findings, we propose Answer Probing-Guided Tree Search (APTS), which guides the tree search by the probed answers' hidden state similarity and perplexity. Experiments on three reasoning tasks across two LLMs show that APTS consistently enhances solution diversity, demonstrating its effectiveness and robustness.
Read the full abstract

All authors Yi Fang, Que Shen, Chengpeng Li, Boyi Deng, Wei Shi, Wenjie Wang, Fuli Feng, Fengli Xu, Dayiheng Liu

Computer Vision

Proximity3D: Shape from Capacitive Proximity on Sensing Manifold

Most shape reconstruction methods assume measurements defined over planar sensing domains, such as RGB images or depth maps. In this paper, we use a curved capacitive textile as a shape sensor, treating its surface as a non-planar sensing manifold. Each scan is represented as a capacitive proximity field on this manifold, induced by the interaction between the curved electrode layout and nearby object geometry. We introduce a multi-view feedforward reconstruction model that aggregates these fields across known sensor views and recovers the observed object shape. Simulated and physical experiments demonstrate robust reconstruction from capacitive proximity signals acquired on curved sensing surfaces, pointing toward a new route to robotic near-field geometric awareness via embodied sensing.
Read the full abstract

All authors Hao Chen, Chenming Wu, Chun Ping Lam, Xiangjia Chen, Guoxin Fang, Charlie C. L. Wang, Yeung Yam, Juncong Lin, Chengkai Dai

Game Theory

LangBP: Language-Guided Reasoning and Acting for Joint Bidding and Pricing

Auto-bidding is a long-horizon sequential decision problem for maximizing conversion value under budget and key performance indicator (KPI) constraints. Recent work extends this task from bidding alone to joint bidding and pricing, where a policy controls bidding decisions and pricing corrections. Existing methods mainly rely on numerical trajectory modeling, which offers limited support for interpreting campaign context and expressing high-level strategies. Large language models (LLMs) can complement this paradigm with their reasoning capabilities. However, existing language-guided methods have two limitations. First, they condition actions on language strategies without modeling the corresponding state changes, making it difficult to distinguish errors in strategy understanding from errors in action generation. Second, different instructions can produce similar execution effects, leading to imbalanced policy updates across effects. We propose LangBP, a hierarchical framework for language-guided joint bidding and pricing. LangBP's Semantic Decision Transformer (S-DT) predicts target states from the instruction and the trajectory history, then recovers the joint action via inverse dynamics. We further propose Execution-Grouped Policy Optimization (EGPO), which scores candidate effects with a Context–Effect Verifier (CEV) and balances policy updates across effect groups. Experiments on AuctionNet show that LangBP outperforms strong baselines, and online A/B tests further demonstrate business gains in real-world deployment on a large-scale e-commerce platform.
Read the full abstract

All authors Jiaqi Ding, Chuan Yang, Linghui Meng, Shengsheng Niu, Jie He, Zhangang Lin, Ching Law, Xiaolin Fang

Computer Vision

CapFrame: Text-Instructed Viewpoint Grounding in 3D Gaussian Scenes via Geometric Pseudo Labels

3D Gaussian Splatting (3DGS) enables photorealistic real-time novel view synthesis, yet placing a virtual camera to capture a desired frame remains largely manual. Existing language-guided approaches in 3D scenes mainly focus on object-centric grounding, determining what to observe but rarely controlling how it should appear in a single frame, such as subject orientation or frame layout. To address this limitation, we introduce a new task, Text-Instructed Viewpoint Grounding (TIVG), which aims to identify a 6-DoF camera pose in a 3D Gaussian scene whose rendered frame aligns with a text instruction. To solve this task, we propose CapFrame, a partially differentiable framework that converts language into geometric pseudo labels for camera pose optimization. CapFrame follows a Retrieve-Translate-Refine pipeline: it retrieves relevant views and ranks them through a Question-Evaluation process with MLLMs, translates the instruction into orientation and layout pseudo labels, and refines the camera pose via differentiable optimization with layout and orientation losses in 3DGS. Experiments on 38 real-world scenes with 135 instructions indicate that CapFrame produces viewpoints better aligned with texts than heuristic viewpoint search and adapted trajectory generation baselines, validated by VLM metrics, MLLM judges, and user studies. Code is available at: https://github.com/jirongli/CapFrame
Read the full abstract

All authors Jirong Li, Satoshi Ikehata, Shuhei Kurita, Ikuro Sato