paper-with-me

Papers

AI Achieves a Perfect LSAT Score

2026-04-11 · Bonmu Ku arxiv

This paper reports the first documented instance of a language model achieving a perfect score on an officially disclosed Law School Admission Test (LSAT). Controlled experiments on eight reasoning models show that varying the prompt, shuffling answer choices, and sampling multiple responses have no meaningful effect as drivers of performance. Ablating the thinking phase that models generate before answering, however, lowers frontier accuracy by up to 8 percentage points, predominantly in logical reasoning. Distilled models produce full thinking traces in the same format yet plateau far below frontier performance. A pilot process reward model fine-tuned via QLoRA on official LSAT explanations narrows this gap through Best-of-5 selection, with gains again predominantly in logical reasoning. The gatekeeper of elite legal education since 1948, the LSAT has not merely been passed but answered without a single error by models that reason. The upper bound of the cognitive capacities it has tested is no longer exclusive to human cognition.

📄 PDF Abstract BibTeX arXiv:2604.10034

Code (0)

등록된 구현이 없습니다.

Tasks

Logical Reasoning

Similar Papers 제목 키워드 기반

ELAL: An Emotion Lexicon for the Analysis of Alsatian Theatre Plays

2022-06-01 · LREC 2022 6 · Delphine Bernhard, Pablo Ruiz Fabo

In this work, we present a novel and manually corrected emotion lexicon for the Alsatian dialects, including graphical variants of Alsatian lexical items. These High German dialects are spoken in the North-East of France…

Emotion Recognition

Target specific peptide design using latent space approximate trajectory collector

2023-02-02 · Tong Lin, Sijie Chen, Ruchira Basu, Dehu Pei 외

Despite the prevalence and many successes of deep learning applications in de novo molecular design, the problem of peptide generation targeting specific proteins remains unsolved. A main barrier for this is the scarcity…

NLocalSAT: Boosting Local Search with Solution Prediction

2020-01-26 · Wenjie Zhang, Zeyu Sun, Qihao Zhu, Ge Li 외

The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search (SLS). However, in this method, the init…

Prediction

Lightmorphic Signatures Analysis Toolkit

2022-12-31 · D. Damian

In this paper we discuss the theory used in the design of an open source lightmorphic signatures analysis toolkit (LSAT). In addition to providing a core functionality, the software package enables specific optimizations…

SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning

2024-11-04 · Gaspard Quenard, Damier Pellier, Humbert Fiorino

This paper presents SibylSat, a novel SAT-based method designed to efficiently solve totally-ordered HTN problems (TOHTN). In contrast to prevailing SAT-based HTN planners that employ a breadth-first search strategy, Sib…