Searcharxiv⌕ Search

arXiv subjects

Zhi Li

Publications and source records attributed to Zhi Li.

At least 55 records · Page 3Linked to original sources

Low-luminosity Wolf-Rayet stars: a model-data comparison

A growing number of Galactic Wolf-Rayet (WR) stars, in particular WC and transitional WN/C (WNC) objects, have been reported at comparatively low luminosities. If confirmed, these low-luminosity WR stars provide stringent tests of stellar-evolution models, because their HR-diagram locations and surface compositions are highly sensitive to internal mixing and to the adopted WR-phase mass-loss history.We examine whether the HR-diagram positions and wind properties of low-luminosity WC/WNC stars can be reproduced by single-star evolutionary tracks at approximately solar metallicity, and we identify cases where additional channels (e.g. binary stripping) or dominant systematic uncertainties are likely required. Low-luminosity WNC/WC stars offer sensitive leverage on WR mixing and mass-loss prescriptions. A staged model-data comparison shows that revised WR winds can alleviate the luminosity-side tension for faint WCL stars, but the simultaneous requirements of temperature, surface composition, and WR-like wind density remain important. The WNC stars provide the strongest evidence that additional mixing, stripping, or binary-related channels may be required.

astro-ph.SR↗

Tracing the kinematic perturbations of the Milky Way spiral arms with APOGEE DR17 and Gaia DR3

Aims. We constrain the dynamical perturbations of the spiral arms in the Milky Way disk, based on the non-axisymmetric streaming motions of RGB stars revealed by APOGEE and \textit{Gaia}. Methods. We develop a revised steady-state radial-velocity response model that incorporates both the \(V_{R,\sin}\) and the dynamically important \(V_{R,\cos}\) components for a two-armed logarithmic spiral potential. The model is validated using orbit integrations with \texttt{AGAMA} and Bayesian parameter recovery with \texttt{dynesty}, and is applied to the smoothed two-dimensional radial-velocity field of RGB stars while accounting for Lindblad and corotation resonances. Results. The revised model reproduces the phase and amplitude of the mock radial-velocity field to the \(\sim2\%\) level, substantially improving upon earlier \(V_{R,\sin}\)-only formulations. Applied to the observational data, it yields a robust pitch angle of \(p \simeq 10^\circ\) and a local surface density contrast of \(ξ\simeq 5\)--\(18\%\) at the solar radius. The radial scale length is less well-constrained (\(h_{R,1} \simeq 40\)--\(50\,\mathrm{kpc}\)) due to intrinsic parameter covariance. Resonance effects strongly shape the velocity field, thus affecting the fitting: the radial velocity becomes extremely large near the Lindblad resonances, whereas it vanishes close to the corotation resonance. Conclusions. Our results demonstrate that including both the \(V_{R,\sin}\) and \(V_{R,\cos}\) terms is essential for a physically consistent interpretation of stellar streaming motions induced by a spiral potential. The observed kinematics constrain the spiral pattern speed to \(Ω_{p} \approx 10\)--\(20\,\mathrm{km\,s}^{-1}\mathrm{kpc}^{-1}\).

astro-ph.GA↗

Many-body chirality of topological stabilizer states

A defining feature of chirality is the distinction between a system and its mirror image. Despite extensive experimental observations of chiral phases and theoretical advances, a quantum-information theoretic characterization of chirality based solely on the entanglement structure of many-body quantum states remains elusive. Here, we introduce the notion of many-body chirality by formulating it as an obstruction to transforming a quantum state into its complex conjugate through finite-depth local operations. We rigorously establish many-body chirality for stabilizer realizations of $\mathbb{Z}_d^{(k)}$ anyon theories, proving that complex conjugation can be implemented by local quantum channels if and only if the underlying anyon data are mirror invariant. This reveals forms of chirality that evade conventional diagnostics, including examples with vanishing modular commutator, vanishing chiral central charge, and commuting-projector realizations. We further show that this obstruction is intrinsically four-partite, while invisible to tripartite entanglement structure. Finally, we prove that $\mathbb{Z}_d^{(k)}$ states with $d>2$ possess intrinsic many-body imaginarity: their complex phase structure cannot be removed by finite-depth local unitaries. Remarkably, this includes states that are not many-body chiral.

quant-ph↗

MUSE: Benchmarking Manufacturable, Functional, and Assemblable Text-to-CAD Generation

Large language models (LLMs) have recently advanced text-driven 3D generation, yet Text-to-CAD remains far from supporting industrial product design. Existing benchmarks focus primarily on generating single-part CAD models and evaluate them using geometric similarity metrics that fail to capture functionality, manufacturability, and assemblability. To address this gap, we introduce MUSE, a Text-to-CAD benchmark focused on complex, editable boundary representation (B-Rep) assemblies. MUSE pairs practical design instances with structured Design Specifications and evaluates generated models through a three-stage protocol: code check, geometric check, and design-intent alignment. The final stage uses design-specific rubrics to assess functionality, manufacturability, and assemblability, moving beyond shape matching toward practical design quality. To enable scalable evaluation, we use a rubric-based visual language model (VLM) judge and validate its reliability through human annotation. Experiments on closed-source and open-source LLMs reveal a clear failure cascade from executable code to valid geometry and finally to engineering-ready design, with even the strongest models achieving limited success on fine-grained engineering criteria. Together, MUSE provides a realistic benchmark and evaluation framework for advancing Text-to-CAD from geometric generation toward true engineering design. Our project website, including the leaderboard, dataset, and code, is available at https://dong7313.github.io/muse-benchmark/.

cs.AI↗

PolySpeech-100: A Large-Scale Benchmark for Speech Understanding Across 100+ Languages and Dialects

While End-to-End (E2E) Speech-Large Language Models (Speech-LLMs) are rapidly evolving, their evaluation methodologies remain limited to the era of simple transcription. Existing benchmarks suffer from three critical limitations: a pronounced bias towards high-resource languages, a focus on low-level recognition (ASR) rather than semantic reasoning, and a neglect of regional dialects. To bridge this gap, we introduce PolySpeech-100, a massive-scale benchmark designed to assess `native-level' speech comprehension across 110 linguistic variants. We employ a novel hybrid construction pipeline that augments gold-standard human recordings with instruction-driven synthetic speech, allowing us to cover 19 distinct Chinese dialects and over 80 low-resource languages. Extensive evaluation of 22 state-of-the-art models (including Gemini-3, GPT-Audio, and Qwen2.5-Omni) yields pivotal insights. First, we demonstrate that open-source E2E models outperform Cascade (ASR+LLM) systems on heavy dialects, proving that direct audio processing preserves critical paralinguistic cues and prosodic features (e.g., intonation, stress) that are often lost in standard transcription. Second, we reveal a significant performance gap: while commercial models maintain robustness, open-source models suffer catastrophic degradation on low-resource languages. Finally, counter-intuitively, we observe that under standard zero-shot settings, Chain-of-Thought prompting frequently degrades speech understanding performance for most evaluated models, revealing a potential modality alignment gap in current architectures. PolySpeech-100 establishes a rigorous standard for the next generation of inclusive, omni-capable Speech-LLMs. The data, demo, and code are publicly available at https://github.com/YoungSeng/PolySpeech-100.

cs.CL↗

A hitchhiker's guide to Poisson gradient estimation

Poisson-distributed latent variable models are widely used in computational neuroscience, but differentiating through discrete stochastic samples remains challenging. Two approaches address this: *Exponential Arrival Time* (EAT) simulation and *Gumbel-SoftMax* (GSM) relaxation. We provide the first systematic comparison of these methods, along with practical guidance for practitioners. Our main technical contribution is a modification to the EAT method that theoretically guarantees an unbiased first moment (exactly matching the firing rate), and reduces second-moment bias. We evaluate these methods on their distributional fidelity, gradient quality, and performance on two tasks: (1) variational autoencoders with Poisson latents, and (2) partially observable generalized linear models, where latent neural connectivity must be inferred from observed spike trains. Across all metrics, our modified EAT method exhibits better overall performance (often comparable to exact gradients), and substantially higher robustness to hyperparameter choices. These results extend to over-dispersed Negative Binomial latents, where modified EAT again performs best. However, only GSM generalizes to arbitrary non-Poisson distributions, including the under-dispersed regime. Together, our results clarify the trade-offs between these methods and offer concrete recommendations for practitioners working with Poisson latent variable models.

stat.ML↗

Fisher-Preserving Guidance: Training-Free Manifold Constraints for Safe Diffusion Control

Diffusion models are effective for waypoint prediction in visual navigation, but standard sampling and test time guidance can produce unreliable or inefficient trajectories when updates drift off the training manifold. We propose Fisher Preserving Guidance with Outer Product Span Projection, a training-free inference method that avoids large Fisher drift associated with off-distribution actions while optimizing a task objective. Our method computes the Fisher-preserving update via a low-rank Jacobian factorization, requiring only a single backward pass per step and enabling real-time use. We further introduce Truncated Fisher Denoising Sensitivity as an uncertainty signal and use it for robust multi-sample action blending. Experiments on toy and realistic navigation benchmarks, including Maze2D with TSDF-based guidance, PushT with official Diffusion Policy weights, and visual navigation in simulation and on real robots, demonstrate consistent improvements in performance over strong diffusion-policy baselines without additional training.

cs.RO↗

Periodic orbits and gravitational waveforms around a Schwarzschild black hole with a cloud of strings embedded in perfect fluid dark matter

In this study, we explore the dynamics of particle orbits and their corresponding gravitational wave signatures in the vicinity of a Schwarzschild black hole (BH) surrounded by a cloud of strings and embedded in a perfect fluid dark matter medium. The model is characterized by two parameters: $a$, associated with the string cloud, and $α$, representing the dark matter distribution. We systematically analyze how the marginally bound orbit (MBO) and the innermost stable circular orbit (ISCO) depend on these parameters. Our findings reveal that while both the orbital radius and angular momentum increase with increasing $a$, they decrease as $α$ increases; notably, the energy exhibits the opposite trend, decreasing with $a$ and increasing with $α$. Furthermore, we examine periodic orbits indexed by rational numbers $q$ and the gravitational waveforms they generate. The results demonstrate that an increase in the string cloud parameter $a$ induces a significant phase delay in the waveform. Specifically, waveforms with lower values of $a$ oscillate over shorter time intervals, whereas those with higher values extend to longer time scales. These distinct features, including noticeable differences in amplitude, allow the waveforms to be clearly distinguished from those in a pure Schwarzschild spacetime.

gr-qc↗

Nonlinear Photonic Tripartite Phase

Anderson localization is usually understood as a transition between extended and localized phases, with criticality confined to a single mobility edge. Recent advances predict that quasiperiodic systems can instead host a finite critical window bounded by mobility edges, in which localized, critical and extended states coexist. Yet both the experimental realization of this regime and whether interactions can provide controlled access to it remain unknown. Here, we realize such a tripartite phase in a nonlinear quasiperiodic photonic lattice and show that Kerr nonlinearity, acting as an effective interaction, enables state-selective access to the critical window. By tracking wavepacket dynamics, we distinguish localized, critical and extended transport regimes and uncover a state-selective response: rather than simply reinforcing localization through self-trapping, weak nonlinearity drives low-energy localized states into the critical window, whereas stronger nonlinearity restores localization. By contrast, critical, extended and high-energy localized states evolve monotonically towards self-trapped behaviour. Our results reveal a state-selective mechanism by which interactions provide controlled access to a pre-existing critical window in quasiperiodic systems.

cond-mat.mes-hall↗

Tripartite Haar random state has no bipartite entanglement

We show that no EPR-like bipartite entanglement can be distilled from a tripartite Haar random state $|Ψ\rangle_{ABC}$ by local unitaries or local operations when each subsystem $A$, $B$, or $C$ has fewer than half of the total qubits. Specifically, we derive an upper bound on the probability of sampling a state with EPR-like entanglement at a given EPR fidelity tolerance, showing a doubly-exponential suppression in the number of qubits. Our proof relies on a simple volume argument supplemented by an $ε$-net argument and concentration of measure. Viewing $|Ψ\rangle_{ABC}$ as a bipartite quantum error-correcting code $C\to AB$, this implies that neither output subsystem $A$ nor $B$ supports any non-trivial logical operator. We also establish general constraints on the structure of tripartite entanglement in Haar random states, showing that W- or GHZ-like entanglement cannot be distilled and that nontrivial global symmetries are absent. Finally, we discuss a physical interpretation in the AdS/CFT correspondence, indicating that a connected entanglement wedge does not necessarily imply bipartite entanglement, contrary to a previous belief.

quant-ph↗

HydroAgent: Closing the Gap Between Frontier LLMs and Human Experts in Hydrologic Model Calibration via Simulator-Grounded RL

Calibrating distributed hydrologic models is a critical bottleneck across operational water resources management - streamflow prediction, reservoir operation, drought monitoring, infrastructure design, and flood forecasting all depend on it. Each basin demands an expert to translate hydrograph signatures into adjustments of a high-dimensional parameter vector, and the resulting workflow does not transfer between watersheds. We ask: can frontier large language model (LLM) agents replace the human hydrologic modeler, and if not, what would it take? We benchmark nine frontier LLM agents - Claude Opus 4.6/4.7, Sonnet 4.6, GPT-5/5.4/5.4-pro, and Gemini 2.5-pro/3.1-pro/3-flash - on the operational CREST distributed hydrologic model used by the U.S. National Weather Service for flash-flood forecasting. Best-of-twenty-rounds Nash-Sutcliffe Efficiency (NSE) across four held-out gauges spanning 329-40,792 km2 ranges from -0.16 (GPT-5.4) to 0.75 (Sonnet 4.6); the ceiling reproduces across all three vendors and capability tiers, with the strongest models concentrating in the 0.65-0.75 band, and no model reaches the human-expert reference except Opus-4.7 on one gauge. We argue this gap is not a parameter-count problem but a domain-grounding problem. We then propose HYDROAGENT, fine-tuning open-weight Qwen3-4B with supervised fine-tuning on 2,576 expert calibration trajectories and Group-Relative Policy Optimization using NSE as a verifiable reward from online CREST simulations - reinforcement learning with simulation feedback (RLSF). For Earth system science, a small domain-tuned policy with simulator-in-the-loop RL is a more compute-efficient and physically faithful path than scaling generic frontier models, and the multi-modal richness of Earth data - remote sensing, in-situ time series, and forecaster narrative - makes domain agents a leveraged direction for AI in physical science.

cs.LG↗

Terahertz detection within charge density wave state

Terahertz (THz) technology enables multi-Tbps satellite communications, but conventional semiconductor detectors suffer from fundamental performance degradation above 1 THz due to the Drude limit of free electrons. Here, we theoretically demonstrate that charge density wave (CDW) materials offer a paradigm-shifting solution via their collective electronic response. We show that a static bias electric field can continuously tune the THz resonant absorption frequency of CDW states from 0 to cutoff frequency, and enhance the nonlinear rectification current by more than one order of magnitude. This unprecedented electric-field tunability makes CDW materials ideal candidates for next-generation ultrafast THz detectors working at room-temperature.

cond-mat.mes-hall↗

Dynamically Characterizing the Structures of Dirac Points via Wave Packets

Topological non-trivial band structures are the core problem in the field of topological materials. In this paper, we investigate the topological band structure in a system with controllable Dirac points from the perspective of wave packet dynamics. By adding a third-nearest-neighboring coupling to the graphene model, additional pairs of Dirac points emerge. The emergence and annihilation of Dirac points result in hybrid and parabolic points, and we show that these band structures can be revealed by the dynamical behaviors of wave packets. Particularly, for the gapped hybrid point, the motion of the wave packet shows a one-dimensional \emph{Zitterbewegung} motion. Furthermore, we also show that the winding number associated with the Dirac point and parabolic point can be determined via the center-of-mass and spin texture of wave packets, respectively. The results of this work could motivate new experimental methods to characterize the system's topological signatures through wave packet dynamics, which may also find application in systems of other exotic topological materials.

cond-mat.mes-hall↗

A Unified Framework for Locally Stable Phases

We propose a unifying framework for characterizing pure and mixed state phases of matter across equilibrium, non equilibrium, and metastable regimes. We introduce the concept of locally stable states, defined by the operational property that any local operation (including post selection) can be reversed by a local channel. We prove that local stability is equivalent to a state being short range correlated, defined by the decay of both correlations and conditional mutual information. We demonstrate that these properties are invariant under locally reversible channels, thus defining locally stable phases. Furthermore, we prove that local stability implies both the decay of a family of nonlinear correlators, including the fidelity correlator, and the decay of correlations in the canonical purification, thus bridging the gap between mixed and pure states. Along the way, we establish two results which may be of independent interest: we show that post-selection on locally stable (short range correlated) states can be implemented via local channels and that quantum Markov chains can be characterized by the local computability of nonlinear observables.

quant-ph↗

Lattice-to-Total Thermal Conductivity Ratio: A Phonon-Glass Electron-Crystal Descriptor for Data-Driven Thermoelectric Design

Thermoelectrics (TEs) are promising candidates for energy harvesting with performance quantified by figure of merit, $ZT$. To accelerate the discovery of high-$ZT$ materials, efforts have focused on identifying compounds with low thermal conductivity $κ$. Using a curated dataset of 71,913 entries, we show that high-$ZT$ materials reside not only in the low-$κ$ regime but also cluster near a lattice-to-total thermal conductivity ratio ($κ_\mathrm{L}/κ$) of approximately 0.5. This optimal ratio provides a quantitative descriptor for the well-known phonon-glass electron-crystal (PGEC) design concept. Building on this insight, we construct a framework consisting of two machine learning models for the lattice and electronic components of thermal conductivity that jointly provide both $κ$ and $κ_\mathrm{L}/κ$ for screening and guiding the optimization of TE materials. By applying this framework to 104,567 inorganic compounds, we identify 2,522 ultralow-$κ$ candidates while simultaneously evaluating their proximity to the optimal PGEC regime. A follow-up case study on chemical doping demonstrates how the framework can qualitatively provide optimization strategies that shift pristine materials toward the ideal $κ_\mathrm{L}/κ$ $\approx$ 0.5 target. Ultimately, by integrating rapid screening with PGEC-guided optimization, our data-driven framework takes a critical step towards closing the gap between materials discovery and performance enhancement.

cond-mat.mtrl-sci↗

Random Walk on Point Clouds for Feature Detection

The points on the point clouds that can entirely outline the shape of the model are of critical importance, as they serve as the foundation for numerous point cloud processing tasks and are widely utilized in computer graphics and computer-aided design. This study introduces a novel method, RWoDSN, for extracting such feature points, incorporating considerations of sharp-to-smooth transitions, large-to-small scales, and textural-to-detailed features. We approach feature extraction as a two-stage context-dependent analysis problem. In the first stage, we propose a novel neighborhood descriptor, termed the Disk Sampling Neighborhood (DSN), which, unlike traditional spatially and geometrically invariant approaches, preserves a matrix structure while maintaining normal neighborhood relationships. In the second stage, a random walk is performed on the DSN (RWoDSN), yielding a graph-based DSN that simultaneously accounts for the spatial distribution, topological properties, and geometric characteristics of the local surface surrounding each point. This enables the effective extraction of feature points. Experimental results demonstrate that the proposed RWoDSN method achieves a recall of 0.769-22% higher than the current state-of-the-art-alongside a precision of 0.784. Furthermore, it significantly outperforms several traditional and deep-learning techniques across eight evaluation metrics.

cs.CV↗

Characterizing Trust Boundary Vulnerabilities in TEE Containers: An Empirical Study

Trusted Execution Environments (TEEs) have become a cornerstone of confidential computing, attracting significant attention from academia and industry. To support secure and scalable application deployment on confidential clouds, TEE containers (Tcons) have been introduced as middleware to shield applications from malicious operating systems and orchestration layers while preserving usability. In this paper, we present the first comprehensive analysis of Tcons, focusing on three critical layers: OS interfaces, encrypted I/O, and orchestration mechanisms. To enable systematic evaluation, we design TBouncer, an automated analyzer that precisely exercises and benchmarks Tcon isolation boundaries. Our study uncovers fundamental flaws in existing Tcons, leading to exploitable vulnerabilities such as code execution, denial-of-service, and information leakage. In total, we identify six attack vectors, twelve new bugs, and three CVEs. These findings provide new insights into the underestimated attack surface of Tcons and highlight key directions for building more secure and trustworthy container solutions.

cs.CR↗

PoTable: Towards Systematic Thinking via Plan-then-Execute Stage Reasoning on Tables

In recent years, table reasoning has garnered substantial research interest, particularly regarding its integration with Large Language Models (LLMs), which have revolutionized natural language applications. Existing LLM-based studies typically achieve step-by-step thinking for table reasoning guided by task semantics. While these approaches emphasize autonomous exploration and enhance fine-grained table understanding, they often overlook systematic thinking in the reasoning process. This oversight can lead to omitted steps, disorganized logic and misleading results, especially in complex scenarios. In this paper, we propose PoTable, a novel stage-oriented plan-then-execute approach that incorporates systematic thinking into table reasoning. Specifically, PoTable involves several distinct analytical stages with clear objectives to provide adequate guidance. To accomplish stage-specific goals, PoTable employs a plan-then-execute mechanism: it first plans the operation chain based on the stage objective, and then executes operations sequentially through code generation, real-time running and feedback processing. Consequently, PoTable produces reliable table reasoning results with highly accurate, step-wise commented and completely executable programs. It mirrors the workflow of a professional data analyst, offering advantages in both accuracy and explainability. Finally, we conduct extensive experiments on four datasets from the WikiTQ and TabFact benchmarks, where the results demonstrate the effectiveness, efficiency and explainability of PoTable. Our code is available at: https://github.com/Double680/PoTable.

cs.IR↗