MétaCan
Menu
Back to cohort
Record W4416712105 · doi:10.48550/arxiv.2509.02558

Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM

2025· preprint· en· W4416712105 on OpenAlexfundno aff
Yijun Ge, Sahel Sharifymoghaddam, Jimmy Lin

Bibliographic record

VenueArXiv.org · 2025
Typepreprint
Languageen
FieldComputer Science
TopicInformation Retrieval and Search Behavior
Canadian institutionsnot available
FundersInstitute for Information and Communications Technology PromotionNatural Sciences and Engineering Research Council of CanadaMinistry of Science and ICT, South Korea
KeywordsBenchmark (surveying)Construct (python library)Range (aeronautics)Query expansionBaseline (sea)Search engineQuestion answering

Abstract

fetched live from OpenAlex

Retrieval benchmarks for large language models (LLMs) should reflect the long, reasoning-intensive queries typical of retrieval-augmented generation (RAG). We present a systematic study of BRIGHT, a reasoning-focused retrieval benchmark, along with strong, reproducible reference methods integrated into Anserini, Pyserini, and RankLLM. We evaluate lexical, sparse, dense, and fusion-based retrievers, as well as LLM rerankers, under long-query settings. In reproducing BRIGHT's lexical baseline, we identify a key under-documented detail: query-side BM25 (BM25Q), which applies BM25 weighting to the query itself. On long, multi-sentence queries, BM25Q consistently outperforms standard BM25, making it the strongest lexical baseline for reasoning-oriented retrieval. We further audit the BRIGHT corpus, uncovering data quality issues that impact evaluation, and offer mitigation. Finally, we study the generalizability of BM25Q across five additional benchmarks, finding its gains largely specific to BRIGHT, while fusion with standard BM25 provides the most consistent improvements across datasets.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.025
metaresearch head score (Gemma)0.088
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.025
Threshold uncertainty score0.132

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0250.088
Meta-epidemiology (narrow)0.0040.001
Meta-epidemiology (broad)0.0030.003
Bibliometrics0.0090.007
Science and technology studies0.0040.003
Scholarly communication0.0070.010
Open science0.0060.007
Research integrity0.0040.005
Insufficient payload (model declined to judge)0.0100.013

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.052
GPT teacher head0.293
Teacher spread0.241 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueArXiv.orgSame topicInformation Retrieval and Search BehaviorFrench-language works237,207