arXiv subjects

Wenhao Liu

Publications and source records attributed to Wenhao Liu.

At least 19 recordsLinked to original sources

arXiv2026

ProMediConv: Benchmarking Proactive Conversational Agents in Legal Dispute Mediation

Dispute mediation is essential for maintaining social harmony and resilience, yet developing skilled mediators is costly and time-consuming. Existing LLM-based mediation research remains limited by unrealistic task formulations, low-fidelity datasets, and coarse evaluation metrics that obscure turn-by-turn dynamics. To address these gaps, we introduce ProMediConv, a novel benchmarking framework that models mediation as a proactive, multi-stage, and party-aware dialogue process incorporating 11 mediation strategies and four party behavior pattern (BP) states. Using 972 complete real-world cases, we construct a high-fidelity mediation dataset with utterance-level annotations of strategies and BP states. Furthermore, to better assess agent impact, we propose MAD (Mean Attribute Difference), a fine-grained metric that captures BP shifts throughout the dialogue. Leveraging this framework, we establish a comprehensive benchmark by evaluating diverse models alongside our tailored baseline ProMediAgent. Extensive empirical analyses reveal critical behavioral phenomena and underscore the persistent challenges current models face in dynamic, multi-party mediation. Ultimately, ProMediConv provides a rigorous foundation and a vital quantitative standard for advancing AI-assisted conflict resolution. Our dataset and codebase are accessible at https://github.com/ZsWei66/ProMediConv_repo.

cs.CL↗

arXiv2026

Optimal Exponent of the Single-Error Correction Threshold with Fixed Redundancy for Analog Error-Correcting Codes

Analog error-correcting codes (Analog ECCs), introduced by Roth [1], address errors in vector-matrix multiplication arising from analog noise and sparse outliers in in-memory computing. A fundamental open problem concerns the lower bound on the single-error correction threshold $\Gamma_2(\mathcal C)$ for real $[n,k]$ linear codes with fixed redundancy $r=n-k\geq 2$. Li et al. [2] recently established that for redundancy $r=2$, every real $[n,n-2]$ linear code $\mathcal{C}$ satisfies $\Gamma_2(\mathcal C)\geq \csc^2(\frac{\pi}{2n})$, resolving an open problem in [1], and showed that, for every fixed $r \geq 2$, there exists a class of $[n,k]$ linear code $\mathcal{C}$ over $\mathbb{R}$ such that $\Gamma_2(\mathcal{C}) \leq O(n^{1+\frac{1}{r-1}})$. This paper proves the matching converse in [2]. For every $[n,k]$ linear code $\mathcal{C}\subseteq \mathbb R^n$ with fixed redundancy $2\leq r<n$, we show that \[ \Gamma_2(\mathcal C)\ge \frac{a_r}{\sqrt{r}\,\beta_{r-1}\,2^{\frac{1}{r-1}}}\cdot n^{1+\frac{1}{r-1}}, \] where $a_r =\frac{\Gamma(\frac{r}{2})}{\sqrt{\pi}\,\Gamma(\frac{r+1}{2})}$ and $\beta_d = \left(\frac{d\pi^{d-1}|\mathbb S^d|}{|\mathbb S^{d-1}|}\right)^{\frac{1}{d}}$ for positive integer $d$. Here $\mathbb S^d$ denotes the unit sphere in $\mathbb R^{d+1}$, $|\mathbb S^d|$ its surface area, and $\Gamma(\cdot)$ the Gamma function. In particular, we further show that $\Gamma_2(\mathcal C)\geq \frac{1}{4\pi\sqrt{3}r}\cdot n^{1+\frac{1}{r-1}}$. Together with the upper bound in [2], this confirms that the exponent $n^{1+\frac{1}{r-1}}$ is optimal, completing the asymptotic characterization of the single-error correction threshold for Analog ECCs.

cs.IT↗

arXiv2026

Element-Specific Visualization of Layer-Parity and Twist-Dependent Magnetism in CrSBr

Van der Waals (vdW) based antiferromagnets (AFMs) are an ideal platform for probing and understanding thickness- and twist-angle-dependent emergent spin phenomena. However, element-specific nanoscale characterization of the spin structure in atomically thin vdW-based AFMs systems and layer-parity effects remain elusive, making them crucial for both fundamental insight into low-dimensional magnetism and the rational design of spintronic devices based on these materials. Here, we utilize X-ray magnetic circular and linear dichroisms paired with photoemission electron microscopy to resolve the magnetic order in atomically thin CrSBr. Our comprehensive measurements reveal CrSBr magnetic structure at the nanoscale and its dependence on the layer number, surface encapsulation, temperature, and applied field. Moreover, in the orthogonally twisted bilayer configuration, obtained by twisting two CrSBr ferromagnetic monolayers by 90$^\circ$, the magnetic easy axis fundamentally differs from the individual monolayers, unlocking a new pathway for moir\'e magnetism.

cond-mat.mes-hall↗

arXiv2026

DemoPSD: Disagreement-Modulated Policy Self-Distillation

On-policy self-distillation (OPSD) has emerged as a practical method for training large language models (LLMs) to reason, where a single model acts as both the teacher and the student with different levels of information access. However, recent studies have found that the teacher's dense token-level supervision, conditioned on privileged information, can lead to overfitting to in-domain patterns, suppress exploration, and hurt cross-domain generalization, while also introducing a more fundamental issue: *privileged information leakage*, where the student encodes answer-dependent shortcuts that are unavailable at test time. We introduce **DemoPSD**, a novel framework that resolves such problems through the idea of *selective adoption of teacher guidance*. Instead of fitting the full teacher distribution, DemoPSD steers the student toward a *reverse-KL barycenter target*, a weighted geometric combination of the teacher and student distributions, that naturally balances learning from the teacher with preserving the student's own reasoning capacity. We measure the difference between their distributions and use such a discrepancy to adaptively control the blending at each token position. We provably show that DemoPSD achieves **(1)** *leakage attenuation*, i.e., effective mitigation of privileged information leakage; and **(2)** *exploration preservation*, i.e., preservation of exploration capacity under dense token-level distillation. Extensive experiments on SciKnowEval across four scientific fields show that DemoPSD outperforms both GRPO and SDPO while maintaining higher training entropy and robustly generalizing to out-of-distribution GPQA benchmarks.

cs.LG↗

arXiv2026

Enabling Electrical Readout of N\'eel vector reversal in a van der Waals Antiferromagnet

Owing to its robustness against external perturbations and intrinsically ultrafast dynamics, the N\'eel vector in antiferromagnets (AFMs) can enable the development of next-generation spintronic and magnonic devices for memory and computing applications. To realize AFM-based magnetic memory devices, one of the key requirements is to demonstrate electrical readout of 180-degree reversal of N\'eel vector in thin film AFMs, which remains critically missing. In this work, we report experimental demonstration of a novel transport methodology to detect N\'eel vector reversal in atomically thin films of a van der Waals (vdW) based A-type AFM. For this, we utilize spin-dependent electronic band properties of CrSBr by coupling it to a spin-polarized layer, separated by a tunnel barrier. In this configuration, the spin-dependent tunnelling magnetoresistance (MR) becomes sensitive to the relative orientation between the magnetization of the reference electrode and the interfacial sublattice magnetization of the AFM layer, in turn enabling electrical detection of the N\'eel vector orientation. Importantly, the observed MR can also reveal 180-degree reversal of N\'eel vector in even-layers of CrSBr, wherein adjacent sublattice magnetic layers are exactly compensated and the net magnetization vanishes and thus establishes a broadly applicable strategy for electrical detection of N\'eel vector in vdW-based AFMs.

cond-mat.mes-hall↗

arXiv2026

Mask-Proof: An LLM-based Automated Data Curation Pipeline on Mathematical Proofs

Large language models (LLMs) are increasingly capable of mathematical problem solving and can even assist with research-level proofs, yet we still lack a scalable and reproducible way to measure step-level reasoning in long proofs across diverse sources. This evaluation gap limits trustworthy AI assistance in proof-certified scientific progress. Existing evaluations often emphasize final answers or rely on costly expert grading, while end-to-end proof generation remains open-ended and hard to verify automatically. We introduce Mask-Proof, a pipeline that turns real proofs into automatically checkable masked-step tasks. It masks key formula steps, provides the necessary surrounding context, and evaluates model reconstructions with an LLM-based equivalence judge using repeated votes for stability. The resulting Mask-ProofBench contains 292 curated problems across diverse research areas. Experiments with 17 models show that reasoning-enhanced models outperform standard models by 12% to 27%. Our evaluator achieves 96.8% agreement with expert annotators, enabling faithful, reproducible, and comparable measurement of step-level mathematical reasoning. Benchmark, annotations, and code are available at https://github.com/weating/Mask-Proof.

cs.AI↗

arXiv2026

Asymptotically Optimal Codes for Correcting Burst Deletions and Insertions in Labeled DNA Sequences

Fluorescent labeling is a cornerstone of DNA visualization and a key enabler of random access in DNA-based data storage. However, the stochastic nature of biochemical processes, including synthesis, hybridization, and optical readout, induces \emph{burst} synchronization errors within the resulting labeling sequences. To address this critical challenge, we formally introduce \emph{burst $t$-deletion/insertion $\mathcal{A}$-labeling codes,} designed to correct a single burst of $t$ deletions or insertions in the label domain. Our contributions are threefold. \begin{itemize} \item \textbf{Fundamental limit.} We establish an information-theoretic lower bound of $\log_4 n + \mathcal{O}(1)$ on the redundancy of any such code for all $t \ge 1$ with $t \mid n$. To the best of our knowledge, this resolves the first information-theoretic lower bound even for the single-error case $t=1$. \item \textbf{Explicit construction.} For $t \ge 2$, $t \mid n$, and $n \ge 7t + 3$, we propose explicit encoding and decoding algorithms, both running in $\mathcal{O}(n^2)$ time. A novel generalized Run-Length Limited (RLL) constraint is introduced to bridge the structural mismatch between the DNA encoding domain and the label error domain. \item \textbf{Asymptotic optimality.} The proposed scheme achieves redundancy $\log_4 n + (t-1)\log_4 \log_{8/3} n + \mathcal{O}(1)$, matching the dominant term of the lower bound up to a small $\mathcal{O}(\log\log n)$ overhead, rendering the construction asymptotically optimal for fixed $t$. \end{itemize}

cs.IT↗

arXiv2026

ReasonAlloc: Hierarchical Decoding-Time KV Cache Budget Allocation for Reasoning Models

Long chain-of-thought (CoT) trajectories in large language model (LLM) reasoning cause severe inference bottlenecks due to rapid key-value (KV) cache growth. Current decoding-time compression methods mitigate this issue via token eviction, but typically assume a uniform budget distribution across all layers and heads. In contrast, existing non-uniform budget allocation methods are predominantly designed for the static prompt prefill phase, and they do not capture the stepwise context demands of autoregressive reasoning. To bridge this gap, we propose ReasonAlloc, a training-free framework that recasts decoding-time KV compression as a hierarchical budget allocation problem. ReasonAlloc operates at two complementary levels: an offline layer-wise preallocation strategy captures an architecture-driven demand pattern which we call ``\textit{Reasoning Wave}'', while an online head-wise strategy reallocates resources during decoding to information-rich heads based on real-time utility. Evaluations on mathematical reasoning benchmarks (MATH-500, AIME~2024) using DeepSeek-R1-Distill-Llama-8B, DeepSeek-R1-Distill-Qwen-14B, and AceReason-14B show that ReasonAlloc outperforms uniform-budget R-KV, SnapKV, and Pyramid-RKV (a baseline enforcing a static, monotonically decreasing layer budget), with the largest gains at small budgets (128-512 tokens). ReasonAlloc is plug-and-play with existing token-eviction policies and introduces negligible inference-time overhead.

cs.AI↗

arXiv2026

Non-local low energy neutral excitations in a strongly disordered triangular Mott magnet Cr$_3$Se$_2$Br$_5$

Understanding if low-energy excitations can remain itinerant in the presence of strong disorder remains a central challenge in frustrated quantum magnets, where disorder is generally expected to localize excitations through Anderson-like mechanisms. Here we report the emergence of charge-neutral itinerant excitations in a van der Waals compound Cr$_3$Se$_2$Br$_5$, a strongly disordered $S = 3/2$ Mott insulator with a frustrated triangular lattice. Structural analysis reveals substantial intrinsic disorder arising from Cr-site deficiency and Se/Br-site mixing, which appear to be fixed and cannot be readily tuned. No long-range magnetic order or conventional glassy behavior is observed. In addition to its highly insulating nature, the magnetic specific heat C_mag/T and thermal conductivity \k{appa}_xx/T both exhibit linear temperature dependencies with substantial finite intercepts. In particular, a sizeable field-independent residual term $\kappa/T \approx 0.03~\mathrm{W\,m^{-1}\,K^{-2}}$ is observed, providing compelling evidence of itinerant low-energy excitations that carry entropy without charge. These findings conceptually advance our understanding of quantum matter by demonstrating a rare regime where the interplay of disorder, frustration, and electronic correlations actively reshapes the nature of low-energy excitations, allowing itinerant neutral excitations to coexist with strong intrinsic disorder.

cond-mat.str-el↗

arXiv2026

Charge density wave in a band insulator

Charge density wave (CDW) implies a periodic modulation of the charge density. Typically observed in metallic systems, CDWs arise from Fermi surface instabilities, resulting in the total or partial gapping of the Fermi surface. Here, we present experimental evidence for a CDW state emerging in a band insulator which has no Fermi surface. The bulk and surface of our material platform, Bi4Br4, is gapped over the entire Brillouin zone. Through topographic and spectroscopic imaging at low temperatures, we unveil an unexpected unidirectional charge modulation in Bi4Br4, breaking the lattice translation symmetry. The CDW develops at temperatures below 40 K and adds an energy gap atop the existing insulating gap of Bi4Br4. Furthermore, our transport measurements reveal nonlinear electrical conduction, a phenomenon conventionally associated with the sliding or phason mode of incommensurate CDWs. These highly unusual observations represent a new type of CDW and demand a new theoretical framework for CDWs.

cond-mat.str-el↗

arXiv2026

Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes

Analog error-correcting codes (Analog ECCs) for approximate vector-matrix multiplication have been extensively studied as means to achieve fault-tolerant in-memory computation. The theoretical foundations for such coding schemes, particularly the characterization of their correction capabilities via the height profile, have been well established in recent literature. In this paper, we focus on the case of single-error detection Analog ECCs. Among several open problems related to this case proposed by Ron M. Roth in [1], Problem 1 asks: "Identify the values of $k$ and $n$ for which every linear $[n, k]$ code $\mathcal{C}$ over $\mathbb{R}$ satisfies: $$\mathsf{h}_1(\mathcal{C}):=\max_{\boldsymbol{c}\in \mathcal{C}\setminus{\{\boldsymbol{0}\}}}\mathsf{h}_1(\boldsymbol{c})\geq \Big\lceil \frac{k}{n-k} \Big\rceil.\text{"}$$ Here, for any $\boldsymbol{x}\in\mathbb{R}^n$, $\mathsf{h}_1(\boldsymbol{x})$ represents the ratio between the largest and second largest absolute values of $\boldsymbol{x}$'s entries. As the simplest special case of Problem 1 (with $n-k=2$), the following problem was posed as Problem 2 in [1]: "Must every $(n-2)$-dimensional subspace of $\mathbb{R}^n$, $n$ even, contain a nonzero vector in which the ratio between the largest and second largest absolute values of its entries is at least $(n/2)-1$?" These problems directly pertain to the lower bounds on the single-error detection threshold for Analog ECCs: Problem 1 corresponds to arbitrary $n-k$ and Problem 2 corresponds to $n-k=2$. In this paper, we provide an affirmative answer to Problem 2 and a rigorous proof using theories related to convex optimization. Furthermore, we extend our analytical method to show that the lower bound in Problem 1 is tight for the case where $n-k$ divides $k$. Our results fill the gap in the lower bound theory of thresholds for single-error detection in Analog ECCs.

cs.IT↗

arXiv2026

Reward Hacking in the Era of Large Models: Mechanisms, Emergent Misalignment, Challenges

Reinforcement Learning from Human Feedback (RLHF) and related alignment paradigms have become central to steering large language models (LLMs) and multimodal large language models (MLLMs) toward human-preferred behaviors. However, these approaches introduce a systemic vulnerability: reward hacking, where models exploit imperfections in learned reward signals to maximize proxy objectives without fulfilling true task intent. As models scale and optimization intensifies, such exploitation manifests as verbosity bias, sycophancy, hallucinated justification, benchmark overfitting, and, in multimodal settings, perception--reasoning decoupling and evaluator manipulation. Recent evidence further suggests that seemingly benign shortcut behaviors can generalize into broader forms of misalignment, including deception and strategic gaming of oversight mechanisms. In this survey, we propose the Proxy Compression Hypothesis (PCH) as a unifying framework for understanding reward hacking. We formalize reward hacking as an emergent consequence of optimizing expressive policies against compressed reward representations of high-dimensional human objectives. Under this view, reward hacking arises from the interaction of objective compression, optimization amplification, and evaluator--policy co-adaptation. This perspective unifies empirical phenomena across RLHF, RLAIF, and RLVR regimes, and explains how local shortcut learning can generalize into broader forms of misalignment, including deception and strategic manipulation of oversight mechanisms. We further organize detection and mitigation strategies according to how they intervene on compression, amplification, or co-adaptation dynamics. By framing reward hacking as a structural instability of proxy-based alignment under scale, we highlight open challenges in scalable oversight, multimodal grounding, and agentic autonomy.

cs.LG↗

arXiv2026

Highly Efficient Second/Third Harmonic Generation in van der Waals Layered Material AgScP2S6 with Anisotropic Polarization and Temperature Dependence

Single-crystal X-ray diffraction and nonlinear optical measurements, especially second- and third-harmonic generation (SHG/THG) are comprehensively investigated for the van der Waals layered material AgScP2S6 with a non-centrosymmetric P31c (159) space group. Linear optical constants are extracted using spectroscopic ellipsometry and applied in fitting the harmonic generation behavior. Polarization-resolved SHG and THG measurements exhibit pronounced anisotropy, with emission patterns well-described by theoretical models derived from the khi(2) and khi(3) tensor elements. The material demonstrates exceptionally high nonlinear susceptibilities, with khi(2) ~ 10^(-8) m/V and khi(3) ~ 10^(-17) m^2/V^2 which is a few orders of magnitude greater than comparable 2D materials reported in the literature. Temperature-dependent SHG and THG measurements from 300 K to 25 K reveal exponential decay in harmonic signal intensities, attributed to reduced carrier mobility, with no evidence of structural phase transitions, consistent with results from single crystal diffraction and heat capacity measurements. Polarization-resolved SHG and THG measurements also reveal distinct orientation and ellipticity trends, highlighting the anisotropic nonlinear tensor contributions and contrasting polarization selection rules in the material. These results establish AgScP2S6 as a high-performance, thermally stable, and highly anisotropic nonlinear candidate material suitable for compact photonic applications such as ultrafast optical modulators, polarization-sensitive detectors, and wavelength-tunable light sources.

cond-mat.mtrl-sci↗

arXiv2026

Redundancy-Optimal Constructions of $(1,1)$-Criss-Cross Deletion Correcting Codes with Efficient Encoding/Decoding Algorithms

Two-dimensional error-correcting codes, where codewords are represented as $n \times n$ arrays over a $q$-ary alphabet, find important applications in areas such as QR codes, DNA-based storage, and racetrack memories. Among the possible error patterns, $(t_r,t_c)$-criss-cross deletions-where $t_r$ rows and $t_c$ columns are simultaneously deleted-are of particular significance. In this paper, we focus on $q$-ary $(1,1)$-criss-cross deletion correcting codes. We present a novel code construction and develop complete encoding, decoding, and data recovery algorithms for parameters $n \ge 11$ and $q \ge 3$. The complexity of the proposed encoding, decoding, and data recovery algorithms is $\mathcal{O}(n^2)$. Furthermore, we show that for $n \ge 11$ and $q = \Omega(n)$ (i.e., there exists a constant $c>0$ such that $q \ge cn$), both the code redundancy and the encoder redundancy of the constructed codes are $2n + 2\log_q n + \mathcal{O}(1)$, which attain the lower bound ($2n + 2\log_q n - 3$) within an $\mathcal{O}(1)$ gap. To the best of our knowledge, this is the first construction that can achieve the optimal redundancy with only an $\mathcal{O}(1)$ gap, while simultaneously featuring explicit encoding and decoding algorithms.

cs.IT↗

arXiv2026

TRIP-Bench: A Benchmark for Long-Horizon Interactive Agents in Real-World Scenarios

As LLM-based agents are deployed in increasingly complex real-world settings, existing benchmarks underrepresent key challenges such as enforcing global constraints, coordinating multi-tool reasoning, and adapting to evolving user behavior over long, multi-turn interactions. To bridge this gap, we introduce \textbf{TRIP-Bench}, a long-horizon benchmark grounded in realistic travel-planning scenarios. TRIP-Bench leverages real-world data, offers 18 curated tools and 40+ travel requirements, and supports automated evaluation. It includes splits of varying difficulty; the hard split emphasizes long and ambiguous interactions, style shifts, feasibility changes, and iterative version revision. Dialogues span up to 15 user turns, can involve 150+ tool calls, and may exceed 200k tokens of context. Experiments show that even advanced models achieve at most 50\% success on the easy split, with performance dropping below 10\% on hard subsets. We further propose \textbf{GTPO}, an online multi-turn reinforcement learning method with specialized reward normalization and reward differencing. Applied to Qwen2.5-32B-Instruct, GTPO improves constraint satisfaction and interaction robustness, outperforming Gemini-3-Pro in our evaluation. We expect TRIP-Bench to advance practical long-horizon interactive agents, and GTPO to provide an effective online RL recipe for robust long-horizon training.

cs.AI↗

arXiv2026

Benchmark^2: Systematic Evaluation of LLM Benchmarks

The rapid proliferation of benchmarks for evaluating large language models (LLMs) has created an urgent need for systematic methods to assess benchmark quality itself. We propose Benchmark^2, a comprehensive framework comprising three complementary metrics: (1) Cross-Benchmark Ranking Consistency, measuring whether a benchmark produces model rankings aligned with peer benchmarks; (2) Discriminability Score, quantifying a benchmark's ability to differentiate between models; and (3) Capability Alignment Deviation, identifying problematic instances where stronger models fail but weaker models succeed within the same model family. We conduct extensive experiments across 15 benchmarks spanning mathematics, reasoning, and knowledge domains, evaluating 11 LLMs across four model families. Our analysis reveals significant quality variations among existing benchmarks and demonstrates that selective benchmark construction based on our metrics can achieve comparable evaluation performance with substantially reduced test sets.

cs.CL↗

arXiv2025

Observation of robust one-dimensional edge channels in a three-dimensional quantum spin Hall insulator

Topologically protected edge channels show prospects for quantum devices. They have been found experimentally in two-dimensional (2D) quantum spin Hall insulators (QSHIs), weak topological insulators and higher-order topological insulators (HOTIs), but the number of materials realizing these topologies is still quite limited. Here, we provide evidence for topological edge states within a novel topology named three-dimensional (3D) QSHIs. Its topology originates solely from a nonzero $S_z$ spin Chern number for each $k_z$ plane of the crystal and is realized in bulk $\alpha$-Bi$_4$I$_4$ with trivial symmetry indicators, as we show by density functional theory calculations. We experimentally observe the related edge states at each type of monolayer and bilayer step of this material by scanning tunneling microscopy. Consistently, the edge states are neither interrupted, nor backscattered by defects at the step edges corroborating their helical character as expected from the nontrivial topology. Furthermore, two individual edge channels are directly observed at bilayer steps without visible interaction gap opening, demonstrating the robustness of these edge modes against vertical stacking. Our results establish $\alpha$-Bi$_4$I$_4$ as the first material realization of a 3D QSHI whose definition goes beyond the scope of topological symmetry indicators, and provide a pathway for realizing nearly-quantized spin Hall conductivity per unit cell in a bulk crystal.

cond-mat.mes-hall↗

arXiv2025

Atomic-scale spin sensing of a 2D $d$-wave altermagnet via helical tunneling

Altermagnetism simultaneously possesses nonrelativistic spin responses and zero net magnetization, thus combining advantages of ferromagnetism and antiferromagnetism. This superiority originates from its unique dual feature, i.e., opposite-magnetic sublattices in real space and alternating spin polarization in momentum space enforced by the same crystal symmetry. Therefore, the determination of an altermagnetic order and its unique spin response inherently necessitates atomic-scale spin-resolved measurements in real and momentum spaces, an experimental milestone yet to be achieved. Here, via utilizing the helical edge (hinge) modes of a higher order topological insulator as the spin sensor, we realize spin-resolved scanning tunneling microscopy which enables us to pin down the dual-space feature of a layered $d$-wave altermagnet, KV$_2$Se$_2$O. In real space, atomic-registered mapping demonstrates the checkerboard antiferromagnetic order together with density-wave lattice modulation, and in momentum space, spin-resolved spectroscopic imaging provides a direct visualization of d-wave spin splitting of the band structure. Critically, using this new topology-guaranteed spin filter we directly reveal the unidirectional, spin-polarized quasiparticle excitations originating from the crystal symmetry-paired X and Y valleys around opposite magnetic sublattices simultaneously --the unique spin response for $d$-wave altermagnetism. Our experiments establish a solid basis for the exploration and utilization of altermagnetism in layered materials and further facilitate access to atomic-scale spin sensing and manipulating of 2D quantum materials.

cond-mat.mes-hall↗