arXiv subjects

Zhe Wang

Publications and source records attributed to Zhe Wang.

At least 91 records · Page 5Linked to original sources

arXiv2026

Hybrid-Integrated DFB-Laser-Coupled 1 * 8 Thin-Film Lithium Niobate Modulator Array for High-Speed Parallel Optical Transmitters

Thin-film lithium niobate (TFLN) electro-optic modulators are attractive for high-speed optical interconnects, but scalable transmitter architectures require not only high modulation bandwidth but also multi-channel optical power distribution and practical laser-to-chip integration. Here, we demonstrate a hybrid-integrated 1 * 8 TFLN electro-optic modulator array passively butt-coupled to a 1550 nm distributed-feedback laser. The chip integrates a three-stage cascaded 1 * 2 multimode-interference splitter, spot-size converters, eight traveling-wave Mach-Zehnder modulators, thermal tuning electrodes, and on-chip 50 Ω terminations. The cascaded splitter provides uniform optical power distribution with a maximum normalized power deviation of 9.7%, while the optimized electrodes enable electro-optic 3 dB bandwidths exceeding 40 GHz for all channels. The measured half-wave voltages are 3.60-3.83 V, corresponding to VπL products of 2.52-2.68 V cm for a 7 mm modulation length, and the extinction ratio reaches approximately 25 dB. The bare-chip insertion loss is 15.19-16.55 dB, and DFB laser bonding introduces an additional coupling loss of approximately 5 dB while preserving channel uniformity. These results establish a practical TFLN-based multi-channel modulator platform and represent a step toward compact hybrid-integrated optical transmitters for high-speed parallel interconnects.

physics.optics↗

arXiv2026

TERGAD: Structure-Aware Text-Enhanced Representations for Graph Anomaly Detection

Graph Anomaly Detection (GAD) aims to identify atypical graph entities, such as nodes, edges, or substructures, that deviate significantly from the majority. While existing text-rich approaches typically integrate structural context into the data representation pipeline using raw textual features, they often neglect the structural context of nodes. This limitation hinders their ability to detect sophisticated anomalies arising from inconsistencies between a node's inherent content and its topological role. To bridge this gap, we propose TERGAD (Structure-aware Text-enhanced Representations for Graph Anomaly Detection), A novel data augmentation framework that enriches structural semantics for GAD via the semantic reasoning capabilities of Large Language Models (LLMs). Specifically, TERGAD translates node-level topological properties into descriptive natural language narratives, which are subsequently processed by an LLM to derive high-level semantic embeddings. These embeddings are then adaptively fused with original node attributes through a gated dual-branch autoencoder to jointly reconstruct both graph structure and node features. The anomaly score is computed based on the integrated reconstruction error, effectively capturing deviations in both observable attributes and LLM-informed semantic expectations. Extensive experiments on six real-world datasets demonstrate that TERGAD consistently outperforms state-of-the-art baselines. Furthermore, our ablation studies validate the indispensable role of structural semantic guidance and the efficacy of the gated fusion mechanism. Code is available at https://github.com/Kantorakitty/TERGAD-main.

cs.CL↗

arXiv2026

Probing Tensor Singularities and Their Euler-Class Descendants via Non-Abelian Quantum Geometry Measurement

We report the theoretical prediction and experimental observation of a new class of four-dimensional (4D) tensor singularities and their three-dimensional (3D) Euler-class descendants, protected by chiral and spacetime inversion symmetries on a superconducting circuit platform. The 4D point-like singularity/monopole, characterized by the Dixmier-Douady class of a real bundle gerbe associated with tensor gauge fields, is observed to evolve into a nodal ring carrying an additional first Euler class charge under symmetry-preserving perturbations. Dimensional reduction reveals 3D Euler and Euler curvature dipoles, exhibiting nontrivial Euler topology and a topological sum rule that ensures zero-energy flat bands inherit nontrivial topology even without interactions. Crucially, these high-dimensional degenerate systems are mapped and reconstructed using a hybrid analog-digital protocol designed for non-Abelian quantum geometry measurement within a superconducting qubit array. Our work not only expands the family of topological monopoles but also establishes a robust experimental framework for exploring high-order gauge theory and real-bundle topology across diverse quantum platforms.

quant-ph↗

arXiv2026

WavFlow: Audio Generation in Waveform Space

Modern audio generation predominantly relies on latent-space compression, introducing additional complexity and potential information loss. In this work, we challenge this paradigm with WavFlow, a framework that generates high-fidelity audio directly in raw waveform space without intermediate representations. To overcome the inherent difficulties of modeling high-dimensional and low-energy signals, we reshape audio into 2D token grids through waveform patchify and introduce amplitude lifting to align signal scales, enabling stable optimization via direct x-prediction in flow matching. To capture complex semantic alignment and temporal synchronization, we leverage an automated data pipeline to curate 5 million high-quality video-text-audio triplets, allowing the model to learn fine-grained acoustic patterns from scratch. Experimental results show that WavFlow achieves competitive performance on the video-to-audio benchmark VGGSound (FD_PaSST: 59.98, IS_PANNs: 17.40, DeSync: 0.44) and the text-to-audio benchmark AudioCaps (FD_PANNs: 10.63, IS_PANNs: 12.62), matching or exceeding the performance of established latent-based methods. Our work demonstrates that intermediate compression is not a prerequisite for high-quality synthesis, offering a simpler and more scalable alternative for multimodal audio generation.

cs.SD↗

arXiv2026

Spontaneous continuous-symmetry breaking and tower of states in a comb chain

Based on the study of a one-dimensional (1D) antiferromagnetic Heisenberg model on a comb lattice, this work identifies an example of spontaneous continuous symmetry breaking in a 1D system with short-range interactions. When a symmetry-preserving relevant perturbation is applied to the system, we find that this model can always be described by the Marshall-Lieb-Mattis (MLM) theorem. The Shen-Qiu-Tian theorem establishes a direct connection between the MLM theorem (in the case of bipartite lattices with unequal numbers of sites in the two sublattices) and the breaking of continuous symmetry. Moreover, although authors of previous studies have suggested that the presence of a tower of states (TOS) serves as an important numerical diagnostic of the tendency of a system toward spontaneous symmetry breaking, these investigations have primarily focused on two-dimensional systems. In 1D systems, however, the presence of long-range order does not automatically imply the emergence of a TOS. Here, we observe the existence of a TOS in a 1D realistic ferrimagnetic lattice system with short-range interactions.

cond-mat.str-el↗

arXiv2026

UFO: A Unified Flow-Oriented Framework for Robust Continual Graph Learning

Graph learning research has increasingly shifted toward continual graph learning (CGL), which better reflects real-world scenarios where graphs evolve over time. However, existing CGL methods largely assume clean supervision and overlook a critical challenge: the newly arriving portions of the graph are often noisy, due to annotation errors or adversarial corruption. This mismatch limits their applicability in practice. In this work, we study robust continual graph learning, where models must simultaneously handle catastrophic forgetting and noisy supervision in evolving graph data. We show that label noise introduces a new failure mode, catastrophic remembering, where models persistently reinforce corrupted knowledge across tasks. To address these challenges, we propose a Unified Flow-Oriented framework (UFO). First, UFO models conditional feature distributions via flow-based generative modeling and produces replay representations, mitigating forgetting without storing historical data. Second, UFO estimates instance-level reliability scores to distinguish clean from noisy nodes, reducing the impact of corrupted supervision and alleviating catastrophic remembering. Extensive experiments on four benchmark graph datasets under varying noise ratios demonstrate that UFO consistently outperforms existing methods in both accuracy and forgetting metrics. Code is available at: https://anonymous.4open.science/r/UFO.

cs.LG↗

arXiv2026

Learning Multi-Relational Graph Representations for DNA Methylation-Based Biological Age Estimation

Aging clocks aim to estimate biological age, a measure of physiological state distinct from chronological age, from observable biomarkers, and are widely used for health assessment and disease analysis. DNA methylation is a particularly informative biomarker due to its stability and strong association with aging, and recent learning-based approaches have improved predictive performance. However, most existing methods treat CpG sites as independent features, overlooking the complex and heterogeneous biological relationships among them. We propose RelAge-GNN, a multi-relational graph neural network framework for DNA methylation-based age prediction. Our method constructs three complementary graphs capturing co-methylation patterns, genomic co-localization, and gene-level associations among CpG sites. Each graph is modeled by an independent GNN branch, and a learnable gating mechanism adaptively fuses the resulting representations. Experiments on large-scale datasets show that RelAge-GNN achieves competitive accuracy and stronger correlation with chronological age compared to state-of-the-art methods. Moreover, the model exhibits improved sensitivity in detecting age acceleration across diverse disease cohorts, highlighting its potential utility for disease characterization. Finally, through post hoc interpretability analyses, we quantify the contributions of different relational structures and CpG sites, providing biologically meaningful insights and suggesting potential directions for aging-related research. Our code is available at: https://anonymous.4open.science/r/RelAge-GNN-F1E3/.

cs.LG↗

arXiv2026

Benchmarking Fairness in Spiking Neural Networks: Data Bias, Spurious Features, and Hardware Effects

Evaluating fairness in Spiking Neural Networks (SNNs) demands rigorous benchmarks that reflect real-world complexities, yet existing assessments remain limited by superficial dataset diversity and idealized hardware assumptions. This work introduces the first systematic fairness benchmark for SNNs, addressing three critical dimensions of realism: (1) demographic coverage gaps in training data, (2) spurious feature leakage (e.g., skin tone as a proxy for class labels), and (3) deployment-environment mismatches (e.g., edge devices with constrained spike encoding). Our framework integrates four cross-demographic datasets with controlled bias injections and three neuromorphic hardware simulators (Loihi 2, SpiNNaker), enabling isolated analysis of fairness-performance trade-offs under resource constraints. Standardized evaluations of 12 state-of-the-art SNNs reveal stark disparities: models trained on biased data exhibit 23\% higher false positive rates for underrepresented groups, while hardware limitations (e.g., reduced spike precision) further amplify accuracy gaps by up to 41\% in edge deployments. Critically, bias mitigation strategies developed for cloud-based SNNs often degrade under resource constraints, highlighting the need for co-design principles that jointly optimize fairness and hardware efficiency. By bridging algorithmic fairness research with neuromorphic engineering, our benchmark provides a foundation for trustworthy SNNs in socially critical applications such as healthcare and autonomous systems. Our code is available at: https://anonymous.4open.science/r/SNN-Benchmarks-8017.

cs.NE↗

arXiv2026

A Breast Vision Pathology Foundation Model for Real-world Clinical Utility

Pathology foundation models have shown strong retrospective performance, but whether such systems can support clinically relevant use remains unclear. This challenge is particularly important in breast cancer, where pathological assessment serves as the gold standard for diagnosis and guides treatment planning, surgical decision-making and risk stratification across pre-, intra- and post-operative stages. Here we present \textbf{BRAVE}, a breast-adaptive pathology foundation model developed and evaluated using a total resource of 101,638 breast whole-slide images from 32 sources across Asia, Europe and North America. We assessed BRAVE across 34 tasks in 82 cohorts spanning pre-operative biopsy, intra-operative frozen section and post-operative resection, using an evidence chain comprising retrospective benchmarking, clinically challenging scenarios, workflow-oriented clinical impact simulations, prospective observational validation with the thresholds locked in the retrospective cohorts and crossover pathologist-AI interaction studies. Across these settings, BRAVE supported practical roles in the clinical workflow, including safe exclusion of low-risk cases from routine review, AI-assisted second-review rescue of initially missed positives and prioritization of cases for further assessment. In prospective validation across three centres, BRAVE excluded 76.9% of negative biopsy cases (NPV 0.953) and 70.1% of negative frozen-section cases (NPV 0.973), and triaged 78.8% of post-operative subtyping cases as high-confidence clear-cut cases (NPV 1.000). In reader studies, AI assistance improved balanced accuracy from 88.5% to 95.1% (OR 3.14, P<0.001), with better efficiency, confidence and inter-rater agreement. BRAVE-derived scores also independently predicted disease-free survival (adjusted HR 4.79, P<0.001) and overall survival (adjusted HR 8.14, P<0.001).

cs.CV↗

arXiv2026

Boundary Renormalization Group Flow of Entanglement Entropy at a (2+1)-Dimensional Quantum Critical Point

We investigate the second-order Rényi entanglement entropy at the quantum critical point of a spin-1/2 antiferromagnetic Heisenberg model on a columnar dimerized square lattice. The universal constant $γ$ in the area-law scaling $S_{2}(\ell) = α\ell - γ$ is found to be sensitive to the entangling surface configurations, with $γ_{\text{sp}} > 0$ for strong-bond-cut (special) surfaces and $γ_{\text{ord}} < 0$ for weak-bond-cut (ordinary) surfaces, which is attributed to the distinct conformal boundary conditions. Introducing boundary dimerization drives a renormalization group (RG) flow from the special to the ordinary boundary criticality, and the constant $γ$ decreases monotonically with increasing dimerization strength, demonstrating irreversible evolution under the boundary RG flow. These results provide numerical evidence for a higher-dimensional analog of the $g$ theorem, and suggest $γ$ as a possible characteristic function for boundary RG flow in $(2+1)$-dimensional conformal field theory.

cond-mat.stat-mech↗

arXiv2026

LBA: Textual Hard-Label Adversarial Attack under Low Query Budgets

Generating high-quality adversarial texts with low query budgets remains a challenging problem in the hard-label scenario. Most existing approaches rely on greedy algorithms, where one position in the text is selected for substitution, followed by the substitutions of other positions. This local search approach may fail to discover high-quality adversarial examples and often leads to excessive query costs. Ideally, an optimal adversarial sample would consider all possible position combinations in the text, but exhaustive search is computationally impractical. To address this challenge, we propose a sampling-based method called LBA, which constructs an approximate distribution of high-quality adversarial examples by integrating both prior and posterior knowledge, and utilizes this distribution for sampling. As sampling progresses, posterior knowledge updates the approximate distribution, which in turn guides more effective sampling. Extensive experiments on six language models, ranging from small-scale to large-scale architectures across four datasets, demonstrate that LBA significantly outperforms state-of-the-art baselines on all evaluation metrics. Additionally, LLM-based assessment indicates that LBA generates more semantically preserved and comprehensible adversarial texts.

cs.CL↗

arXiv2026

Empowering Heterogeneous Graph Foundation Models via Decoupled Relation Alignment

While Graph Foundation Models (GFMs) have achieved remarkable success in homogeneous graphs, extending them to multi-domain heterogeneous graphs (MDHGs) remains a formidable challenge due to cross-type feature shifts and intra-domain relation gaps. Existing global feature alignment methods (PCA or SVD) enforce a shared feature space blindly, which distorts type-specific semantics and disrupts original topologies, inevitably leading to "Type Collapse" and "Relation Confusion". To address these fundamental limitations, we propose Decoupled relation Subspace Alignment (DRSA), a novel, plug-and-play relation-driven alignment framework. DRSA fundamentally shifts the paradigm by decoupling feature semantics from relation structures. Specifically, it introduces a dual-relation subspace projection mechanism to coordinate cross-type interactions within a shared low-rank relation subspace explicitly. Furthermore, a feature-structure decoupled representation is designed to decompose aligned features into a semantic projection component and a structural residual term, adaptively absorbing intra-domain variations. Optimized via a stable alternating minimization strategy based on Block Coordinate Descent, DRSA constructs a well-calibrated, structure-aware latent space. Extensive experiments on multiple real-world benchmark datasets demonstrate that DRSA can be seamlessly integrated as a universal preprocessing module, significantly and consistently enhancing the cross-domain and few-shot knowledge transfer capabilities of state-of-the-art GFMs. The code is available at: https://github.com/zhengziyu77/DSRA.

cs.SI↗

arXiv2026

Harnessing the Freedom of Non-Uniformity in Monostatic ISAC with Antenna Flexibility

This paper studies flexible non-uniform array design for monostatic integrated sensing and communication (ISAC) systems. An antenna pool is considered at the base station, where each candidate antenna can be dynamically assigned to transmit, receive, or inactive modes, such that a non-uniform effective array is jointly constructed with the ISAC precoding design. We formulate a sum communication rate maximization problem by jointly optimizing the ISAC beamforming schemes and antenna-mode assignment under sensing, power, and antenna mode constraints. We develop an alternating-optimization-based solution framework mainly with the aid of weighted minimum mean square error, continuous relaxation-based penalty, and successive convex approximation. Numerical results show that the proposed non-uniform array achieves higher sum-rates than the uniform-array baselines, with particularly large gains when the number of activated antennas is small. Moreover, the proposed non-uniform array can achieve, and in some cases exceed, the performance of uniform array baselines with substantially fewer activated antennas, highlighting geometry-aware non-uniform array design as a compelling alternative to brute-force antenna scaling-based array design.

cs.IT↗

arXiv2026

Keypoint-based Dynamic Object 6-DoF Pose Tracking via Event Camera

Accurate 6-DoF pose estimation of objects is critical for robots to perform precise manipulation tasks. However, for dynamic object pose estimation, conventional camera-based approaches face several major challenges, such as motion blur, sensor noise, and low-light limitation. To address these issues, we employ event cameras, whose high dynamic range and low latency offer a promising solution. Furthermore, we propose a keypoint-based detection and tracking approach for dynamic object pose estimation. Firstly, a keypoint detection network is constructed to extract keypoints from the time surface generated by the event stream. Subsequently, the polarity and spatial coordinates of the events are leveraged, and the event density in the vicinity of each keypoint is utilized to achieve continuous keypoint tracking. Finally, a hash mapping is established between the 2D keypoints and the 3D model keypoints, and the EPnP algorithm is employed to estimate the 6-DoF pose. Experimental results demonstrate that, whether in simulated or real event environments, the proposed method outperforms the event-based state-of-the-art methods in terms of both accuracy and robustness.

cs.CV↗

arXiv2026

Molecular structure, electric property, and scintillation and quenching of liquid scintillators

Liquid scintillators are widely used in particle and nuclear physics. Understanding the scintillation and quenching mechanisms is a fundamental issue in designing a high-light-yield liquid scintillator. In this work, the basic scintillation process for two-component liquid scintillators is discussed, highlighting the processes of excitation, ionization, and anion-cation recombination. A molecule's polar group, polarization characteristics, and the corresponding material's dielectric constant are found to be correlated with a liquid scintillator's scintillation efficiency. Polar groups and high relative dielectric constant (permittivity) can cause quenching and should be avoided. The tellurium loading scheme in the liquid scintillator of the SNO+ experiment, TeBD, is discussed. The hydroxyl groups introduce polar structures in the TeBD, and for the first time, the relative dielectric constant of TeBD is measured to be $16\pm1$. These discussions explain part of the quenching of the TeBD liquid scintillator.

physics.ins-det↗

arXiv2026

Re$^2$MoGen: Open-Vocabulary Motion Generation via LLM Reasoning and Physics-Aware Refinement

Text-to-motion (T2M) generation aims to control the behavior of a target character via textual descriptions. Leveraging text-motion paired datasets, existing T2M models have achieved impressive performance in generating high-quality motions within the distribution of their training data. However, their performance deteriorates notably when the motion descriptions differ significantly from the training texts. To address this issue, we propose Re$^2$MoGen, a Reasoning and Refinement open-vocabulary Motion Generation framework that leverages enhanced Large Language Model (LLM) reasoning to generate an initial motion planning and then refine its physical plausibility via reinforcement learning (RL) post-training. Specifically, Re$^2$MoGen consists of three stages: We first employ Monte Carlo tree search to enhance the LLM's reasoning ability in generating reasonable keyframes of the motion based on text prompts, specifying only the root and several key joints' positions to ease the reasoning process. Then, we apply a human pose model as a prior to optimize the full-body poses based on the planned keyframes and use the resulting incomplete motion to supervise fine-tuning a pre-trained motion generator via a dynamic temporal matching objective, enabling spatiotemporal completion. Finally, we use post-training with physics-aware reward to refine motion quality to eliminate physical implausibility in LLM-planned motions. Extensive experiments demonstrate that our framework can generate semantically consistent and physically plausible motions and achieve state-of-the-art performance in open-vocabulary motion generation.

cs.CV↗

arXiv2026

Worldline deconfinement and emergent long-range interaction in the entanglement Hamiltonian and in the entanglement spectrum

The entanglement spectrum (ES) is a powerful tool for probing topological phases. While its behavior in gapped systems is well understood, its properties in gapless regimes remain unclear. In this work, we employ a quantum Monte Carlo method to study the ES of a two-dimensional square-octagon lattice Heisenberg model at quantum criticality and in the Néel phase. We find that the ES exhibits an M-shape magnon mode with a distinct sublinear dispersion, deviating from the conventional linear magnon. This behavior, similar to that of a one-dimensional long-range Heisenberg chain, reveals the emergence of relevant long-range interactions in the entanglement Hamiltonian. We demonstrate that the mechanism underlying short- and long-range interactions in the entanglement Hamiltonian can be interpreted as the confinement/deconfinement of worldlines in the path integral formulation. Our results reveal that gapless modes can fundamentally change the entanglement Hamiltonian and its spectrum, thereby offering insight into this general phenomenon.

cond-mat.str-el↗

arXiv2026

Generalised (bi-)Hamiltonian structures of hydrodynamic type and (bi-)flat F-manifolds

We introduce the notions of generalised (bi-)Hamiltonian structures which generalise naturally the (bi-)Hamiltonian structures of evolutionary partial differential equations. In the hydrodynamic case, these structures are characterised in terms of geometric data. Furthermore, we show that a generalised (bi)-Hamiltonian structure of hydrodynamic type can be associated with any (bi-)flat F-manifold, and it is compatible with the corresponding principal hierarchy.

math-ph↗