CaseGNN: Graph Neural Networks for Legal Case Retrieval with Text-Attributed Graphs
Not on the map. Why?
Abstract (arXiv)
Legal case retrieval is an information retrieval task in the legal domain, which aims to retrieve relevant cases with a given query case. Recent research of legal case retrieval mainly relies on traditional bag-of-words models and language models. Although these methods have achieved significant improvement in retrieval accuracy, there are still two challenges: (1) Legal structural information neglect. Previous neural legal case retrieval models mostly encode the unstructured raw text of case into a case representation, which causes the lack of important legal structural information in a case and leads to poor case representation; (2) Lengthy legal text limitation. When using the powerful BERT-based models, there is a limit of input text lengths, which inevitably requires to shorten the input via truncation or division with a loss of legal context information. In this paper, a graph neural networks-based legal case retrieval model, CaseGNN, is developed to tackle these challenges. To effectively utilise the legal structural information during encoding, a case is firstly converted into a Text-Attributed Case Graph (TACG), followed by a designed Edge Graph Attention Layer and a readout function to obtain the case graph representation. The CaseGNN model is optimised with a carefully designed contrastive loss with easy and hard negative sampling. Since the text attributes in the case graph come from individual sentences, the restriction of using language models is further avoided without losing the legal context. Extensive experiments have been conducted on two benchmarks from COLIEE 2022 and COLIEE 2023, which demonstrate that CaseGNN outperforms other state-of-the-art legal case retrieval methods. The code has been released on https://github.com/yanran-tang/CaseGNN.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Dec 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 6; 2026: 1.
9 papers.
- 2023PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensationcited by 8
- 2025IL-PCSR: Legal Corpus for Prior Case and Statute Retrievalcited by 5
- 2025When Large Language Models Meet Law: Dual-Lens Taxonomy, Technical Advances, and Ethical Governancecited by 3
- 2025Text Meets Topology: Rethinking Out-of-distribution Detection in Text-Rich Networkscited by 3
- 2025LLM-based Embedders for Prior Case Retrievalcited by 2
- 2025Segment First, Retrieve Better: Realistic Legal Search via Rhetorical Role-Based Queriescited by 1
- 2025Does Homophily Help in Robust Test-time Node Classification?cited by 1
- 2026Call Neighbours Yourself: Graph Walks with Destination-Conditioned On-Policy Self-Distillationcited by 1
- 2024Learning from Litigation: Graphs and LLMs for Retrieval and Reasoning in eDiscoverycited by 0
- 2026Call Neighbours Yourself: Graph Walks with Destination-Conditioned On-Policy Self-Distillation30 Aug 2026
- 2025IL-PCSR: Legal Corpus for Prior Case and Statute Retrieval31 Oct 2025
- 2025Does Homophily Help in Robust Test-time Node Classification?25 Oct 2025
- 2025Text Meets Topology: Rethinking Out-of-distribution Detection in Text-Rich Networks25 Aug 2025
- 2025Segment First, Retrieve Better: Realistic Legal Search via Rhetorical Role-Based Queries1 Aug 2025
- 2025LLM-based Embedders for Prior Case Retrieval24 Jul 2025
- 2025When Large Language Models Meet Law: Dual-Lens Taxonomy, Technical Advances, and Ethical Governance10 Jul 2025
- 2024Learning from Litigation: Graphs and LLMs for Retrieval and Reasoning in eDiscovery29 May 2024
- 2023PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation22 Dec 2023