Pith. sign in

REVIEW 4 major objections 5 minor 39 references

A Comprehensive Framework for Reliable Legal AI: Combining Specialized Expert Systems and Adaptive Refinement

T0 review · 4 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A four-part legal AI framework claims to beat GPT-4 on nine legal tasks.

desk verdict Central empirical claim unsupported: no results for the integrated system, no numerical tables, and a formal inconsistency between similarity formulas. read the letter →

arxiv 2412.20468 v2 pith:PS7WZRAA submitted 2024-12-29 cs.AI cs.CY

Sidra Nasir , Qamar Abbas , Samita Bai , Rizwan Ahmed Khan This is my paper · ORCID
classification cs.AIcs.CY
keywords legalAIhallucinationreductionretrieval-augmentedgenerationknowledgegraphsmixtureofexpertsreinforcementlearningfromhumanfeedbackquestionansweringdomain-specificLLM
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proposes a legal AI system that layers retrieval-augmented generation, knowledge graphs, a mixture of specialized legal experts, and reinforcement learning from human feedback into one pipeline. The central claim is that this combination grounds answers in verified legal sources and routes each query to the right specialist, reducing the hallucinations that make general-purpose language models unreliable in law. On evaluations across nine legal tasks—question answering, document summarization, case analysis, contract drafting, classification, and judgment prediction—the authors report that their system outperforms general-purpose models including GPT-4 and LLaMA-3. If the claim holds, the framework would make AI legal assistance more dependable and more affordable at scale.

What carries the argument

The load-bearing mechanism is the sparse Mixture-of-Experts routing network: a gating network computes a softmax distribution over specialized legal experts, activates only the top-K, and aggregates their weighted outputs into the generator's context (Eqs. 8–13). Around that core, the RAG module uses cosine similarity with an empirically tuned threshold between 0.8 and 0.9, augmented by a knowledge-graph similarity term balanced by a parameter α (Eqs. 6–7), and the RLHF loop applies Proximal Policy Optimization to update the model from weighted human feedback signals (Eqs. 17–18).

What would settle it

Re-run the nine tasks in Table 1 using matched training and test splits and the same evaluation metrics; if the full system does not beat GPT-4 and LLaMA-3 on LegalQA question answering, document summarization, and case analysis, the paper's central claim of outperforming existing AI models would fail.

Watch

Extended reading notes

Core claim

The paper's central discovery is that the reliability of legal AI does not come from any single technique but from the coordination of four: a sparse mixture-of-experts network that routes each query to the top-K specialized legal modules, a retrieval-augmented generator whose similarity search is enriched with knowledge-graph relations between legal entities, a structured human-in-the-loop workflow that mirrors law-firm practice, and a reinforcement-learning step that updates the system from expert feedback. The authors assert that this coordinated architecture yields higher accuracy, lower abstention rates, and stronger performance on structured tasks like element extraction and text classification, while also improving unstructured reasoning tasks such as judgment prediction and summarization.

Load-bearing premise

The reported performance gains rest on the unstated assumption that the evaluation shown in Figures 4 and 5 was fair—identical datasets, splits, and scoring for every model, with no selective reporting.

Editorial extensions

If this is right

  • Legal question-answering systems built on this framework could ground their outputs in retrieved sources and abstain when confidence is low, reducing the risk of fabricated legal advice.
  • The modular expert design means a new legal sub-domain can be added by fine-tuning and inserting one more specialist module, without retraining the entire system.
  • The human-feedback loop makes the system continuously adaptable to updated statutes and firm-specific preferences, keeping outputs aligned with current legal practice.
  • If the reported gains hold, the framework provides a template for combining retrieval, structured knowledge, and expert routing in other high-stakes professional domains.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An ablation study that runs each component alone (RAG-only, KG-only, MoE-only) on the same nine tasks would reveal whether the claimed improvement is truly synergistic or carried by a single module; this is not reported in the paper.
  • The paper's abstention-rate metric could become a standard reliability signal for legal AI evaluation, since general-purpose benchmarks typically ignore a model's willingness to withhold an answer.
  • The same four-part architecture could be transferred to other domains where hallucinated output is costly, such as medical advice or financial compliance, though the paper does not test those settings.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes a framework for reliable legal AI that combines Retrieval-Augmented Generation (RAG), Knowledge Graphs (KG), a Mixture of Experts (MoE) architecture, and Reinforcement Learning from Human Feedback (RLHF), embedded in a multi-agent collaboration workflow. The authors claim the system achieves significant improvements over existing LLMs such as GPT-4, LLaMA-3, and Flan-T5 across nine legal tasks. The methodology describes the modules and key equations, and the results section presents narrative descriptions of component-level ablations and model/role comparisons. The paper concludes that the empirical evaluation demonstrates the system's superiority, but no numerical tables, error bars, or a full-system evaluation are provided.

Significance. If the claimed improvements were substantiated with a rigorous and reproducible evaluation, the framework would be of interest to the legal NLP community, particularly for reducing hallucinations in legal question answering, summarization, and case analysis. The architecture description is reasonably detailed and the literature review is broad. However, as submitted, the central empirical claim is entirely unsupported by the reported results, and the paper provides no machine-checked proofs, code, or data. The contribution is therefore not established at the level required for a scientific publication.

major comments (4)
  1. [Section 4 and Section 5] The central claim that the integrated system outperforms existing models is not supported by the reported results. Section 4 reports only component-level comparisons: baseline vs SFT-LoRA (Fig. 4a), RAG vs KG (Fig. 4b), RLHF vs KG (Fig. 4c), and model/role comparisons. No figure or table reports the performance of the complete system formed by RAG+KG+MoE+RLHF. In particular, the Mixture-of-Experts component introduced in Section 3.4 is never evaluated in the Results. Therefore the Conclusion's statement that 'the empirical evaluation across nine distinct legal tasks demonstrates that our system outperforms existing AI models' does not follow from the evidence presented.
  2. [Section 4] The evaluation is reported without any numerical tables, error bars, dataset splits, or statistical significance tests. The text gives approximate percentages (e.g., 'LLAMA-3's performance escalates from approximately 40% in the baseline to 60% post fine-tuning') but does not state the number of runs, variance, or the exact evaluation protocol. Since the paper's central claim is empirical, the absence of these details makes the results unrestatable and unverifiable. At minimum, the authors should report the numeric scores for all models and tasks, with confidence intervals and significance tests.
  3. [Section 3.3] The retrieval threshold θ is described as 'empirically tuned based on legal document validation' and α is 'typically set to 0.5', but the paper provides no details of the validation procedure, the search range, or whether the tuning used held-out data. If θ and α were tuned on the evaluation data, the reported performance would be circular. The choice of β in Eq. (7) is also unspecified. These parameters are load-bearing for the retrieval and generation quality, so the paper must describe how they are selected and show sensitivity analyses.
  4. [Section 3.4] The MoE gating network in Eq. (10) is presented as trainable, but the paper does not describe how it is trained (e.g., loss function, training data, or whether it is jointly trained with the experts). No experiment isolates the effect of the MoE component, so there is no evidence that the gating network functions as intended or contributes to the claimed improvements. A proper evaluation should include an ablation with and without the MoE module.
minor comments (5)
  1. [Section 4] Figure numbering is inconsistent: the text refers to 'Figure 4 (a)-(c)' for the bar charts, but the caption reads 'Figure 2'; the radar chart is 'Figure 3' in the text and the task-wise comparison is 'Figure 4'. The authors should renumber all figures consistently and ensure in-text references match the captions.
  2. [Section 3.3] Equations (6) and (7) define two different similarity functions sim(x,d) without explaining which one is used in the system. Eq. (6) uses α in the denominator while Eq. (7) uses β as a weighted sum; the relationship between the two formulations is unclear and should be clarified.
  3. [Section 3.3] The sentence 'Legal texts tend to be verbose, and high θvalues help maintain precision, crucial for high-stakes applications.:' contains a typo (extra colon and missing space).
  4. [Section 3.1] The paper says that when multiple datasets were available, the most recent version was chosen, but no version numbers or access dates are provided for any dataset, making the configuration non-reproducible.
  5. [Table 1] In Table 1, the Size column for SARA & LexGlue reads '867 questions, 768 statutes', but it is unclear whether these numbers refer to one dataset or both, and the Metric column lists multiple metrics without mapping them to specific tasks.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the reported superiority claim is empirically asserted and unsupported by the evidence given, not forced by construction or by self-citation.

full rationale

Walking the claimed derivation chain: the only fitted quantities are the retrieval threshold theta (Section 3.3, 'empirically tuned based on legal document validation') and the blending weights alpha=0.5 and beta in Eq. 7; these are ordinary hyperparameters and no equation defines the reported task accuracies as a function of them, so the performance claims do not reduce to the fit by construction. The KG/RAG/MoE/RLHF components are described compositionally (Eqs. 1-18), but none of the equations presuppose the conclusion that the integrated system outperforms GPT-4 or LLaMA-3; that conclusion is an empirical claim. The only self-citation, ref [5], supports a background ethics statement and carries no load in the derivation. The serious defect in Section 4 is evidentiary, not circular: the results are prose descriptions of Figures 2-5 with no numerical tables, error bars, dataset splits, or significance tests, and the MoE component never appears in the reported ablations, so the headline claim is unsupported as written. Unsupported empirical claims are a correctness/reporting risk, not a circularity of the kind reducible to inputs, and no load-bearing step is definitionally or citationally forced.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

The framework depends on several unstated capabilities: that the chosen embedding and knowledge graph are reliable, that a gating network can be trained to route legal queries correctly, and that the evaluation environment produced valid numbers. The threshold theta and weights alpha, beta are free parameters tuned or fixed by hand, adding to the burden of proof.

free parameters (3)
  • theta (similarity threshold) = 0.8 to 0.9
    Section 3.3: empirically tuned based on legal document validation; directly controls which documents enter D and thus affects all downstream metrics.
  • alpha (KG contribution weight) = 0.5
    Section 3.3.1: 'typically set to 0.5'; balances KG relational similarity against text similarity in Eq 6, influencing retrieval.
  • beta (text vs KG similarity weight) = not specified
    Eq 7 introduces beta to trade off simtext and simKG, but the paper never gives a value or estimation procedure, leaving the final similarity measure underdetermined.
assumptions (3)
  • domain assumption LegalBERT embeddings are a valid similarity basis for legal documents.
    Section 3.3 assumes f=LegalBERT yields vector representations that make cosine similarity meaningful for legal texts, without evidence on this dataset mix.
  • domain assumption The constructed knowledge graph triplets are accurate and complete.
    Section 3.3.1 assumes NER, relation extraction, and coreference resolution produce a reliable KG; no evaluation of KG construction is provided.
  • ad hoc to paper The gating network can be trained to route queries to appropriate experts.
    Section 3.4 assumes a trained gating network (Eqs 8-10) exists and is effective, but no training procedure, data, or validation is described, making this a postulated capability.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Comprehensive Framework for Reliable Legal AI: Combining Specialized Expert Systems and Adaptive Refinement." pith.science (2026). https://pith.science/paper/PS7WZRAA

@misc{pith2026241220468,
  author       = {Pith},
  title        = {Pith review of: A Comprehensive Framework for Reliable Legal AI: Combining Specialized Expert Systems and Adaptive Refinement},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PS7WZRAA}},
  note         = {Machine review of arXiv:2412.20468}
}
read the original abstract

This article discusses the evolving role of artificial intelligence (AI) in the legal profession, focusing on its potential to streamline tasks such as document review, research, and contract drafting. However, challenges persist, particularly the occurrence of "hallucinations" in AI models, where they generate inaccurate or misleading information, undermining their reliability in legal contexts. To address this, the article proposes a novel framework combining a mixture of expert systems with a knowledge-based architecture to improve the precision and contextual relevance of AI-driven legal services. This framework utilizes specialized modules, each focusing on specific legal areas, and incorporates structured operational guidelines to enhance decision-making. Additionally, it leverages advanced AI techniques like Retrieval-Augmented Generation (RAG), Knowledge Graphs (KG), and Reinforcement Learning from Human Feedback (RLHF) to improve the system's accuracy. The proposed approach demonstrates significant improvements over existing AI models, showcasing enhanced performance in legal tasks and offering a scalable solution to provide more accessible and affordable legal services. The article also outlines the methodology, system architecture, and promising directions for future research in AI applications for the legal sector.

Figures

Figures reproduced from arXiv: 2412.20468 by the authors.

Figure 1
Figure 1. A comprehensive AI-assisted legal system integrating Retrieval-Augmented Generation [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Comparative Analysis of Model Enhancements ((a) Baseline vs SFT(LoRA), (b)RAG vs KG [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Performance comparison of various language models across nine legal tasks based on absten [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Task-Wise Performance Comparison of Different Models Across Legal Applications. [PITH_FULL_IMAGE:figures/full_fig_p012_4.png]
Figure 5
Figure 5. Figure 5: Role-Based Task Performance Evaluation Across Expert Roles (Consultant, Researcher, [PITH_FULL_IMAGE:figures/full_fig_p013_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

39 extracted references · 17 canonical work pages

  1. [1]

    A short survey of viewing large language models in legal aspect,

    Z. Sun, “A short survey of viewing large language models in legal aspect,” arXiv preprint arXiv:2303.09136, 2023

    arXiv 2023

  2. [2]

    To what extent have llms reshaped the legal domain so far? a scoping literature review,

    B. Padiu, R. Iacob, T. Rebedea, and M. Dascalu, “To what extent have llms reshaped the legal domain so far? a scoping literature review,” Information, vol. 15, no. 11, p. 662, 2024

    2024

  3. [3]

    Hallucination-free? assessing the reliability of leading ai legal research tools,

    V. Magesh, F. Surani, M. Dahl, M. Suzgun, C. D. Manning, and D. E. Ho, “Hallucination-free? assessing the reliability of leading ai legal research tools,” arXiv preprint arXiv:2405.20362 , 2024

    arXiv 2024

  4. [4]

    Cbr-rag: case-based reasoning for retrieval augmented generation in llms for legal question answering,

    N. Wiratunga, R. Abeyratne, L. Jayawardena, K. Martin, S. Massie, I. Nkisi-Orji, R. Weerasinghe, A. Liret, and B. Fleisch, “Cbr-rag: case-based reasoning for retrieval augmented generation in llms for legal question answering,” in International Conference on Case-Based Reasoning, pp. 445–460, Springer, 2024

    work page 2024

  5. [5]

    Ethical framework for harnessing the power of ai in healthcare and beyond,

    S. Nasir, R. A. Khan, and S. Bai, “Ethical framework for harnessing the power of ai in healthcare and beyond,” IEEE Access, vol. 12, pp. 31014–31035, 2024

    work page 2024

  6. [6]

    A survey of hallucination in large foundation models,

    V. Rawte, A. Sheth, and A. Das, “A survey of hallucination in large foundation models,” arXiv preprint arXiv:2309.05922, 2023

    arXiv 2023

  7. [7]

    Large language models in law: A survey,

    J. Lai, W. Gan, J. Wu, Z. Qi, and S. Y. Philip, “Large language models in law: A survey,” AI Open, 2024

    work page 2024

  8. [8]

    Language models are few-shot learners,

    T. B. Brown, “Language models are few-shot learners,” arXiv preprint arXiv:2005.14165 , 2020

    arXiv 2005

Show all 39 references
  1. [9]

    Gpt-4 technical report,

    J. Achiam, S. Adler, S. Agarwal, L. Ahmad, I. Akkaya, F. L. Aleman, D. Almeida, J. Altenschmidt, S. Altman, S. Anadkat, et al. , “Gpt-4 technical report,” arXiv preprint arXiv:2303.08774 , 2023

    2023 arXiv

  2. [10]

    Customizing contextualized language models for legal document reviews,

    S. Shaghaghian, L. Y. Feng, B. Jafarpour, and N. Pogrebnyakov, “Customizing contextualized language models for legal document reviews,” in 2020 IEEE International Conference on Big Data (Big Data) , pp. 2139–2148, IEEE, 2020

    2020

  3. [11]

    Legal-bert: The muppets straight out of law school,

    I. Chalkidis, M. Fergadiotis, P. Malakasiotis, N. Aletras, and I. Androutsopoulos, “Legal-bert: The muppets straight out of law school,” arXiv preprint arXiv:2010.02559 , 2020

    2010 arXiv

  4. [12]

    Fingpt: Open-source financial large language models,

    H. Yang, X.-Y. Liu, and C. D. Wang, “Fingpt: Open-source financial large language models,” arXiv preprint arXiv:2306.06031 , 2023

    2023

  5. [13]

    Medical reports summarization using text-to-text transformer,

    A. Helwan, D. Azar, and D. U. Ozsahin, “Medical reports summarization using text-to-text transformer,” in 2023 Advances in Science and Engineering Technology International Conferences (ASET), pp. 01–04, IEEE, 2023

    2023

  6. [14]

    Disc-lawllm: Fine-tuning large language models for intelligent legal services,

    S. Yue, W. Chen, S. Wang, B. Li, C. Shen, S. Liu, Y. Zhou, Y. Xiao, S. Yun, W. Lin, et al. , “Disc-lawllm: Fine-tuning large language models for intelligent legal services,” arXiv preprint arXiv:2309.11325, 2023

    2023 arXiv

  7. [15]

    Chatlaw: Open-source legal large language model with integrated external knowledge bases,

    J. Cui, Z. Li, Y. Yan, B. Chen, and L. Yuan, “Chatlaw: Open-source legal large language model with integrated external knowledge bases,” arXiv preprint arXiv:2306.16092 , 2023. 14

    2023 arXiv

  8. [16]

    Lora: Low-rank adaptation of large language models,

    E. J. Hu, Y. Shen, P. Wallis, Z. Allen-Zhu, Y. Li, S. Wang, L. Wang, and W. Chen, “Lora: Low-rank adaptation of large language models,” arXiv preprint arXiv:2106.09685 , 2021

    2021 arXiv

  9. [17]

    Lexgpt 0.1: pre-trained gpt-j models with pile of law,

    J.-S. Lee, “Lexgpt 0.1: pre-trained gpt-j models with pile of law,” arXiv preprint arXiv:2306.05431, 2023

    2023 arXiv

  10. [18]

    Pile of law: Learning responsible data filtering from the law and a 256gb open-source legal dataset,

    P. Henderson, M. Krass, L. Zheng, N. Guha, C. D. Manning, D. Jurafsky, and D. Ho, “Pile of law: Learning responsible data filtering from the law and a 256gb open-source legal dataset,” Advances in Neural Information Processing Systems , vol. 35, pp. 29217–29234, 2022

    2022

  11. [19]

    Legal prompting: Teaching a language model to think like a lawyer,

    F. Yu, L. Quartey, and F. Schilder, “Legal prompting: Teaching a language model to think like a lawyer,” arXiv preprint arXiv:2212.01326 , 2022

    2022 arXiv

  12. [20]

    Can gpt-3 perform statutory reasoning?,

    A. Blair-Stanek, N. Holzenberger, and B. Van Durme, “Can gpt-3 perform statutory reasoning?,” arXiv preprint arXiv:2302.06100 , 2023

    2023 arXiv

  13. [21]

    A dataset for statutory reasoning in tax law entailment and question answering,

    N. Holzenberger, A. Blair-Stanek, and B. Van Durme, “A dataset for statutory reasoning in tax law entailment and question answering,” arXiv preprint arXiv:2005.05257 , 2020

    2005 arXiv

  14. [22]

    Tacticalgpt: Uncovering the potential of llms for predicting tactical decisions in professional football,

    M. Caron and O. M¨ uller, “Tacticalgpt: Uncovering the potential of llms for predicting tactical decisions in professional football,” in StatsBomb, 2023

    2023

  15. [23]

    Retrieval-augmented generation for knowledge-intensive nlp tasks,

    P. Lewis, E. Perez, A. Piktus, F. Petroni, V. Karpukhin, N. Goyal, H. K¨ uttler, M. Lewis, W.-t. Yih, T. Rockt¨ aschel,et al. , “Retrieval-augmented generation for knowledge-intensive nlp tasks,” Advances in Neural Information Processing Systems , vol. 33, pp. 9459–9474, 2020

    2020

  16. [24]

    Simple is effective: The roles of graphs and large language models in knowledge-graph-based retrieval-augmented generation,

    M. Li, S. Miao, and P. Li, “Simple is effective: The roles of graphs and large language models in knowledge-graph-based retrieval-augmented generation,” arXiv preprint arXiv:2410.20724 , 2024

    2024 arXiv

  17. [25]

    Openagi: When llm meets domain experts,

    Y. Ge, W. Hua, K. Mei, J. Tan, S. Xu, Z. Li, Y. Zhang, et al., “Openagi: When llm meets domain experts,” Advances in Neural Information Processing Systems , vol. 36, 2024

    2024

  18. [26]

    Deep reinforcement learning from human preferences,

    P. F. Christiano, J. Leike, T. Brown, M. Martic, S. Legg, and D. Amodei, “Deep reinforcement learning from human preferences,” Advances in neural information processing systems , vol. 30, 2017

    2017

  19. [27]

    Answer retrieval in legal community question answering,

    A. Askari, Z. Yang, Z. Ren, and S. Verberne, “Answer retrieval in legal community question answering,” in European Conference on Information Retrieval , pp. 477–485, Springer, 2024

    2024

  20. [28]

    When does pretraining help? assessing self-supervised learning for law and the casehold dataset of 53,000+ legal holdings,

    L. Zheng, N. Guha, B. R. Anderson, P. Henderson, and D. E. Ho, “When does pretraining help? assessing self-supervised learning for law and the casehold dataset of 53,000+ legal holdings,” in Proceedings of the eighteenth international conference on artificial intelligence and ...

    2021

  21. [29]

    Ledgar: A large-scale multi-label cor- pus for text classification of legal provisions in contracts,

    D. Tuggener, P. Von D¨ aniken, T. Peetz, and M. Cieliebak, “Ledgar: A large-scale multi-label cor- pus for text classification of legal provisions in contracts,” in Proceedings of the Twelfth Language Resources and Evaluation Conference, pp. 1235–1241, 2020

    2020

  22. [30]

    Gpt-4 passes the bar exam,

    D. M. Katz, M. J. Bommarito, S. Gao, and P. Arredondo, “Gpt-4 passes the bar exam,” Philo- sophical Transactions of the Royal Society A , vol. 382, no. 2270, p. 20230254, 2024

    2024

  23. [31]

    Summary of the compe- tition on legal information, extraction/entailment (coliee) 2023,

    R. Goebel, Y. Kano, M.-Y. Kim, J. Rabelo, K. Satoh, and M. Yoshioka, “Summary of the compe- tition on legal information, extraction/entailment (coliee) 2023,” in Proceedings of the Nineteenth International Conference on Artificial Intelligence and Law , pp. 472–480, 2023

    2023

  24. [32]

    Billsum: A corpus for automatic summarization of us legislation,

    A. Kornilova and V. Eidelman, “Billsum: A corpus for automatic summarization of us legislation,” arXiv preprint arXiv:1910.00523 , 2019

    1910 arXiv

  25. [33]

    Cuad: An expert-annotated nlp dataset for legal contract review,

    D. Hendrycks, C. Burns, A. Chen, and S. Ball, “Cuad: An expert-annotated nlp dataset for legal contract review,” arXiv preprint arXiv:2103.06268 , 2021. 15

    2021 arXiv

  26. [34]

    Super-scotus: A multi-sourced dataset for the supreme court of the us,

    B. Fang, T. Cohn, T. Baldwin, and L. Frermann, “Super-scotus: A multi-sourced dataset for the supreme court of the us,” in Proceedings of the Natural Legal Language Processing Workshop 2023, pp. 202–214, 2023

    2023

  27. [35]

    Eur-lex-sum: A multi-and cross-lingual dataset for long-form summarization in the legal domain,

    D. Aumiller, A. Chouhan, and M. Gertz, “Eur-lex-sum: A multi-and cross-lingual dataset for long-form summarization in the legal domain,” arXiv preprint arXiv:2210.13448 , 2022

    2022 arXiv

  28. [36]

    Neural legal judgment prediction in english,

    I. Chalkidis, I. Androutsopoulos, and N. Aletras, “Neural legal judgment prediction in english,” arXiv preprint arXiv:1906.02059 , 2019

    1906 arXiv

  29. [37]

    The llama 3 herd of models,

    A. Dubey, A. Jauhri, A. Pandey, A. Kadian, A. Al-Dahle, A. Letman, A. Mathur, A. Schelten, A. Yang, A. Fan, et al. , “The llama 3 herd of models,” arXiv preprint arXiv:2407.21783 , 2024

    2024 arXiv

  30. [38]

    Scaling instruction-finetuned language models,

    H. W. Chung, L. Hou, S. Longpre, B. Zoph, Y. Tay, W. Fedus, Y. Li, X. Wang, M. Dehghani, S. Brahma, et al., “Scaling instruction-finetuned language models,” Journal of Machine Learning Research, vol. 25, no. 70, pp. 1–53, 2024

    2024

  31. [39]

    Llama 2: Open foundation and fine-tuned chat models,

    H. Touvron, L. Martin, K. Stone, P. Albert, A. Almahairi, Y. Babaei, N. Bashlykov, S. Batra, P. Bhargava, S. Bhosale, et al. , “Llama 2: Open foundation and fine-tuned chat models,” arXiv preprint arXiv:2307.09288, 2023. 16

    2023 arXiv

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.