Pith. sign in

REVIEW 2 cited by

TurtleBench: Evaluating Top Language Models via Real-World Yes/No Puzzles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.05262 v1 pith:HWR5NY4O submitted 2024-10-07 cs.CL

TurtleBench: Evaluating Top Language Models via Real-World Yes/No Puzzles

classification cs.CL
keywords modelsreasoningturtlebenchdynamicevaluationevaluationsguessesmodel
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

As the application of Large Language Models (LLMs) expands, the demand for reliable evaluations increases. Existing LLM evaluation benchmarks primarily rely on static datasets, making it challenging to assess model performance in dynamic interactions with users. Moreover, these benchmarks often depend on specific background knowledge, complicating the measurement of a model's logical reasoning capabilities. Other dynamic evaluation methods based on strong models or manual efforts may introduce biases and incur high costs and time demands, hindering large-scale application. To address these issues, we propose TurtleBench. TurtleBench collects real user guesses from our online Turtle Soup Puzzle platform that we developed. This approach allows for the relatively dynamic generation of evaluation datasets, mitigating the risk of model cheating while aligning assessments more closely with genuine user needs for reasoning capabilities, thus enhancing the reliability of evaluations. TurtleBench includes 1,532 user guesses along with the correctness of guesses after annotation. Using this dataset, we thoroughly evaluated nine of the most advanced LLMs available today. Notably, the OpenAI o1 series models did not achieve leading results in these evaluations. We propose several hypotheses for further research, such as "the latent reasoning of o1 utilizes trivial Chain-of-Thought (CoT) techniques" and "increasing CoT length not only provides reasoning benefits but also incurs noise costs."

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Agent's First Day: Benchmarking Learning, Exploration, and Scheduling in the Workplace Scenarios

    cs.AI 2026-01 conditional novelty 6.0

    Trainee-Bench evaluates LLM agents on scheduling, active exploration, and continual learning in randomized workplace scenarios; the best current model completes only 35% of tasks.

  2. Multistage Stochastic Programming for Rare Event Risk Mitigation in Power Systems Management

    math.OC 2026-03 unverdicted novelty 5.0

    Fleming–Viot-biased multistage scenario trees make power-system unit commitment robust to rare, prolonged renewable shortfalls without excessive cost.