Skip to content

Research1 min read

SciLitBench: Benchmark and Design Principles for LLM-Powered Systematic Literature Reviews

arXiv:2609.05505v1 Announce Type: new Abstract: Systematic reviews require sustained human judgment across thousands of records, yet existing evaluations of large language models (LLMs) typically examine review stages in isolation. We in...

By OpenSmartRoute editorial · attributed excerpt

From arXiv cs.AI

arXiv:2609.05505v1 Announce Type: new Abstract: Systematic reviews require sustained human judgment across thousands of records, yet existing evaluations of large language models (LLMs) typically examine review stages in isolation. We introduce SciLitBench, a multi-stage benchmark spanning title and abstract screening, full-text screening, and schema-guided data extraction, with 42,981 retrieved records, 1,012 full texts, and annotations for 888 included papers. Across 22 open-weight LLMs from six model families, explicit inclusion and exclusion criteria improve title and abstract screening $F_2$ by 28.8%, while researcher-authored rationales improve full-text screening by 15%. Data extraction reveals a different reliability regime: performance declines from 0.97 accuracy for publication year to 0.37 Jaccard overlap for computational approach, while the strongest models recover only 30% of annotated evaluation evidence and 25% of limitations. SciLitBench identifies a practical boundary between high-recall screening and evidence-complete extraction and provides a reproducible resource for evaluating LLM-assisted evidence synthesis.

Read the original at arXiv cs.AI: SciLitBench: Benchmark and Design Principles for LLM-Powered Systematic Literature Reviews

Source: https://arxiv.org/abs/2609.05505

Published Sep 9, 2026 · updated Sep 9, 2026 · 164 words

This post is an attributed excerpt of the source above (unusable model output); no model rewrote it. Refer to the source for the authoritative text.

Keep reading

Related posts

More in Research

Research1 min read

Deep belief networks are exact

arXiv:2609.05572v1 Announce Type: new Abstract: We prove that every strictly positive probability distribution on \(\{-1,1\}^n\) is represented exactly by a sigmoid belief network with finite parameters. This answers a question of Sutske...

Research1 min read

ARC-Bench: Evaluating Action Ranking in Frozen JEPA World Models

ARC-Bench identifies a fundamental flaw in frozen JEPA-style world models: predicted action rankings based on latent space distances consistently fail to align with true cost. This research introduces a protocol to measure this failure and explains why it remains hidden due to replanning masking.