Decompose-and-Refine: Structured Legal Question Answering with Parametric Retrieval 事件

Decompose-and-Refine: Structured Legal Question Answering with Parametric Retrieval arXiv:2605.24454v1 Announce Type: new Abstract: Large language models (LLMs) have shown strong performance in the legal domain, demonstrating notable potential in Legal Question Answering (LQA). However, unlike general QA, LQA requires answers that are not only accurate but also rigorously grounded in explicit legal authority. In statutory LQA, many questions require multi-hop reasoning across multiple legal iss