<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>RAGScholar &amp; DBLP-QA: Explainable Retrieval Augmented Scientific QA on dblp with Source-Attributed Answers and a Benchmark Dataset</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Aditya Neekhra</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Markus Nilles</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ralf Schenkel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Trier University</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2026</year>
      </pub-date>
      <fpage>62</fpage>
      <lpage>70</lpage>
      <abstract>
        <p>Efective question answering (QA) over scientific literature is essential for accelerating research. However, existing benchmarks often fail to capture the complexity and domain-specific reasoning required. To address this gap, we introduce DBLP-QA, a benchmark dataset of 50 manually crafted question-answer pairs derived from the abstracts of scientific publications. It is designed to test both the retrieval and generation capabilities of large language models (LLMs) in scientific contexts. To demonstrate its utility, we evaluate RAGScholar, a retrieval-augmented generation (RAG) system that integrates external knowledge sources, and compare multiple retrieval and generation strategies. The dataset provides a robust foundation for advancing and objectively evaluating QA systems for scientific literature.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Retrieval-Augmented Generation</kwd>
        <kwd>Digital Libraries</kwd>
        <kwd>Benchmark Question Answer Pair Dataset</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>RQ1: How efectively does BM25 retrieve a publication whose abstract contains the correct answer?
RQ3: Does a two-step strategy, where concatenated answers from single abstracts serve as context,
improve final answer quality compared to using multiple retrieved abstracts directly?
RQ4: How does model choice afect performance under identical retrieval and context conditions?</p>
      <p>Our contributions are threefold: (1) DBLP-QA, a curated benchmark for abstract-based scholarly QA;
(2) RAGScholar, a system integrating BM25 retrieval with instruction-tuned LLMs; and (3) a systematic
evaluation of retrieval and context strategies across multiple models.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Scientific question answering has been studied through a variety of benchmarks that difer in domain
coverage and annotation depth. General-domain datasets such as SQuAD [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] helped establish large-scale
QA evaluation but do not match the conceptual density of scientific writing.
      </p>
      <p>
        Several datasets target QA over scholarly publications. Scientific QA datasets, including BioASQ [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],
PubMedQA [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], SciQ [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and CORD-19–based benchmarks like COVID-QA [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], have advanced
domainspecific QA, yet many rely on automatically generated questions or focus narrowly on biomedical
literature. QASPER [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] provides thousands of human-written questions grounded in full NLP papers,
while QASA [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] focuses on expert-authored, high-level questions requiring deep reasoning across
AI/ML articles. Other scientific QA resources, such as SciQA [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], SciDQA [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], or the automatically
generated SciQAG [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] ofer broader coverage but often include synthetic questions or multimodal
elements that difer from abstract-focused QA. Evaluation frameworks like ScholarQABench [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and
SciArena [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] assess literature-grounded responses from large models, but are not designed around
curated, abstract-level question-answer pairs.
      </p>
      <p>In contrast to these large, heterogeneous, or full-paper datasets, DBLP-QA provides a compact,
manually crafted benchmark grounded solely in scientific abstracts from computer science. This design
enables controlled assessment of retrieval-augmented generation systems, such as RAGScholar, under
well-defined and reproducible conditions.</p>
    </sec>
    <sec id="sec-3">
      <title>3. DBLP-QA Benchmark Dataset</title>
      <p>
        DBLP-QA is a novel benchmark dataset for scientific question answering that consists of 50 questions
and corresponding answers derived from research articles in the computer science domain. To construct
it, we used the dblp corpus dump from April 2025 [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] with 7.8 million publications and combined
it with the abstracts obtained from the Semantic Scholar dataset API1. This resulted in a collection
of 4.6 million publications with abstracts. To create the question-answer pairs, we randomly selected
50 among those publications and manually formulated a question that can be answered based on the
abstract. We manually extracted and reformulated the answer from the abstract, ensuring that it is 1-3
sentences long and aligns with the original abstract. As an example, from the abstract stating "Magnetic
resonance (MR) tagging is a technique for measuring heart deformations through creation of a stripe grid
pattern on cardiac images", we formulated the question "What is Magnetic resonance tagging?" and the
answer "Magnetic Resonance (MR) Tagging is a technique used to measure heart deformations by creating
a stripe grid pattern on cardiac images." The dataset is provided as a single CSV file 2 where each line
provides question, answer, and dblp key and semantic scholar id of the publication from which they
were derived.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. RAGScholar &amp; Experimental Setup</title>
      <p>This section presents the architecture, workflow, and experimental setup of RAGScholar, a
retrievalaugmented generation (RAG) system designed to answer questions in the domain of computer science.
By integrating the system description with the experimental methodology, we provide a concise and
coherent overview of the framework and its evaluation.</p>
      <sec id="sec-4-1">
        <title>4.1. System Overview</title>
        <p>RAGScholar consists of three main components: a retriever, a generator, and a web-based user interface
(Figure 1). Users submit questions through a single-page application, upon which the retriever identifies
1https://www.semanticscholar.org/product/api; note that the abstracts dataset from the corpus of April 2025 is currently
unavailable. The current abstracts dataset from January 20, 2026 does not include all the abstracts from the DBLP-QA dataset
due to copyright licensing restrictions, but they are still accessible through the web interface.
2https://seafile.rlp.net/f/6581519cdd1d4782bccc/
IR System
(Lucene BM25)
retrieve update</p>
        <p>Index
KEY, DOI
TITLE
AUTHOR
YEAR
ABSTRACT</p>
        <p>Query
+ Top-5
Documents</p>
        <p>LLM
- FLA-NT‑Tin5yL(LLaarMgeA, XXL)
- Phi 4
- Mistral</p>
        <p>Answers
+ Documents</p>
        <p>User Interface</p>
        <p>User Query
Answers + Documents</p>
        <p>A1 A2 A3 A4 A5
DoCTcooupnm-c3e.--nts ACTnoospwn-ce3.r--s DoCTcooupnm-c5e.--nts ACTnoospnw-ce5.r--s
relevant scientific publications from a pre-constructed Apache Lucene 3 index. The index is built from
the April 2025 dblp dump and contains, for each publication, the dblp key, DOI, title, year, author names,
and abstract. User queries are translated into Lucene search expressions over titles and abstracts, and
the retrieved publications are ranked using BM25. The top-ranked abstracts are provided as context
to the generator, a large language model that produces a natural-language answer. Depending on the
configuration, the generator uses either the top abstract, multiple individual abstracts, or concatenated
contexts derived from the top retrieved documents. The generated answer and the corresponding source
documents are presented to the user.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Retrieval Evaluation (RQ1)</title>
        <p>RQ1 evaluates whether BM25 reliably retrieves a publication containing the answer to a question of the
DBLQ-QA benchmark dataset. We use BM25 with default parameters (1 = 1.2,  = 2) and evaluate
performance via Recall@k and MRR@k.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Context Construction Strategies (RQ2 &amp; RQ3)</title>
        <p>RAGScholar employs nine context strategies, grouped into three categories: (1) Single-Document
Contexts (5 variants): The LLM receives the abstract of each of the Top-5 (A1, . . . , A5) retrieved documents
individually; (2) Concatenated Document Contexts (2 variants): Top-3 Concatenated Documents
and Top-5 Concatenated Documents, formed by concatenating the top-ranked abstracts; and (3)
Concatenated Answer Contexts (2 variants): Top-3 Concatenated Answers and Top-5 Concatenated
Answers, where intermediate answers for the Top-3 or Top-5 documents are concatenated and used as
context for generating a final answer.</p>
        <p>RQ2 compares strategies from the first and the second category to assess the efect of context size
and document aggregation. RQ3 compares strategies from the second and the third category to study
document- vs. answer-level aggregation.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Model Comparison (RQ4)</title>
        <p>To evaluate the influence of model scale and architecture, five instruction-tuned causal and
sequence-tosequence LLMs (0.78B–14.7B parameters) were tested under identical retrieval and context conditions.
All models used consistent generation settings (temperature 0.7, top- = 0.9, maximum output lengths
of 512–1024 tokens). Automatic precision and device selection were applied when supported. Table 1
shows the models evaluated and the parameters used.</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Evaluation Procedure</title>
        <p>For all 50 benchmark questions, we generated 2,500 answers (5 models × 10 context variants, including
a no-context baseline). Answers were manually rated against the ground-truth answer on a three-point
Generated Answer: Compres- Generated Answer:
Compressive sensing is a signal processing sive Sensing, also known as
Comtechnique that allows for the re- pressed Sensing (CS), is a
techconstruction of signals or images nique used in signal processing
from a small number of measure- and imaging that allows for the
ments, significantly fewer than detection and recovery of signals
what is typically required by the that are inherently sparse or
lowNyquist-Shannon sampling theo- rank, such as images or signals
rem. Explanation: Answered in with noise. Explanation: Related
the same way as Ground Truth An- to the Ground Truth Answer.
swer.</p>
        <p>Example (Score 0)
Generated Answer:
Compressive Sensing is a method used to
improve on what any nonadaptive
method can achieve in the context
of recursive bisection method. It
is a technique that establishes a
non-asymptotic lower bound that
applies to all methods, regardless
of their computational
complexity. Explanation: Unrelated to
Ground Truth Answer.</p>
        <p>
          Scale: 2 = correct and complete, 1 = correct but incomplete, 0 = incorrect or irrelevant. Table 2 contains
an example question-answer pair with generated answers and their manual scores. In addition, all
answers were evaluated against the ground-truth answers using ROUGE-L [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and BERTScore [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <sec id="sec-5-1">
        <title>5.1. Retrieval Performance (RQ1)</title>
        <p>The retriever ranked a document containing a correct answer at rank 1 for 44 out of the 50 benchmark
questions. In four questions, the document at rank 2 was the first document in the ranking to contain
a correct answer, and in two questions, the first document containing an answer was ranked third.
Consequently, the retriever achieved MRR@3 of 0.93 and Recall@3 of 1. We also examined the ranking
position of the document from which the question-answer pair was derived. For 32 questions, the
document was ranked at the top, for seven questions, it was ranked at two, for two questions, it was
ranked at three, and for one question, it was ranked at four. The document was not in the top 5 for five
questions.</p>
        <p>The following example shows a case where the top-ranking document was not relevant:
Question: What is CtRL-Sim?
Ground Truth Answer: CtRL-Sim is a method that leverages return-conditioned ofline reinforcement learning to
eficiently generate reactive and controllable trafic agents.</p>
        <p>Abstract of retrieved document at rank 1: . . . calibration transformer with line-classification (CtRL-C) . . . demonstrate
that CtRL-C outperforms . . .</p>
        <p>Comment: The retriever was misled by high-frequency mentions of the query keyword ctrl.
Mistral-7B
Phi-4
TinyLlama-1.1B
FLAN-T5-Large
FLAN-T5-XXL</p>
        <p>Mistral-7B</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Context Selection Strategies (RQ2)</title>
        <p>Context selection is a central design choice in retrieval-augmented QA because it determines the
evidence available to the model at generation time. We therefore evaluate Top- context concatenation
for  ∈ {3, 5}, where abstracts of the  top-ranked retrieved papers are merged into a single composite
context to increase coverage and reduce omissions due to ranking errors. The results in Table 3 show
that increasing  can improve human-perceived answer quality, but the gains are model-dependent: for
Mistral-7B, Top-5 context concatenation (Top-5-CD) achieves the best manual score (1.74) compared
to Top-3-CD (1.63), while Phi-4 remains stable at 1.66 for both Top-3-CD and Top-5-CD. In contrast,
TinyLlama-1.1B slightly drops from 1.58 (Top-3-CD) to 1.52 (Top-5-CD), suggesting that additional
context can introduce redundancy or noise beyond what smaller models can efectively use. Across
models, however, aggregated evidence is consistently beneficial relative to no context (e.g., Mistral-7B:
1.74 vs. 0.80; Phi-4: 1.66 vs. 0.40), highlighting the overall importance of context selection in balancing
coverage, noise accumulation, and explainability in scholarly QA. For single-document contexts, A1
achieves the best results compared to the other single-document variants. For TinyLlama, this variant
attains the highest overall score, and for the other models, the manual scores are only slightly lower
than those of the respective best-performing variant. Moreover, a slight correlation can be observed
between the manual evaluations and the automatic metrics BERTScore and ROUGE. This suggests that
these metrics could potentially be used for the automatic evaluation of generated answers for DBLP-QA,
although further research is required.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Answer Concatenation (RQ3)</title>
        <p>Answer concatenation leverages multiple retrieved documents. The model generates one answer per
document and then combines the  candidates for Top- ( ∈ {3, 5}). However, concatenating abstracts
before generation is consistently stronger in our results. In Table 3, Top-5 concatenated documents
(Top-5-CD) outperforms Top-5 concatenated answers (Top-5-CA) for the best models (Mistral-7B:
1.74 vs. 1.49; Phi-4: 1.66 vs. 1.51; TinyLlama-1.1B: 1.52 vs. 1.34), suggesting that direct exposure to
aggregated evidence yields more complete answers. Still, answer concatenation improves over no
context (e.g., Mistral-7B: 1.49 vs. 0.80; Phi-4: 1.51 vs. 0.40), indicating that output-level fusion remains
useful. Interestingly, TinyLlama attains higher ROUGE-L with Top-5-CA than Top-5-CD (0.30 vs. 0.23),
implying that answer fusion can increase surface overlap even when human judgments favor context
concatenation.</p>
      </sec>
      <sec id="sec-5-4">
        <title>5.4. LLM Comparison (RQ4)</title>
        <p>All models were evaluated under identical conditions, so diferences can be attributed primarily to
the LLMs. Table 3 shows clear separation: Mistral-7B performs best (Top-5-CD: 1.74), followed by
Phi-4 (up to 1.66) and TinyLlama-1.1B (up to 1.58), while FLAN-T5 variants are much lower (0.38-0.61
under Top-5-CD). Retrieved evidence consistently improves quality over no context (e.g., Mistral-7B:
0.80→1.74; Phi-4: 0.40→1.66), confirming retrieval conditioning as a key driver. Context size shows
a model-dependent coverage-noise trade-of: Mistral benefits from Top-5 vs. Top-3 (1.74 vs. 1.63),
Phi-4 is stable (1.66 for both), and TinyLlama slightly drops with Top-5 (1.58→1.52), indicating higher
sensitivity to redundancy. Overall, strong performance is achievable with eficient mid-sized models in
a reproducible pipeline, supporting scalable scholarly QA deployments.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion</title>
      <p>Limitations Despite the efectiveness of the framework, limitations remain. The system uses abstracts
rather than full texts, limiting fine-grained methodological questions. Retrieval is BM25-only, which
may miss semantically relevant evidence under paraphrasing without dense/hybrid methods. We also
evaluate only small and medium-sized LLMs due to compute constraints, although results are already
strong, highlighting the impact of retrieval and evidence packaging. Finally, DBLP-QA contains only 50
items from one domain, limiting generalizability.</p>
      <p>
        Future Work Several directions can extend this work. First, re-running the pipeline with larger
instruction-tuned, long-context models (e.g., 34B/70B) would allow to estimate the performance ceiling.
Second, retrieval could be strengthened via dense/hybrid methods by adding DPR [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] or ColBERT [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
alongside BM25 [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], using fusion (e.g., RRF/score fusion), and lightweight reranking (e.g., MonoT5 [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]);
FiD-style conditioning can further probe multi-document limits [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. Beyond retrieval,
sentence/spanlevel evidence and diversification (MMR [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]) can improve grounding and reduce redundancy, while
adaptive routing can enable low-latency single-document inference. Finally, expanding DBLP-QA
beyond 50 items, diversifying question types, and collecting multi-rater judgments would improve
reliability and generalizability across domains.
      </p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>In this work, we introduced DBLP-QA, a benchmark of 50 QA pairs derived from abstracts, and
RAGScholar, a retrieval-augmented QA system integrating BM25 retrieval and generative LLMs. The
evaluation provides several insights in the design of domain-specific RAG systems for bibliographic
corpora.</p>
      <p>BM25 retrieval is efective in our scholarly QA setting, achieving a Recall@1 of 0.88 and a perfect
Recall@3. Context construction is a crucial factor in determining the answer quality. Providing the
abstract of the top retrieved document as context to the LLM results in better answers compared to
the baseline scenario without context. Concatenating abstracts of the top-3 retrieved documents can
improve the quality of the answer, while concatenating five abstracts may lead to reduced quality due
to noise. A two-step context setting that first generates answers per retrieved document and then
concatenates them as context does not improve answer quality compared to directly concatenating
abstracts. Mid-sized LLMs perform well, while smaller models are more sensitive to context size and
noise, indicating that efective scholarly QA depends more on retrieval and context construction than
on large models.</p>
      <p>DBLP-QA and RAGScholar ofer a reproducible evaluation setup for studying retrieval-augmented
methods over scholarly corpora, with future work on extending the benchmark dataset, improving
retrieval and exploring automatic evaluation metrics.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>The author(s) have not employed any Generative AI tools.
and producing summaries, SIGIR Forum 51 (2017) 209–210. URL: https://doi.org/10.1145/3130348.
3130369. doi:10.1145/3130348.3130369.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Rajpurkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lopyrev</surname>
          </string-name>
          , P. Liang, SQuAD:
          <volume>100</volume>
          , 000+
          <article-title>questions for machine comprehension of text</article-title>
          , in: J.
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Carreras</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          Duh (Eds.),
          <source>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, EMNLP</source>
          <year>2016</year>
          , Austin, Texas, USA, November 1-
          <issue>4</issue>
          ,
          <year>2016</year>
          , The Association for Computational Linguistics,
          <year>2016</year>
          , pp.
          <fpage>2383</fpage>
          -
          <lpage>2392</lpage>
          . URL: https://doi.org/10.18653/v1/d16-
          <fpage>1264</fpage>
          . doi:
          <volume>10</volume>
          .18653/V1/D16-1264.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>G.</given-names>
            <surname>Tsatsaronis</surname>
          </string-name>
          , G. Balikas,
          <string-name>
            <given-names>P.</given-names>
            <surname>Malakasiotis</surname>
          </string-name>
          , I. Partalas,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zschunke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Alvers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Weissenborn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krithara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Petridis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Polychronopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Almirantis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pavlopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Baskiotis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gallinari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Artières</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Ngomo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Heino</surname>
          </string-name>
          , É. Gaussier,
          <string-name>
            <given-names>L.</given-names>
            <surname>Barrio-Alvers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schroeder</surname>
          </string-name>
          , I. Androutsopoulos,
          <string-name>
            <surname>G. Paliouras,</surname>
          </string-name>
          <article-title>An overview of the BIOASQ large-scale biomedical semantic indexing and question answering competition</article-title>
          ,
          <source>BMC Bioinform</source>
          .
          <volume>16</volume>
          (
          <year>2015</year>
          )
          <volume>138</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>138</lpage>
          :
          <fpage>28</fpage>
          . URL: https://doi.org/10.1186/ s12859-015-0564-6. doi:
          <volume>10</volume>
          .1186/S12859-015-0564-6.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dhingra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. W.</given-names>
            <surname>Cohen</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Lu,</surname>
          </string-name>
          <article-title>PubMedQA: A dataset for biomedical research question answering</article-title>
          , in: K. Inui,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          Wan (Eds.),
          <source>Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, EMNLP-IJCNLP</source>
          <year>2019</year>
          ,
          <string-name>
            <given-names>Hong</given-names>
            <surname>Kong</surname>
          </string-name>
          , China, November 3-
          <issue>7</issue>
          ,
          <year>2019</year>
          , Association for Computational Linguistics,
          <year>2019</year>
          , pp.
          <fpage>2567</fpage>
          -
          <lpage>2577</lpage>
          . URL: https://doi.org/10.18653/v1/
          <fpage>D19</fpage>
          -1259. doi:
          <volume>10</volume>
          .18653/V1/D19-1259.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Welbl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. F.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gardner</surname>
          </string-name>
          ,
          <article-title>Crowdsourcing multiple choice science questions</article-title>
          , in: L.
          <string-name>
            <surname>Derczynski</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ritter</surname>
          </string-name>
          , T. Baldwin (Eds.),
          <source>Proceedings of the 3rd Workshop on Noisy User-generated Text, NUT@EMNLP</source>
          <year>2017</year>
          , Copenhagen, Denmark, September 7,
          <year>2017</year>
          , Association for Computational Linguistics,
          <year>2017</year>
          , pp.
          <fpage>94</fpage>
          -
          <lpage>106</lpage>
          . URL: https://doi.org/10.18653/v1/w17-
          <fpage>4413</fpage>
          . doi:
          <volume>10</volume>
          .18653/V1/ W17-4413.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Möller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Reina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jayakumar</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Pietsch, COVID-QA: A question answering dataset for COVID19, in:</article-title>
          K. Verspoor,
          <string-name>
            <given-names>K. B.</given-names>
            <surname>Cohen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dredze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Ferrara</surname>
          </string-name>
          , J. May,
          <string-name>
            <given-names>R.</given-names>
            <surname>Munro</surname>
          </string-name>
          , C. Paris, B. Wallace (Eds.),
          <source>Proceedings of the 1st Workshop on NLP for COVID-19 at ACL</source>
          <year>2020</year>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .nlpcovid19-acl.18/.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.</given-names>
            <surname>Dasigi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lo</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Beltagy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gardner</surname>
          </string-name>
          ,
          <article-title>A dataset of informationseeking questions and answers anchored in research papers</article-title>
          , in: K.
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rumshisky</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Hakkani-Tür</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Beltagy</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Bethard</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Cotterell</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Chakraborty</surname>
          </string-name>
          , Y. Zhou (Eds.),
          <source>Proceedings of the</source>
          <year>2021</year>
          <article-title>Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2021, Online</article-title>
          , June 6-11,
          <year>2021</year>
          , Association for Computational Linguistics,
          <year>2021</year>
          , pp.
          <fpage>4599</fpage>
          -
          <lpage>4610</lpage>
          . URL: https://doi.org/10.18653/v1/
          <year>2021</year>
          .naacl-main.
          <volume>365</volume>
          . doi:
          <volume>10</volume>
          .18653/V1/
          <year>2021</year>
          .NAACL-MAIN.
          <year>365</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>QASA: advanced question answering on scientific articles</article-title>
          , in: A.
          <string-name>
            <surname>Krause</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Brunskill</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Cho</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Engelhardt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Sabato</surname>
          </string-name>
          , J. Scarlett (Eds.),
          <source>International Conference on Machine Learning</source>
          ,
          <string-name>
            <surname>ICML</surname>
          </string-name>
          <year>2023</year>
          ,
          <volume>23</volume>
          -
          <issue>29</issue>
          <year>July 2023</year>
          , Honolulu, Hawaii, USA, volume
          <volume>202</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>19036</fpage>
          -
          <lpage>19052</lpage>
          . URL: https://proceedings.mlr.press/v202/lee23n.html.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Meloni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Motta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Recupero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Salatino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vahdati</surname>
          </string-name>
          ,
          <article-title>Large language models for scientific question answering: An extensive analysis of the SciQA benchmark</article-title>
          , in: A.
          <string-name>
            <surname>Meroño-Peñuela</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Dimou</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Troncy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Hartig</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Acosta</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Paulheim</surname>
          </string-name>
          , P. Lisena (Eds.),
          <source>The Semantic Web - 21st International Conference, ESWC</source>
          <year>2024</year>
          , Hersonissos, Crete, Greece, May
          <volume>26</volume>
          -30,
          <year>2024</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>I</given-names>
          </string-name>
          , volume
          <volume>14664</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2024</year>
          , pp.
          <fpage>199</fpage>
          -
          <lpage>217</lpage>
          . URL: https://doi.org/10.1007/978-3-
          <fpage>031</fpage>
          -60626-7_
          <fpage>11</fpage>
          . doi:
          <volume>10</volume>
          . 1007/978-3-
          <fpage>031</fpage>
          -60626-7\_
          <fpage>11</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sarkar</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Cohan,
          <article-title>SciDQA: A deep reading comprehension dataset over scientific papers</article-title>
          , in: Y.
          <string-name>
            <surname>Al-Onaizan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bansal</surname>
          </string-name>
          , Y. Chen (Eds.),
          <source>Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, EMNLP</source>
          <year>2024</year>
          ,
          <article-title>Miami</article-title>
          , FL, USA, November
          <volume>12</volume>
          -
          <issue>16</issue>
          ,
          <year>2024</year>
          , Association for Computational Linguistics,
          <year>2024</year>
          , pp.
          <fpage>20908</fpage>
          -
          <lpage>20923</lpage>
          . URL: https://doi. org/10.18653/v1/
          <year>2024</year>
          .emnlp-main.
          <volume>1163</volume>
          . doi:
          <volume>10</volume>
          .18653/V1/
          <year>2024</year>
          .EMNLP-MAIN.
          <year>1163</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ajith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Grazian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hoex</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , C. Kit,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Foster</surname>
          </string-name>
          ,
          <article-title>SciQAG: A framework for auto-generated science question answering dataset with fine-grained evaluation</article-title>
          ,
          <source>CoRR abs/2405</source>
          .09939 (
          <year>2024</year>
          ). URL: https://doi.org/10.48550/arXiv.2405.09939. doi:
          <volume>10</volume>
          .48550/ ARXIV.2405.09939. arXiv:
          <volume>2405</volume>
          .
          <fpage>09939</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Asai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Soldaini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Feldman</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. D'Arcy</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Wadden</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Latzke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Ji</surname>
            , S. Liu,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Tong</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Xiong</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Neubig</surname>
            ,
            <given-names>D. S.</given-names>
          </string-name>
          <string-name>
            <surname>Weld</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Downey</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Yih</surname>
            ,
            <given-names>P. W.</given-names>
          </string-name>
          <string-name>
            <surname>Koh</surname>
          </string-name>
          , H. Hajishirzi,
          <article-title>OpenScholar: Synthesizing scientific literature with retrieval-augmented LMs</article-title>
          ,
          <source>CoRR abs/2411</source>
          .14199 (
          <year>2024</year>
          ). URL: https://doi.org/10. 48550/arXiv.2411.14199. doi:
          <volume>10</volume>
          .48550/ARXIV.2411.14199. arXiv:
          <volume>2411</volume>
          .
          <fpage>14199</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Hu,
          <string-name>
            <surname>S. Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Bras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dodge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bragg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hajishirzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Downey</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Cohan,
          <string-name>
            <surname>SciArena:</surname>
          </string-name>
          <article-title>An open evaluation platform for nonverifiable scientific literature-grounded tasks</article-title>
          ,
          <source>in: The Thirty-ninth Annual Conference on Neural Information Processing Systems Datasets and Benchmarks Track</source>
          ,
          <year>2025</year>
          . URL: https://openreview. net/forum?id=am6RR85mnc.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13] dblp Team, dblp computer science bibliography - Monthly
          <source>Snapshot XML Release of April</source>
          <year>2025</year>
          ,
          <year>2025</year>
          . URL: https://doi.org/10.4230/dblp.xml.2025-
          <volume>04</volume>
          -
          <fpage>01</fpage>
          . doi:
          <volume>10</volume>
          .4230/dblp.xml.2025-
          <volume>04</volume>
          -01.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>C.-Y. Lin</surname>
            ,
            <given-names>ROUGE:</given-names>
          </string-name>
          <article-title>A package for automatic evaluation of summaries, in: Text Summarization Branches Out, Association for Computational Linguistics</article-title>
          , Barcelona, Spain,
          <year>2004</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>81</lpage>
          . URL: https://aclanthology.org/W04-1013/.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kishore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Artzi,</surname>
          </string-name>
          <article-title>BERTScore: Evaluating text generation with BERT</article-title>
          ,
          <source>in: 8th International Conference on Learning Representations, ICLR</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>Addis</given-names>
            <surname>Ababa</surname>
          </string-name>
          , Ethiopia,
          <source>April 26-30</source>
          ,
          <year>2020</year>
          , OpenReview.net,
          <year>2020</year>
          . URL: https://openreview.net/forum?id= SkeHuCVFDr.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Oguz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Min</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Edunov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          , W. Yih,
          <article-title>Dense passage retrieval for open-domain question answering</article-title>
          , in: B.
          <string-name>
            <surname>Webber</surname>
            , T. Cohn,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>He</surname>
          </string-name>
          , Y. Liu (Eds.),
          <source>Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, EMNLP</source>
          <year>2020</year>
          , Online,
          <source>November 16-20</source>
          ,
          <year>2020</year>
          , Association for Computational Linguistics,
          <year>2020</year>
          , pp.
          <fpage>6769</fpage>
          -
          <lpage>6781</lpage>
          . URL: https://doi.org/10.18653/v1/
          <year>2020</year>
          .emnlp-main.
          <volume>550</volume>
          . doi:
          <volume>10</volume>
          .18653/V1/
          <year>2020</year>
          .EMNLP-MAIN.
          <year>550</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>O.</given-names>
            <surname>Khattab</surname>
          </string-name>
          , M. Zaharia,
          <article-title>ColBERT: Eficient and efective passage search via contextualized late interaction over BERT</article-title>
          , in: J. X.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Chang</surname>
          </string-name>
          , X. Cheng, J.
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Murdock</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wen</surname>
          </string-name>
          , Y. Liu (Eds.),
          <source>Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval</source>
          ,
          <string-name>
            <surname>SIGIR</surname>
          </string-name>
          <year>2020</year>
          ,
          <string-name>
            <given-names>Virtual</given-names>
            <surname>Event</surname>
          </string-name>
          , China,
          <source>July 25-30</source>
          ,
          <year>2020</year>
          , ACM,
          <year>2020</year>
          , pp.
          <fpage>39</fpage>
          -
          <lpage>48</lpage>
          . URL: https://doi.org/10.1145/3397271.3401075. doi:
          <volume>10</volume>
          .1145/3397271.3401075.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zaragoza</surname>
          </string-name>
          ,
          <article-title>The probabilistic relevance framework: BM25 and beyond</article-title>
          ,
          <source>Found. Trends Inf. Retr</source>
          .
          <volume>3</volume>
          (
          <year>2009</year>
          )
          <fpage>333</fpage>
          -
          <lpage>389</lpage>
          . URL: https://doi.org/10.1561/1500000019. doi:
          <volume>10</volume>
          .1561/ 1500000019.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nogueira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pradeep</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Document ranking with a pretrained sequence-to-sequence model</article-title>
          , in: T. Cohn,
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          , Y. Liu (Eds.),
          <source>Findings of the Association for Computational Linguistics: EMNLP</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>Online</given-names>
            <surname>Event</surname>
          </string-name>
          ,
          <fpage>16</fpage>
          -20
          <source>November</source>
          <year>2020</year>
          , volume
          <article-title>EMNLP 2020 of Findings of ACL, Association for Computational Linguistics</article-title>
          ,
          <year>2020</year>
          , pp.
          <fpage>708</fpage>
          -
          <lpage>718</lpage>
          . URL: https://doi.org/10.18653/v1/
          <year>2020</year>
          .findings-emnlp.
          <volume>63</volume>
          . doi:
          <volume>10</volume>
          .18653/V1/
          <year>2020</year>
          .FINDINGS-EMNLP.
          <year>63</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>G.</given-names>
            <surname>Izacard</surname>
          </string-name>
          , E. Grave,
          <article-title>Leveraging passage retrieval with generative models for open domain question answering</article-title>
          , in: P. Merlo,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tiedemann</surname>
          </string-name>
          , R. Tsarfaty (Eds.),
          <source>Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics:</source>
          Main Volume,
          <source>EACL</source>
          <year>2021</year>
          , Online,
          <source>April 19 - 23</source>
          ,
          <year>2021</year>
          , Association for Computational Linguistics,
          <year>2021</year>
          , pp.
          <fpage>874</fpage>
          -
          <lpage>880</lpage>
          . URL: https://doi.org/10.18653/v1/
          <year>2021</year>
          .eacl-main.
          <volume>74</volume>
          . doi:
          <volume>10</volume>
          .18653/V1/
          <year>2021</year>
          .EACL-MAIN.
          <year>74</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>J. G</surname>
          </string-name>
          . Carbonell, J. Goldstein,
          <article-title>The use of MMR, diversity-based reranking for reordering documents</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>