arXiv:2608.21249v1 Announce Type: new
Abstract: While recent large language models (LLMs) have achieved promising results on individual patent drafting tasks, they fundamentally fail to investigate t...
By Lekang Jiang, Wenjun Sun, Stephan Goetz
arXiv:2605. 21071v4 Announce Type: replace-cross Abstract: The rapid progress of large language models (LLMs) is shifting semantic search toward a question-answering paradigm, where users ask questions and LLMs generate responses.
By Souvick Das, Sallam Abualhaija, Domenico Bianculli
LogicTree-RAG is a retrieval‑augmented generation framework that uses a hierarchical logic tree to guide the creation of long‑form patent drafts. Each node in the tree represents a technical element and is built through evidence‑guided recursive generation, while a hybrid traversal maps the tree into patent sections for balanced, controllable output. Experiments show that this logic‑centric approach improves content quality, language conformity, and token efficiency compared to strong LLM baselines.
By Jiaqi Zhu, Naili Xing, Hexiang Pan, Haotian Gao, Jianwei Yin, Xiaokui Xiao, Beng Chin Ooi
LEGO is a dual‑module framework that combines a Legal Expert GraphRAG system with an expert Chain‑of‑Thought approach to enhance complex legal reasoning. The GraphRAG component uses an expert‑annotated civil code graph and a greedy normative‑coverage retrieval algorithm to extract relevant provision subgraphs, while the Chain‑of‑Thought module structures retrieved provisions and case facts into a Provision‑Fact‑Conclusion reasoning flow. Using a Qwen3‑8B backbone, LEGO achieves 40.53% exact‑match accuracy on LawExamQA_Civil, surpassing baseline RAG and CoT models and matching larger models on multi‑hop and open‑ended benchmarks, with ablation studies confirming the complementary benefits of both modules.
By Qingjing Chen, Junkai Zhang, Shaochun Wang, Jiahao Ding, Siyuan Zheng, Yukun Yan, Zhi Zheng, Antonino Rotolo, Yun Liu, Weixing Shen
The paper introduces PARCEL, a benchmark designed to evaluate whether legal claims are supported by cited authorities. Using 3,396 claims from New York State Court of Appeals decisions, the authors label each claim as Supported, Refuted, or Not Found and cast the task as a three‑way natural language inference problem. State‑of‑the‑art LLMs achieve up to 0.97 accuracy in zero‑shot settings, yet they still frequently misclassify unsupported claims as supported, especially when fabricated but plausible citations are present.
By M. Mikail Demir, M. Abdullah Canbaz
arXiv:2609.13422v1 Announce Type: new
Abstract: LLM judges are increasingly used to evaluate and improve AI-generated outputs, yet their reliability for complex professional work remains unclear. We...
By Toshiaki Koike-Akino, Vlad Blaykhman, Ye Wang, Jing Liu, Gene V. Vinokur
arXiv:2604.13706v2 Announce Type: replace
Abstract: Professional fact-checkers rely on domain knowledge and deep contextual understanding to verify claims. Large language models (LLMs) and large reas...
By Dhruv Sahnan, Subhabrata Dutta, Tanmoy Chakraborty, Preslav Nakov, Iryna Gurevych
arXiv:2608.21924v1 Announce Type: new
Abstract: Patent litigation imposes substantial costs on firms and distorts R&D incentives, making early risk identification a practically important task. While...
By Takao Arai, Hiroyasu Inoue
arXiv:2606. 16118v1 Announce Type: new Abstract: Large Language Models (LLMs) achieve strong performance on reasoning tasks, but whether this reflects faithful logical inference or heuristic approximation remains unclear.
By Olivia Peiyu Wang, Sanna Wong-Toropainen, Daneshvar Amrollahi, Ryan Bai, Tashvi Bansal, Arush Garg, Leilani H. Gilpin
This study experimentally evaluates large language models (LLMs) for legal decision-making in Austrian and EU value‑added tax (VAT) law. It compares fine‑tuning and retrieval‑augmented generation (RAG) on textbook and real‑world tax consulting cases to identify optimal LLM configurations and assess legal‑reasoning abilities. Results show that properly configured LLMs can aid tax professionals with routine tasks and provide legally grounded justifications, though they are not yet ready for full automation due to challenges like hallucination and handling implicit client knowledge.
By Marina Luketina, Andrea Benkel, Christoph G. Schuetz
arXiv:2609.36550v1 Announce Type: new
Abstract: Retrieval-augmented generation is widely used in professional writing, yet whether retrieval grounds revision or merely injects templates is rarely tes...
By Josepha Michiko Leo, Hyun-seok Min, Yehoon Jang, Irvan Zidny, Jin-Woo Chung, Sungchul Choi
arXiv:2608. 14610v1 Announce Type: new Abstract: Legal reasoning tasks such as legal judgment prediction (LJP) require identifying the temporally correct version of the law governing a case -- a capability we term temporal applicable-law determination.
By Yiqian Huang, Shuyuan Zheng, Qianying Liu, Shaowen Peng, Yuntao Kong, Kotaro Funakoshi, Chuan Xiao, Manabu Okumura, Yang Cao