arXiv subjects

Ping Zhang

Publications and source records attributed to Ping Zhang.

At least 73 records · Page 4Linked to original sources

arXiv2026

Nonmagnetic-magnetic Transitions in Rutile RuO2

Rutile RuO$_2$ has recently attracted great interest, as its magnetic ground state remains controversial. Experimental studies have reported either nonmagnetic (NM) or altermagnetic (AM) ground states in different crystalline samples of RuO$_2$, highlighting the need for a reasonable explanation to resolve this contradiction. In this study, density functional theory calculations are performed to reveal the correlation-sensitive and strain-dependent magnetism of bulk RuO$_2$. On one hand, multiple AM phases with different magnitudes of the spin magnetic moment are identified in the Hubbard parameter space for RuO$_2$. On the other hand, when appropriate strains that significantly change the crystal cell volume are applied, the ground state of RuO$_2$ can undergo transitions between the NM state (with no spin splitting) and the magnetic states (with spin splitting in the band structure). These findings not only demonstrate intriguing physics in 4\textit{\textit{d}}-electron-correlated RuO$_2$, but also retain its potential for spintronic applications.

cond-mat.mtrl-sci↗

arXiv2026

DistFlow: A Fully Distributed RL Framework for Scalable and Efficient LLM Post-Training

Effectively scaling Reinforcement Learning (RL) is crucial for enhancing the reasoning and alignment of Large Language Models. The massive data and complex execution flows inherent in these tasks require a distributed architecture capable of efficient scaling. However, to simplify programming and dependency management, mainstream frameworks often rely on a centralized architecture where a single node dispatches both control and data. This inherent coupling creates significant communication bottlenecks, severely limiting system scalability and efficiency. We present DISTFLOW, a novel, fully distributed RL framework that adopts a multi-controller paradigm. By decoupling data transmission from control dispatch, DISTFLOW establishes a parallelism-aware, decentralized Data Coordinator that leverages local caching, load balancing, and asynchronous double buffer to minimize communication overhead and mitigate straggler effects. For control logic, it introduces a task scheduler built upon Directed Acyclic Graph (DAG) that facilitates fine-grained, independent execution. Experimental results demonstrate that DISTFLOW achieves near-linear scalability up to 512 GPUs and delivers up to a 2.63x throughput improvement over state-of-the-art (SOTA) frameworks. The source code is available at: https://github.com/sii-research/siiRL.

cs.DC↗

arXiv2026

SIDMA: Semantic Interleave Division Multiple Access Communication System

Multiple Access (MA) technology has consistently served as the core driving force behind the evolution of mobile communications. As a promising paradigm for next-generation communications, Semantic Communication explores entirely new semantic spatial resources by mining the deep meaning of information. However, the inherent spatial correlation and importance heterogeneity of semantic features often cause semantic collisions and semantic collapse in multi-user concurrent transmission scenarios. To address these challenges, this paper proposes a Semantic Interleaved Division Multiple Access (SIDMA) technique. By utilizing a permutation operator to perform structural whitening on semantic features and combining it with an Importance-aware Power Allocation (ImpPA) module for differentiated protection, SIDMA scatters core features across the interleaving domain and adaptively optimizes power levels based on real-time channel conditions. Simulation results demonstrate that, compared with traditional MA techniques and advanced semantic multiple access schemes including Orthogonal-Model Division Multiple Access (OMDMA), Deep Multiple Access (DeepMA), and Shared Embedding (SE), the proposed SIDMA exhibits superior reconstruction fidelity and scalability in multi-user concurrent transmissions, effectively enhancing the communication quality and robustness in resource-constrained environments.

cs.IT↗

arXiv2026

Prediction of 1:1 kagome metals with superconductivity and band topology

Kagome superconductors featuring topologically nontrivial band structures have attracted extensive research interest. FeSn and CoSn is a new kind of kagome material with intrinsic magnetism, which suppresses the emergence of superconductivity. Here, we theoretically predict a new kind of 1:1 kagome MSn (M=transition metal), which exhibit intrinsic superconductivity and nontrivial band topology by first-principles calculations. Among twenty-seven candidates, MSn (M= Mo, Hf, Nb, Ta, W, Ti) are theoretically identified as both dynamically and thermodynamical stable. And, five non-magnetic MSn (M= Mo, Hf, Nb, Ta, W) exhibit phonon-mediated superconductivity. Especially, the d orbitals bands display Dirac points and van Hove singularities near the Fermi level, which contribute to the emergence of topology and the electron-phonon coupling (EPC). More interestingly, MoSn, HfSn and NbSn show nontrivial topological band structure at the Fermi level. Thus, the predicted MSn establish a platform integrating superconductivity and topological order.

cond-mat.supr-con↗

arXiv2026

PlexRL: Cluster-Level Orchestration of Serviceized LLM Execution for RLVR

Reinforcement learning with verifiable rewards (RLVR) has recently unlocked strong reasoning capabilities in large language models (LLMs), triggering rapid exploration of new algorithms and data. However, RLVR training is notoriously inefficient: long-tailed rollouts, tool-induced stalls, and asymmetric resource requirements between rollout and training introduce substantial idle time that cannot be eliminated by job-local optimizations such as synchronous pipelining, asynchronous rollout, or colocated execution. We argue that this inefficiency is structural. While idle gaps are unavoidable within individual RLVR jobs, they are largely anti-correlated across jobs and therefore exploitable at the cluster level. Leveraging this observation, we present PlexRL, a cluster-level runtime for multiplexing unified LLM services across RLVR jobs. By centrally managing model placement, state transitions, and function-level scheduling under strict affinity constraints, PlexRL time-slices LLM execution across jobs to fill otherwise idle periods without expensive model migration. Our implementation and evaluations demonstrate that PlexRL significantly improves effective cluster capacity and reduces user GPU hour cost by maximum 37.58% while preserving algorithmic flexibility and introducing minimal per-job overhead.

cs.DC↗

arXiv2026

When Cases Get Rare: A Retrieval Benchmark for Off-Guideline Clinical Question Answering

Across medical specialties, clinical practice is anchored in evidence-based guidelines that codify best studied diagnostic and treatment pathways. These pathways routinely fall short for the long tail of real-world care not covered by guidelines. Most medical large language models (LLMs), however, are trained to encode common, guideline-focused medical knowledge in their parameters. Current evaluations test models primarily on recalling and reasoning with this memorized content, often in multiple-choice settings. Given the fundamental importance of evidence-based reasoning in medicine, it is neither feasible nor reliable to depend on memorization in practice. To address this gap, we introduce OGCaReBench, a free-form retrieval-focused benchmark aimed at evaluating LLMs at answering clinical questions that require going beyond typical guidelines. Extracted from published medical case reports and validated by medical experts, OGCaReBench contains long-form clinical questions requiring free-text answers, providing a systematic framework for assessing open-ended medical reasoning in rare, case-based scenarios. Our experiments reveal that even the best-performing baseline (GPT-5.2) correctly answers only 56% of our benchmark with specialized models only reaching 42%. Augmenting models with retrieved medical articles improves this performance to up to 82% (using GPT-5.2) highlighting the importance of evidence-grounding for real-world medical reasoning tasks. This work thus establishes a foundation for benchmarking and advancing both general-purpose and medical LLMs to produce reliable answers in challenging clinical contexts.

cs.CL↗

arXiv2026

ChannelAgent-Empowered Electromagnetic Space World Model: A Case Study on Agent-Driven Channel Generation for 6G AI-Native Air Interface

As sixth-generation (6G) wireless networks evolve toward increasingly heterogeneous scenarios, tasks, and service requirements, conventional artificial intelligence (AI) models remain limited in task-aware decision-making and autonomous adaptation. To address this issue, this paper first proposes a ChannelAgent-empowered electromagnetic space world model, in which wireless intelligence is organized into a closed-loop process consisting of multi-modal sensing, ChannelAgent as the intelligent core, and execution with feedback update. As a case study, agent-driven channel generation is instantiated through path loss prediction. Specifically, a task-oriented intelligent feature selection mechanism is designed by integrating reinforcement-learning-inspired policy adaptation with evolutionary search, enabling the agent to iteratively derive compact and task-suitable feature subsets according to the current scenario and performance feedback. Simulation results demonstrate superior performance in both single-scenario and multi-scenario tasks, highlighting the potential of the proposed model for autonomous, adaptive, task-oriented, and closed-loop wireless intelligence.

eess.SP↗

arXiv2026

Important Bit Prefix M-ary Quadrature Amplitude Modulation for Semantic Communications

M-ary Quadrature Amplitude Modulation (MQAM) is a commonly used channel modulation technology in wireless communication systems. To achieve dedicated channel modulation for semantic communication (SemCom), we propose an Important-Bit-Prefixed MQAM (IBP-MQAM) scheme and derive its approximate expression of important symbol error rate (ISER) and unimportant symbol error rate (USER). By extracting and quantifying text semantics using Latent Dirichlet Allocation (LDA), we verify that IBP-MQAM achieves improved performance over MQAM in SemCom scenarios and further analyze the effects of key system parameters.

eess.SP↗

arXiv2026

Generalization Bounds of Emergent Communications for Agentic AI Networking

The evolution of 6G networking toward agentic AI networking (AgentNet) systems requires a shift from traditional data pipelines to task-aware, agentic AI-native communication solutions. Emergent communication, a novel communication paradigm in which autonomous agents learn their own signaling protocols through interaction, is increasingly viewed as a promising solution to address the challenges posed by existing rigid, predefined protocol-based networking architecture. However, most existing emergent communication frameworks fail to account for physical networking constraints, such as bandwidth and computational complexity, and often lack a rigorous information-theoretical foundation. To address these challenges, this paper introduces a novel emergent communication framework that facilitates collaborative task-solving among heterogeneous agents through an information-theoretic lens. We propose a novel joint loss function that unifies the optimization of decision-making functions and the learning of communication signaling. Our proposed solution is grounded on the multi-agent and multi-task distributed information bottleneck (DIB) theory, which allows the quantification of the fundamental trade-off between task-relevant information representation and computational complexity. We further provide theoretical generalization bounds of the emergent communication protocol during decentralized inference across unseen environmental states. Experimental validation on a real-world hardware prototype confirms that our proposed framework significantly improves generalization performance, compared to the state-of-the-art solutions.

cs.AI↗

arXiv2026

Generative AI Meets 6G and Beyond: Diffusion Models for Semantic Communications

Semantic communications mark a paradigm shift from bit-accurate transmission toward meaning-centric communication, essential as wireless systems approach theoretical capacity limits. The emergence of generative AI has catalyzed generative semantic communications, where receivers reconstruct content from minimal semantic cues by leveraging learned priors. Among generative approaches, diffusion models stand out for their superior generation quality, stable training dynamics, and rigorous theoretical foundations. However, the field currently lacks systematic guidance connecting diffusion techniques to communication system design, forcing researchers to navigate disparate literatures. This article provides the first comprehensive tutorial on diffusion models for generative semantic communications. We present score-based diffusion foundations and systematically review three technical pillars: conditional diffusion for controllable generation, efficient diffusion for accelerated inference, and generalized diffusion for cross-domain adaptation. In addition, we introduce an inverse problem perspective that reformulates semantic decoding as posterior inference, bridging semantic communications with computational imaging. Through analysis of human-centric, machine-centric, and agent-centric scenarios, we illustrate how diffusion models enable extreme compression while maintaining semantic fidelity and robustness. By bridging generative AI innovations with communication system design, this article aims to establish diffusion models as foundational components of next-generation wireless networks and beyond.

eess.SP↗

arXiv2026

SANet: A Semantic-aware Agentic AI Networking Framework for Cross-layer Optimization in 6G

Agentic AI networking (AgentNet) is a novel AI-native networking paradigm in which a large number of specialized AI agents collaborate to perform autonomous decision-making, dynamic environmental adaptation, and complex missions. It has the potential to facilitate real-time network management and optimization functions, including self-configuration, self-optimization, and self-adaptation across diverse and complex environments. This paper proposes SANet, a novel semantic-aware AgentNet architecture for wireless networks that can infer the semantic goal of the user and automatically assign agents associated with different layers of the network to fulfill the inferred goal. Motivated by the fact that AgentNet is a decentralized framework in which collaborating agents may generally have different and even conflicting objectives, we formulate the decentralized optimization of SANet as a multi-agent multi-objective problem, and focus on finding the Pareto-optimal solution for agents with distinct and potentially conflicting objectives. We propose three novel metrics for evaluating SANet. Furthermore, we develop a model partition and sharing (MoPS) framework in which large models, e.g., deep learning models, of different agents can be partitioned into shared and agent-specific parts that are jointly constructed and deployed according to agents' local computational resources. Two decentralized optimization algorithms are proposed. We derive theoretical bounds and prove that there exists a three-way tradeoff among optimization, generalization, and conflicting errors. We develop an open-source RAN and core network-based hardware prototype that implements agents to interact with three different layers of the network. Experimental results show that the proposed framework achieved performance gains of up to 14.61% while requiring only 44.37% of FLOPs required by state-of-the-art algorithms.

cs.AI↗

arXiv2026

Secure Intellicise Wireless Network: Agentic AI for Coverless Semantic Steganography Communication

Semantic Communication (SemCom), leveraging its significant advantages in transmission efficiency and reliability, has emerged as a core technology for constructing future intellicise (intelligent and concise) wireless networks. However, intelligent attacks represented by semantic eavesdropping pose severe challenges to the security of SemCom. To address this challenge, Semantic Steganographic Communication (SemSteCom) achieves ``invisible'' encryption by implicitly embedding private semantic information into cover modality carriers. The state-of-the-art study has further introduced generative diffusion models to directly generate stega images without relying on original cover images, effectively enhancing steganographic capacity. Nevertheless, the recovery process of private images is highly dependent on the guidance of private semantic keys, which may be inferred by intelligent eavesdroppers, thereby introducing new security threats. To address this issue, we propose an Agentic AI-driven SemSteCom (AgentSemSteCom) scheme, which includes semantic extraction, digital token controlled reference image generation, coverless steganography, semantic codec, and optional task-oriented enhancement modules. The proposed AgentSemSteCom scheme obviates the need for both cover images and private semantic keys, thereby boosting steganographic capacity while reinforcing transmission security. The simulation results on open-source datasets verify that, AgentSemSteCom achieves better transmission quality and higher security levels than the baseline scheme.

cs.CR↗

arXiv2026

IPRU: Input-Perturbation-based Radio Frequency Fingerprinting Unlearning for LAWNs

Radio Frequency Fingerprinting (RFF) is a key technology for identity authentication in wireless networks. However, due to the rapid dynamics of Autonomous Aerial Vehicles (AAVs) in low-altitude wireless networks, RFF models require parameter updates to maintain authentication performance, posing a major challenge to existing schemes. Conventional retraining approaches for handling departed or compromised AAVs are computationally prohibitive and risk retaining polluted features, which compromises both authentication security and user privacy. To address these limitations, we propose an Input-Perturbation-based RFF Unlearning (IPRU) scheme. By optimizing a universal Fingerprint Forget Vector (FFV) as a lightweight input perturbation, IPRU successfully erases the fingerprints of target AAVs without modifying the RFF model parameters, achieving an effective balance between efficient unlearning and preserved authentication performance. A combinatorial optimization strategy further enables multi-AAV forgetting on demand. The simulation results demonstrate that IPRU achieves 1.41% unlearning accuracy, 99.41% remaining accuracy, and 100% resistance to membership inference attack, while running 5.79X faster than retraining and 2.1X faster than the baseline scheme.

eess.SP↗

arXiv2026

Secure Digital Semantic Communications: Fundamentals, Challenges, and Opportunities

Semantic communication (SemCom) has emerged as a promising paradigm for future wireless networks by prioritizing task-relevant meaning over raw data delivery, thereby reducing communication overhead and improving efficiency. However, shifting from bit-accurate transmission to task-oriented delivery introduces new security and privacy risks. These include semantic leakage, semantic manipulation, knowledge base vulnerabilities, model-related attacks, and threats to authenticity and availability. Most existing secure SemCom studies focus on analog SemCom, where semantic features are mapped to continuous channel inputs. In contrast, digital SemCom transmits semantic information through discrete bits or symbols within practical transceiver pipelines, offering stronger compatibility with realworld systems while exposing a distinct and underexplored attack surface. In particular, digital SemCom typically represents semantic information over a finite alphabet through explicit digital modulation, following two main routes: probabilistic modulation and deterministic modulation. These discrete mechanisms and practical transmission procedures introduce additional vulnerabilities affecting bit- or symbol-level semantic information, the modulation stage, and packet-based delivery and protocol operations. Motivated by these challenges and the lack of a systematic analysis of secure digital SemCom, this paper provides a structured review of the area. Specifically, we review SemCom fundamentals and clarify the architectural differences between analog and digital SemCom. We then summarize threats shared by both paradigms and organize the threat landscape specific to digital SemCom, followed by a discussion of potential defenses. Finally, we outline open research directions toward secure and deployable digital SemCom systems.

cs.CR↗

arXiv2026

Intertwined charge density wave, tunable anti-dome superconductivity, and topological states in kagome metal VSn

These years, kagome materials with 1:1 stoichiometry have garnered increasing attention, among which FeSn, CoSn, and FeGe have been the focus of current studies. However, all of them are antiferromagnetic, thereby hindering the observation of superconductivity and other novel physical properties. Here, we predict a novel 1:1 kagome metal VSn, which is an intrinsic charge density wave (CDW) material. Interestingly, with increasing pressure or doping concentration, the CDW order is progressively suppressed, followed by the emergence of superconductivity characterized by a non-monotonic transition temperature that exhibits a rare anti-dome-shaped dependence. Above a critical threshold, a reentrance of the CDW phase occurs. The anti-dome superconductivity originates from the first hardening and then softening of phonon modes, together with band reconstruction. Crucially, VSn retains nontrivial topological properties across the entire superconducting regime, a feature of paramount importance for realizing robust topological superconductivity. These intertwined CDW, superconductivity, and topological phenomena elucidate the correlations among multiple quantum states in VSn. Therefore, this research paves the way for for designing 1:1 kagome superconducting topological metals and establishes a platform for exploring the interplay of multiple phases in kagome systems.

cond-mat.mtrl-sci↗

arXiv2026

Two-gap to Single-gap Transition and Two-dome-like Superconductivity in Alkali-Metal Intercalated Bilayer PdTe2

PdTe2 has been synthesized with controllable thickness down to the monolayer limit. Based on first-principles calculations within the fully anisotropic Migdal-Eliashberg framework, this work reveals that alkali-metal intercalation markedly enhances the weak superconductivity of bilayer PdTe2, boosting the transition temperature from 1.4 K to 5.0 -13.5 K and yielding a two-dome-like evolution of Tc. Rubidium intercalation induces the highest Tc of 13.5 K, which can be further increased to 14.5 K under biaxial tensile strain. The strain-dependent evolution of Tc also exhibits a two-dome-like behavior, reflecting the interplay between strain-induced band structure modifications and electron-phonon coupling (EPC). Moreover, a systematic correlation is identified between interlayer interaction and superconducting gap. Lithium intercalation induces a distinct two-gap state, whereas intercalants with larger atomic radii (Na, K, Rb, and Cs) drive the system into a single-gap character. The two-gap to single-gap transition originates from the modulation of interlayer coupling through intercalation-induced interlayer expansion. In addition, pristine and Li/Na-intercalated bilayers exhibit nontrivial band topology, suggesting that layered PdTe2 provides a promising platform for realizing the coexistence of superconductivity and nontrivial topology. These results provide detailed anisotropic insights into EPC and offer viable pathways for enhancing Tc and achieving diverse properties in layered PdTe2 systems.

cond-mat.supr-con↗

arXiv2026

PBSBench: A Multi-Level Vision-Language Framework and Benchmark for Hematopathology Whole Slide Image Interpretation

Peripheral Blood Smear (PBS) is a critical microscopic examination in hematopathology that yields whole-slide imaging (WSI). Unlike solid tissue pathology, PBS interpretation focuses on individual cell morphologies rather than tissue architecture, making it distinct in both visual characteristics and diagnostic reasoning. However, current multimodal large language models (MLLMs) for pathology are primarily developed on solid-tissue WSIs and struggle to generalize to PBS. To bridge this gap, we construct PBSInstr, the first vision-language dataset for PBS interpretation, comprising 353 PBS WSIs paired with microscopic impression paragraphs and 29k cell-level image crops annotated with cell type labels and morphological descriptions. To facilitate instruction tuning, PBSInstr further includes 27k question-answer (QA) pairs for cell crops and 1,286 QA pairs for PBS slides. Building upon PBSInstr, we develop PBS-VL, a hematopathology-tailored vision-language model for multi-level PBS interpretation at both cell and slide levels. To comprehensively evaluate PBS understanding, we construct PBSBench, a visual question answering (VQA) benchmark featuring four question categories and six PBS interpretation tasks. Experiments show that PBS-VL outperforms existing general-purpose and pathology MLLMs, underscoring the value of PBS-specific data. We release our code, datasets, and model weights to facilitate future research. Our proposed framework lays the foundation for developing practical AI assistants supporting decision-making in hematopathology.

cs.CV↗

arXiv2026

Intervention-Aware Multiscale Representation Learning from Imaging Phenomics and Perturbation Transcriptomics

Microscopy-based phenotypic profiling is scalable for drug discovery but lacks the mechanistic depth of transcriptomics, which remains costly and scarce. Existing multimodal approaches either use images to support other modalities or naively align representations by sample identity, ignoring cell-type and dose variations in weakly paired data-limiting generalization to unseen interventions. In this paper, we introduce an intervention-aware distillation framework that leverages perturbational transcriptomics to guide image representation learning. A transcriptome-conditioned teacher integrates gene expression and intervention metadata to produce soft distributions over a chemistry-aware codebook organized by drug similarity. The teacher employs a fine-tuned single-cell foundation model to encode cell-type context and disentangle dose effects. An image-only student learns to predict these distributions from microscopy alone, distilling mechanistic knowledge while operating independently at test time. This design emphasizes intervention semantics rather than identity alignment and explicitly handles dose and cell-type mismatches. We provide theoretical guarantees showing that transcriptomic guidance tightens the risk bound for image-based prediction. On Cell Painting and RxRx datasets paired with L1000, our method significantly improves one-shot transfer to unseen interventions and drug-target gene discovery compared to self-supervised and alignment baselines.

cs.CV↗