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

Differential Geometry

Decay estimates for Yang-Mills connections and Yang-Mills-Higgs pairs in higher dimensions

We obtain decay estimates at infinity for Yang-Mills connections and Yang-Mills-Higgs pairs on higher-dimensional manifolds. The main tool is an abstract decay theorem for manifolds with suitable positive harmonic functions. Combining this theorem with refined Kato inequalities, we prove that a natural quadratic decay assumption implies an improved decay rate on certain asymptotically conical and product manifolds.
Read the full abstract

High Energy Physics (Phenomenology)

Constraining Proton Spin at Small $x$ with Valence Quark Model

Recently, a global analysis has been performed for longitudinal spin asymmetries in polarized deep inelastic scattering (DIS) processes, combining the polarized valence quark model with the large-$N_c \& N_f$ helicity evolution equations. With a three-fold reduction in the number of free parameters, the valence quark model results in a six-fold reduction of uncertainty for the resulting prediction of total parton spin inside the proton, when compared to previous analysis performed with traditional moderate-$x$ model inspired by Born approximation. The fit based on valence quark model predicts a positive gluon hPDF and negative $g_1$ structure function at small $x$. However, the resulting increase in the $\chi^2$-statistic of the fit warrants further examination into the physical uncertainty of the valence quark model, which is a work in progress. We also summarize other possibilities of future research directions towards the end of this article.
Read the full abstract

Statistics Theory

Marginal maximum likelihood estimation and asymptotic theory for latent variable models in high dimensions

This work addresses a longstanding gap in the statistical foundations of marginal maximum likelihood estimation for high-dimensional latent variable models. Marginal maximum likelihood estimation is widely used to fit latent variable models across the social sciences, ecology, and machine learning. Despite its broad use, rigorous asymptotic theory for nonlinear models remains limited when both the sample size and the number of observed variables diverge. The gap arises largely from the fact that integration over the latent variables creates a nonlinear objective that tightly couples the high-dimensional model parameters. To address this issue, we first show that the marginal likelihood exhibits multiple nearly flat directions even at the true parameter, in contrast to the behavior in the fixed-dimensional case. Building on this geometric characterization, we develop new techniques to establish consistency and asymptotic normality for the marginal estimator of the high-dimensional parameters. For the latent variables, we provide frequentist and Bayesian uncertainty quantification, proving asymptotic normality of the maximum a posteriori estimator and a Bernstein-von Mises-type result for the plug-in posterior. Together, these results provide rigorous foundations for marginal estimation and latent-variable inference in high-dimensional models.
Read the full abstract

Operator Algebras

On the Orlicz function estimations of the $a$-Davis–Wielandt radius in $C^*$-algebra

We present a systematic study of $a$-Davis–Wielandt radius estimates for elements in a unital $C^*$-algebra through an Orlicz function approach. We derive novel bounds for the algebraic $a$-Davis–Wielandt radius and further obtain estimates for the classical algebraic Davis–Wielandt radius via polar decomposition and the Moore–Penrose inverse. The results obtained in this work extend, generalize, and unify a variety of established inequalities in the literature as special cases.
Read the full abstract

Multimedia

Mechanism-Level Evaluation for Vision-Language Models: Controlled Activation-Replacement Diagnosis of Gender Bias

Behavioral benchmarking reveals what biases exist in vision-language models but not which internal components are most sensitive to targeted intervention, precluding principled intervention. We argue for mechanism-level evaluation as a necessary complement, demonstrating causal mediation analysis as a diagnostic instrument for gender bias. We decompose gender-cue effects into controlled indirect effects attributable to specific-layer activations and direct effects through all other pathways, producing layer-by-layer mechanistic signatures. Across six models spanning three architectural families (LLaVA-1.5, LLaVA-NeXT, InstructBLIP at 7B/13B) and two 8B-scale architectures, three findings emerge: language-layer activations exhibit the greatest output sensitivity under controlled intervention, with the direct component often carrying the opposite sign; architectural choices redistribute layer-wise sensitivity to activation replacement; and counterfactual scores diverge from surface-level scores, exposing implicit associations. Systematic ablation validates internal consistency. An intervention experiment finds that the average indirect effect (AIE) and downstream intervention effectiveness are only weakly correlated (Pearson $r = 0.33$), and the layer with the second-largest AIE produces near-zero bias change—indicating that mechanistic diagnosis captures activation-replacement sensitivity but does not, by itself, identify optimal intervention targets. These results show mechanism-level evaluation captures architecture-specific sensitivity patterns that behavioral benchmarks cannot; pairing both should become standard NLP practice. Code: https://github.com/zhaozhipeng1997/CARD-GenderBias.
Read the full abstract

All authors Zhipeng Zhao, Wenxu Wang, Peishun Liu, Ruichun Tang

Atomic and Molecular Clusters

Electron scattering from polar hydrides using relativistic optical potential method

We extend the relativistic spherical complex optical-potential method with group additivity developed in our recent work [S. Arya and B. Antony, RSC Adv. 16, 13548–13558 (2026)] to molecules with permanent dipole moments. The short-range electronic collision is described by a central Dirac partial-wave calculation, while the missing anisotropic long-range dipole interaction is restored through a rotationally resolved first-Born contribution. The rotational thresholds, state-to-state transition-dipole strengths, and thermal populations are obtained from the HITRAN2024 spectroscopic database and thermally reweighted at the adopted rotational temperature. Both excitation and superelastic de-excitation channels are included. Electron scattering from benchmark polar hydrides ($\rm H_2O$, $\rm H_2S$, $\rm NH_3$, and $\rm PH_3$) is investigated over the incident-energy range 0.1–10,000 eV. We report vibrationally elastic, differential, integral, and momentum-transfer cross sections, together with a total cross section that also contains electronically inelastic loss from the quasifree absorption potential. The calculations reproduce the broad experimental and recommended trends over a wide energy range. The largest deviations are confined mainly to the low-energy and resonance-sensitive regions. Overall, the agreement improves substantially from the tens-of-eV region upward. The method therefore retains the low computational cost and wide energy coverage of the optical-potential approach while adding the long-range rotational physics needed for polar molecules.
Read the full abstract

Materials Science

Total-energy-assisted Tight-binding Method Based on Density Functional Theory - Design Principles toward Transferability and Extrapolation

The previously proposed tight-binding method derived from the total energy has been extended within the local density approximation (TE-TB method; J. Phys. Soc. Jpn. 87, 064802 (2018)). Unlike the earlier two-parameter formulation, the present method introduces three parameters. These parameters explicitly capture local packing effects and improve transferability. Furthermore, based on physical considerations, several boundary conditions (inductive bias) are imposed on the functionals defining the tight-binding Hamiltonian and related energy functionals. The revised formalism is tested on crystalline silicon to assess the stability of the diamond structure, a monovacancy, and the (001) surface. These benchmark tests demonstrate the high transferability and reliability of the present three-parameter TE-TB design philosophy.
Read the full abstract

Machine Learning

GrowMTP: Can RL Grow Its Own Draft Head?

Reinforcement learning (RL) post-training drives the frontier capabilities of large language models, with its wall-clock dominated by autoregressive rollout generation. Speculative decoding is an established remedy for this bottleneck, but existing draft heads must be pretrained or warmed up before RL, introducing substantial training cost outside the RL run to be accelerated. We observe that RL training itself provides both conditions required for online draft-head training: its rollout distribution is far narrower than that of pretraining, and its verification step continuously produces supervision signals aligned with this distribution. Building on these observations, we propose GrowMTP, which uses this supervision to train a draft head from scratch entirely within the RL loop, with all head updates detached from the policy backbone. On Qwen3-4B (no draft head), MiMo-7B-SFT (weak head), and Qwen3.5-4B-Base (strong head), GrowMTP achieves rollout speedups of 2.13x, 1.93x, and 1.36x, and end-to-end speedups of 1.60x, 1.41x, and 1.20x, respectively. GrowMTP therefore serves existing RL training frameworks as a modular component, particularly offering a from-scratch acceleration path for models without pretrained draft heads.
Read the full abstract

All authors Minghua He, Lingzhe Zhang, Yuan Liu, Xiao Zhou, Aiwei Liu

Computer Vision

ViD: Vision-Dominant Gender Bias Mitigation for Large Vision-Language Models

Gender bias in large vision-language models (LVLMs) undermines their fairness and reliability, compromising output trustworthiness. Current mitigation methods rely on training-phase adjustments or post-hoc calibration, but face limitations in dynamic visual bias mitigation. These include inability to capture real-time visual-textual incongruence, dependence on predefined gender bias taxonomies, and degraded cross-modal alignment with emergent bias patterns. To address these challenges, we propose ViD, a causally-inspired framework that analyzes attention mechanisms across five distinct patterns, revealing confounding effects from strong language priors. ViD demonstrates that visual-to-language cross-attention effectively suppresses bias while preserving general reasoning capabilities and text generation quality. ViD incorporates dual mechanisms: backdoor adjustment counters strong language priors, while refined token selection in decoding layers optimizes processing. This enhances model robustness and inference efficiency. Our integrated approach significantly mitigates gender bias across multidimensional social attributes in LVLMs, improving visual grounding and output fairness. Cross-benchmark validation shows ViD reduces gender bias by 14.7% on single-attribute evaluations (FACET) and achieves significant improvements on image captioning tasks (MS COCO), with gender bias score improving from 0.6708 to 0.9978 for LLaVA. Crucially, these improvements require no additional training overhead, making ViD a scalable and practical solution for bias mitigation in LVLMs.
Read the full abstract

All authors Zhipeng Zhao, Zhaoqiang Wei, Peishun Liu, Youwei Zhao, Ruichun Tang

Computer Vision

What Do Hallucinations Reveal About Multimodal Reasoning? Diagnosing Visual Grounding Failures via Contrastive Decoding Probes

When strong multimodal models are widely available, progress requires new scientific methodologies beyond benchmark scores—using models as instruments for understanding behavior. We address this by asking: can we use large vision-language models (LVLMs) as experimental instruments for studying their own failure dynamics? Focusing on visual hallucination, we introduce SAFE, a training-free decoding framework that contrasts visually-grounded and vision-ablated generation paths to produce a token-level contrastive grounding score that identifies when the model favors linguistic priors over visual evidence. This signal serves dual roles: as a practical proxy for detecting visually-ungrounded tokens, and as the basis for decoding-time penalties. Our analysis yields three empirical observations: visual dependency decays over generation, hallucinations co-occur in temporal clusters, and early intervention reduces clustering without substantially degrading fluency. On MMHalBench, SAFE substantially outperforms all compared baselines; results elsewhere are more mixed. We argue that designing contrastive probes exemplifies a broader mission: using models as instruments for scientific understanding. Code: https://github.com/zhaozhipeng1997/SAFE_public.
Read the full abstract

All authors Zhipeng Zhao, Wenxu Wang, Peishun Liu, Ruichun Tang

Human-Computer Interaction

Beyond Benefit or Risk: Perceived Impact Profiles of Human-AI Affective Interaction and Their Associations with Psychological Functioning

Relational AI increasingly serves as an emotional shelter for humans, and its impact is mixed. Prior research has focused on either positive or negative impacts, leaving unclear how they are configured within individuals and relate to psychological functioning. To address these gaps, this study used a sequential mixed-methods design. Study 1 interviewed 52 users with emotional ties to AI and identified four positive impact domains (emotional relief, loneliness alleviation, enhanced interpersonal functioning, and personal growth) and four negative impact domains (virtual-real boundary blur, social replacement, cognitive-emotional reinforcement, and excessive use). Study 2 followed 673 Chinese AI users for six months and identified four profiles of individuals differently impacted by relational AI use: minimal impact, benefit-driven impact, mixed impact, and risk-driven impact. Users in the mixed impact and risk-driven impact profiles were both high in human-AI affective bonding, but those showing risk-driven impact had greater vulnerability, indicated by higher interpersonal need frustration and emotion-regulation difficulties, more depressive and anxiety symptoms, and lower self-esteem and flourishing. Users in the benefit-driven and mixed impact profiles showed more favorable psychological functioning. After controlling for baseline functioning and relevant covariates, Wave 1 profiles did not predict five of the six Wave 2 indicators; only users in the mixed impact profile reported higher flourishing than those in the minimal impact profile. Overall, potential psychological harms associated with relational AI engagement appeared limited and selective. These findings portray relational AI as a heterogeneous socio-emotional context that may partly mirror users' states and traits, warranting individualized, adaptive safeguards.
Read the full abstract

All authors Lu Chen, Fenghua Tang, Jiayu Zhao, Xuanying Li, Yanli Wang, Weijia Fang, Mengyu Miranda Gao, Zhuo Rachel Han

Robotics

WholeBodyWAM: Generalizing Pre-trained World-Action Priors to Humanoid Loco-Manipulation via WBC-Grounded Coordination

World Action Models (WAMs) offer a promising approach to general-purpose robot manipulation by jointly modeling visual dynamics and actions. However, most WAM studies focus on tabletop or arm-centric manipulation, while humanoid loco-manipulation remains less explored. To address this gap, we introduce WholeBodyWAM, which jointly predicts future visual dynamics, manipulation actions, and whole-body control intents for generalizable humanoid loco-manipulation. It preserves pre-trained world-action priors while grounding heterogeneous whole-body controller (WBC) semantics and coordinating whole-body behavior. Extensive experiments show that WholeBodyWAM achieves an overall simulation task success rate of 91.9%, with a 0.23 improvement in real-world out-of-distribution task progress and a 70% reduction in success-rate variance across WBCs relative to the respective baselines. These results suggest a path toward scalable humanoid whole-body intelligence by extending pre-trained world-action priors through structured WBC grounding and coordination, rather than relearning whole-body behavior from scratch. Project page: https://wholebodywam.github.io/.
Read the full abstract

All authors Zhuo Li, Yiming Yao, Jim Tan, Mengjie Jing, Zhipeng Dong, Fei Chen

Mesoscale and Nanoscale Physics

Accurate noise spectroscopy using quantum sensing ensembles

Noise spectroscopy with quantum sensors is a powerful tool for characterising the properties of the sensor environment and detecting critical magnetic phenomena. While replacing single sensors with large ensembles promises substantial gains in measurement sensitivity and field of view, the output becomes difficult to interpret when there is a variable coupling to targets across the sensing ensemble. In this work we present an analysis procedure for accessing the true source noise spectrum using ensemble coherence from dynamical decoupling measurements. We show that sequence timing plays a dual role in ensemble noise spectroscopy, setting both the frequency selectivity and the weighted collection of signal across the ensemble, and demonstrate how incorporation of the coupling distribution allows accurate parameter extraction of the noise. We apply this procedure to a model system, shallow nitrogen-vacancy centres in diamond, and show that consistent information about the spectral character of MHz-range surface noise can be obtained from two sensing ensembles featuring distinct depth distributions. Our results pave the way for using large quantum sensor ensembles for quantitative, broadband noise spectroscopy, with straightforward extension to other solid-state and molecular sensing platforms.
Read the full abstract

All authors Dhilan T Vallury, Nikolai Dontschuk, Alexander M Jakob, Alexander J Healey, David A Simpson

Trading and Market Microstructure

From Public Evidence to Contractual Outcome: First and Stable Decidability on Kalshi

Public evidence can become sufficient to settle a prediction-market contract before the venue records its first determination, but the relevant boundary depends on the applicable rule version, exact release object, source hierarchy, correction history, and unfinished contract conditions. This paper defines two Kalshi clocks: first decidability, the earliest contemporaneous singleton in the rule-evidence mapping, and stable decidability, the retrospective earliest time after which the same singleton remains unchanged through finalization. A completed retrospective identification test establishes a narrow feasibility result. In a frozen blind pilot, all 25 identities and blinding checks passed and current rule text was recovered for all 25; no exact or bounded historical rule version and no exact or bounded official source-release object was recovered. The full historical recovery covered 152,694 ordinary tickers, 11,530 exact event identities, and 6,540 read-only official requests, with zero historically eligible events and zero historically eligible tickers. This is an observability result, not a claim that no market was decidable or that public evidence never existed. A completed prospective infrastructure shakedown established observation capability for three source programmes across 25 markets, with integrity revalidation of 781,266 lifecycle frames, 22 closed lower-bounded reconnect receipts, no unresolved reconnect gap, no due-but-missed official release, and an inactive price layer. Production evidence enrollment is active. The prospective sample is constructed only at enrollment close from prospectively frozen identities and pre-outcome fields; its frozen target size is selected mechanically under the registered full, reduced, exploratory, or no-go support disposition. No contractual-decidability clock, human-adjudication, price, or cross-venue result is reported here.
Read the full abstract

Robotics

SAVLA: Symmetry-Aware Vision-Language-Action Models for Robotic Manipulation

Vision-language-action (VLA) models have become the dominant paradigm for language-conditioned robot manipulation. However, although images and language instructions inherently encode geometric information, VLAs acquire their spatial competence purely from demonstrations. As a result, they are reliable only within the range of scene poses that the demonstrations cover. We propose SAVLA, an end-to-end symmetry-aware VLA model for robust and data-efficient policy learning. Our approach keeps the pretrained vision-language backbone entirely frozen while combining it with an equivariant flow-matching action head and a learned canonicalizer. The head decomposes its state, action, and conditioning inputs into invariant and equivariant channels, and preserves this typing throughout all of its layers. The canonicalizer transforms oblique-view images into a canonical frame and rotates the geometric conditions consistently. We evaluate our model on LIBERO. Compared with the GR00T N1.5 baseline, SAVLA improves the success rate averaged over all four LIBERO suites by 5.1 points and increases the mean success rate under rotation on LIBERO-Goal from 41.5% to 90.4%.
Read the full abstract

All authors Junle Li, Weixian Waylon Li, Fuxiang Wu, Fusheng Hao, Fengxiang He

Populations and Evolution

Graph construction in QUBO-based recursive phylogenetic tree reconstruction

Molecular sequence data are used to reconstruct evolutionary relationships among taxa, but reconstruction accuracy depends not only on the tree-building method but also on how pairwise sequence relationships are represented. We evaluated sequence-to-affinity representations in a recursive normalized-cut (Ncut) framework whose graph-partitioning subproblems were formulated as quadratic unconstrained binary optimization (QUBO) models and solved using Simulated Bifurcation. Using simulated amino-acid and nucleotide datasets spanning multiple tree-generation settings and evolutionary divergence, we compared normalized bit-score affinities with representations derived from transformed sequence similarities and evolutionary distances, examined post-swap refinement, and used neighbor joining (NJ) as a distance-based comparator. Affinity representation substantially affected internal split recovery, particularly for nucleotide data. JC69-based local affinities maintained comparatively high accuracy as divergence increased, whereas normalized bit-score and BLAST-derived kernel representations declined more markedly. Post-swap refinement generally improved recovery, but not consistently across individual reconstructions. NJ achieved higher mean split recovery than corresponding recursive Ncut reconstructions for WAG and JC69 distances across all evaluated conditions, whereas recursive Ncut outperformed NJ for BLAST-derived logarithmic distances under some conditions. These results show that graph construction is an important determinant of recursive Ncut-based phylogenetic reconstruction. A representation that performs well within Ncut does not necessarily provide the most accurate use of the underlying pairwise distances. Pairwise representation, affinity transformation, optimization, and recursive tree construction should therefore be evaluated jointly.
Read the full abstract

Artificial Intelligence

ReDraft, Don't Just Distill: Reference-Driven Revision for Continual VLLM Post-Training

Continual post-training of large multimodal models should add new capabilities while preserving those from pre-training, and the two goals pull in opposite directions. SFT gives explicit target supervision that learns a task from near-zero accuracy, but its off-policy targets move the model far enough to cause forgetting; on-policy methods such as RLVR and self-distillation preserve policy proximity yet supply little signal when the policy cannot yet solve the task. We introduce ReDraft (Reference-Driven Revision and Fine-Tuning), which obtains both from the model's own failures: using an expert response only as a reference, it has the model revise its own incorrect rollout, keeps the revision only if a verifier accepts it, and fine-tunes on what survives. Each retained target is therefore explicit, yet still close to the current policy. Across Counting, Clock Reading, and Jigsaw on Qwen2.5-VL-3B/7B, two of them with near-zero accuracy, ReDraft gains 56.9 points on the target task against SFT's 52.9 while cutting prior-task loss from 16.6 to 1.5 points (11.3x less forgetting), and improves on OPSD along both axes (19.3 gain, 6.2 loss). Data- and parameter-space analyses match the design: revised targets are more probable under the base model, and the updates they induce stay compact and follow SFT's direction more closely than OPSD's. Together, these results show that revising the model's own rollout rather than directly imitating an expert trajectory can reconcile cold-start acquisition with prior-capability retention.
Read the full abstract

All authors Zhihao Zhang, Mingqi Wu, Qiaole Dong, Enyu Zhou, Shuo Li, Boyang Liu, Jiazheng Zhang, Honglin Guo, Xin Guo, Shaofan Liu, Junzhe Wang, Dingwei Zhu, Minlong Peng, Yuan Hua, Zhiheng Xi, Qi Zhang, Tao Gui, Xuanjing Huang

Algebraic Geometry

Arc-analytic functions on locally closed semialgebraic sets

We give a partial generalization of the Kurdyka theory of arc-analytic functions and arc-symmetric sets on Nash manifolds to the setting of arbitrary locally closed semialgebraic sets.
Read the full abstract

All authors Janusz Adamus, Matthew R. Aharonian, Sean Coverdale, Jaden Visscher

Computer Vision

Can Knowledge Transfer Parameters Be Learned? LePoKet for Efficient Robotic Vision

Efficient perception is central to robotic systems operating under constrained computation, memory, and latency budgets. Knowledge transfer from larger pretrained models offers a practical route to stronger compact perception networks, but existing approaches commonly rely on fixed distillation objectives or manually designed interaction mechanisms. Building on Hereditary Knowledge Transfer (HKT), we propose LePoKet (Learnable Parameter Optimization for Knowledge Transfer), a structural transfer framework that embeds knowledge inheritance directly into the forward computation. LePoKet introduces a block-wise Extract-Transform-Mix interface whose interaction parameters are optimized jointly with the child network through a Learnable Genetic Attention (LGA) operator, without auxiliary distillation losses or temperature scaling. We first characterize the mechanism on CIFAR-10 and CIFAR-100 using ResNet parent-child pairs, obtaining relative error reductions of 24.57% and 25.1%, respectively, over standard child training. We then evaluate LePoKet for dense motion estimation by integrating it into a compact RAFT-based optical-flow model trained only on FlyingChairs and FlyingThings3D. LePoKet improves the compact RAFT baseline from 2.21 to 1.92 EPE on Sintel Clean, from 3.35 to 3.01 on Sintel Final, and from 7.51 to 6.39 on KITTI. A direct comparison with HKT further shows that LePoKet improves CIFAR-10 accuracy from 92.40% to 93.40% while achieving the best Sintel Final and KITTI errors among the evaluated compact transfer variants, with comparable performance on Sintel Clean. These results demonstrate that learnable structural transfer generalizes across recognition and motion perception tasks and provides a promising approach for efficient robotic vision.
Read the full abstract

All authors Yanick C. Tchenko, Felix Mohr, Hicham Hadj-Abdelkader, Hedi Tabia

High Energy Astrophysical Phenomena

Radiation Pressure Instability-Driven Variability of Line-Driven Disk Winds in AGNs: Connection to Periodic Luminosity Variations and UFO Appearance

We investigated the temporal variability of line-driven disk winds induced by radiation pressure instability in accretion disks surrounding supermassive black holes. This is the first study to self-consistently couple one-dimensional hydrodynamic simulations of accretion disks with two-dimensional radiation hydrodynamic simulations of line-driven winds and to analyze their time-dependent evolution. Our results show that periodic luminosity oscillations caused by radiation pressure instability lead to corresponding changes in both the mass outflow rate and the covering factor of gas expected to be observed as ultra-fast outflows (UFOs), with a delay comparable to the viscous timescale around the wind base. The viewing angles from which UFOs are expected to be observed also change with time. Our results therefore imply that, depending on the viewing angle, UFOs may not be detected even during high-luminosity states, whereas they may be detected even at lower luminosities. These findings are consistent with observations showing that UFOs are not always detected at high luminosities and can sometimes be detected even at lower luminosities. For a black hole mass of $10^{7.4}M_\odot$, a mass accretion rate of $1.3L_{\rm Edd}/c^2$ at a radius of about 100 Schwarzschild radii, a viscosity parameter of $\alpha=0.1$, and a viscosity prescription parameter of $\mu=0.45$, the mass outflow rate shows a delay of approximately 2–5 yr relative to the luminosity variation, and the covering factor consequently reaches a maximum of $\sim 30\%$ from the high-luminosity phase through the declining phase. Our results suggest that the intermittent detection of UFOs in luminosity-variable AGNs can be explained by radiation pressure instability driven variability of the line-driven disk winds.
Read the full abstract

All authors Yutaro Kuroda, Ken Ohsuga, Mariko Nomura, Kenya Watarai

Artificial Intelligence

EchoPath: Execution-Level Replayable Memory for GUI Agents

Computer-use agents increasingly operate browsers, software, and desktop applications via CLI or API portals, but graphical user interface (GUI) still plays an important role in common industrial production scenarios. GUI agents commonly employ fresh observe-plan-ground-act loops, which is inefficient for enterprise tasks that repeatedly update records, process forms, configure tools, and export reports. We introduce EchoPath, a model-agnostic harness that converts artifact-validated GUI trajectories into standardized, parameter-controlled callable memories, analogous to Model Context Protocol (MCP)-style tool calls rather than unstructured experience records. Each memory stores task-intent keys, application and state preconditions, flexible input parameters, GUI evidence, validation provenance, and lifecycle state, so the host agent invokes a targeted procedure only when it can be deterministically replayed in the current runtime. The core mechanism enabling replay is an image-based target-reaiming algorithm that treats stored coordinates as visual evidence, matches the remembered GUI target against the current screen, and emits corrected operation coordinates before execution. During replay, EchoPath rebinds only declared modifiable inputs and rejects ambiguous or incompatible steps to bounded grounding repair or fresh planning. In experiments with real computer-use tasks, EchoPath reduced median token cost by more than 90% and median execution time by about 60%. These results support a bounded form of enterprise GUI memory: validated execution experience can become a controllable callable asset for recurrent work rather than only context for another reasoning pass.
Read the full abstract

All authors Yao Zhao, Aditya Shanmugham, Swastik Roy, Yanxun Xu

Fluid Dynamics

Does the Boussinesq approximation correctly describe statistically stationary states of Rayleigh-Bénard convection?

It is generally believed that statistically stationary states of Rayleigh-Bénard convection (RBC) can be described by statistically stationary solutions to the Boussinesq approximation. Based on an analysis of the mechanical energy equation, we argue that this belief is not justified, because the expression for mean conversion of internal energy into kinetic energy by compressions and expansions, which is implicitly given by the approximation, does not qualify as an approximation. In consequence, it is questionable whether the exact Boussinesq expression relating the mean kinetic energy dissipation in a stationary state to the Rayleigh and Nusselt numbers is valid. Using assumptions that partly lie outside the Boussinesq approximation, we derive scaling relations for the mean kinetic energy dissipation in a stationary state in three and two dimensions. The relation for the three-dimensional system is similar to the Boussinesq expression, but includes an unknown prefactor, while the relation for the two-dimensional system is completely different. Our arguments suggest that statistically stationary solutions to the Boussinesq approximation in three dimensions, reproduce scaling relations between various statistical quantities quite well, although they should not be regarded as approximations in a strict sense, while solutions in two dimensions completely fail. We suggest that this should be investigated by performing DNS of weakly compressible RBC and compare with DNS of Boussinesq RBC.
Read the full abstract

Social and Information Networks

Inferring Temporal Dependencies from Social Time Series with the Cross-Correlogram

Characterizing temporal interactions in social systems is challenging because social behavior can be bursty and non-stationary, violating the stationarity assumptions of many methods used to measure temporal dependence. The cross-correlogram, an existing technique used to profile neural excitations and inhibitions, offers an interpretable alternative to methods such as Granger causality or co-occurrence, as it produces a full profile of lagged dependence directly from event times rather than a single summary statistic. We adapt the cross-correlogram by integrating functional models of behavior with data-driven temporal response profiling. By characterizing how periodic structure biases traditional cross-correlograms, we propose a correction based on smooth intensity functions, specified from a known functional form or estimated empirically. This approach provides a robust, interpretable estimator of temporal dependency profiles even when collective rhythms operate on timescales that overlap those of the interactions of interest. We demonstrate theoretically and through simulation that the proposed method recovers temporal dependencies in periodic regimes, outperforming interval-jitter and Granger causality methods. Finally, we apply the method to 3.1 million event times from X (formerly Twitter) collected between 2019 and 2020, demonstrating how cross-correlograms reveal delayed temporal relationships in collective online behavior that are missed by co-occurrence measures. For a subset of television-related hashtags, recovered delays align with known broadcast schedules, providing evidence that the proposed method captures genuine temporal structure rather than artifacts of shared attention cycles.
Read the full abstract

All authors Bridget Smart, Renaud Lambiotte, Takaaki Aoki, Ryota Kobayashi

Rings and Algebras

The prime spectrum of the talented monoid of a higher-rank graph and applications

In this paper, we further investigate the role of the graded Grothendieck group $K_0^{\gr}$ and its positive cone (the talented monoid) as an effective tool for distinguishing structural types of algebras associated to higher-rank $k$-graphs. We study the prime spectrum (the space of all prime $\Gamma$-order ideals equipped with a Zariski-like topology) of a general commutative $\Gamma$-monoid and establish that this space is spectral in the sense of Hochster, provided the monoid has the refinement property and every $\Gamma$-order ideal is finitely generated. As a result we are able to show that the prime spectrum of the talented monoid of a row-finite $k$-graph without sources and with a finite set of vertices is spectral. For any row-finite $k$-graph $\Lambda$ without sources, one of our main results says that the space of all graded prime ideals of the Kumjian–Pask algebra $\KP(\Lambda)$ is homeomorphic to both the space of all prime $\mathbb{Z}^k$-order ideals and the space of all prime $\mathbb{Z}^k$-filters of the talented monoid $T_\Lambda$. Another main result of this paper provides a complete topological description of regular $\Gamma$-order ideals of a refinement $\Gamma$-monoid: a $\Gamma$-order ideal $J$ is regular if and only if the corresponding closed (resp., open) set $V(J)$ (resp., $D(J)$) is regular closed (resp., regular open) in the prime spectrum. As an application of these results, we establish a lattice isomorphism between the lattice of all regular $\mathbb{Z}^k$-order ideals of the talented monoid and the lattice of all regular graded ideals of the Kumjian–Pask algebra via a spectrum-theoretic approach.
Read the full abstract

Group Theory

Kazhdan constants for two-element generating sets of $\mathrm{SL}_n(\mathbb Z)$

For $n\geq3$, the group $\mathrm{SL}_n(\mathbb Z)$ has property $(T)$, so every finite generating set has a positive Kazhdan constant. However, it was recently shown that the infimum of these constants over all finite generating sets is $0$. This naturally raises the question of whether the infimum remains zero when the cardinality of the generating sets is bounded in advance. We prove that the infimum of the Kazhdan constants of $\mathrm{SL}_n(\mathbb Z)$ over all two-element generating sets is $0$ for every $n\geq3$.
Read the full abstract

Quantum Physics

Two-qubit gates for the soft 0-{\pi} qubit

The 0-{\pi} qubit promises longer lifetimes than the transmon, making it a strong candidate for a next-generation, lower-error qubit. Gyenis et al. experimentally demonstrated an unprotected single-qubit gate in the soft 0-{\pi} regime [1], but no corresponding two-qubit gate has yet been proposed. We propose an unprotected CZ gate for capacitively coupled soft 0-{\pi} qubits. The gate uses a direct transition between a computational state and a higher non-computational state. Assuming negligible device disorder and a phenomenological noise model, the simulated CZ gate achieves a fidelity of approximately 99.9% at a gate time of approximately 160 ns.
Read the full abstract

Robotics

Learning to Optimize UAV Path Planning for Data Sensing in Wireless Sensor Networks

UAVs have emerged as highly flexible platforms for data sensing in Wireless Sensor Networks (WSNs). Path planning for UAVs in such tasks plays a key role to assure remote sensing effectiveness and friendly energy consumption. However, existing approaches show two key limitations: i) they are primarily hand-crafted with certain design biases that harm adaptation on unseen tasks. ii) they predominantly assume idealized spatial complexities of actual environments through simplified simulation, causing them to underperform during real-world deployment. In this paper, we propose a novel learning-assisted planning framework, termed Landscape-Aware Meta Differential Evolution (LAMDE), to tackle the mentioned limitations. The major contributions come from the following aspects. We first re-formulate such UAV path planning problem to embrace challenging constraints. To efficiently navigate this highly constrained space, we propose a bi-level learning to optimize approach, where the meta-level is a trainable algorithm configuration policy that meta-learns an adaptable planning strategy for low-level planning algorithm. To address the potential training data scarcity and distribution shift in real-world environments, we introduce a landscape-aware automatic augmentation scheme that enriches training data. At the low-level, a Differential Evolution algorithm is deployed for solving the path planning tasks. To enhance the solving flexibility, we further design a variable-length encoding strategy that dynamically prunes redundant hover points and optimizes continuous flight parameters concurrently within a unified search space. Based on all proposed designs, we meta-train LAMDE and compare it with representative baselines. Comprehensive experiments demonstrate that LAMDE achieves state-of-the-art performance on the tested complex UAV path planning tasks in WSN data collection scenarios.
Read the full abstract

All authors Sijie Ma, Zeyuan Ma, Weijia Cao, Yue-Jiao Gong, Lingling Ma, Zhiyang Huang, Jun Zhang

Quantum Physics

Quantum Simulation of Two-Dimensional Free Dirac Hamiltonian in Multimode Circuit QED

Two-dimensional massive Dirac systems feature a gapped Dirac-cone dispersion central to a broad range of phenomena in condensed-matter and topological physics. While quantum simulations have demonstrated one-dimensional Dirac dynamics and two-dimensional massless Weyl dynamics, programmable simulation of massive two-dimensional Dirac dynamics remains experimentally unexplored. Here, we realize a programmable two-dimensional free Dirac Hamiltonian in circuit QED, with independently tunable spin-momentum couplings and mass, using a single Rabi-driven qubit coupled to two modes of a multimode cavity. Using this Hamiltonian, we observe rotational Zitterbewegung of a two-dimensional massive Dirac particle and its dependence on the effective mass. Time-dependent master-equation simulations incorporating measured decoherence, corrections beyond the rotating-wave approximation (RWA), and anharmonicity of the transmon reproduce the observed dynamics. Our results establish multimode circuit QED as a compact, programmable platform for higher-dimensional relativistic quantum dynamics and provide a foundation for exploring dynamical and topological phenomena in gapped Dirac systems.
Read the full abstract

All authors Jiwon Kang, Jiuk Lee, Eliya Blumenthal, Shay Hacohen-Gourgy, Eunseong Kim

Computation and Language

Quantifying Organizational Environmental Action from Web Data and Large Language Models

Quantifying organizational environmental action from publicly available web content remains a challenging environmental data science problem because relevant information can be dispersed across multiple webpages and is primarily communicated through unstructured text. We present a scalable computational framework for transforming organizational web content into structured measures of environmental action and demonstrate the approach using Jewish congregations in the United States. We constructed a national database of 4,964 congregations by integrating multiple geospatial, knowledge-base, directory, and manually reviewed sources. Of these, 2,657 had active websites that were successfully crawled, producing a corpus of 154,454 webpages. We compared three approaches for detecting environmental actions: keyword retrieval followed by large language model (LLM) classification, semantic vector retrieval followed by LLM classification, and direct LLM classification classification without preliminary retrieval. Agreement with an expert human reviewer was lowest for keyword retrieval ($\kappa$ = 0.26), higher for semantic vector retrieval ($\kappa$ = 0.42), and similar for direct LLM classification ($\kappa$ = 0.40). Although semantic retrieval achieved the highest agreement, its retrieval recall was 0.87, indicating loss of relevant content before classification. Applied to the complete corpus, direct LLM classification identified at least one environmental action at 1,398 congregations (53%), providing greater coverage than either retrieval-based approach. These results demonstrate that preliminary retrieval can reduce computational cost but may exclude relevant information before it reaches the classifier. The framework provides a reproducible approach for extracting organization-level environmental information from unstructured web content that can be adapted to other institutions.
Read the full abstract

All authors Quinn Reynolds, Daniel Shore, Vianey Leos Barajas, Tanhum Yoreh, Meredith Franklin

Computer Vision

JewelTry: Mask-Free Scale Aware Jewelry Virtual Try-On

Virtual try-on (VTON) enables customers to visualize how fashion products appear when worn and has become an important technology for online shopping. While recent advances have substantially improved garment VTON, jewelry remains a challenging and underexplored category due to its small size, rigid structure, and sensitivity to fine-grained visual details. Realistic jewelry VTON requires not only faithful appearance transfer but also accurate scale and placement relative to the wearer. Existing jewelry VTON methods typically rely on mask guidance, whereas mask-free approaches lack explicit guidance for modeling the product scale. To bridge this gap, we introduce JVTO-Bench, a benchmark dataset for scale-faithful jewelry VTON, providing reference source target triplets with real-world product-scale annotations across four major jewelry categories. Building upon this benchmark, we propose JewelTry, a mask-free diffusion framework for scale-aware jewelry VTON. JewelTry incorporates a scale adapter that encodes product dimensions into a scale token, enabling the model to learn scale relationships between jewelry items and surrounding human anatomy in-context. To further improve jewelry consistency, we introduce a single-directional condition attention mechanism and an attention refinement loss that preserve both coarse geometry and fine-grained structural details of the reference jewelry. Extensive experiments show that JewelTry achieves a balance among visual fidelity, background preservation, object consistency and scale accuracy, establishing a strong baseline for mask-free, scale-aware jewelry virtual try-on.
Read the full abstract

All authors Xinlei Niu, Peixia Li, Jun Wang, Chenchen Xu, Jiayu Yang, Jing Zhang, Pulak Purkait, Hongdong Li