Metraipolis › archive › dc_9f40ffc3164e
Cassette: Case-to-Case Structural Distillation for Efficient Legal Case Retrieval — arXiv:2609.08185
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08185
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T15:05:24.311Z
- SHA-256 of the archived text
6a2ba79d3254d33dae2fdb66f9d3a842e4018a3d7a98cb2a22034ae7ffd96f7b- Stable URL of this page
https://metraipolis.com/documento/dc_9f40ffc3164e
How to cite
Cassette: Case-to-Case Structural Distillation for Efficient Legal Case Retrieval — arXiv:2609.08185 — arXiv (en), https://arxiv.org/abs/2609.08185 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9f40ffc3164e (Metraipolis archive dc_9f40ffc3164e, sha256 6a2ba79d3254d33dae2fdb66f9d3a842e4018a3d7a98cb2a22034ae7ffd96f7b)
BibTeX
@misc{dc9f40ffc3164e,
title = {Cassette: Case-to-Case Structural Distillation for Efficient Legal Case Retrieval — arXiv:2609.08185},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08185},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9f40ffc3164e; sha256 6a2ba79d3254d33dae2fdb66f9d3a842e4018a3d7a98cb2a22034ae7ffd96f7b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08185. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Legal case retrieval (LCR) is an essential tool for not only assisting legal practitioners to efficiently retrieve precedents but also enabling ordinary individuals to find valuable legal case information without relying on expensive professional legal services. Our previous work CaseLink demonstrated the effectiveness of using case to case graph structures to improve retrieval accuracy. However, its high computational cost during inference on large-scale legal databases limits its practical use in real-world settings. The main inefficiency comes from constructing test time graphs and computing pairwise term frequency similarities of cases. This process has O(n^2) complexity for n legal cases, making the runtime prohibitive as the number of candidates grows. For example, the retrieval time for one query on a database (COLIEE2022) with 1,563 candidate cases is more than 500 milliseconds, while the runtime would increase drastically to more than 3,500 seconds for a database (LeCaRDv2) with 55,192 candidate cases. To further enhance the retrieval performance while achieving a significant speed-up, in this extension paper, Cassette framework is proposed with a distillation strategy involving ranking objective and eigen-matching objective for an effective transfer of knowledge from a powerful and well-trained heavy teacher retriever to a lightweight and efficient hybrid student dual encoder. Specifically, the student query encoder is implemented as a multilayer perceptron model designed for fast online processing, whereas the student candidate encoder adopts a GNN architecture, suitable for an offline manner within the case database. Extensive experiments are conducted on three benchmark datasets, and the results verify the effectiveness of the ranking distillation while achieving high efficiency. The code has been released on this https URL . Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-09 in cs.IR). Categorie arXiv: Information Retrieval (cs.IR). Pagina del lavoro: https://arxiv.org/abs/2609.08185 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T14:49:33.958Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).