Peer Revenue Equity in science

Papers

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

All of arXiv

Sunday 30 August

Functional Analysis

Inertia-Sensitive Kreiss Bounds for $J$-Selfadjoint Matrices

Let $A \in \mathbb{C}^{n \times n}$ have spectrum in the closed unit disk. Its maximal power growth $\operatorname{Power}(A) := \sup_{k \ge 0} \Vert{}A^k\Vert{}$ measures transient amplification, whereas the Kreiss constant $\operatorname{Kreiss}(A) := \sup_{\vert{}z\vert{}>1} (\vert{}z\vert{}-1) \Vert{}(zI-A)^{-1}\Vert{}$ measures the corresponding resolvent growth outside the disk. The classical finite-dimensional Kreiss theorem gives $\operatorname{Power}(A) \le en \operatorname{Kreiss}(A)$, and the linear dependence on $n$ is unavoidable for general matrices. We show that, for matrices selfadjoint with respect to an indefinite metric, the ambient dimension $n$ can be replaced by an effective dimension determined by the minimal polynomial and the inertia of the metric. Specifically, if $A^*J = JA$, where $J$ is a fundamental symmetry with inertia $(n-q,q)$, then $\operatorname{Power}(A) \le e \min\{d(A), 2q+1, 2(n-q)+1\} \operatorname{Kreiss}(A)$, where $d(A)$ is the degree of the minimal polynomial. Our proof requires no assumption on diagonalizability or reality on the spectrum. Instead, we associate each cyclic orbit with a finite-rank selfadjoint Hankel operator and transfer its rank and inertia to a coefficient estimate. Examples based on scaled nilpotent shifts show that the linear dependence on the smaller inertia index is asymptotically sharp, even when this index is negligible relative to the matrix size and $d(A)=n$. We also obtain scaled-disk decay estimates and weighted-norm extensions to arbitrary nonsingular Hermitian metrics.
Read the full abstract

Superconductivity

Interplay of Excitonic Charge Density Wave and Superconductivity in Transition Metal Dichalcogenides

Motivated by the unique characteristics of the phase diagram of 1T-TiSe2, we investigated the complex interplay of excitonic charge density wave (CDW) and superconductivity (SC) on a two-dimensional triangular lattice, each site accommodating two orbitals. In response to various tuning parameters, such as intercalation, pressure, substitution, and gating, these materials exhibit a generic and gradual waning of CDW, followed by the emergence of SC. Intriguingly, the nature of CDW changes from commensurate to incommensurate with the appearance of SC. Setting up a minimal model based on observed excitonic CDW and electron and hole pockets in the Fermi surface, and analyzing it within a simple mean-field framework, we can comprehend some salient experimental features. We also found that the qualitative phase diagram remains insensitive to details of the band structure. These results offer crucial insights into the nature of the interplay between CDW and SC in transition-metal dichalcogenides.
Read the full abstract

Statistical Methodology

A Generalized Ridge Regression and Convolutional LASSO

We derive the complete duality theory underlying the Hodrick–Prescott filter, whose rank-deficient second-difference penalty admits infinitely many equivalent trend representations via generalized inverses. Constructing two canonical choices—the Moore–Penrose-based B-representation and an alternative A-representation—we prove that the extracted trend is invariant across representations, obtain a closed-form Bregman-type divergence quantifying their disagreement under a shared coefficient vector, and show this divergence vanishes as $\lambda\to\infty$. We further mollify the non-smooth $\ell_1$ trend filter with a compactly supported biweight kernel to obtain a closed-form $C^3$ Convolutional LASSO that restores Newton-type quadratic convergence without sacrificing the kink- setecting character of $\ell_1$ regularization. Theoretical results are verified numerically and benchmarked against ADMM/IRLS on NVIDIA's 2013–2018 daily closing prices, where the sparse filter isolates genuine growth-regime breaks—chiefly the November 2016 post-earnings acceleration—cleanly separated from the smooth $L_2$ trend.
Read the full abstract

Computer Vision

Null-Space Diffusion Restoration with Adaptive Uncertainty-Guided Fusion for Ultrasound Speckle Reduction

Ultrasound B-mode imaging commonly suffers from speckle noise and artifacts, requiring a delicate balance between contrast, resolution, and preservation of anatomical structures. Although recently developed despeckling methods have achieved some progress, supervised learning approaches remain fundamentally limited by the ground truth paradox, which arises from the absence of noise-free, ground truth reference images in in vivo scenarios. Existing unsupervised diffusion-based methods typically enforce data consistency directly in the nonlinear log-compressed domain, which can disproportionately amplify background artifacts when mapped back to the envelope domain. To overcome these limitations, we propose an uncertainty-guided null-space diffusion (UGNS) framework, a novel label-free solution that enforces consistency correction on a stabilized positive-envelope proxy obtained via inverse log compression. The proposed UGNS introduces several technical novelties: (a) extraction of a structural prior in the stabilized envelope domain to produce a robust signal envelope that preserves anatomical structure, (b) development of an adaptive range-null reconstruction mechanism that uses an adaptive weight mask to preserve tissue regions via range-space projection, and (c) introduction of uncertainty-guided fusion in an adaptive way to mitigate sampling variability. Extensive and comparative experiments were conducted using the PICMUS benchmark and in vivo datasets. The results demonstrate that UGNS achieves competitive generalized contrast-to-noise ratio (gCNR) values across diverse datasets. In addition, it is successfully validated that UGNS effectively suppresses speckle noise while preserving fine spatial resolution. Code is available at https://github.com/yousirong/UGNS.git.
Read the full abstract

Computer Vision

PhasorNet: Learning Structure from Frequency for Real-Time Stereo Matching

Accurate stereo matching remains challenging in ill-posed regions such as fine structures, reflective, or transparent objects, where appearance cues are often ambiguous or unreliable. To tackle this, we propose PhasorNet, a lightweight yet powerful framework that boosts geometric discrimination via frequency-domain cues. At its core, the Phase-Augmented Transformer (PAT) injects Fourier-derived phase information into the attention mechanism, yielding photometrically robust, structure-preserving features that prioritize structural consistency in difficult areas. Additionally, we develop a Geometry-Context Fusion Refinement Module (GCFRM) that combines a full-resolution convolutional stream with a lightweight attention-based stream (leveraging WQA and CDGA blocks) to efficiently preserve fine details and object boundaries without excessive overhead. Training is further enhanced by a multi-scale Edge-guided High-Error Region (EHR) loss that adaptively focuses optimization on high-error and edge regions, guiding hierarchical cost volume refinement. With only 5.3M parameters, PhasorNet achieves state-of-the-art performance on the challenging ETH3D benchmark while exhibiting excellent cross-domain generalization on KITTI, delivering an efficient and practical solution for accurate real-time stereo matching.
Read the full abstract

Statistics Applications

Decarbonising price formation: unit-level evidence on battery storage and the imbalance price in the GB Balancing Mechanism

Renewables now dominate Great Britain's generation mix but rarely occupy the marginal price-setting position, which raises the question of which flexible technologies translate a renewable-rich system into real-time price formation. This study reconstructs the price-ranked edge of the eligible bid or offer stack in the GB Balancing Mechanism across 50,684 half-hourly Settlement Periods from 2023 to 2025 and attributes it to individual Balancing Mechanism Units, separating long-system bid-active from short-system offer-active conditions and retaining co-marginal ties. Batteries rose from 0.8% to 36.2% of bid-active and from 3.2% to 26.9% of offer-active marginality, displacing combined-cycle gas on the bid side and pumped storage on the offer side. Capacity-normalised marginal capture rose on both sides, and unit-quarter fixed effects show that an additional 100 MW of Balancing Mechanism active capacity was associated with a 0.55 and 0.48 percentage-point increase in quarterly bid- and offer-side marginal share. By 2025, battery actions were around {\pounds}9 to 10/MWh more favourable than volume-matched non-battery alternatives drawn from the same ladder, yet batteries were under-represented by 12.9 percentage points in the highest-priced 5% of short-system periods. Individual batteries remain consistent with price-taking, while the fleet has become endogenous to routine balancing price formation.
Read the full abstract

Machine Learning

Structure Aware Neural Architecture Search for Mixture of Experts

Neural Architecture Search (NAS) has so far rarely been applied to Mixture-of-Experts (MoE) models, and existing MoE designs leave the alignment between experts and the structure of the data to emerge on its own. We propose an architecture search framework that makes this alignment an explicit search variable: the assignment of data clusters to experts is optimised jointly with the per-expert architectures. We cast the joint problem as a cluster-aware likelihood maximisation, show that it coincides with the incomplete-data maximum likelihood of a latent-variable mixture, and solve it by a generalised Expectation-Maximisation procedure whose otherwise intractable expert-quality term is supplied by an adaptively refined surrogate. We prove that the iterates converge whenever the surrogate errors are summable, and that at every limit point no candidate the search produces improves the true objective. On a heterogeneous image-classification mixture the method recovers the underlying domain partition on 95% of clusters without ever observing domain labels, and on that benchmark and a four-domain time-series forecasting one alike it outperforms the MoE and NAS baselines that likewise use no label information.
Read the full abstract

High Energy Physics (Theory)

BMN Spread Complexity Across Phase Transitions

We investigate the dynamical behavior and spread complexity of quantum states within the mass-deformed BMN matrix model equipped with an emergent $U(1)$ global charge at finite temperature $\beta^{-1}$ and chemical potential $\nu$. Focusing on the strong-coupling regime ($\mu \gg 1$), we model the dynamics via a charged Thermofield Double (cTFD) state and trace the evolution of spread complexity across three distinct thermodynamic regimes. In the low-temperature gapped phase ($\beta \mu \gg 1$), discrete mass-gap bound states dominate, trapping wavepacket dispersion and producing non-chaotic, oscillatory early-time growth. Conversely, in the high-temperature continuum phase ($\beta \mu \ll 1$), thermal excitations overwhelm the mass gap, driving a transition to a continuous advection field that exhibits maximal chaotic scrambling with a Krylov Lyapunov exponent $\lambda_K = \pi / \beta$ that saturates the universal bound. In the intermediate temperature regime ($\beta \mu \sim 1, \beta \nu \sim 1$), the interplay between mass-gap bound states and the continuous thermal background induces a sub-leading correction to the Lanczos coefficients $b_n \sim \frac{\pi}{\beta} n + \gamma \sqrt{n}$, governing a continuous sub-exponential crossover before full chaotic thermalization. Technical derivations regarding KMS boundary conditions, grand canonical spectral moments, residue analysis, and time-reversal symmetry breaking in Krylov space are detailed in four dedicated appendices.
Read the full abstract

Analysis of PDEs

Uniform-in-time relative entropy estimates for Kac's approximation of the Landau equation

We prove uniform-in-time quantitative relative entropy estimates for Kac's particle approximation of the three-dimensional spatially homogeneous Landau equation for Maxwellian molecules. Using the relative entropy method and logarithmic derivative estimates, we obtain a finite-time normalized entropy bound of order $N^{-1/2}$. The proof relies on explicit covariance identities and a new law-of-large-numbers estimate for the particle system using a new duality method. The uniform-in-time propagation of chaos is derived from an interpolation with an algebraic relaxation estimate toward equilibrium.
Read the full abstract

Artificial Intelligence

FRAMEWORKERS: A Dynamic Multi-Agent Framework for AI-Generated Video Production

Modern video generators excel at synthesizing individual clips, but complete video production requires coordinating a long sequence of interdependent creative steps, including scripting, storyboarding, generation, and editing. It further demands persistent asset management and dynamic task orchestration as intermediate outputs, dependencies, and execution states evolve over time. Existing automated systems typically rely on rigid pipelines that are difficult to adapt to diverse inputs and changing workflows, while general-purpose large language models (LLMs) remain unreliable for long-horizon orchestration and multimodal asset routing. We introduce FRAMEWORKERS, a task-centric and workspace-grounded multi-agent framework for open-ended video production. A central Director formulates video creation as dynamic task management, continuously editing a Task Stack to determine which subtask to execute next and which sub-agent to invoke. An Assistant serves as the execution layer, grounding each selected task in a shared Workspace, retrieving the required assets and context, invoking the assigned sub-agent, and persisting the resulting artifacts. Execution capabilities are exposed through modular sub-agents with registered descriptors, allowing new sub-agents to be integrated without redesigning the orchestration workflow. To improve orchestration reliability, we fine-tune the Director via supervised fine-tuning (SFT) followed by Group Relative Policy Optimization (GRPO) for descriptor-conditioned task routing. Experiments show that FRAMEWORKERS outperforms strong LLM planners in routing accuracy, recovers reliably from runtime failures, generalizes to unseen sub-agents without retraining, and achieves higher end-to-end video quality and broader task coverage than fixed pipelines, single-agent systems, and prior multi-agent approaches.
Read the full abstract

All authors Zhendong Li, Lei Sun, Letian Shi, Deheng Zhang, Ruibo Ming, Mengshun Hu, Dannong Xu, Jian Wang, Danda Paudel, Luc Van Gool, Jinjin Gu

Analysis of PDEs

Boundary Harnack inequalities for Kolmogorov equations in asymptotically cylindrical Lipschitz domains

We establish boundary Harnack inequalities for non-negative solutions of the Kolmogorov equation \[ \mathcal Ku=\Delta_xu+x\cdot\nabla_yu-\partial_tu=0 \] in non-characteristic intrinsic Lipschitz graph domains whose defining functions may depend on the higher-order variable \(y_m\). Earlier theory required independence of \(y_m\). We replace this symmetry by quantitative asymptotic cylindricality, measured by a scale-invariant \(C^{0,1/3}_{y_m}\) defect. The perturbative comparison theorem applies whenever this defect is sufficiently small, and hence at all sufficiently small scales for \(C^{0,\alpha}_{y_m}\) graphs with \(\alpha>1/3\), as well as under a vanishing critical cylindrical modulus. We obtain local comparability and intrinsic Hölder continuity of quotients of positive solutions, together with a Hölder estimate for their logarithmic quotient. The proof combines local boundary estimates, valid without \(y_m\)-independence, with a global rigidity argument for cylindrical blow-up limits. The central issue is uniform balance of forward and backward reference values. If this balance fails at collapsing scales, maximal-scale selection and a second rescaling produce a non-negative polynomial-growth Dirichlet solution in an unbounded cylindrical domain that vanishes at the backward reference point but not at the forward one. We exclude this configuration using boundary-energy and mean-value estimates, finite-dimensionality of spaces of polynomial-growth solutions, and translation invariance in \(y_m\). The resulting finite-dimensional translation representation yields real-analytic dependence on \(y_m\). Propagation of zeros, analytic continuation along invariant fibres, and a Tikhonov uniqueness argument then force the limiting solution to vanish identically. The exponent \(1/3\) is critical because \(y_m\) has homogeneous degree three.
Read the full abstract

Number Theory

On supersingular isogeny graphs of Drinfeld modules

We study supersingular isogeny graphs of rank-two Drinfeld modules over $A=\mathbb{F}_q[T]$. For distinct finite primes $\mathfrak p$ and $\mathfrak q$ of $A$, we prove that the graph in characteristic $\mathfrak p$, with edges given by cyclic $\mathfrak q$-isogenies, is connected. The proof combines Gekeler's ideal-class correspondence with strong approximation to realize the graph as a quotient of the Bruhat–Tits tree of the homothety classes of $A_\mathfrak q$-lattices in $(\mathbb{F}_q(T))_\mathfrak q^2$. We also introduce the completeness number $E(\mathfrak p)$, the least integer such that the graph is complete for every prime $\mathfrak q\neq\mathfrak p$ with $\operatorname{deg}\mathfrak q\geq E(\mathfrak p)$, and derive explicit upper bounds using the Ramanujan–Petersson bound for the eigenvalues of operators associated to Brandt matrices over function fields. In particular, if $d=\operatorname{deg}\mathfrak p$, then $E(\mathfrak p)\leq 2d+2$, with sharper bounds depending on $q$ and the parity of $d$. This confirms a conjecture of Micheli and Papikian that the graph becomes complete once $\operatorname{deg}\mathfrak q$ is sufficiently large relative to $\operatorname{deg}\mathfrak p$. We further obtain parity-dependent lower bounds and prove that $E(\mathfrak p)\geq d+\log_q d-K$ for an absolute constant $K>0$ and sufficiently large odd $d$, thereby refuting the previously suggested bound $E(\mathfrak p)\leq d+1$. Finally, we prove a criterion yielding an algorithm to compute $E(\mathfrak p)$.
Read the full abstract

Quantum Physics

Dark state as a measurable state by a dispersive readout without a Purcell limit

It is believed that the enhancement in qubit-resonator coupling allows a better dispersive readout but introduces greater Purcell loss. In this work, we propose that a dark mode in a coupled quantum system may violate this rule by introducing the ZZ interaction between the dark and a bright mode. The dark mode may exhibit an effective zero coupling strength, and zero Purcell loss with the resonator photons. Nevertheless, the dispersive shift is almost the same as the bright state, due to the higher order perturbation introduced by the higher excited states. Such a state demonstrates the measurability without a Purcell limit in circuit quantum electrodynamics.
Read the full abstract

All authors Wei-Chen Chien, Jyh-Yang Wang, Yen-Yu Chiang, Cheng-Chengh Huang, Lih-Chieh Hsaio, Yen-Chun Chen, Cen-Shawn Wu, Chiidong Chen, Watson Kuo

Disordered Systems and Neural Networks

Pseudo Entropy in Quantum Spin Chains: from Integrability to Chaos

In this work, we study pseudo entropy and spectral dynamics in quantum spin chains (Heisenberg XXZ model and the mixed-field Ising model) to investigate whether they can serve as diagnostics of quantum chaos. First, we derive an exact relation between the real part of the thermal pseudo entropy and the spectral form factor. This provided evidence that pseudo entropy could exhibit the characteristic dip, logarithmic ramp, and plateau, implying the precise manner in which pseudo entropy probes chaos. We found that the imaginary part, while it does not diagnose chaos, can still provide crucial information about Fisher zeros that is not available in the real counterpart. For spatial pseudo entropy in the XXZ chain, we find that the logarithmic critical scaling persists in both integrable and chaotic regimes, and that the non-positivity conjecture holds. Finally, we derive an exact connection between pseudo entropy, relative pseudo entropy, and spectral complexity with a potential connection to holography.
Read the full abstract

Computer Vision

RegionCache: Semantic-Aware Region Reuse for Efficient Multi-Turn Image Generation

Real-world image generation often involves multi-turn editing, where users iteratively modify small regions while most image content remains unchanged. However, existing diffusion transformer (DiT)-based editing pipelines recompute the entire image at every turn, causing substantial redundant computation. Existing DiT acceleration methods further ignore semantic correspondence across prompts, leading to unnecessary recomputation or unsafe reuse that harms editing quality. To address this, we propose RegionCache, a semantic-aware reuse framework for multi-turn image editing that selectively reuses diffusion states from unchanged regions. RegionCache detects reusable regions through semantic overlap between consecutive prompts and cross-attention localization, and adopts an adaptive reuse schedule based on prompt similarity and contextual consistency. Experiments on PixArt-alpha demonstrate that RegionCache achieves 1.43x–2.55x end-to-end speedup while maintaining comparable image quality. Code is available at https://github.com/hebutBryant/RegionCache.
Read the full abstract

All authors Peizheng Li, Xin Ai, Hanyuan Liu, Qiange Wang, Yanfeng Zhang

Cryptography and Security

POLYFLOW: A Neuro-Symbolic Framework for Static Cross-Language Information Flow Analysis

Modern software systems are commonly constructed in multiple, interacting programming languages. This construction leads to additional, often stealthy vulnerabilities buried in complex information flow due to language interactions. Existing static analyzers are impeded by the heterogeneous semantics of different languages, whereas dynamic approaches suffer from the limited coverage of (available and/or generated) test inputs. In this paper, we develop PolyFlow, a neural-symbolic framework for statically reasoning about information flow across language boundaries, combining large language models (LLMs) and static analysis synergistically. Governed by the control-flow representation of a given multi-language system, PolyFlow leverages LLMs to identify implicit flow facts due to challenging language features, hence augmenting the base representation and then propagating data flow through the system. It tackles inherent barriers (e.g., token limit and hallucination) of LLMs by putting them under careful guidance (e.g., static-analysis-guided scoping, context management, and fact checking), along with a multi-LLM expert panel for negotiated validation. Our experiments on real-world Python-C and Java-C systems show that PolyFlow is cost-effective and superior to various kinds of state-of-the-art baselines, revealing previously unknown cross-language vulnerabilities that are missed by all the baselines.
Read the full abstract

All authors Haoran Yang, Zhixuan Zhong, Jiawei Guo, Haipeng Cai

Statistical Mechanics

Branching stochastic mechanics: Clustering and connected correlations within a branching-process representation of the Schrödinger equation

Can finite-range correlations hide in the statistics of an extended quantum state? The Schrödinger-Nagasawa transform represents the wave function by positive forward and backward diffusion fields whose product is the Born density. We promote them to branching superprocesses, \(\Phi_F\) and \(\Phi_B\): diffusion samples stochastic paths, whereas Bohm/Fisher-controlled branching generates genealogies of alternative continuations. With rates evaluated on the prescribed Born density, their means reproduce Schrödinger dynamics exactly. The connected sector exhibits supercritical, critical, and subcritical clustering in confinement and has critical dimension \(d_c=2\) in free space. Stationary eigenmodes remain extended; subcritical clusters acquire the reduced de~Broglie scale. We then let the branching rate respond to the fluctuating product \(\Phi_F\Phi_B\). In the reciprocal basis, the fields equal a smooth reference \(R\) plus centered fluctuations \(\psi_F,\psi_B\), defining the signed kernel \(C_{\rm FB}(x,y)=\mathbb E_\omega[\psi_F(x)\psi_B(y)]\). On the anticorrelated branch, \(\rho_{\rm BSM}(x)=-C_{\rm FB}(x,x)\) is the positive organized connected weight. Stationary matching of this weight to the Born profile is imposed as a closure condition, while off-diagonal decay defines the correlation range. The pair equation splits into collective and relative sectors: spectral cancellation selects the Born collective mode, while suppression of the leading density fluctuation selects the anticorrelated source channel. With relative diffusivity \(D_{\rm eff}\) and positive relaxation rate \(\mu_{\rm FB}\), correlations have screening length \(\xi_{\rm FB}=\sqrt{D_{\rm eff}/\mu_{\rm FB}}\). Within this reciprocal closure, an extended Born-shaped connected weight and a finite correlation range can coexist in one stochastic kernel.
Read the full abstract

All authors Eric Dumonteil, Benoît Bischoff, Alain Letourneau, Loïc Thulliez, Corentin Doutre

General Relativity and Quantum Cosmology

Two Languages for the Same Resonance: From Nuclear Decay to Black-Hole Ringdown

Quantum resonances and black-hole quasinormal modes (QNMs) are described by closely related mathematics: radiative boundary conditions, analytic continuation of Green functions or resolvents, poles on nonphysical sheets, and non-self-adjoint spectral representations. This article does not introduce that equivalence but reconstructs its genealogy. Nuclear resonance theory grew from radioactive decay, reaction cross sections, metastable compound states, and complex energies, whereas black-hole perturbation theory grew from spacetime stability and causal response. We place the two developments on a common chronology, from Sommerfeld's radiation condition and early nuclear-decay theory through Regge–Wheeler perturbations, Vishveshwara's 1968 dissertation and 1970 papers, Press's 1971 quasi-normal terminology, and the independent Aguilar–Balslev–Combes theory of analytic dilation, then follow their later mathematical reunification in scattering-resonance theory. Alongside the chronology, we give a working dictionary relating no-incoming and horizon-ingoing/infinity-outgoing conditions, pole energy and complex frequency, width and damping rate, residues and excitation factors, and nonresonant background with branch-cut and prompt contributions. The aim is to make the cross-disciplinary equivalence operational without flattening its history, and to distinguish mathematical equivalence from historical genealogy.
Read the full abstract

Chemical Physics

Site-Specific Vibrational Dynamics to Probe Local and Global Protein Motions

Vibrational spectroscopic probes can provide site-specific information on protein structure and dynamics. In this work, the possibility to relate protein motion with the vibrational response for –SCN, –N$_3$, and –SNO labels covalently linked to all alanine-residues in lysozyme is investigated. Depending on the position of the probe along the polypeptide chain, its local hydration, and the dynamics of its environment, the vibrational response can encode not only local fluctuations but also low-frequency, collective motions of the protein. The spectroscopic probes are described using machine-learning-based models for both bonded interactions, represented by reproducing-kernel models, and electrostatic interactions, represented by fluctuating minimally distributed charges. Spectroscopic dynamics are characterized through frequency fluctuation correlation functions (FFCFs). For many probe locations, the FFCFs contain a non-decaying component on the simulation time scale, indicating residual slow dynamics and incomplete sampling of the underlying conformational fluctuations. The magnitude of these static contributions is consistent with previous experimental observations, providing qualitative validation of the simulations. Overall, the results demonstrate that site-specific vibrational probes can report on dynamics extending beyond their immediate local environment and can, at suitable locations, provide information on collective protein motions.
Read the full abstract

Computer Vision

Beyond Global Realism: Virtual Try-On Evaluation and Optimization with Dimension-wise Garment Fidelity Assessment

Virtual try-on (VTON) requires not only realistic generation but also faithful preservation of garment characteristics. However, existing evaluation metrics such as PSNR, SSIM, KID and FID struggle to measure the consistency between the generated and reference garments, particularly in capturing the multi-dimensional characteristics of garment fidelity. To address this, we propose DAT: a Dimension-wise Assessment framework for virtual Try-on, which decomposes garment consistency into seven interpretable dimensions: silhouette, color, neckline and sleeve shape, major decoration and structure, material texture, fine-detail fidelity, and logo preservation, each formulated as a discrete attribute-level prediction task. To train this specialized assessment model, we adopt a two-stage learning paradigm comprising large-scale weak supervision on 50K samples, followed by refinement on 10K higher-quality annotations obtained via multi-model voting. Furthermore, we employ weighted cross-entropy loss to mitigate the severe label imbalance inherent across evaluation dimensions. Beyond its role as an evaluation framework, the assessment model can be integrated into reinforcement learning optimization of Qwen-Image-Edit for VTON, where dimension-wise rewards are adaptively aggregated to emphasize under-optimized aspects during training. Experimental results show that our method (8B parameters) achieves state-of-the-art performance in terms of balanced accuracy, SROCC, and PLCC, outperforming strong proprietary models such as Gemini-3.1, Qwen3.7-plus, and GPT-5.5, while also serving as an effective optimization signal for reward-guided VTON generation
Read the full abstract

All authors Kaidong Zhang, Yukang Ding, Xiaoyu Liu, Ying Chen

Computers and Society

Do LLMs Change Their Minds Like Humans? Diagnosing Human–LLM Divergence in Single-Turn Persuasion Judgments

Large language models (LLMs) are increasingly deployed as proxies for human participants in social simulations, yet whether they update their beliefs in response to persuasive arguments, as humans do, remains poorly understood. We conduct a systematic comparison using a naturally occurring online persuasion corpus in which original posters explicitly verify whether a reply changed their view. Our results show that LLMs achieve only slight agreement with humans (Cohen's kappa ranging from 0.079 to 0.178). Content-level analyses show that humans and LLMs agree on the strongest persuasion cues but diverge on finer ones: humans are more swayed by novel content and assertive language, whereas LLMs favor topical similarity and surface-level formatting. At the level of persuasion strategy, LLMs underweight emotional appeals and overweight credibility signals relative to humans, while the type of proposition under debate exerts no measurable effect on the degree of divergence. Furthermore, switching from first-person role-playing to third-person observation shifts all models toward greater resistance to persuasion, with the effect varying across persuasion strategies and textual features. These findings highlight the risk of treating LLM judgments as faithful proxies for human belief updating and point to structural differences in how LLMs and humans process persuasive discourse. Our code is available at https://github.com/tsinghua-fib-lab/LLM-belief-update-cmv.
Read the full abstract

Computer Vision

Foundation and Multimodal Large Language Models for Face Presentation and Morph Attack Detection

Face recognition systems are increasingly deployed in security-critical applications, yet they remain vulnerable to presentation and morph attacks. Presentation attack detection (PAD) and morphing attack detection (MAD) are therefore essential components of trustworthy face biometrics. Despite advancements in PAD and MAD methods, existing detectors suffer from limited generalization and degrade in cross-dataset evaluation. In this paper, we systematically investigate whether general-purpose foundation models (FMs) and multimodal large language models (MLLMs) encode PAD-relevant and MAD-relevant information, and how such models can best be deployed for both tasks. We study five approaches with increasing access to the internal information of the model: (i) zero-shot prompting of off-the-shelf MLLMs; (ii) training a shallow model on the next-token logit probabilities at the output of the MLLM; (iii) parameter-efficient fine-tuning on task-specific question-answer data, yielding two specialized MLLMs, called PADLLM and MADLLM, which additionally provide textual reasoning for their decisions; (iv) linear probing of frozen vision encoders; and (v) fine-tuning of vision encoders of FMs and MLLMs. We benchmark 16 open-weight MLLMs and 30 vision encoder backbones on four PAD datasets (MSU-MFSD, CASIA-FASD, Replay-Attack, and OULU-NPU) and four MAD datasets (FFHQ, FRGC, FRLL, and FERET). Our experiments show that FMs and MLLMs can achieve significant performance for PAD and MAD. In addition, the fine-tuned models achieve state-of-the-art detection performance in cross-dataset evaluation, indicating that general-purpose pretrained representations carry substantial attack-relevant information. Source code of all our experiments will be publicly released.
Read the full abstract

All authors Hatef Otroshi Shahreza, Asif Hussain Khan, Peter Lorenz, Alain Komaty, Sébastien Marcel

High Energy Physics (Phenomenology)

Seesaw and Axion in No-Scale Gravity

The No-Scale gravity is a compelling framework to describe particle physics, gravity and cosmology, in which all mass scales are an illusion given by the value of a scalar field $\phi$. This theory, however, falls under the umbrella of more general scalar-tensor theories, which propagate different modes depending on the scalar field, and faces the extensive debate regarding the equivalence between its Jordan and Einstein frame descriptions. In this work we advocate that by excluding the singular point in the transformation between the two frames (e.g., $\phi=0$) we can have the classical equivalence between them. To show the merit of removing this singular point, we argue the Jordan frame makes the symmetries of the model manifest, which creates a suitable playground for the particle-physics model building which we illustrate by showing the emergence of discrete symmetries which leads to a high-quality axion and also naturally incorporate the seesaw mechanism.
Read the full abstract

Computer Vision

Source-Dependent Deference in Medical Imaging Agents Under Falsified Findings: A Pilot Audit

Tool-using agents are being proposed for medical imaging, and their behaviour when a tool returns a false finding is largely unmeasured. We audit whether a ReAct-style tool-calling agent abandons an answer it has already given correctly once a falsified finding arrives, and whether that depends on how the finding is presented. On 20 VQA-RAD closed questions across four vendor-designated model tiers, the agent commits to an answer from the image alone; a negated finding is then delivered either as JSON from an analyze_image tool the agent invokes itself, or as quoted prose attributed to a radiologist. Our outcome is the commission-error rate over cases answered correctly without any tool. Deference is much higher under the prose-attributed claim: at the strongest tier the agent revised its correct answer in 10 of 13 cases against 1 of 13 under the tool (exact McNemar p=0.0039, Holm-adjusted 0.012). We do not claim this isolates the source label. Attribution travels with the delivery channel in our design, and exposure differs because the tool claim reaches the agent only when it calls the tool. The finding is a joint source-and-delivery asymmetry from a small-scale pilot whose pre-specified stopping rule was not met.
Read the full abstract

Numerical Analysis

Optimal error estimates of sequential finite element method for nonlinear thermo-poroelasticity problems

This study introduces and analyzes a three-step sequential decoupling algorithm designed to address nonlinear, fully coupled quasi-static thermo-poroelasticity systems incorporating convective transport. The finite element method is employed for spatial discretization and the backward Euler method for temporal discretization. The proposed sequential method has a higher computing efficiency than the fully implicit nonlinear numerical scheme, since it does not require any internal iterations. The well-posedness of the numerical solution is discussed by introducing a cut-off operator and the stability analysis of the algorithm is performed. Rigorous analysis yields optimal convergence order estimates for both spatial and temporal discretizations. In order to confirm the theoretical results and the effectiveness of the suggested approach, numerical experiments are finally carried out.
Read the full abstract

Computation and Language

R$^2$A: Learning Persona Policies Through Persona Representation Learning and Runtime Alignment

The same Persona behavior can be beneficial in one context but harmful in another, causing static Persona elicitation to perform inconsistently across tasks. We introduce the Persona Selection–Realization Framework, which models behavior generation through a latent Persona state and decomposes it into Persona Selection and Persona Realization. The discrepancies between static Persona elicitation and an ideal Persona policy in these two components define the Selection Gap and Realization Gap, respectively. Building on this framework, we propose R$^2$A, a two-stage approach for learning Persona policies. Persona Representation Learning uses structured Who–How–What presentations to encode the target Persona's objective, conditional behavioral principles, and trajectory-level manifestations. Persona Runtime Alignment then removes the explicit Persona specification and jointly calibrates behavior selection and trajectory realization using task feedback. Across 12 evaluation settings covering the four principles of the Accountable-Professional Persona studied in this work, R$^2$A overall outperforms both the base model and static Persona elicitation. Ablation results further show that Persona Representation Learning is critical for preventing Runtime Alignment from producing behaviorally imbalanced policies and for achieving more stable Persona policy learning.
Read the full abstract

All authors Mohan Zhang, Chengsong You, Xiaoyu Cao, Zhen Sun, Xiaohan Jia, Junwei Zhou, Yongchao Chen

Probability

Mean-field branching SDEs: propagation of chaos, scaling limits and phase transitions

We study branching SDEs with law-dependent immigration and their mean-field particle approximations. Under a dissipativity condition and sufficiently weak interaction, a uniform propagation-of-chaos bound in time of order $N^{-1/2}$ is established. On every fixed finite time horizon, the same order of propagation of chaos holds for arbitrary finite interaction strength. A two-stage scaling limit connects continuous-time discrete-state mean-field birth–death processes to interacting branching diffusions and then to the nonlinear equation. For a logistic mean-field diffusion we prove a sharp criterion for extinction/non-extinction, and further show that weak enough interaction strength is necessary for a uniform-in-time approximation.
Read the full abstract

Number Theory

Euler Characteristics of $\mathrm{SL}_4(\mathbb{Z})$ and $\mathrm{GL}_4(\mathbb{Z})$, and their cohomological consequences

We compute the homological Euler characteristics of $\mathrm{SL}_4(\mathbb{Z})$ and $\mathrm{GL}_4(\mathbb{Z})$ with coefficients in arbitrary irreducible rational highest-weight representations. Applying Wall's formula, we combine the orbifold Euler characteristics of centralizers of torsion elements with traces computed using the Jacobi-Trudi identity to derive explicit formulas and rational generating functions. Consequently, these Euler characteristics are quasi-polynomial functions of the highest-weight parameters, of total degree at most two. We further derive degreewise vanishing results and parity-sensitive lower bounds for the dimensions of cohomology groups. The two extensions of an $\mathrm{SL}_4(\mathbb{Z})$-coefficient system to $\mathrm{GL}_4(\mathbb{Z})$ yield sharper bounds, which grow linearly or quadratically in explicit infinite families. For symmetric powers, combining our formulas with Horozov's calculation of the determinant-twisted summand yields exact identities and lower bounds for the untwisted summand, together with a conjectural degreewise description of its cohomology.
Read the full abstract

Optics

Localization in microcavities revealed by phase-space non-Hermitian skin effect

Contrary to the semiclassical expectation for fully chaotic systems, localization of resonances is found to be a common feature in open microcavities. In spiral-shaped dielectric microcavities, a substantial fraction of resonances localize on polygonal patterns in real space, are chiral, and their momentum distributions accumulate near the critical line for total internal reflection. Despite the extensive investigation, the physical mechanism responsible for their remarkable abundance has remained a long-standing question. Addressing this, we reveal a physical correspondence between an inhomogeneous-loss Hatano-Nelson model and the dielectric phase space of a spiral microcavity. We show that the combination of geometry-induced momentum drift and refractive escape yields a generalized non-Hermitian skin effect in the phase space momentum. We identify this mechanism as the origin of the critical-line localization of resonances in open chaotic spiral microcavities, extending the skin-effect concept beyond nonreciprocal lattices to phase space and to open chaotic wave systems.
Read the full abstract

All authors Jung-Wan Ryu, Yong-Hoon Lee, Muhan Choi, Chang-Hwan Yi, Martina Hentschel

Analysis of PDEs

Refined decay estimates for global solutions to the rotating MHD equations

In this paper, we consider the Cauchy problem for the incompressible magnetohydrodynamic equations with the Coriolis force in the three-dimensional whole space. For large initial data, it is known that the Cauchy problem admits a unique global solution in critical Sobolev space $\dot{H}^{1/2}(\mathbb{R}^3)$ provided that the speed of rotation is fast enough. By using delicate dispersive estimates, we show refined decay estimates of the velocity field and magnetic field. These decay rates significantly improve the ones obtained by Kim [J. Differential Equations., 2022] in the subcritical Sobolev framework $H^s(\mathbb{R}^3)$ with $1/2<s<3/2$.
Read the full abstract