Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Tuesday 15 September

General Relativity and Quantum Cosmology

Radial Stress and the Innermost Stable Circular Orbit of a Bardeen Black Hole in a Dark Matter Halo: A First-Order Response Criterion

A dark matter density profile alone does not determine the spacetime around a black hole; the radial stress must be prescribed separately and governs the strong-field orbital response. We study a Bardeen black hole in a Hernquist halo through three spherical models sharing the same density, mass function, and cutoff but differing in radial stress: a halo with $p_r^{\mathrm{DM}}=-\rho_{\mathrm{DM}}$, its truncated form, and a truncated Einstein cluster with $p_r^{\mathrm{DM}}=0$. Treating the halo as a small perturbation, we derive a first-order criterion for the leading innermost stable circular orbit shift, $C_\lambda=C_\rho+\lambda C_p$. The two truncated closures shift this orbit in opposite directions for the Hernquist profile, and unexpanded calculations for five density profiles confirm the predicted signs. Checks using a Hayward background and a published Dehnen-halo result show that the criterion is not restricted to the Bardeen-Hernquist system. A continuous stress interpolation identifies a critical closure at which the leading shift vanishes. For a representative four-year extreme-mass-ratio inspiral, changing the radial stress at fixed density and cutoff produces a phase difference of several radians in a leading-order adiabatic treatment.
Read the full abstract

Computer Vision

MEgoVista: Multi-view Ego-aware Motion Estimation for Metric 4D Hands and Head in the Wild

Learning manipulation from human video requires high-fidelity hand-motion reconstruction in metric units. Today's metric hand labels come from studio rigs and instrumented headsets, and both are confined in the same two ways: neither leaves a prepared setting, and neither is checked against an independent reference. Unconstrained head-worn recording promises the opposite trade-off, scaling with the number of people wearing a device. We therefore introduce MEgoVista, an offline pipeline that turns a single unprepared MEgo View recording into metric two-hand and head motion in one gravity-aligned world frame. Three properties set it apart from existing egocentric reconstruction systems: first, it reconstructs in settings studio volumes and tabletop rigs cannot reach, settling hand ownership at detection so bystander hands stay out of the wearer's trajectory; second, it takes its metric gauge from calibrated stereo rather than a monocular prior, installing scale at initialisation so policies receive physical units, not arbitrary coordinates; third, both outputs are scored inside a motion-capture volume against independent Chingmu optical capture, under a protocol that audits its own reference and charges what a method declines to predict. MEgoVista is offered as a measured route from egocentric video to metric hand supervision, one that widens where such labels can be gathered. To bridge the gap between lab validation and industrial-scale data annotation, we further introduce MEgoDeploy, a production-grade GPU stack that fully preserves reconstruction fidelity while achieving a 14.05x end-to-end throughput speedup, scaling the generation of metric 4D pseudo-labels for embodied foundation models.
Read the full abstract

All authors Jiangong Xiao, Chao Ma, Zhihao Zhang, Yifei Dong, Zhouyi Jin, Zhiwen Hou, Haoyi Wang, Junle Yu, Amu Zheng, Chen Wang, Kaishu Lin, Hanwen Shi, Shiyun Zhang, Renquan Wan, Jingmei Jin, Xuan Hu, Weihuang Chen, Hongbin Sun, Jinli Suo, Maoqing Li, Li Liu, Maoqing Yao

Robotics

Weave: Learning Whole-Body Dexterous Loco-Manipulation from Human-Object Interactions

Learning humanoid-object interaction requires coordinating whole-body balance, locomotion, and dexterous hand contact to control both robot and object motion. Human demonstrations provide examples of coordinated interaction, but transferring these behaviors to humanoid robots requires learning how to establish and maintain effective contacts under different embodiments and dynamics. We present Weave, a unified framework for learning whole-body dexterous humanoid-object interaction from captured human demonstrations. Weave first converts captured human-object interactions into executable robot-object references through contact-aware retargeting and approach-motion completion. At its core is a contact- and geometry-aware policy that jointly commands 29 body joints and 12 actuated finger joints across multiple objects and interaction sequences. Evaluation across nine objects yields a 92.5% success rate on trained interactions and, without any additional training, 65.0% on sequences never seen during training. We additionally release ~9,000 physically executed rollouts spanning ~23 hours, providing robot-object trajectories with contact annotations for downstream interaction-policy learning and physically consistent HOI motion generation. Project website: https://xiaohu-art.github.io/Weave/
Read the full abstract

All authors Liu Cao, Xingze Wu, Jingzhi Cui, Botian Xu, Mingzhi Pei, Ruoqu Chen, Mengdi Xu

Distributed Computing

DeepShare: Assurance-Driven Deep Learning Job Scheduling for Multi-Tenant Clusters

Multi-tenant GPU clusters frequently remain underutilized even when tenants experience long queueing delays, because quota control, queue ordering, preemption, and GPU sharing are driven by different local signals. We present DeepShare, a scheduler that uses a continuous tenant-assurance signal to coordinate these decisions at runtime. DeepShare combines elastic quota borrowing, tenant-specific runtime prediction, cost-aware best-effort preemption, and interference-aware MPS colocation, while using the same assurance signal to decide when borrowed capacity should be reclaimed and when sharing should become more conservative. In trace-driven experiments on 23,859 Venus jobs and 3,200 internal jobs, DeepShare achieves an average GPU utilization of 70.58%, a 29.5% improvement over the strongest non-intrusive sharing baseline, while reducing average queueing delay by 46%. On a 16-GPU Kubernetes testbed, it reduces the average job completion time by 34% and maintains 93% QoS compliance for guaranteed tenants. These results show that treating tenant assurance as a runtime control loop achieves a more advantageous utilization-QoS trade-off than optimizing quotas, scheduling, and resource sharing independently.
Read the full abstract

All authors Jinghao Wang, Yihang Zhou, Xiao Zhou, Xinlei Zheng, Xiaoyang Sun, Tianyu Wo, Chunming Hu, Renyu Yang

Cryptography and Security

MarkSec: Capability-Aware Evaluation of Adversarial Attacks Against LLM Watermarks

LLM watermarking helps trace the origin of generated text, but faces stealing attacks that recover watermark information, scrubbing attacks that remove watermark signals, and spoofing attacks that forge text accepted as watermarked. These attacks are often studied in isolation, leaving their connections unclear. Evaluations also often lack shared detector calibration, metric definitions, and reporting protocols. Moreover, measuring attack success and text quality separately makes it difficult to identify attacks that are both effective and quality-preserving. We propose MarkSec, a general framework that unifies analyses of stealing, scrubbing, and spoofing. We evaluate attacks under a common reporting protocol and introduce a quality-constrained attack success metric to assess effectiveness and text quality jointly. Experiments across representative watermark families, attacks, LLMs, and datasets reveal three findings. First, attacks that appear strongest by watermark removal alone can fall behind general rewriting when success also requires acceptable text quality. Second, general rewriting remains a strong baseline across watermark families, while its advantage over other scrubbers varies by family. Third, in a case study of one watermark family, stealing-based scrubbers often underperform the best general-scrubbing baselines when text quality is required. These results show that apparent attack winners depend on text-quality constraints, attack generality, and capability assumptions.
Read the full abstract

All authors Kairong Li, Zhikun Zhang, Xiao Ren, Yunjun Gao

Artificial Intelligence

little m: An AI Agent for Industrial Process Optimization

Manufacturing consumes one third of global energy and still has significant room for improvement in terms of energy efficiency. Optimal process control is essential for this purpose. However, synthesizing mathematical optimization models from messy, real-world industrial specifications requires bridging unstructured natural language and spatial diagrams with rigorous mathematical syntax. This poses a profound challenge for general-purpose Large Language Models (LLMs), which may introduce invalid constraints when tasked with modeling continuous multi-physics dynamics. To address this, we introduce little m, an AI agent designed to assist the formulation of industrial process control models. Combining a domain-specific knowledge repository with LLM-driven interaction, the proposed framework formulates real-world optimization problems as mathematical models. For systematic evaluation, we introduce the Industrial Process Control Benchmark (IPC-Bench), a novel multimodal dataset of 50 canonical scenarios requiring joint reasoning over text and process diagrams. Through comprehensive automated structural assessments and double-blind human evaluation, little m substantially outperforms state-of-the-art LLMs, generating semantically correct models. These evaluations assess formulation quality rather than solver feasibility, formal physical validity, or closed-loop industrial performance. The implementation of little m and the IPC-Bench dataset are available at https://github.com/yeyongchao/process-modeling-benchmark.
Read the full abstract

All authors Yongchao Ye, Xinyu He, Dutliff Boshoff, Way Kuo, Lishuai Li

Artificial Intelligence

AI for Games in the Foundation Model Era

Foundation models, alongside advances in learned game-world models, are reshaping AI across the game lifecycle. Beyond playing games, recent systems model players and game dynamics, support design and development, adapt player-facing experiences at runtime, and evaluate resulting artifacts. Yet these directions have evolved largely separately, obscuring which capabilities transfer across settings and which remain tied to particular games, engines, interfaces, or player populations. We organize the literature into six roles according to the immediate use of AI output: playing and acting; modeling players and games; designing games; building and maintaining games; generating and adapting at runtime; and testing and evaluating games. For each role, we examine what structure is supplied by the game or workflow, what AI learns or produces, which capabilities and artifacts transfer across settings and roles, and what evidence supports the claims. We identify cross-role connections: trajectories train world models, learned environments provide experience for agents, design specifications drive executable implementations, and play or testing feedback guides revision. However, control schemes, rules, engine interfaces, state representations, and player contexts often remain setting-specific, so downstream claims require validation in the target setting. Evaluation is most standardized for bounded game playing and selected learned environments, while persistent state in learned worlds, repeated software revision, validated player modeling, sustained runtime adaptation, and representative automated testing remain less established. The central challenge is to reuse or transfer outputs and capabilities across roles while re-establishing evidence for effectiveness in the game-specific contexts where they are used.
Read the full abstract

All authors Meng Luo, Yanlin Li, Hao Li, Hongzhan Lin, Pengfei Zhou, Tianjie Ju, Ran Zhang, Yeying Jin, Mong-Li Lee, Wynne Hsu

Number Theory

An infinite family of imaginary biquadratic fields with a large class number

We construct an infinite family of imaginary biquadratic fields with large class numbers. The construction of this family is done by composing two distinct families of imaginary quadratic fields: the first one is the family Q(sqrt(k^2-p^l)) introduced by Banerjee and Hoque [1], subject to specific constraints on the integer parameters, l, k and p, and the second one is the parametrized family of the form Q(sqrt(-F_(50s+25))) based on Fibonacci numbers, introduced by Kishi [2]. One of the main tools that is used is Kuroda's class number formula of imaginary biquadratic fields. We choose these two families with the sole aim to get high order elements in the class group of the resultant biquadratic fields.
Read the full abstract

Dynamical Systems

Newton geometry of Bogdanov-Takens degeneracies in integrable dilatonic models: invariant divisors and boundary multiplicity

The Kantowski–Sachs interior of Grumiller's two-dimensional dilaton gravity model reduces to $\dot H=\tfrac12(\Lambda-3H^2-u^2)+Qu$, $\dot u=-Hu$, where $H$ is the expansion rate of the orbit two-spheres, $u$ their inverse areal radius, and $Q$ is minus twice the Rindler acceleration. For $Q\neq0$ it has two distinct rank-one nilpotent equilibria with complementary Bogdanov–Takens (BT) degeneracies: $(a,b)=(0,\neq0)$ with multiplicity $\mu=3$, and $(a,b)=(\neq0,0)$ with $\mu=2$. We show that this complementarity is forced by a single divisor-organized structure. The system is Darboux integrable, $X=\tfrac12u^4X_I$, where $I$ is the mass function and $u^4$ is an inverse integrating factor whose zero divisor is the invariant axis $\{u=0\}$. Off the divisor, every nilpotent equilibrium of $RX_I$ with $R(p)\neq0$ has $b=0$, from $b=D_{q_0}\operatorname{tr}DX$. On the divisor, invariance of the coordinate axis forces $a=0$ because $\det DX|_{u=0}=\Phi_xG$ and both factors vanish at the corner. Hence $ab=0$ throughout the class, so a versal two-parameter BT unfolding is impossible. The Bernstein–Kushnirenko bound fails at both points; instead, the exact local identity $\mu_0=m_1\ell_y+m_2\ell_x$ gives $\mu=3,2$ without a nondegeneracy hypothesis. Both multiplicities have a mixed-covolume interpretation, with $\operatorname{Covol}=\sum_{k,i}\min(p_kq_i',p_i'q_k)$ on convenient diagrams; the corresponding general theorem for the non-convenient diagrams arising here remains open. For $\dot H=\tfrac{1-m}{2}H^2+\psi(u)$, $\dot u=-Hu$, with $\psi(0)=0$, $\psi'(0)\neq0$, $m\neq1$, the vacuum always has $\mu=3$, $a=0$, $b=-m$. Its Dumortier–Llibre–Artés discriminant is $b_1^2+8a_3=(m-2)^2$, so for every $m>1$ it has one hyperbolic and one elliptic sector, independently of $\psi$.
Read the full abstract

Complex Variables

When can a power series be analytically continued?

A classical line of research characterizes analytic continuation of power series through analytic interpolation of their coefficients. Under suitable hypotheses, the growth of the interpolating function reflects the geometry of the continuation domain, and conversely. We survey the development of these results from Leau and Le Roy through Lindelöf, Carlson, Dufresnoy$\unicode{x2013}$Pisot and Arakelian. We formulate the main results in a unified notation using compactifications of the complex plane. In particular, we give a comprehensive treatment of Carlson's second continuation theorem, which has received little attention, and prove a refinement based on the Laplace transform.
Read the full abstract

Cryptography and Security

From Hypervisor to Container: Cloud Security Vulnerabilities, Defense Mechanisms, and Open Challenges

In cloud computing, different users share the same physical hardware, which creates serious security risks. To protect data, cloud systems rely on virtual machines and containers to keep users isolated. This paper reviews over 120 security publications from 2008 to 2025, focusing on how these isolation boundaries can be breached. We examine threats like virtual machine escape, virtual machine hopping, CPU cache side-channels, container breakouts, vulnerable container images, and distributed denial of service (DDoS) attacks. We evaluate these security threats and their defenses using three key research questions. To compare different defense systems, we introduce a quantitative scoring framework called ADPO, which rates defenses from 0 to 3 based on their Accuracy, Deployment ease, Performance impact, and Operational overhead. We also map the impact of these attacks onto a 1-to-5 severity scale for Confidentiality, Integrity, and Availability. Finally, we highlight the trade-offs between security and system performance, and we outline open challenges like building low-overhead intrusion detection and creating realistic test datasets.
Read the full abstract

Classical Analysis and ODEs

Sets with no Riesz bases of exponentials

We prove that sets in a certain class do not admit Riesz bases of exponentials. In particular, this class contains disks and triangles in the plane.

Game Theory

Anchored Sequential Deliberation

Sequential deliberation is a mechanism for collective decision making: at each round, a uniformly randomly selected pair is asked to revise a collective outcome, which then becomes the input for the next round. Existing theory by Fain et al.~\cite{fain2017sequential} treats the current outcome solely as the disagreement alternative in bargaining. Yet the existing outcome might also carry social influence and anchor participants' positions toward the status quo. In this paper, we introduce anchored sequential deliberation. At each round, two participants with bliss points $U$ and $V$ shift their positions toward the previous outcome $O_{t-1}$ with anchoring strength $0\leq \lambda<1$. They then bargain using $O_{t-1}$ as the disagreement alternative. For the sake of analysis, we assume that the decision space is one-dimensional, the anchoring effect is linear, and participants use Nash bargaining. The update simplifies to $O_t=(1-\lambda)Med\{U,V,O_{t-1}\}+\lambda O_{t-1}$. Our analysis reveals a trade-off. Through a coupling of two outcomes, we find that the process contracts in $1$-Wasserstein distance with a factor of at most $\frac{1+\lambda}{2}$, which implies that stronger anchoring slows mixing. On the other hand, stationary distortion weakly decreases with $\lambda$, although the worst-case distortion remains $\frac{1+\sqrt{2}}{2}$ for every feasible $\lambda$. We also identify a unique deliberative fixed point, at which the expected movement is zero, and prove that the stationary distribution concentrates around it as $\lambda$ increases. For symmetric populations, we further provide a tighter bound on the stationary variance around this fixed point. For the uniform distribution, we establish upper and lower bounds on stationary distortion, both of which approach $1$ as $\lambda$ increases.
Read the full abstract

Computer Vision

Lesion-centered 3D mapping of colonoscopy procedures: validation of a hierarchical ensemble pipeline on public benchmark videos

Background and Objective: Colonoscopy recording practice preserves text reports and still photographs, while the spatial information already present in the recorded video - where the scope traveled, where a lesion was observed, and whether the same lesion was seen again - is discarded when the procedure ends. This study determines whether a lesion-centered spatial record can be assembled and validated without full-colon 3D reconstruction. Methods: A four-layer hierarchical pipeline was assembled - (1) a global topological map, (2) lesion-level spatio-temporal tracks, (3) on-demand local 3D reconstruction, and (4) persistent lesion identity across repeated observations - and ran end to end on four public videos (two C3VDv2 sequences with ground-truth depth and two full REAL-Colon procedures; 40,245 frames). All components are published, individually validated methods; the contribution is their lesion-centered assembly, linking rules, and evaluation. Results: Revisits, impossible under forward-only mapping by construction, were detected by entry-map Bayesian localization: 5,614 and 4,043 revisit events (56 and 68 distinct nodes) in the two full procedures. Lesion-identity merging at the adopted threshold 0.5 maintained ground-truth purity 1.0 while auto-merging 20 of 231 candidate pairs. The endoscopy-specific geometry engine outperformed a general-purpose foundation model on all metrics (overall absolute relative error (AbsRel) 0.2276 vs. 0.3523). Conclusions: The results are partial but establish a concrete near-term path: revisit detection, lesion identity, and local 3D each returned quantitative, reproducible output without waiting for complete geometric reconstruction; validating the record on clinical data is the next step.
Read the full abstract

Atmospheric and Oceanic Physics

A storm-centered perspective of midlatitude near-inertial wave generation

Near-inertial waves (NIWs) generated by extratropical storms provide a major pathway for transferring atmospheric energy into the ocean, yet what determines the efficiency of this energy transfer at the level of individual storms remains poorly understood. Here, using a slab ocean model forced by ERA5 reanalysis and analyzed in storm-relative coordinates, we investigate NIW generation across three temporal scales: from the instantaneous structure of individual storms, through their life cycle, to variability across storms. Instantaneous storm structure reveals that the spatial layout of wind stress and storm propagation provides the required time evolution and rotation to excite a localized maximum in wind work on the right side of storm tracks, much like tropical cyclones do. Following storms through their life cycle further reveals that wind work peaks one day after cyclone genesis, about one day before storms reach their maximum intensity. This offset arises because storm translation slows during intensification, reducing the propagation-induced wind-stress tendency, while concurrent poleward propagation increases the Coriolis parameter and reduces the alignment between winds and near-inertial currents. Due to the temporal lag, regions of climatologically high NIW forcing are located upstream of the North Pacific storm-track maximum. Finally, examining variability across storms, we show that storm intensity, propagation speed, and latitude explain most of the variability in NIW generation, but not in extreme events. Focusing on extreme events, we find that the strongest NIW-generating storms feature colder cold sectors, which destabilize the marine boundary layer and enhance downward momentum transfer to the ocean surface.
Read the full abstract

Statistical Methodology

A flexible framework for treatment effect inference in longitudinal clinical studies with skewed outcomes

Longitudinal continuous outcomes in clinical trials are commonly analyzed using mixed models for repeated measures (MMRM) under normality assumptions. However, many clinical outcomes are skewed, making mean-based treatment effects difficult to interpret and potentially reducing statistical efficiency. The Box–Cox MMRM (BCMMRM) approach accommodates skewness by enabling inference on model-based median differences via inverse transformation. However, BCMMRM typically assumes a common transformation parameter across treatment groups and time points. When distributional shapes differ between groups or evolve over time, this assumption may lead to biased treatment effect. Furthermore, when treatment affects not only central tendency but also distributional shape or tail behavior, treatment effects may not be adequately characterized by a single location summary such as the median. We propose the Box–Cox multivariate regression (BCMVR) framework for longitudinal data with skewed outcomes. BCMVR relaxes this restriction by allowing transformation parameters to vary across groups and time points. The framework enables inference based on interpretable summaries, including median differences and a probability-based treatment effect quantifying the probability that a randomly selected patient in one group has a better outcome than one in another group. This measure integrates information over the entire outcome distribution and provides a complementary summary when distributional shapes differ. Simulation studies demonstrate that BCMMRM can produce biased estimates when distributions differ in shape, whereas BCMVR provides nearly unbiased estimation. The probability-based measure achieves a favorable balance between robustness and statistical efficiency. The proposed framework provides a flexible and interpretable approach to treatment effect inference under distributional heterogeneity.
Read the full abstract

All authors Kazushi Maruo, Ryota Ishii, Yusuke Yamaguchi, Toshio Shimokawa, Tomoyuki Sugimoto, Masahiko Gosho

Software Engineering

Memory-Skill Isomorphism: One Skill Carrier, Two Native Uses

Memory and skills improve agents without changing weights: memory carries prior experience, skills carry reusable procedures. Wrapping both in stores, routers, retrieval, reflection, and update paths makes reuse machinery grow with accumulation. Part of this duplication need not be rebuilt: a Skill is already a natural carrier for distilled memory. Here the memory component is a Skill: resident description holds hot cues, on-demand SKILL.md a colder index and curation policy, and reference/*.md files detailed memories (levels L0 -> L1 -> L2). A governed 1,024-character description budget keeps the resident index compressed. Memory and capability thus share one progressive-disclosure carrier; reflection evolves either Skill. Writes fork: history appended, current state rewritten and revalidated. In one deployed system, the sharpest identification is governance: 4 write entries exist, but only 1/4 reaches the settlement ledger. At the priced operating point, one L1 lesson-1 point adds 1,313 first-turn tokens against a 1,462-token baseline–tied at k=1 (1,313 versus 1,365), 4,949 at k=5; session totals differ by only 1.18x with overlapping last-turn ranges; price decomposition is unavailable. On one selected task with one model, exposing the lesson means fewer failures (0/8 or 1/8 with the lesson versus a shared non-concurrent 6/6 historical floor, unadjusted for multiplicity). The task was selected on prior floor evidence, so this is a selected-task post-selection existence signal, not a confirmatory rate. Resident and BM25 show no detected difference in two small comparisons. This motivates a candidate RSI design rule: one Skill carrier family, a shared read side, governed distinct writes. Body delivery h := P(D|A) is uninstrumented in RQ1–RQ2; this evaluates a resident-index implementation.
Read the full abstract

Mesoscale and Nanoscale Physics

1/f frequency noise in mechanical resonators scales inversely with volume, not with quality factor

Mechanical frequency-shift sensors have never reached their fundamental thermomechanical or quantum limits. Every material, size, and transduction scheme yet examined yields a $1/f$ floor 1-3 orders higher, with a flicker-noise coefficient $h_{-1} \propto 1/V_{\varepsilon}$. Surveying the published record, I find the invariant $h_{-1}\,V_{\varepsilon} \equiv \sigma_A ^2\, V_{\varepsilon}/(2\ln 2)$ independent of device size across 13 decades; volume-independent noise is excluded by 9$\sigma$, site-averaging by 3.8$\sigma$. No $Q$ dependence appears: reported $Q^{-n}$ laws scale equivalently when $Q$ and volume co-vary; only volume scaling survives when they do not. Mass resolution follows as $|\delta m| \propto \sqrt{h_{-1}\,V_{\varepsilon} \cdot V}$.
Read the full abstract

Artificial Intelligence

ANIMASK: What the Model Contributes to Role Play in Simulated Story Worlds

When a language model plays a character, the observed behavior reflects both the assigned persona and the default dispositions of the actor model itself. Existing evaluations test persona fidelity or model defaults in isolation, but neither says, at a specific choice with consequences, what the persona changed and what the model's default kept. We introduce ANIMASK, a simulation framework that freezes books and scripts into story worlds whose characters act on their own motivations and replays each story from its freeze point. We hold out the author's continuation as a human reference, verify through in-story interviews that each persona remains present, and at every decision point compare the character's action with what the model produces when the persona is removed. Across 40 stories, 6 actor models, and 3,846 decision points, the replays converge away from their canons in one shared direction, toward flatter, cooler stories that leave their tensions open. The personas stay present and obeyed throughout. On three choices in four the model's default already falls inside what the persona accepts, and where the two diverge the model is the cautious one, holding where the persona would press. The persona guarantees who the character is, and the model sets how far the character will go.
Read the full abstract

All authors Xiucheng Zhang, Zhuoning Xu, Hanjun Luo, Yankai Chen, Hanan Salam, Xue Liu

Systems and Control

Development of a 4D Cerebral Microvascular Imaging Platform for Mouse Stroke Model

In ischemic stroke, changes in cerebral hemodynamics during both the ischemic and reperfusion phases strongly influence stroke outcomes. However, these hemodynamic changes remain incompletely understood. To address this challenge, we devised an imaging platform that enables time-resolved ultrasound microvascular imaging during the experimental induction of ischemia and reperfusion in a mouse model. The platform leverages our previous ultrasound imaging framework combined with continuous mechanical scanning, which acquires whole-brain blood-flow signals within 5 s. The experiments demonstrated that the proposed platform can visualize both local and whole-brain hemodynamic responses to the induction of ischemia and reperfusion, suggesting its potential for rapid and continuous whole-brain hemodynamic assessment in small-animal models.
Read the full abstract

All authors Yoshihisa Kaneko, Moe Kumai, Hiroyuki Igarashi, Daisuke Ando, Kuniyasu Niizuma, Hidenori Endo, Yoshifumi Saijo, Takuro Ishii

Machine Learning

Right Direction, Wrong Step: Geometric Analysis of Finite-Step Failure in Looped Transformers

Looped Transformers offer a parameter-efficient route to test-time scaling by reusing shared layers for iterative latent reasoning. However, additional iterations can reduce support for a reference answer, leaving unclear whether an update's direction is locally unhelpful or its full displacement moves too far. We study this distinction by analysing reference utility, which measures this support, along the model's own update direction, varying the fraction of the proposed displacement supplied to the readout. This reveals finite-step failures in which a locally improving direction produces a harmful full update. A pathwise curvature decomposition characterises how initial progress is lost, while a local quadratic model predicts full-step gains and useful step scales. Bounds based on accumulated curvature variation characterise the approximation error of these predictions. Experiments across two model families reveal this separation on mathematical and commonsense tasks. A fixed quarter step produces positive gains in reference utility for 72.2–83.2% of selected failures across four settings. These findings identify a mismatch between update direction and step scale as a mechanism of lost progress, explaining how some harmful updates retain useful computation.
Read the full abstract

All authors Zhihao Guo, Zonghan Wu, Haizhou Du, Huan Huo, Yilei Shao, Athanasios V. Vasilakos, Qingsong Wen

Computer Vision

Bridging the Perceptual Gap: Residual-Enhanced Downscaling and Manifold-Aware Perception Alignment Adaptation for NR-IQA

Leveraging Large Vision-Language Models like CLIP has recently set new benchmarks for No-Reference Image Quality Assessment (NR-IQA). However, the contrastive pretraining of CLIP inherently prioritizes semantic invariance, which often suppresses subtle perceptual signals, a phenomenon we term perceptual submergence. Furthermore, standard preprocessing techniques (e.g., cropping and interpolation) further exacerbate the loss of critical high-frequency quality cues. In this paper, we propose the Cross-modal Perception Alignment Adapter (CMPA), a manifold-aware framework designed to disentangle perceptual distortions from dominant semantics. CMPA introduces a Perception-Sensitive Feature Extractor (PFE) that projects CLIP features into a compact, low-dimensional subspace, explicitly magnifying distortion-induced off-manifold deviations. Subsequently, a Cross-Modal Perception Alignment Injector (PAI) aligns these features with quality-aware text anchors and re-injects them into the backbone. To ensure input fidelity, we also devise a Residual-enhanced Perceptual Downscaling strategy that adaptively compensates for resolution-induced information loss using Just Noticeable Difference (JND) guided frequency re-injection. Extensive evaluations on several benchmark datasets demonstrate that our approach significantly outperforms state-of-the-art methods, effectively recovering the perceptual signals submerged in semantic-dense representations.
Read the full abstract

All authors Yu Li, Zhengran Shen, Yachun Mi, Puchao Zhou, Shaohui Liu

Social and Information Networks

The Local-to-Global AD-k Conjecture is Resolved

AD-k stands for Alternating Differences through order k, and it is a property of set functions denoting that the first order difference of the set function is nonnegative (a.k.a. monotnocity), the second order difference is nonpositive (submodularity), and so on with signs alternating through order k. Chen et al. [1] conjectured that in an influence diffusion model called the general threshold model originally defined by Kempe et al. [2], if every local influence function is AD-k, then the global influence spread function is also AD-k, for any (possibly cyclic) directed graph and any k. This paper provides a complete proof showing that the conjecture is true. The proof utilizes Möbius inversion, reverse reachable sets, and decision tree partition techniques and extends the probability distribution of node triggering sets into a generalized algebraic structure allowing negative weights for triggering sets. The extension to negative-weighted triggering sets may be of independent interest and may have further algorithmic implications.
Read the full abstract

Computer Vision

SAVTrack: Selective Vote Aggregation for Reliability-Aware Point Cloud Tracking

3D single object tracking (SOT) in LiDAR point clouds is essential for autonomous systems, but remains challenging under sparse and incomplete observations. In such cases, different target points provide highly uneven constraints on the object center, causing some point-to-center votes to be substantially less reliable than others. Existing point-based trackers typically aggregate these hypotheses without explicitly modeling their reliability, allowing inaccurate votes to contaminate proposal clustering and degrade localization accuracy. To address this issue, we propose SAVTrack, a motion-aware tracking framework with Selective Vote Aggregation (SAV). SAVTrack estimates the reliability of each candidate vote from both local seed features and inter-frame motion context, and removes low-confidence hypotheses before proposal clustering. This pre-aggregation gating prevents unreliable hypotheses from affecting cluster formation while introducing only modest computational overhead. SAVTrack achieves competitive performance on KITTI and nuScenes, reaching 68.4/87.4 and 58.44/69.82 Success/Precision, respectively, while running at 82 FPS. It retains fewer than one-sixth of the candidate votes used by dense aggregation and remains particularly effective under sparse target observations.
Read the full abstract

All authors Sifan Zhou, Linyue Tan, Qiwei Wang, Ziyu Zhao, Xiaobo Lu

Computation and Language

DiaWhisper-DPO: Role-Attributed Transcription of Clinical Interviews via Failure-Mined Preference Optimization

Automated depression screening from clinical interviews requires attribution of utterances to the clinician or patient. We evaluate two datasets: DAIC-WOZ, where participant-only recordings require re-synthesizing both sides for controlled two-party evaluation, and PDCH-HAMD, comprising voice-converted real Chinese interviews for cross-lingual validation. Cascaded systems combine speaker diarization with role-assignment heuristics, so errors can propagate across stages. We propose an end-to-end model, which we named DiaWhisper, that fine-tunes Whisper-large-v3 with LoRA and an auxiliary frame-level role head for transcription and attribution, together with DiaWhisper-DPO, a failure-mined refinement that uses genuine decoding failures as DPO rejected completions without human preference annotation. On 29 DAIC-WOZ test sessions, DiaWhisper-DPO achieves 0.973 role accuracy and 0.119 DER, 72% below the strongest cascaded baseline, and reduces seed variation from {\sigma} = .205 to .002. Retrained on PDCH-HAMD, it achieves 0.757 role accuracy and improves all 78 session-seed pairs.
Read the full abstract

All authors Weiming Li, Ana Catarina Fidalgo Barata, Miguel Constante, João Miguel Sanches

Computation and Language

Rewarding Reasoning, Not Answers: Fixing and Bounding Test-Time Reinforcement Learning on Medical QA

Test-time reinforcement learning adapts a model on its own unlabeled test set using majority-vote pseudo-labels and has shown strong results in mathematics. We show that this recipe collapses on medical multiple-choice QA: accuracy stagnates while output diversity rapidly declines. Through a controlled experiment that keeps the questions, model, and optimizer fixed while changing only the answer space, we trace this failure to answer-space structure rather than domain difficulty. In small answer spaces, incorrect rollouts often collide on the same wrong pseudo-label and reinforce it; in large answer spaces, they disperse and receive little reward. This diagnosis motivates PROSE, Process Reward Guided Self-Training, which rewards reasoning quality instead of answer agreement. PROSE scores each reasoning step with a medical process reward model, assigns the trajectory reward as the minimum score across steps, and enforces answer-format constraints. Without labels, PROSE substantially improves a general Llama model, surpassing purpose-built medical models and matching much larger systems. Because the process signal is internalized into the policy, the adapted model requires no reward model at inference and transfers its gains to unseen datasets. We further show that the minimum aggregation is essential: mean aggregation can be exploited, saturating the proxy reward while degrading accuracy.
Read the full abstract

All authors Kailong Fan, Anqi Pu, Yichen Wu, Wanhua Li, Yicong Li, Hanspeter Pfister, Huafeng Liu, Xiang Li, Quanzheng Li, Ning Guo

Quantum Physics

Approximate synthesis of general single-qubit unitaries over the Clifford+$\sqrt{T}$ gate set

For the standard Clifford+$T$ gate set, deterministic, ancilla-free synthesis now attains the minimal $T$-count for general single-qubit unitaries (Morisaki et al., arXiv:2510.05816). The $\sqrt{T}$ gate rotates by half the angle of $T$, generating a finer lattice of implementable operations. Access to this magic state is expected to lower the cost of deterministic and ancilla-free synthesis of general single-qubit unitaries (Kliuchnikov et al., arXiv:2203.10064), but no direct Clifford+$\sqrt{T}$ algorithm existed for this case. We provide one by extending the integer lattice-point enumeration method of Morisaki et al. We adopt a resource state cost model based on the magic-state catalysis approach of Gidney and Fowler (arXiv:1812.01238). On Haar-random targets synthesized to precisions ranging from $\varepsilon=10^{-3}$ to $10^{-8}$, the cost of Clifford+$\sqrt{T}$ circuits scales as $2.4\log_2(1/\varepsilon)$ compared to $3.0\log_2(1/\varepsilon)$ for $T$-count-optimal Clifford+$T$ circuits. Once a one-time catalyst state is amortized, the Clifford+$\sqrt{T}$ circuits are never costlier than their Clifford+$T$ counterparts.
Read the full abstract

All authors Mathias Weiden, Jae Won Kim, Justin Kalloor, John Kubiatowicz, Costin Iancu

Differential Geometry

A concise proof of homogeneity of an isoparametric hypersurface with $(g, m)=(6, 2)$

A well-known hypersurface classification theorem states that any isoparametric hypersurface in $S^{13}$ with six principal curvatures is homogeneous. This landmark result was first proved in her Annals paper in 2013 by R. Miyaoka with 58 pages, and with errata in Annals in 2016 with 15 pages. The main purpose of this paper is to provide a concise proof of this theorem through an interplay between topological and geometric insights into the Euler class of an oriented vector bundle.
Read the full abstract

Chemical Physics

Revisiting the CeO Anion Photoelectron Spectrum: Resolving the Assignment and Photodetachment Mechanism of Satellite Transitions

CeO serves as an important model system for understanding the interplay of electron correlation, spin-orbit coupling, and 4f/5d configurational mixing in lanthanide oxides. Its anion photoelectron spectrum exhibits dense electronic manifolds and multielectron shake-up processes that complicate spectral assignments and photodetachment dynamics. Here, we combine high-resolution anion photoelectron spectroscopy with spin-free and spin-orbit-coupled CASSCF+NEVPT2 calculations to characterize the electronic structure of CeO- and CeO. A binning-based data analysis approach enables observation of weak transitions hidden by spectral congestion, while multireference calculations reproduce the low-lying electronic structure and detachment energetics. On this basis, tentative assignments are proposed for the observed photoelectron features. Analysis of photodetachment selection rules, photoelectron angular distributions, and multielectron detachment channels provides additional insight into the mechanisms underlying the spectrum. These results establish a comprehensive interpretation of the CeO- photoelectron spectrum and underscore the importance of combining high-resolution spectroscopy with multireference relativistic theory for electronically complex lanthanide systems.
Read the full abstract

All authors Sakshi Nain, Matheus M. F. de Moraes, Hrant P. Hratchian, Caroline C. Jarrold, Lee M. Thompson

Computer Vision

Channel-Wise and Token-Aware Post-Training Quantization for Visual State Space Duality

State space models (SSMs), particularly Mamba, have emerged as efficient alternatives to attention-based architectures and have been extended to vision through ViM, VMamba, and Visual State Space Duality (VSSD). Yet the low-bit post-training quantization (PTQ) behavior of VSSD remains insufficiently understood. A weight-activation split on VSSD-Tiny identifies activation quantization as the dominant low-bit bottleneck, while representative inputs to selected VSSD-backbone linear layers exhibit strong channel-wise magnitude variation and token-localized extremes. We propose the Channel-wise Token-balanced Output-Aware Clipping (CTOAC) method, which learns per-input-channel clipping bounds by minimizing a token-balanced reconstruction loss on the corresponding linear outputs. Only the selected linear layers and their input activations are quantized; other backbone operations retain their original precision. Across VSSD-Tiny, VSSD-Small, and VSSD-Base, the proposed CTOAC method retains ImageNet-1K accuracy and remains substantially more robust than the evaluated baselines at more aggressive precision settings. Applying the same quantization scope to VSSD backbones on COCO and ADE20K preserves strong object detection, instance segmentation, and semantic segmentation performance. An optimized RTX 4090 deployment configuration achieves up to 1.42x end-to-end speedup over FP32.
Read the full abstract