Automatic Construction of a Legal Citation Graph from 100 Million Ukrainian Court Decisions: Large-Scale Extraction, Topological Analysis, and Ontology-Driven Clustering

• URL: http://arxiv.org/abs/2605.15362v1
• Date: Thu, 14 May 2026 19:42:20 GMT
• Title: Automatic Construction of a Legal Citation Graph from 100 Million Ukrainian Court Decisions: Large-Scale Extraction, Topological Analysis, and Ontology-Driven Clustering
• Abstract summary: Citation edges extracted from 100.7 million Ukrainian court decisions reveal judicial citation structure encodes legal domain boundaries without supervision.<n>We construct the first large-scale citation graph from the completeSR registry (99.5 million full texts, 1.1 TB)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Half a billion citation edges extracted from 100.7 million Ukrainian court decisions reveal that judicial citation structure encodes legal domain boundaries without supervision and predicts future legislative importance with near-perfect accuracy. We construct the first large-scale citation graph from the complete EDRSR registry (99.5 million full texts, 1.1 TB), extracting 502 million citation links across six types via regex on commodity hardware in approximately 5 hours, with precision of 1.00 on a 200-decision validation sample (95% Wilson CI: [0.982, 1.000]). Three principal findings emerge. (1) The degree distribution follows a power law (alpha = 1.57 +/- 0.008), placing the Ukrainian court network near the EU Court of Justice and below the US Supreme Court, with hub articles cited by millions of decisions. (2) Louvain community detection on the co-citation projection recovers legal domain boundaries (civil, criminal, administrative, commercial) with modularity Q = 0.44-0.55 and temporal stability (NMI = 0.83-0.86 across periods), constituting an automatically constructed legal ontology grounded in judicial practice. (3) Citation features predict top-1000 articles with AUC = 0.9984, substantially outperforming a naive frequency baseline (P@1000 = 0.655); temporal dynamics detect legislative regime changes as phase transitions and the 2022 invasion as a citation entropy spike (H: 11.02 -> 13.49) with emergent wartime legislation nodes. The citation-derived ontology is operationalized as the domain layer of a workflow memory system for LLM-assisted legal analysis, connecting to the ontology-controlled paradigm. The extraction pipeline, analysis code, and aggregated statistics are released as open data.

Related papers

• Amortised Post-Hoc Explanation with Exact Preservation for Dynamic Graph Anomaly Detectors [2.169919643934826]
  Anomaly detection in dynamic graphs underpins financial fraud analysis, intrusion detection, and platform integrity.<n>StrGNN, the strongest performer in recent benchmarks, produces no explanation: when an edge is flagged, the analyst receives only a score.<n>We present X-StrGNN, a post-hoc explanation layer that wraps a trained, frozen StrGNN and emits, for every flagged edge, dual attributions.
  arXiv  Detail & Related papers  (2026-08-16T06:10:40Z)
• Citation Grounding: Detecting and Reducing LLM Citation Hallucinations via Legal Citation Graphs [0.0]
  Empirical evaluation on 100 Ukrainian legal queries across five systems.<n>13-21% of citations hallucinated, with citation precision ranging from 0.791 to 0.873.<n>To reduce hallucinations without human annotation, we introduce Citation Grounding DPO.
  arXiv  Detail & Related papers  (2026-05-30T21:22:47Z)
• ImmigrationQA: A Source-Grounded Dataset and Small-Model Adaptation for U.S. Immigration Law [0.0]
  We describe the construction of ImmigrationQA, a source-grounded question-answering dataset of 17,058 pairs.<n>The corpus was assembled from 11 primary and secondary sources.<n>The fine-tuned model was evaluated against a held-out split of 993 pairs.
  arXiv  Detail & Related papers  (2026-05-28T21:36:18Z)
• Citation-Closure Retrieval and Per-Rule Attribution for Real-World Regulatory Compliance Question Answering [54.97384993676565]
  We formalize Regulatory Compliance QA with RegOps-Bench, a novel benchmark featuring an Operational Knowledge Graph derived from complex national R&D regulations.<n>RefWalk traverses cross-document citations, fuses multi-view candidates via max-based aggregation, and enforces per-rule attribution to explicitly map claims to sources.
  arXiv  Detail & Related papers  (2026-05-28T10:38:38Z)
• Can LLMs Time Travel? Enhancing Temporal Consistency in Legal Agentic Search through Reinforcement Learning [45.13302016493955]
  Law must match the temporal context of each case, as retroactive application of statutes violates core legal principles and leads to erroneous conclusions.<n>Our observations reveal that current legal LLMs suffer from temporal bias anchored to their training cutoff, while search agents rarely incorporate temporal constraints into queries.<n>We propose LegalSearch-R1, an end-to-end reinforcement learning framework that pairs local statute RAG for precise article matching with online web search for broader legal knowledge, trained on temporally-indexed data spanning multiple amendment periods to enforce temporal consistency.
  arXiv  Detail & Related papers  (2026-05-25T14:57:13Z)
• Temporal Decay of Co-Citation Predictability: A 20-Year Statute Retrieval Benchmark from 396M Ukrainian Court Citations [0.0]
  Co-citation structure is widely assumed to provide stable retrieval signal in legal information systems.<n>We test this assumption longitudinally by constructing UA-StatuteRetrieval, a benchmark that measures co-citation predictability across 20 annual snapshots.<n>We find that Adamic-Adar MRR declines 33% on a fixed set of articles and 47% under a train/test temporal split confirming genuine temporal decay.
  arXiv  Detail & Related papers  (2026-05-17T20:15:37Z)
• Accurate Legal Reasoning at Scale: Neuro-Symbolic Offloading and Structural Auditability for Robust Legal Adjudication [0.0]
  Legal texts often contain computational legal clauses, whose understanding requires complex logic.<n>We propose Amortized Intelligence, a neuro-symbolic approach where we use an LLM once to translate a legal text into Deterministic Autonomous Contract Language.<n>Our DACL-based Agent achieves near-perfect consistency and mitigates the "reasoning cliff" observed in probabilistic models.
  arXiv  Detail & Related papers  (2026-05-04T11:13:59Z)
• Towards Intelligent Legal Document Analysis: CNN-Driven Classification of Case Law Texts [1.3192560874022086]
  This work presents a lightweight yet high-accuracy framework for citation-treatment classification.<n>It pairs lemmatisation-based preprocessing with subword-aware FastText embeddings and a one-dimensional Convolutional Neural Network (CNN)<n>The proposed system achieves 97.26% classification accuracy and a macro F1-score of 96.82%, surpassing established baselines.
  arXiv  Detail & Related papers  (2026-04-20T00:14:11Z)
• LAMUS: A Large-Scale Corpus for Legal Argument Mining from U.S. Caselaw using LLMs [0.5830619388189558]
  This paper introduces LAMUS, a sentence-level legal argument mining corpus constructed from U.S. Supreme Court decisions and Texas criminal appellate opinions.<n>The dataset is created using a data-centric pipeline that combines large-scale case collection, automatic annotation, and targeted human-in-the-loop quality refinement.
  arXiv  Detail & Related papers  (2026-03-09T12:01:42Z)
• LegalOne: A Family of Foundation Models for Reliable Legal Reasoning [54.57434222018289]
  We present LegalOne, a family of foundational models specifically tailored for the Chinese legal domain.<n>LegalOne is developed through a comprehensive three-phase pipeline designed to master legal reasoning.<n>We publicly release the LegalOne weights and the LegalKit evaluation framework to advance the field of Legal AI.
  arXiv  Detail & Related papers  (2026-01-31T10:18:32Z)
• Relative Scaling Laws for LLMs [91.73497548097775]
  Scaling laws describe how language models improve with additional data, parameters, and compute.<n>We introduce relative scaling laws, which track how performance gaps between test distributions evolve with scale.<n>These results show that although scaling improves overall performance, it is not a universal equalizer.
  arXiv  Detail & Related papers  (2025-10-28T16:55:22Z)
• Unilaw-R1: A Large Language Model for Legal Reasoning with Reinforcement Learning and Iterative Inference [15.567885200167913]
  We introduce Unilaw-R1, a large language model tailored for legal reasoning.<n>With a lightweight 7-billion parameter scale, Unilaw-R1 significantly reduces deployment cost.<n>It tackles three core challenges in the legal domain: insufficient legal knowledge, unreliable reasoning logic, and weak business generalization.
  arXiv  Detail & Related papers  (2025-10-11T07:17:22Z)
• AI for Statutory Simplification: A Comprehensive State Legal Corpus and Labor Benchmark [5.268588811689132]
  One U.S. state has claimed to eliminate one third of its state code using AI.<n>We introduce LaborBench, a benchmark dataset to evaluate AI capabilities in this domain.
  arXiv  Detail & Related papers  (2025-08-26T18:53:39Z)
• AppealCase: A Dataset and Benchmark for Civil Case Appeal Scenarios [47.83822985839837]
  We present the AppealCase dataset, consisting of 10,000 pairs of real-world, matched first-instance and second-instance documents across 91 categories of civil cases.<n>The dataset also includes detailed annotations along five dimensions central to appellate review: judgment reversals, reversal reasons, cited legal provisions, claim-level decisions, and whether there is new information in the second instance.<n> Experimental results reveal that all current models achieve less than 50% F1 scores on the judgment reversal prediction task, highlighting the complexity and challenge of the appeal scenario.
  arXiv  Detail & Related papers  (2025-05-22T10:50:33Z)
• Evaluating Test-Time Scaling LLMs for Legal Reasoning: OpenAI o1, DeepSeek-R1, and Beyond [44.16387138987627]
  We evaluate 12 large language models (LLMs) across 17 Chinese and English legal tasks.<n>We develop Legal-R1, an open-source model specialized for the legal domain.<n>DeepSeek-R1 exhibits clear advantages in Chinese legal reasoning, while OpenAI's o1 achieves comparable results on English tasks.
  arXiv  Detail & Related papers  (2025-03-20T11:14:39Z)
• CopyrightShield: Enhancing Diffusion Model Security against Copyright Infringement Attacks [61.06621533874629]
  Diffusion models are vulnerable to copyright infringement attacks, where attackers inject strategically modified non-infringing images into the training set.<n>We first propose a defense framework, CopyrightShield, to defend against the above attack.<n> Experimental results demonstrate that CopyrightShield significantly improves poisoned sample detection performance across two attack scenarios.
  arXiv  Detail & Related papers  (2024-12-02T14:19:44Z)
• CLERC: A Dataset for Legal Case Retrieval and Retrieval-Augmented Analysis Generation [44.67578050648625]
  We transform a large open-source legal corpus into a dataset supporting information retrieval (IR) and retrieval-augmented generation (RAG) This dataset CLERC is constructed for training and evaluating models on their ability to (1) find corresponding citations for a given piece of legal analysis and to (2) compile the text of these citations into a cogent analysis that supports a reasoning goal.
  arXiv  Detail & Related papers  (2024-06-24T23:57:57Z)
• Exploring Graph Neural Networks for Indian Legal Judgment Prediction [39.0233340304095]
  This research paper centres on developing a graph neural network-based model to address the Legal Judgment Prediction (LJP) problem. We explore various embeddings as model features, while nodes such as time nodes and judicial acts were added and pruned to evaluate the model's performance. A link prediction task is also conducted to assess the model's proficiency in anticipating connections between two specified nodes.
  arXiv  Detail & Related papers  (2023-10-19T14:55:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.