Weixing Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Weixing Shen has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Yiran Hu
University of Waterloo, Waterloo, Canada
7 shared publications - Qingyao Ai
Tsinghua University, Beijing, China
5 shared publications - Yiqun Liu
Department of Computer Science and Technology, Tsinghua University, China
5 shared publications - Yun Liu
Tsinghua University, Beijing, China
5 shared publications - Bulou Liu
Department of Computer Science and Technology, Institute for Internet Judiciary, Tsinghua University, Beijing, China
3 shared publications - Chenliang Li
Wuhan University
3 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9036-9040
LexSkill: A Systematic Chinese Legal Skill Framework with High-Quality Annotations and an Execution Harness
Agents in knowledge-intensive domains require not only knowledge retrieval, but also the skills to effectively use retrieved knowledge. Since domain knowledge is often highly complex, agents must possess strong reasoning capabilities in order to perform tasks effectively. In the legal domain, different legal systems exhibit substantial differences, and the reasoning logic for applying legal knowledge varies significantly across systems. Meanwhile, existing skill collections lack a systematic skill framework grounded in domain knowledge, limiting their scalability and extensibility. To address these challenges, we present LexSkill, a reasoning-oriented legal skill library for the Chinese legal system. Within this framework, legal experts construct 36 atomic skills, further organized into 180 sub-atomic skills and 2 compound skills. Since legal problem solving also requires grounded access to legal resources and coordinated reasoning across multiple steps, we further introduce Chinese-Law-Harness, which augments the skill library with MCP modules built over a case repository and a statutory repository, and incorporates a multi-agent system for skill orchestration and execution. Evaluations on existing legal AI benchmarks show that leveraging the skill library through the proposed harness significantly outperforms direct problem solving without structured support, verifying the effectiveness of our skills and harness.
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9036-9040
Open AccessLexSkill: A Systematic Chinese Legal Skill Framework with High-Quality Annotations and an Execution Harness
Agents in knowledge-intensive domains require not only knowledge retrieval, but also the skills to effectively use retrieved knowledge. Since domain knowledge is often highly complex, agents must possess strong reasoning capabilities in order to perform tasks effectively. In the legal domain, different legal systems exhibit substantial differences, and the reasoning logic for applying legal knowledge varies significantly across systems. Meanwhile, existing skill collections lack a systematic skill framework grounded in domain knowledge, limiting their scalability and extensibility. To address these challenges, we present LexSkill, a reasoning-oriented legal skill library for the Chinese legal system. Within this framework, legal experts construct 36 atomic skills, further organized into 180 sub-atomic skills and 2 compound skills. Since legal problem solving also requires grounded access to legal resources and coordinated reasoning across multiple steps, we further introduce Chinese-Law-Harness, which augments the skill library with MCP modules built over a case repository and a statutory repository, and incorporates a multi-agent system for skill orchestration and execution. Evaluations on existing legal AI benchmarks show that leveraging the skill library through the proposed harness significantly outperforms direct problem solving without structured support, verifying the effectiveness of our skills and harness.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6738-6742
JustEva: A Toolkit to Evaluate LLM Fairness in Legal Knowledge Inference
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6738-6742
Open AccessJustEva: A Toolkit to Evaluate LLM Fairness in Legal Knowledge Inference
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5411-5416
HCLeK: Hierarchical Compression of Legal Knowledge for Retrieval-Augmented Generation
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5411-5416
Open AccessHCLeK: Hierarchical Compression of Legal Knowledge for Retrieval-Augmented Generation
- Open Access
- 10 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (4) , 1-26
Generating Clarifying Questions for Conversational Legal Case Retrieval without External Knowledge
In legal case retrieval, existing work has shown that human-mediated conversational search can improve users’ search experience. One of the key problems for a practical conversational search system is how to ask high-quality clarifying questions to initiate conversations with users and understand their search intents. Previous works demonstrated that human-annotated external domain knowledge (such as event schemas) can improve the legal utility of clarifying questions generated by large language models. However, these methods are restricted to specific law systems or languages and cannot be generalized to others. To this end, we propose to generate context and domain-specific questions with LLMs without external annotations or knowledge by extracting information from top-retrieved documents given the current conversation context. Specifically, we construct a conversational legal case retrieval system CARQ that iteratively selects neighbor candidate case documents from the retrieved list at each conversation step to ask clarifying questions. We pretrain CARQ to capture the differences between legal cases and employ the reward augmented maximum likelihood to optimize the system directly for retrieval metrics. Extensive automated and human evaluations on three widely adopted legal case retrieval datasets demonstrate the superior effectiveness of our approach as compared with the state-of-the-art baselines.
- 10 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (4) , 1-26
Open AccessGenerating Clarifying Questions for Conversational Legal Case Retrieval without External Knowledge
In legal case retrieval, existing work has shown that human-mediated conversational search can improve users’ search experience. One of the key problems for a practical conversational search system is how to ask high-quality clarifying questions to initiate conversations with users and understand their search intents. Previous works demonstrated that human-annotated external domain knowledge (such as event schemas) can improve the legal utility of clarifying questions generated by large language models. However, these methods are restricted to specific law systems or languages and cannot be generalized to others. To this end, we propose to generate context and domain-specific questions with LLMs without external annotations or knowledge by extracting information from top-retrieved documents given the current conversation context. Specifically, we construct a conversational legal case retrieval system CARQ that iteratively selects neighbor candidate case documents from the retrieved list at each conversation step to ask clarifying questions. We pretrain CARQ to capture the differences between legal cases and employ the reward augmented maximum likelihood to optimize the system directly for retrieval metrics. Extensive automated and human evaluations on three widely adopted legal case retrieval datasets demonstrate the superior effectiveness of our approach as compared with the state-of-the-art baselines.
- Open Access
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 374-378
EVENS: Equality versus Equity Notion Spectrum of LLMs
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 374-378
Open AccessEVENS: Equality versus Equity Notion Spectrum of LLMs
- Open Access
- 17 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (3) , 1-28
Structure-Aware Conversational Legal Case Retrieval
Legal case retrieval is an important task in information retrieval that aims to retrieve relevant cases for given query cases. Conversational search paradigms have been shown to improve the search experience in legal case retrieval. However, there are two challenges in applying conversational search to legal scenarios. Firstly, legal search conversations often focus on different parts of legal case documents, but existing models struggle to capture the complex structural information and extract accurate relevance signals. Secondly, collecting large-scale conversational search datasets is costly, making it difficult to build reliable conversational legal case retrieval models. To address these challenges, we propose a Structure-Aware Matching Model (SAMM) for conversational legal case retrieval. SAMM extracts matching signals between conversational utterances and segments of the legal cases to incorporate structural information. We decouple the conversational search task into three subtasks and design pre-training tasks to overcome the lack of training data. Additionally, we create ConvLegal, the largest conversational legal case retrieval dataset to the best of our knowledge, for better evaluation of different methods. We train and evaluate SAMM and baselines on both a public dataset (CLCR) and ConvLegal. Experimental results demonstrate that SAMM outperforms existing models in legal case retrieval and conversational search.
- 17 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (3) , 1-28
Open AccessStructure-Aware Conversational Legal Case Retrieval
Legal case retrieval is an important task in information retrieval that aims to retrieve relevant cases for given query cases. Conversational search paradigms have been shown to improve the search experience in legal case retrieval. However, there are two challenges in applying conversational search to legal scenarios. Firstly, legal search conversations often focus on different parts of legal case documents, but existing models struggle to capture the complex structural information and extract accurate relevance signals. Secondly, collecting large-scale conversational search datasets is costly, making it difficult to build reliable conversational legal case retrieval models. To address these challenges, we propose a Structure-Aware Matching Model (SAMM) for conversational legal case retrieval. SAMM extracts matching signals between conversational utterances and segments of the legal cases to incorporate structural information. We decouple the conversational search task into three subtasks and design pre-training tasks to overcome the lack of training data. Additionally, we create ConvLegal, the largest conversational legal case retrieval dataset to the best of our knowledge, for better evaluation of different methods. We train and evaluate SAMM and baselines on both a public dataset (CLCR) and ConvLegal. Experimental results demonstrate that SAMM outperforms existing models in legal case retrieval and conversational search.
- Top Cited PapersOpen Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1513-1522
Leveraging Event Schema to Ask Clarifying Questions for Conversational Legal Case Retrieval
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1513-1522
Top Cited PapersOpen AccessLeveraging Event Schema to Ask Clarifying Questions for Conversational Legal Case Retrieval
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 5336-5340
MUSER: A Multi-View Similar Case Retrieval Dataset
Similar case retrieval (SCR) is a representative legal AI application that plays a pivotal role in promoting judicial fairness. However, existing SCR datasets only focus on the fact description section when judging the similarity between cases, ignoring other valuable sections (e.g., the court's opinion) that can provide insightful reasoning process behind. Furthermore, the case similarities are typically measured solely by the textual semantics of the fact descriptions, which may fail to capture the full complexity of legal cases from the perspective of legal knowledge. In this work, we present MUSER, a similar case retrieval dataset based on multi-view similarity measurement and comprehensive legal element with sentence-level legal element annotations. Specifically, we select three perspectives (legal fact, dispute focus, and law statutory) and build a comprehensive and structured label schema of legal elements for each of them, to enable accurate and knowledgeable evaluation of case similarities. The constructed dataset originates from Chinese civil cases and contains 100 query cases and 4,024 candidate cases. We implement several text classification algorithms for legal element prediction and various retrieval methods for retrieving similar cases on MUSER. The experimental results indicate that incorporating legal elements can benefit the performance of SCR models, but further efforts are still required to address the remaining challenges posed by MUSER. The source code and dataset are released at https://github.com/THUlawtech/MUSER.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 5336-5340
Open AccessMUSER: A Multi-View Similar Case Retrieval Dataset
Similar case retrieval (SCR) is a representative legal AI application that plays a pivotal role in promoting judicial fairness. However, existing SCR datasets only focus on the fact description section when judging the similarity between cases, ignoring other valuable sections (e.g., the court's opinion) that can provide insightful reasoning process behind. Furthermore, the case similarities are typically measured solely by the textual semantics of the fact descriptions, which may fail to capture the full complexity of legal cases from the perspective of legal knowledge. In this work, we present MUSER, a similar case retrieval dataset based on multi-view similarity measurement and comprehensive legal element with sentence-level legal element annotations. Specifically, we select three perspectives (legal fact, dispute focus, and law statutory) and build a comprehensive and structured label schema of legal elements for each of them, to enable accurate and knowledgeable evaluation of case similarities. The constructed dataset originates from Chinese civil cases and contains 100 query cases and 4,024 candidate cases. We implement several text classification algorithms for legal element prediction and various retrieval methods for retrieving similar cases on MUSER. The experimental results indicate that incorporating legal elements can benefit the performance of SCR models, but further efforts are still required to address the remaining challenges posed by MUSER. The source code and dataset are released at https://github.com/THUlawtech/MUSER.