<!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>
      <journal-title-group>
        <journal-title>Grenoble, France
†These authors contributed equally.
$ heinrich.merker@uni-jena.de (J. H. Merker); alexander.bondarenko@uni-jena.de (A. Bondarenko);
matthias.hagen@uni-jena.de (M. Hagen); adrian.viehweger@medizin.uni-leipzig.de (A. Viehweger)</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>MiBi at BioASQ 2024: Retrieval-Augmented Generation for Answering Biomedical Questions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jan Heinrich Merker</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexander Bondarenko</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matthias Hagen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Adrian Viehweger</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Friedrich-Schiller-Universität Jena</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Medical Microbiology and Virology, University Hospital Leipzig</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Leipzig University</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Letter</institution>
          ,
          <addr-line>Comment, Editorial, News, Biography, Congress, Video-Audio Media, Interview, Overall</addr-line>
          ,
          <institution>Retraction of Publication</institution>
          ,
          <addr-line>Retracted Publication, Newspaper Article, Bibliography, Legal Case, Directory, Personal Narrative, Address, Randomized Controlled Trial (Veterinary), Autobiography, Dataset</addr-line>
          ,
          <institution>Clinical Interactive Tutorial</institution>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>The publication types listed below (sorted by number of occurrences) were excluded from rfist-stage retrieval from PubMed:</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>In this paper, we describe the MiBi team's participation in the BioASQ 2024 Task 12b on biomedical semantic question answering. Our RAG-based systems (retrieval-augmented generation) use GPT-3.5, GPT-4, or Mixtral to generate an answer from some retrieved context. For the retrieval, we use PubMed's search API or a local BM25 index of PubMed abstracts and potentially re-rank the initially retrieved abstracts / snippets with diferent neural bi-encoder and cross-encoder re-rankers. We test five diferent retrieval-augmented generation schemes with diferent orders of generation and retrieval stages. The evaluation results for our submitted systems-although partially inconsistent over diferent test batchesshow three general trends. First, combining BM25-based lexical retrieval with neural re-rankers seems to be a good retrieval setup. Second, answers generated from retrieved snippets as context seem more accurate than answers generated from complete abstracts. Third, GPT-4 generates more accurate answers than GPT-3.5, but Mixtral is on par with GPT-4 when employing a generation-then-retrieve-then-generation scheme.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Retrieval-augmented generation</kwd>
        <kwd>biomedical question answering</kwd>
        <kwd>information retrieval</kwd>
        <kwd>large language models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Due to the access to large language models (LLMs) becoming easier, the way people search for answers
to all kinds of questions has been changing. Now, it might seem easier to ask ChatGPT and get an instant
answer than to use a web search engine and read through the returned search results. While newer and
larger LLMs are becoming more accurate, they still can confabulate incorrect facts in their responses.
One of the ways to reduce confabulation is a retrieval-augmented generation (RAG) approach [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        To investigate the RAG efectiveness in the scenario of biomedical question answering, our team
MiBi participated in all the phases of the BioASQ 2024 Task 12b on biomedical semantic question
answering [
        <xref ref-type="bibr" rid="ref2 ref3 ref4 ref5">2, 3, 4, 5</xref>
        ] that includes an abstract retrieval task, a snippet extraction task, and an
answer generation task. Particularly for answer generation, we use LLMs (GPT-3.5 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], GPT-4 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], and
Mixtral-8x7B [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]) and provide them with the context information that contains either retrieved top-3
complete PubMed abstracts or top-10 snippets extracted from the abstracts. The latter approach aims to
condense potentially useful, relevant facts and reduce possible context “noise”. For retrieving abstracts,
we experiment with PubMed’s search API and Elasticsearch. Methodically, besides the more
conventional retrieval-then-generation paradigm, we also test the generation-then-retrieval paradigm that
expands the query before retrieval and re-ranking and more advanced RAG paradigms. Furthermore,
for snippet extraction, we either use a chain-of-thought few-shot LLM prompting [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] or heuristically
re-rank the PubMed article’s titles and chunks of up to three consecutive sentences from the abstracts.1
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Approach</title>
      <p>
        Our BioASQ submissions follow the retrieval-augmented generation paradigm [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], where existing
state-of-the-art large language models are given context based on retrieved documents and/or snippets
to improve the reliability and factual accuracy of the generated answers. Following the BioASQ’s
evaluation scheme, we structure our retrieval and generation systems as a modular pipeline consisting
of (1) document retrieval and re-ranking, (2) snippet extraction and re-ranking, and (3) answer generation.
We explore several implementation options for the three pipeline stages, ranging from simpler heuristic
or statistical approaches to complex neural approaches. We also experiment with diferent paradigms
of retrieval-augmented generation, ranging from standard retrieval-then-generate pipelines to more
complex RAG pipelines intertwining retrieval and generation.
      </p>
      <sec id="sec-2-1">
        <title>2.1. Document Retrieval</title>
        <p>The first subtask of the BioASQ Task 12b is to retrieve relevant abstracts from the PubMed corpus, 2 an
open collection of 37 million medical abstracts.</p>
        <p>
          PubMed API and Neural Re-Ranking Our first document retrieval approach queries the PubMed’s
search API3 to retrieve up to 200 abstracts (term matching to achieve higher recall) for further re-ranking
(to increase precision at top ranks) using the lower-cased test questions as queries (after removing
stop words from NLTK [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and punctuation). If no document is found for the query, it is iteratively
shortened by one word at a time until at least one abstract is found for the shortened query. The
resulting abstract(s) are then re-ranked with BM25 [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] (1=1.5, =0.75, concatenated title and abstract,
tokenizer and stop words from NLTK). Afterward, the top-50 abstracts are re-ranked again with a
MiniLM [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] cross-encoder model4 trained on the MS MARCO Passage Ranking task [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], and finally
the top-25 are again re-ranked with a MPNet [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] bi-encoder model.5
Elasticsearch and PyTerrier To avoid issues with the PubMed API (which often returns no results),
we index the full PubMed annual baseline6 of 2024 in Elasticsearch, including the abstracts’ metadata
(e.g., publication type and MeSH terms7). Abstracts (and metadata) are then retrieved by (1) matching the
question to the article’s title and abstract (Elasticsearch’s BM25, 1=1.2, =0.75, Unicode tokenization8)
and (2) matching the medical entities extracted from the question (using ScispaCy [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]) to the abstract’s
MeSH terms annotated by NLM (same Elasticsearch’s BM25). The two queries are combined with an
OR operator. Articles without an abstract (or with an empty abstract) are not considered for retrieval.
Further, we disallow abstracts from 27 manually selected non-peer-reviewed publication types. The
Elasticsearch retrieval using the combined query and filtering is implemented as a PyTerrier [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] module.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Snippet Extraction and Re-Ranking</title>
        <p>After document retrieval, the second subtask is to extract short passages (snippets) from the retrieved
abstracts containing a direct answer to the given question or key information required to answer it.
LLM-based Snippet Extraction Our first strategy is to extract snippets with GPT-3.5-turbo
(temperature: 0, max tokens: 1000, OpenAI API9) chain-of-thought few-shot prompting (the prompt contains
2https://pubmed.gov/
3https://ncbi.nlm.nih.gov/books/NBK25500/
4https://huggingface.co/cross-encoder/msmarco-MiniLM-L6-en-de-v1
5https://huggingface.co/sentence-transformers/all-mpnet-base-v2
6https://pubmed.gov/download/
7https://nlm.nih.gov/mesh/
8https://unicode.org/reports/tr29/
9https://openai.com/api/
3 examples; refer to Appendix A.3 for the LLM instructions and prompt template). We do not do further
re-ranking and simply rely on the ordering returned by the LLM.</p>
        <sec id="sec-2-2-1">
          <title>Rule-based Snippet Extraction and Neural Re-Ranking As an alternative approach, we develop a</title>
          <p>
            rule-based snippet extraction. The document is split into sentences (using NLTK [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ]); then, the full title
and all combinations of up to 3 consecutive sentences from the abstract are used as candidate snippets.
The snippets inherit the retrieval score of the abstract from which they were extracted. Subsequently,
we re-rank the top-100 with a TAS-B bi-encoder,10 then re-rank the top-5 with a duoT5 cross-encoder11
(we use the PyTerrier implementations of the cross- and bi-encoders).
          </p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Answer Generation</title>
        <p>In 2024, the BioASQ phases A+ and B feature two answer generation subtasks evaluated in two settings.
Answers should either be given in an ‘exact’ format based on the question type (e.g., just “yes” or “no”
for a yes-no question) or in an ‘ideal’ format as a short explanatory summary. For both answer types,
answers can be generated based on either our self-retrieved/-extracted abstracts and snippets (phase A+)
or the ground-truth abstracts and snippets provided by the task organizers (phase B).
Few-Shot Prompting with Function Calling Our first approach for answer generation facilitates
function calling with the Instructor library12 to generate structured LLM responses with GPT-3.5-turbo
and GPT-4 (for both temperature: 0, max tokens: 1750, accessed via the OpenAI API). Diferent zero-shot
prompting instructions are used for each answer type (i.e., exact or ideal) and question type (i.e., yes-no,
list, factoid, or summary). As the context for generating the answer, we include the concatenated
top-3 abstracts or all (top-10) snippets in the prompt. When using the ground-truth abstracts and
snippets from the task organizers, the cross-encoder- and bi-encoder-based re-ranking from Section 2.1
is employed before selecting the top-3 abstracts.</p>
        <p>
          Modular LLM Programming with DSPy The second answer generation approach is based on
the DSPy LLM programming framework [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. With DSPy, prompts for the LLM are not manually
constructed; instead, the expected signature of inputs and outputs are given as Python classes. Our
prediction signature defines the input as the question text, a list of snippets, and (only when generating
the ‘ideal’ answer) the previously generated ‘exact’ answer. The output signature again varies depending
on the answer type (exact, ideal) and question type (yes-no, list, factoid, summary). Based on the declared
signature, we generate the answer with DSPy’s typed predictions (using the Mixtral-8x7B-Instruct-v0.1
model [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] accessed via the Blablador API13). We do not use DSPy’s built-in prompt optimization.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Changing the Order of Retrieval and Answer Generation</title>
        <p>
          So far, our approaches have been based on the typical retrieval-augmented generation paradigm: first,
retrieve relevant documents (or snippets) and then generate an answer using the retrieved documents
as context. This retrieval-then-generation (RtG) paradigm [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] intuitively assumes that context is often
needed to answer complex questions such as medical questions. We challenge this assumption and argue
that other paradigms are also valid. For instance, Gienapp et al. [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] also consider the
generation-thenretrieval (GtR) paradigm, where an answer is generated first and subsequently grounded by retrieval.
Our modular retrieval and answer generation pipeline allows for the evaluation of both RAG patterns.
        </p>
        <p>
          Additionally, we explore two new variations: retrieval-then-generation-then-retrieval (RtGtR) and
generation-then-retrieval-then-generation (GtRtG) that resemble feedback loops [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. For example, the
generated answer can be used to refine the initial retrieval results, similar to how a researcher would
10https://huggingface.co/sebastian-hofstaetter/distilbert-dot-tas_b-b256-msmarco
11https://huggingface.co/castorini/duot5-base-msmarco
12https://useinstructor.com/
13https://helmholtz-blablador.fz-juelich.de/
refine their references based on new findings. In the latter, an answer generated without context is
refined after retrieving supporting documents. This resembles roughly a literature review, where an
initial hypothesis is checked and refined based on relevant literature.
        </p>
        <p>To facilitate the knowledge aggregation in our approach, we use previously retrieved or generated
abstracts, snippets, or answers as follows: For retrieval, the ‘exact’ and ‘ideal’ answers are appended to
the query. If snippets are given, we use the snippets’ origin abstracts for abstract re-ranking (using the
same Elasticsearch document scoring as in Section 2.1). Also, previous ‘exact’ or ‘ideal’ answers are
added to the context according to the DSPy prompt signature (Section 2.3).</p>
        <p>
          Finally, we delegate the decision of which ‘task’ to execute next to the LLM, using DSPy’s typed
prediction (Mixtral-8x7B, Blablador API). The LLM is given the question, question type (e.g., yes-no), a
history of previously executed “modules”, and a readiness flag indicating whether the question is fully
answered. Based on this information, the model decides whether to (1) retrieve or re-rank documents,
(2) extract and re-rank snippets, (3) generate an ‘exact’ answer, or (4) generate an ‘ideal’ answer. Custom
DSPy suggestions to the LLM [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] are used to enforce that each module is executed at least once and
that the same module cannot execute consecutively (e.g., a retrieval step cannot directly follow another
retrieval step to avoid infinite loops). No prompt optimization is used.
        </p>
      </sec>
      <sec id="sec-2-5">
        <title>2.5. Submitted Systems</title>
        <p>We combine the techniques described above in our submitted systems to evaluate the impact of diferent
choices of LLMs and prompting frameworks on the efectiveness of answering biomedical questions.
Further systems are submitted to investigate the LLM’s reliance on efectively retrieved documents and
snippets. Finally, we explore the efect of diferent retrieval-augmented generation paradigms, with or
without feedback loops. An overview of all submitted systems is given in Table 1.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Results</title>
      <p>
        We report the evaluation results of our submitted systems in Table 2 using the values for a subset of
oficial BioASQ evaluation metrics published on the task website 14 (recall and MAP for the retrieval
phase, macro F1, strict accuracy, mean precision, and ROUGE-2 F1 [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] for answer generation). For
completeness, we include the ‘best’, ‘worst’, and median of the task participants’ results. While our
results often lie around the median values, two times, we achieved the overall highest results: ‘exact’
answers for yes-no and factoid questions in phase B of the batch 3, and three times, we scored the worst
results: ‘exact’ answers for factoid questions in phases A+ and B of the batch 2 and ‘exact’ answers for
factoid questions in phase B of the batch 4. In the following, we compare some interesting diferences
between groups of our systems with respect to the evaluation metrics.
      </p>
      <sec id="sec-3-1">
        <title>3.1. PubMed API vs. Elasticsearch for Abstract Retrieval</title>
        <p>Two diferent approaches are employed for abstract retrieval: the PubMed search API and our own
Elasticsearch index. Comparing our phase A systems mibi_s and mibi_a from test batch 1 and 2,15
Table 2 shows a substantial diference in the achieved recall and a noticeable diference in MAP for
abstract retrieval. The API-based retrieval used in test batch 1 (cf. Table 1) struggles to find relevant
abstracts and consequentially yields a recall below median. We notice that for many queries, the oficial
search API returns too few or no documents at all. Seemingly, it cannot handle the question-like queries
well. Although the documents are re-ranked with both cross-encoders and bi-encoders, the MAP scores
are only marginally above the median of all submissions. The metadata-enhanced Elasticsearch retrieval,
on the other hand, yields above-median recall and MAP even without any re-ranking stage. However,
more detailed ablation studies are required to determine what part of the Elasticsearch-based retrieval
contributes most to the increase in retrieval efectiveness.
14http://bioasq.org/
15The same retrieval was used in mibi_s and mibi_a.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. GPT-3.5 vs. Rules and Re-Ranking for Snippet Extraction</title>
        <p>Further, we change the snippet extraction approach from test batch 1 to test batch 2. In batch 1,
snippets are extracted with GPT-3.5 chain-of-thought few-shot-prompting, while in batch 2, we extract
consecutive sentences from each article’s title and abstract (chunks) and then re-rank the chunks with a
bi-encoder and cross-encoder. In Table 2, the systems using GPT-3.5 for snippet extraction (mibi_s
and mibi_a from batch 1) struggle, especially with respect to the recall of snippets (phase A). Our
ruleand re-ranking-based snippet extraction (cf. mibi_s and mibi_a from batch 2) achieves a higher recall
and MAP. Yet, neither of the approaches yields competitive efectiveness with the ‘best’ of the task’s
leaderboard. An important limitation of our comparison of snippet extractions is that the abstract
retrieval approach has changed simultaneously. So, the snippet extraction efectiveness could also be
influenced by the changed abstract retrieval step on which the snippet extraction relies.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Snippets vs. Abstracts as Context for Answer Generation</title>
        <p>In the first three test batches of Phase B, we submitted systems that use either the top-10 snippets or
the top-3 (re-ranked) abstracts as context for the LLM to generate an answer (see Table 1). Due to the
large length of abstracts (which can even be structured in multiple sections), we assume that shorter
snippets would “confuse” an LLM less than full abstracts. Indeed, we can observe that this assumption
holds for all submitted systems. The efectiveness benefit of using snippets instead of abstracts is most
pronounced in the generation of yes-no answers and ‘ideal’ long-form answers, while for factoid and
list answers, the LLM-generated answers are not consistently better with either abstracts or snippets.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. GPT-3.5 vs. GPT-4 vs. Mixtral-8x7B for Answer Generation</title>
        <p>A clear efect is also observed when comparing GPT-3.5 with GPT-4 for answer generation (cf. mibi_s
and mibi_a in batch 1/2 and 3 of phase B respectively). Answers generated with GPT-4 are more
accurate than the GPT-3.5 answers for all question types except for list questions. Moreover, GPT-4
works (nearly) perfectly for answering yes-no questions when provided with ground-truth relevant
context, yielding the highest macro F1 score of all submissions to phase B in batch 3. A direct comparison
of GPT-4 to Mixtral is possible with the systems mibi_s and mibi_3 of test batch 3. Here, Mixtral is
outperformed by GPT-4 with respect to efectiveness on all question types. However, Mixtral achieves
comparable efectiveness for answering biomedical questions when following the
generation-thenretrieval-then-generation paradigm (compare mibi_s to mibi_4; see Section 3.5). Because we have
used Mixtral with another LLM framework (i.e., DSPy programming instead of Instructor prompting)
and prompt design (i.e., automatically generated prompts from DSPy instead of manually designed
prompts), the comparability of our GPT-based systems to the Mixtral-based systems is rather limited.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Retrieval-then-Generation vs. Generation-then-Retrieval RAG Paradigms</title>
        <p>As our final evaluation, we compare the impact of diferent RAG paradigms on the retrieval and answer
generation efectiveness. This impact is best observed in phases A and A+ of test batch 3 and 4, where we
use the same approaches for the retrieval step and the generation step of our RAG pipeline, but perform
retrieval and generation in diferent orders. We either follow the conventional retrieval-then-generation
paradigm (RtG), the generation-then-retrieval paradigm (GtR), the new
retrieval-then-generation-thenretrieval paradigm (RtGtR, i.e., re-ranking abstracts and snippets based on the LLM’s answer), the
new generation-then-retrieval-then-generation paradigm (GtRtG, i.e., refining the LLM’s answer with
documents retrieved based on the LLM’s initial answer), or a completely flexible approach where the
LLM itself decides in which order to run the retrieval and generation for a given question (LLM0S,TP).
Overall, all the paradigms work equally efectively for abstract and snippet retrieval. With respect to
answer generation, in phase A+ (no ground-truth context), the best paradigms for yes-no answers were
RtG, GtRtG, and LLM0S,TP while for the remaining answer types, GtR and GtRtG work best. When
ground-truth abstracts and snippets are given (phase B), also for yes-no answers GtR and GtRtG work
best. Note that our GtR systems do not use retrieved context for answer generation (i.e., an LLM is
simply prompted to directly answer the question). Our evaluation results show that the no-context
answer generation is often more accurate for ‘ideal’ answers in phase A+ but is less accurate when
ground-truth snippets are used as context in phase B. The efectiveness diferences between the two
system types are, however, marginal. In conclusion, while directly asking an LLM a biomedical question
can result in accurate answers, RAG-based approaches provide the possibility to ground the answers
in high-quality sources (e.g., PubMed articles), for instance, by providing citations (cf. GtR). Our
implementation of the GtRtG paradigm that then refines LLM-generated answers based on these
citations is a first step towards a more conclusive evaluation of grounded RAG paradigms.</p>
      </sec>
      <sec id="sec-3-6">
        <title>3.6. Limited Comparability Across Test Batches</title>
        <p>We used the same systems in batch 3 and batch 4 (except mibi_s and mibi_a for phase B). Hence,
with comparable test collections, we would expect similar efectiveness for the same systems when
comparing batch 3 to batch 4. Somewhat surprisingly, this is not true for answer generation (phases A+
and B) but only for the retrieval in phase A. Looking at the questions from both batches, we find that
questions from batch 4 are longer (avg. words: 12.0, non-stopwords: 7.5) and contain more medical
entities (avg. entities: 3.7) on average than the questions from batch 3 (words: 10.7, non-stopwords: 6.6,
entities: 3.1). More in-depth analyses are hence required, e.g., to check whether the questions from test
batch 4 were indeed more dificult than the questions from batch 3. Consequently, our findings that
partially rely on the comparability of the diferent batches would need to be re-evaluated.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>In this paper, we described the MiBi team’s participation in all the subtasks (phases) of the BioASQ 2024
Task 12b on biomedical semantic question answering. In our submitted systems, we used a
retrievalaugmented generation approach to enhance the accuracy of LLM-generated answers by providing
relevant contextual information retrieved from PubMed, a large collection of 37 million medical abstracts.</p>
      <p>For abstract retrieval, we either used PubMed’s search API followed by re-ranking with cross- and
bi-encoders or a local Elasticsearch index using BM25 as a retrieval model with further filtering based
on metadata. We found that the former retrieval strategy was less efective due to a lower recall of the
retrieved document candidates. Additionally, our most efective snippet extraction approach was to
split the article titles and abstracts into chunks of up to three sentences and rank them using cross- and
bi-encoders. This approach was more accurate than prompting an LLM to extract snippets.</p>
      <p>Furthermore, for answer generation, we tested several LLMs by providing them with retrieved context.
We found that GPT-4 and Mixtral were on par and were more accurate than GPT-3.5. The highest answer
accuracy was achieved using only snippets as context, indicating that removing potentially distracting
information from abstracts may be beneficial for RAG-based approaches. Comparing diferent orderings
of the retrieval and generation stages, we found the generation-then-retrieval-then-generation paradigm
to be the most efective and that retrieved context given upfront tends to “confuse” LLMs. We also
found that RAG and no-RAG approaches for answer generation in the BioASQ task settings were almost
equally accurate. However, RAG can provide a possibility to reference sources in practical applications.</p>
      <p>An interesting future research direction is to explore the efectiveness of using knowledge graphs to
steer the LLM-based answer generation. Last, a more systematic evaluation of using diferent orderings
of the retrieval and generation stages in RAG pipelines is worthwhile.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments References</title>
      <p>This work has been partially supported by the Stiftung für Innovation in der Hochschullehre under the
“freiraum 2022” call (FRFMM-58/2022). We are also thankful to Helmholtz AI Jülich for the free access
to their Blablador API (for Mixtral inference).</p>
    </sec>
    <sec id="sec-6">
      <title>A. Appendix</title>
      <sec id="sec-6-1">
        <title>A.1. System Name Mapping</title>
      </sec>
      <sec id="sec-6-2">
        <title>A.3. Snippet Extraction Prompt</title>
        <p>The below instructions and few-shot template were used for extracting snippets using GPT-3.5.17
LLM instructions
" role ": " system ",
" content ": " You are a world class system to extract relevant sentences from titles
and abstracts answering questions ",
" role ": " user ",
16Filtering code available at https://github.com/webis-de/clef24-mibi-bioasq/
17Full code and prompts available at https://github.com/webis-de/clef24-mibi-bioasq/
" content ": " Extract from the title and abstract ONLY sentences of phrases that
directly answer the question ",
" role ": " user ",
" content ": &lt;few - shot prompt &gt;,</p>
        <sec id="sec-6-2-1">
          <title>Few-shot prompt template with three examples</title>
          <p>Here are 3 examples :
[ Title ]: Rethinking ramoplanin : the role of substrate binding in inhibition of
peptidoglycan biosynthesis
[ Abstract ]: Ramoplanin is a cyclicdepsipeptide antibiotic that inhibits
peptidoglycan biosynthesis . It was proposed in 1990 to block the MurG step of
peptidoglycan synthesis by binding to the substrate of MurG , Lipid I. The
proposed mechanism of MurG inhibition has become widely accepted even though it
was never directly tested . In this paper , we disprove the accepted mechanism for
how ramoplanin functions , and we present an alternative mechanism . This work
has implications for the design of ramoplanin derivatives and may influence how
other proposed substrate binding antibiotics are studied .
[ Question ]: Which was the first adeno - associated virus vector gene therapy product
approved
in the United States ?
[ Title ]: Rethinking ramoplanin : the role of substrate binding in inhibition of
peptidoglycan biosynthesis
[ Abstract ]: Ramoplanin is a cyclicdepsipeptide antibiotic that inhibits
peptidoglycan biosynthesis . It was proposed in 1990 to block the MurG step of
peptidoglycan synthesis by binding to the substrate of MurG , Lipid I. The
proposed mechanism of MurG inhibition has become widely accepted even though it
was never directly tested . In this paper , we disprove the accepted mechanism for
how ramoplanin functions , and we present an alternative mechanism . This work
has implications for the design of ramoplanin derivatives and may influence how
other proposed substrate binding antibiotics are studied .
[ Question ]: Which antibiotics target peptidoglycan biosynthesis ?
[ Extracted ]:
Title sentences : [" Rethinking ramoplanin : the role of substrate binding in
inhibition of peptidoglycan biosynthesis ."]
Abstract sentences : [" Ramoplanin is a cyclicdepsipeptide antibiotic that inhibits
peptidoglycan biosynthesis ."]
[ Title ]: Mycobacterium Avium Complex ( MAC ) Lung Disease in Two Inner City Community</p>
          <p>Hospitals : Recognition , Prevalence , Co - Infection with Mycobacterium
Tuberculosis ( MTB ) and Pulmonary Function ( PF ) Improvements After Treatment .
[ Abstract ]: Over 4 years , we evaluated patients who had positive MAC cultures , MAC
infection and coinfection with MTB . Lung disease was related / likely related to
MAC in 21 patients (50\%) and not related in 21 (50\%) . In patients with MAC
related lung disease , the primary physician did not consider the diagnosis
except when that physician was a pulmonologist . Half of those with MAC - related
lung disease were smokers , white and US - born . There were 12 immunocompetent
patients with MTB and NTM cultures . Eleven were non - white and all were foreign
born . Presentation and clinical course were consistent with MTB . All 8 patients
with abnormal PF improved . The prevalence of MAC lung infection in two inner
city hospitals was four times higher than that of TB. The indication for
treatment of MAC infection should also rely heavily on clinical and radiological
evidence when there is only one positive sputum culture . The diagnosis was
considered only when the admitting physician was a pulmonologist . Most patients
with combined infection were clinically consistent with MTB and responded to
anti MTB treatment alone . Treatment with anti - MAC therapy improved PF in those
patients whose PF was abnormal to begin with .
[ Question ]: Is Mycobacterium avium less susceptible to antibiotics than</p>
          <p>Mycobacterium tuberculosis ?
[ Extracted ]:
Title sentences : [ empty list ] ( no sentences or phrases that directly answer the
question )
Abstract sentences : [" The prevalence of MAC lung infection in two inner city
hospitals was four times higher than that of TB ." , " Most patients with combined
infection were clinically consistent with MTB and responded to anti MTB
treatment alone ."]
Here is the data :
[ Title ]: { title }
[ Abstract ]: { abstract }
[ Question ]: { question }</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P. S. H.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Piktus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Küttler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rocktäschel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiela</surname>
          </string-name>
          ,
          <article-title>Retrieval-augmented generation for knowledgeintensive NLP tasks</article-title>
          ,
          <source>in: Proceedings of NeurIPS</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>NeurIPS</given-names>
            <surname>Foundation</surname>
          </string-name>
          ,
          <year>2020</year>
          . URL: https: //proceedings.neurips.cc/paper/2020/hash/6b493230205f780e1bc26945df7481e5-Abstract.html.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nentidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Katsimpras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krithara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lima-López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Farré-Maduell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krallinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Loukachevitch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Davydova</surname>
          </string-name>
          , E. Tutubalina, G. Paliouras,
          <source>Overview of BioASQ</source>
          <year>2024</year>
          :
          <article-title>The twelfth BioASQ challenge on large-scale biomedical semantic indexing and question answering</article-title>
          ,
          <source>in: Proceedings of CLEF</source>
          <year>2024</year>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nentidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Katsimpras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krithara</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Paliouras, Overview of BioASQ Tasks 12b</article-title>
          and
          <article-title>Synergy 12 in CLEF 2024</article-title>
          ,
          <source>in: Working Notes of CLEF</source>
          <year>2024</year>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Krithara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nentidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bougiatiotis</surname>
          </string-name>
          , G. Paliouras,
          <string-name>
            <surname>BioASQ-QA</surname>
          </string-name>
          :
          <article-title>A manually curated corpus for biomedical question answering</article-title>
          ,
          <source>Scientific Data</source>
          <volume>10</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .1038/s41597-023-02068-4.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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>
          . doi:
          <volume>10</volume>
          .1186/S12859-015-0564-6.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>T. B. Brown</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Mann</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ryder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Subbiah</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kaplan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Dhariwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Neelakantan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Shyam</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Sastry</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Askell</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Herbert-Voss</surname>
            , G. Krueger,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Henighan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Child</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ramesh</surname>
            ,
            <given-names>D. M.</given-names>
          </string-name>
          <string-name>
            <surname>Ziegler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Winter</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Hesse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            , E. Sigler,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Litwin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chess</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Berner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>McCandlish</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>in: Proceedings of NeurIPS</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>NeurIPS</given-names>
            <surname>Foundation</surname>
          </string-name>
          ,
          <year>2020</year>
          . URL: https://proceedings. neurips.cc/paper/2020/hash/1457c0d6bfcb4967418bfb8ac142f64a-Abstract.html.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>OpenAI</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Achiam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Adler</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Ahmad</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Akkaya</surname>
            ,
            <given-names>F. L.</given-names>
          </string-name>
          <string-name>
            <surname>Aleman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Almeida</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Altenschmidt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Altman</surname>
          </string-name>
          , et al.
          <article-title>(281 authors)</article-title>
          ,
          <source>GPT-4 technical report, arXiv 2303.08774</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2303.08774.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A. Q.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sablayrolles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Savary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bamford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Chaplot</surname>
          </string-name>
          ,
          <string-name>
            <surname>D. de Las Casas</surname>
            ,
            <given-names>E. B.</given-names>
          </string-name>
          <string-name>
            <surname>Hanna</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Bressand</surname>
            ,
            <given-names>G.</given-names>
            Lengyel, G. Bour, G.
          </string-name>
          <string-name>
            <surname>Lample</surname>
            ,
            <given-names>L. R.</given-names>
          </string-name>
          <string-name>
            <surname>Lavaud</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Saulnier</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Lachaux</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Stock</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Subramanian</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Antoniak</surname>
            ,
            <given-names>T. L.</given-names>
          </string-name>
          <string-name>
            <surname>Scao</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Gervet</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lavril</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>W. E.</given-names>
          </string-name>
          <string-name>
            <surname>Sayed</surname>
          </string-name>
          , Mixtral of experts,
          <source>arXiv 2401.04088</source>
          ,
          <year>2024</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2401. 04088.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schuurmans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ichter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Chain-of-thought prompting elicits reasoning in large language models</article-title>
          ,
          <source>in: Proceedings of NeurIPS</source>
          <year>2022</year>
          ,
          <string-name>
            <given-names>NeurIPS</given-names>
            <surname>Foundation</surname>
          </string-name>
          ,
          <year>2022</year>
          . URL: http://papers.nips.cc/paper/2022/hash/ 9d5609613524ecf4f15af0f7b31abca4-Abstract.html.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bird</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Klein</surname>
          </string-name>
          , E. Loper,
          <string-name>
            <surname>Natural Language Processing with Python</surname>
          </string-name>
          ,
          <source>O'Reilly</source>
          ,
          <year>2009</year>
          . URL: https: //www.nltk.org/book/.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Walker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hancock-Beaulieu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gatford</surname>
          </string-name>
          , Okapi at TREC-3, in:
          <source>Proceedings of TREC</source>
          <year>1994</year>
          , volume
          <volume>500</volume>
          -225 of NIST Special Publication,
          <string-name>
            <surname>NIST</surname>
          </string-name>
          ,
          <year>1994</year>
          , pp.
          <fpage>109</fpage>
          -
          <lpage>126</lpage>
          . URL: http://trec.nist.gov/pubs/trec3/papers/city.ps.gz.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Zhou, MiniLM: Deep self-attention distillation for task-agnostic compression of pre-trained transformers</article-title>
          ,
          <source>in: Proceedings of NeurIPS</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>NeurIPS</given-names>
            <surname>Foundation</surname>
          </string-name>
          ,
          <year>2020</year>
          . URL: https://proceedings.neurips.cc/paper/2020/hash/ 3f5ee243547dee91fbd053c1c4a845aa-Abstract.html.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rosenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tiwary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Majumder</surname>
          </string-name>
          , L. Deng, MS MARCO:
          <article-title>A human generated machine reading comprehension dataset</article-title>
          ,
          <source>in: Proceedings of CoCo@NIPS</source>
          <year>2016</year>
          , volume
          <volume>1773</volume>
          , CEUR-WS.org,
          <year>2016</year>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1773</volume>
          /CoCoNIPS_2016_paper9.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>K.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          , T. Liu,
          <article-title>MPNet: Masked and permuted pre-training for language understanding</article-title>
          ,
          <source>in: Proceedings of NeurIPS</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>NeurIPS</given-names>
            <surname>Foundation</surname>
          </string-name>
          ,
          <year>2020</year>
          . URL: https: //proceedings.neurips.cc/paper/2020/hash/c3a690be93aa602ee2dc0ccab5b7b67e-Abstract.html.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Neumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>King</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Beltagy</surname>
          </string-name>
          , W. Ammar,
          <article-title>ScispaCy: Fast and robust models for biomedical natural language processing</article-title>
          ,
          <source>in: Proceedings of BioNLP@ACL</source>
          <year>2019</year>
          , ACL,
          <year>2019</year>
          , pp.
          <fpage>319</fpage>
          -
          <lpage>327</lpage>
          . doi:
          <volume>10</volume>
          .18653/V1/W19-5034.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.</given-names>
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tonellotto</surname>
          </string-name>
          , S. MacAvaney, I. Ounis,
          <article-title>PyTerrier: Declarative experimentation in python from BM25 to dense retrieval</article-title>
          ,
          <source>in: Proceedings of CIKM</source>
          <year>2021</year>
          , ACM,
          <year>2021</year>
          , pp.
          <fpage>4526</fpage>
          -
          <lpage>4533</lpage>
          . doi:
          <volume>10</volume>
          .1145/3459637.3482013.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>O.</given-names>
            <surname>Khattab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singhvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Maheshwari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Santhanam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vardhamanan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Haq</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          , T. T. Joshi,
          <string-name>
            <given-names>H.</given-names>
            <surname>Moazam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharia</surname>
          </string-name>
          , C. Potts,
          <article-title>DSPy: Compiling declarative language model calls into self-improving pipelines</article-title>
          ,
          <source>arXiv 2310.03714</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2310.03714.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>L.</given-names>
            <surname>Gienapp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Scells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Deckers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kiesel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Syed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zuccon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hagen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <article-title>Evaluating generative ad hoc information retrieval</article-title>
          ,
          <source>in: Proceedings of SIGIR</source>
          <year>2024</year>
          , ACM,
          <year>2024</year>
          . doi:
          <volume>10</volume>
          .1145/3626772.3657849.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>D.</given-names>
            <surname>Arora</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Chowdhury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Natarajan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sinha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <article-title>GAR-meets-RAG paradigm for zero-shot information retrieval</article-title>
          ,
          <source>arXiv 2310.20158</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2310.20158.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Singhvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shetty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Potts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharia</surname>
          </string-name>
          ,
          <string-name>
            <surname>O. Khattab,</surname>
          </string-name>
          <article-title>DSPy assertions: Computational constraints for self-refining language model pipelines</article-title>
          ,
          <source>arXiv 2312.13382</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2312.13382.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <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</article-title>
          ,
          <string-name>
            <surname>ACL</surname>
          </string-name>
          , Barcelona, Spain,
          <year>2004</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>81</lpage>
          . URL: https://aclanthology.org/W04-1013.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>