arXiv Computation and Language

Modeling Claim Dependency Structure for Patent Litigation Prediction with Graph Attention Networks

Hugging Face Trending Papers
Jul 11

When Reasoning Hurts Legal Drafting: The Verbalization Bottleneck in Patent Claim Generation

Patent claim drafting is a challenging legal drafting task that requires technical expertise, precise linguistic control, strict adherence to formal conventions, and the preservation of complex logical relationships among claim elements. While Chain-of-Thought (CoT) prompting has been widely used to improve the reasoning capabilities of large language models (LLMs), recent evidence suggests that its benefits may be limited, or even negative, in highly structured or pattern-sensitive tasks.

arXiv Computation and Language
Sep 25

ARGUS: Role-Aware Event Knowledge Graphs for U.S. Employment-Discrimination Complaints

ARGUS is a pipeline that builds document-level Event Knowledge Graphs (EKGs) from U.S. employment‑discrimination complaints. It uses a 5W1H-inspired schema, legal-domain models, and LLM‑based structured generation to extract fact‑bearing statements, create chunk‑level event graphs with participant, temporal, and causal structure, and merge them into comprehensive document representations. Evaluation shows that graph‑structured classifiers outperform raw and linearized baselines on claim classification, and EKG‑only retrieval improves document‑scoped QA, though overall open‑retrieval gains are limited by low first‑stage candidate recall.

By Sriram Kannan, Swetha Saseendran, Vishnu Vardhan Reddy Kandi, Leslie Barrett, Madhavan Seshadri, Enrico Santus
arXiv Computation and Language
Sep 23

Mining Legal Arguments in U.S. Corporate Case Law

The paper introduces an expert‑annotated dataset of 42 U.S. federal tax opinions on corporate reorganizations under I.R.C. §368, marking the first tree‑structured argument corpus in this domain. Each legal passage is labeled with one of five functional categories—Rule, Analysis, Conclusion, Background Facts, and Procedural History—and can be linked into directed support trees. Experiments demonstrate that functional labels are learnable and that supervised fine‑tuning improves within‑case retrieval, though cross‑case generalization remains weak.

By Luis Brena, William Jurayj, Gregory Deyesu, Zaid Al-Huneidi, Andrew Blair-Stanek, Benjamin Van Durme