<!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>S. Kabongo)
 https://sites.google.com/view/simpletext-sota (J. D'Souza)</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Overview of the CLEF 2024 SimpleText Task 4: SOTA? Tracking the State-of-the-Art in Scholarly Publications</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jennifer D'Souza</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Salomon Kabongo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hamed Babaei Giglou</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yue Zhang</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Leibniz University of Hannover</institution>
          ,
          <addr-line>Hannover</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>TIB Leibniz Information Centre for Science and Technology</institution>
          ,
          <addr-line>Hannover</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Technische Universität Berlin</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>This paper presents an overview of the CLEF 2024 SimpleText Task 4 on SOTA? Tracking the State-of-the-Art in Scholarly Publications, asking systems to perform two tasks: 1) classification - given the full text of an AI scientific paper, classify whether the paper indeed reports model scores on benchmark datasets, and if so, 2) information extraction - extract all pertinent (Task, Dataset, Metric, Score) tuples from the content of the scientific paper to automatically populate leaderboards used to keep track on the latest and greatest AI models. We discuss the details of the task set-up. First, the “SOTA?” task corpus comprising over 14K AI scientific papers, their corresponding annotations, and detailed corpus statistics. Second, the Evaluation Metrics used and the online Codalab Evaluation Platform to accept participant submissions. Third, the Results of the runs submitted by our participants.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;information extraction</kwd>
        <kwd>leaderboards</kwd>
        <kwd>benchmarks</kwd>
        <kwd>artificial intelligence</kwd>
        <kwd>open research knowledge graph</kwd>
        <kwd>text mining</kwd>
        <kwd>natural language processing</kwd>
        <kwd>large language models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Task 1 on Content Selection: retrieve passages to include in a simplified summary.</p>
      <sec id="sec-1-1">
        <title>Task 2 on Complexity Spotting: identify and explain dificult concepts.</title>
      </sec>
      <sec id="sec-1-2">
        <title>Task 3 on Text Simplification : simplify scientific text.</title>
      </sec>
      <sec id="sec-1-3">
        <title>Task 4 on SOTA? : tracking the state-of-the-art in AI scholarly publications.</title>
        <p>
          This paper presents an overview of the fourth task in the SimpleText track at CLEF 2024, i.e. tracking
the state-of-the-art in scholarly publications. For a comprehensive overview of the other tasks, the
task overview papers on Task 1 [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], Task 2 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], and Task 3 [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], as well as the track overview paper [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ],
provide detailed information and further insights.
        </p>
        <p>
          Aligned with the aim of simplifying scientific texts, is the goal of generating structured summaries of
scientific knowledge [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] to enhance its machine-actionability. This entails making scholarly knowledge
more amenable to advanced information technology tools, which, particularly in the face of the current
proliferation of publications [
          <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
          ], can significantly aid readers in monitoring scientific advancements.
Related to the topic of monitoring scientific advancements is the concept of leaderboards in Artificial
Intelligence (AI) research. Leaderboards are platforms that keep track of scores reported by various
models introduced in the AI community in terms of certain integral elements: the models are evaluated
on specific benchmark datasets, the datasets address a specific task, and the model output is evaluated
by a performance metric [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. This information is generally buried within the discourse text scholarly
AI articles. Thus SimpleText in 2024 introduces a fourth task that handles the automatic text mining of
the (Task, Dataset, Metric, Score) tuples from AI articles to automatically build leaderboards. This new
task “Task 4: SOTA? Tracking the State-of-the-Art in Scholarly Publications” is explained in detail in
section 2.
        </p>
        <p>A total of 45 teams registered for our SimpleText track at CLEF 2024. A total of 20 teams submitted
207 runs in total for the Track, of which 2 teams submitted a total of 36 runs for Task 4.</p>
        <p>The rest of the paper is organized as follows: Section 2 outlines the overall task definition and
objectives (2.1), followed by an in-depth exploration of the task dataset and its statistics (2.2). This
section also discusses the use of the Codalab competition site for accepting participant submissions (2.3)
and concludes with the evaluation metrics used (2.4). Section 3 provides an overview of the classification
and information extraction methods adopted by the two teams. In Section 4, we present and discuss
the results of the oficial submissions. Finally, Section 5 concludes the paper with a summary of the
ifndings.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Task 4: SOTA? Tracking the State-of-the-Art in Scholarly</title>
    </sec>
    <sec id="sec-3">
      <title>Publications</title>
      <p>This section details Task 4: SOTA? on tracking the state-of-the-art in scholarly publications.</p>
      <sec id="sec-3-1">
        <title>2.1. Description</title>
        <p>In Artificial Intelligence (AI), a common research objective is the development of new models that can
report state-of-the-art (SOTA) performance. The reporting usually comprises four integral elements:
Task, Dataset, Metric, and Score. These (Task, Dataset, Metric, Score) tuples or (T, D, M, S) hence,
coming from various AI research papers go on to power leaderboards in the community. Leaderboards,
akin to scoreboards, traditionally curated by the community, are platforms displaying various AI model
scores for specific tasks, datasets, and metrics. Examples of such platforms include the benchmarks
feature on the Open Research Knowledge Graph and Papers with Code (PwC). Utilizing text mining
techniques allows for a transition from the conventional community-based leaderboard curation to an
automated text mining approach. Consequently, the goal of Task 4: SOTA? is to develop systems that
can classify whether a scholarly article provided as input to the model reports a (T, D, M, S) or not. And
for articles reporting (T, D, M, S), extract all the relevant ones from the paper text.</p>
        <p>The Task 4: SOTA? task formalism is defined as follows: given the text of a scientific paper , the goal
is to extract its Leaderboards , where  = {1, ..., } and  can have between one to an undefined
number of Leaderboards. Each Leaderboard  comprises the (, , , ) quadruple.</p>
        <p>This task was divided into two separate evaluation phases:
Evaluation Phase I. Few-shot (T,D,M,S) extraction: Systems are expected to identify whether an
incoming AI paper reports leaderboards or not; and for paper’s reporting leaderboards, extract all the
pertinent (T, D, M, S) quadruples. The “few-shot” aspect of this subtask is that it involves (T, D, M)
labels previously seen in the training dataset.</p>
        <p>Evaluation Phase II. Zero-shot (T,D,M,S) extraction: This is similar to Subtask 4.1, but involves a new
test dataset containing (T, D, M) tuples that were not seen in the training set, testing the system’s ability
to handle zero-shot scenarios.</p>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Dataset</title>
        <p>
          The training and test datasets for Task 4: SOTA? were derived from the community-curated (T, D, M, S)
annotations of thousands of AI articles available on https://paperswithcode.com/ (PwC) (CC BY-SA).
We used the dataset from our prior work, specifically the PwC data downloaded on December 09, 2023
[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. The corpus included over 8,000 articles, with 7,987 used for training and 994 for testing, divided
into 751 for the few-shot setting and 241 for the zero-shot setting. While the annotations came from
PwC, the full-text of the articles was sourced from the arXiv preprint server under CC-BY licenses. Each
article in the dataset is available in TEI XML format, complete with one or more (T, D, M, S) annotations
from PwC. The complete Task 4: SOTA? dataset is publicly released on GitHub under the CC-BY-SA 4.0
license, accessible at https://github.com/jd-coderepos/sota.
        </p>
        <p>Another important subset of our dataset, in addition to corpus with (T, D, M, S) annotations, was the
“no leaderboards papers” i.e. compiling a set of AI papers that did not report leaderboards. We included
a set of approximately 4,401 and 648 articles that do not report leaderboards into the train and test
sets, respectively. These articles were randomly selected by leveraging the arxiv category feature, then
ifltering it to papers belonging to domains unrelated to AI/ML/Stats. These articles were annotated
with the unanswerable label. Thus given the overall dataset, systems could perform the expected task
i.e. classification and information extraction.
2.2.1. Dataset Statistics
We now provide detailed statistics of our corpus, focusing on the granularity of diferent annotation
counts and coverage of the annotation labels.</p>
        <p>Overall, the train and validation datasets contained 12,288 and 100 papers, respectively. The train
dataset included 7,936 papers annotated with leaderboards, while the remaining 4,352 papers lacked
such annotations and were marked as "unanswerable." The validation dataset featured 51 papers with
leaderboard annotations and 49 without. In the few-shot test dataset for evaluation phase 1, there were
1,401 papers, split between 753 with leaderboards and 648 marked as "unanswerable." The zero-shot test
dataset for evaluation phase 2 comprised 789 papers, with 241 having leaderboard annotations and 548
labeled as "unanswerable."</p>
        <p>Table 1 shows the counts of the unique (Task, Dataset, Metric) entities or elements in the Task 4:
SOTA? dataset.1 The novelty is most pronounced in Datasets, followed by Metrics, and then Tasks.
This novelty partially stems from the community-curated annotations in the PwC, which result in
unnormalized labels. For instance, the metric “F1-score” might be recorded as “F1,” “F-score,” or
“F-measure,” and each variation is considered a unique Metric label. This diversity aims to mirror
the variability seen in scientific papers, where, to our knowledge, there is no standardized naming
convention for these entities. As SOTA? focuses on information extraction, we intend for the variety of
community-curated annotations to reflect the terminology used in the source papers. However, this
diversity might also mirror the annotators’ preferences within the PwC, and the annotated dataset did
not guarantee uniformity.</p>
        <p>Tables 2 and 3 display the top 10 most frequent (Task, Dataset, Metric) annotations in the SOTA?
dataset, both as individual elements and as combined triples. This may also indicate a prevailing research
trend within the scientific community: “Image Classification” is a commonly addressed task, and the
1Since the Score element varies continuously, we do not consider counting unique occurrences as a valid statistic for the
Task 4: SOTA? dataset.
“ImageNet” dataset is frequently used to develop or evaluate systems, often employing variants of the
“accuracy” metric.</p>
        <p>As alluded to earlier, the Task 4: SOTA? dataset does not guarantee that the community curated PwC
(T, D, M, S) annotations for each respective paper matches with the text used in the source scientific
article. With the statistics shown in Table 4, we ofer insights to what extent of in what proportion
of the annotations, the respective (T, D, M, S) labels were found in the underlying source text across
the Train and the two Test datasets. In the training dataset, the occurrence of annotation labels in
the accompanying paper’s full text varies by category: 60.24% for Tasks, 58.86% for Scores, 45.48% for
Dataset Count Parameter
Unique Tasks per Paper
Unique found-in-paper Tasks per Paper
Ratio Tasks
Unique Datasets per Paper
Unique found-in-paper Datasets per Paper
Ratio Datasets
Unique Metrics per Paper
Unique found-in-paper Metrics per Paper
Ratio Metrics
Unique Scores per Paper
Unique found-in-paper Scores per Paper
Ratio Scores</p>
        <p>Train
Datasets, and 42.69% for Metrics. This data indicates that Metrics exhibit the greatest inconsistency
in annotation labels, followed by Datasets, Scores, and Tasks. Similar patterns were reflected in the
Test datasets. We ofer the reader this perspective in interpreting the performance scores obtained by
the two participants in this task–this year’s Task 4: SOTA? dataset presents the most variability in
annotations in the training and evaluation of participant systems which in turn can account for lower
reported scores.</p>
      </sec>
      <sec id="sec-3-3">
        <title>2.3. Codalab Competition Site</title>
        <p>
          Automated evaluations for the participants’ systems were implemented via the Codalab competitions’
website [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. CodaLab is well-known for hosting a variety of machine learning and data science
competitions. It provides a comprehensive environment where competition organizers can manage
entries, participants can submit solutions, and results can be evaluated automatically based on predefined
criteria.
2.3.1. Setup
To configure Task 4: SOTA? on CodaLab, we followed the oficial step-by-step guide guide. In the main
configuration file, competition.yaml, we outlined the competition’s evaluation phases as follows:
1. Practice Phase: This initial phase allows participants to make submissions on the development
set, testing for valid file formats and verifying that the system returns the expected scores.
2. Evaluation Phases: We established two main evaluation phases for the task:
• Evaluation Phase 1: Starting at midnight on April 23, 2024, and transitioning directly into
        </p>
        <p>Evaluation Phase 2.
• Evaluation Phase 2: Beginning at midnight on April 29, 2024, and concluding at midnight
on May 4, 2024.</p>
        <p>During each phase, competition organizers can upload the respective phase’s test dataset annotations
to CodaLab and assign them to the designated phase. The test dataset annotations remain hidden from
the participants. Additionally, a custom scoring program, written in Python, can also be associated with
each evaluation phase. Participants then for the current running evaluation phase can upload their
system output in the designated format prescribed by the competition organizers. We detail the SOTA?
submission format next.
2.3.2. Submission Format
Participants were required to generate a submission folder containing the annotations in a specified
output format, based on the input data provided. The input data consisted of a main folder with several
subfolders, each labeled with a unique article ID. Each subfolder included the full text of an AI paper
in “tei.xml” format. Participants were to apply their systems to this dataset and produce an output
folder mirroring the input structure, with identically numbered subfolders to ensure each article could
be uniquely identified during evaluation. Each output subfolder was expected to contain a file named
“annotations.json,” which either contained (T, D, M, S) annotations or the string “unanswerable” if the
system determined that the input paper did not report a leaderboard.
(T, D, M, S) annotations format. For papers with leaderboards, their annotations were expected in
a json file per the format shown in Figure 1.</p>
        <p>Our competition site is now live and can be accessed at https://codalab.lisn.upsaclay.fr/competitions/
16616. Although the two oficial evaluation phases have concluded, the site will continue to operate
indefinitely in a post-competition phase, hosting the zero-shot evaluation dataset.</p>
      </sec>
      <sec id="sec-3-4">
        <title>2.4. Evaluation Metrics</title>
        <p>We conducted three main categories of evaluations.</p>
        <p>
          1. Classification Accuracy : This metric measured the accuracy with which the participant systems
identified the “unanswerable” papers i.e. papers without leaderboards compared with the
goldstandard.
2. Summarization Rouge: The ROUGE metrics [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] are commonly used for evaluating the quality
of text summarization systems. ROUGE-1 measures the overlap of unigram (single word) units
between the generated summary and the reference summary. ROUGE-2 extends this to measure
the overlap of bigram (two consecutive word) units. ROUGE-L calculates the longest common
subsequence between the generated and reference summaries, which takes into account the order
of words. ROUGE-LSum is an extension of ROUGE-L that considers multiple reference summaries
by treating them as a single summary. These metrics provide a quantitative assessment of the
similarity between the generated and reference summaries, helping researchers and developers
evaluate and compare the efectiveness of diferent summarization approaches. They have become
widely used benchmarks in the field of automatic summarization. We treated the (T, D, M, S)
extraction task as analogous to a summarization objective and hence reported system overall
extraction performance based on the ROUGE summarization metrics.
3. Per (T, D, M, S) Element-wise Extraction F1-score: In this evaluation category, we evaluated
the model JSON output in a fine-grained manner w.r.t. each of the individual (T, D, M, S) elements
and overall for which we reported the results in terms of the standard recall, precision, and F1
score. In addition, these element-wise extraction evaluation results are reported using exact
match of the extracted strings with the gold-standard as well as using partial match between the
        </p>
        <p>extracted string and the gold-standard. The partial matches were computed using https://github.
com/seatgeek/thefuzz python library. Referring back to Figure 1 for the expected (T, D, M, S)
annotation format, the evaluation script was written to handle the fact that predicted leaderboards
could exceed or be less than the total number of gold-standard leaderboards. Additionally that
the order of (T, D, M, S) leaderboards in the system predictions was not expected to match the
order of the (T, D, M, S) leaderboards in the gold-standard since there was no precendence format
prespecified. To handle this, the script operates in two steps: it first compares each predicted (T,
D, M, S) unit to the gold standard to find the best match, and then it calculates the individual
element-wise extraction measures to determine the overall system recall, precision, and F1-score.</p>
        <p>The oficial SimpleText Task 4: SOTA? evaluation script is publicly released online.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Task 4: SOTA? Participant Approaches</title>
      <p>In this section, we discuss participant submissions to “Task 4: SOTA? Tracking the State-of-the-Art in
Scholarly Publications” task of the SimpleText track at CLEF 2024. A total of 2 teams submitted 36 runs
in total.</p>
      <p>AMATU by Staudinger et al. [15] submitted a total of three runs for the few-shot evaluation phase
of Task 4. They submitted nine runs for the zero-shot evaluation phase of Task 4. Their general
approach to extract the (T, D, M, S) annotations were in two main categories: 1) a pure pattern-based
approach inspired after AxCell [16], and 2) an AI-based approach using LLMs with a zero-shot prompt
and a few-shot prompt tested for GPT-3.5 [17] and Mistral-7B [18]. For the latter category, they also
experimented with variants on the input scholarly article text from which the (T, D, M, S) annotations
were expected to be extracted. This we generally refer to as the context. They tried two context variants:
1) full paper text and 2) only the text from sections referring to experiments and results, in addition to
the abstract, which was pre-extracted inspired by the Argumentative Zoning (AZ) method [19].
L3S by Kabongo et al. [20] submitted a total of 12 runs for the few-shot evaluation phase of Task 4.
They submitted 12 runs for the zero-shot evaluation phase of Task 4. Their approach entailed leveraging
the FLAN-T5 [21] strategy which encompassed fine-tuning a pre-trained LLM with a standard set of
instructions to better equip them to handle various tasks. Leveraging the applicable instructions from
the FLAN-T5 collection, they fine-tuned LLMs, viz. Mistral-7B and LLaMA 2 [ 22], to make them better
suited to handle the (T, D, M, S) extraction task. Furthermore, they also tested the most recent proprietary
GPT models viz. GPT-4 [23] and GPT-4o. Finally, as the information extraction context they tried 3
diferent methods: DocTAET ((T)-title, (A)- abstract, (E)-experimental setup, and (T)-tabular information
parts of the full-text), DocREC (text selected from the sections named (R)-results, (E)-experiments, and
(C)-conclusions), and DocFULL (full paper text). Resultingly, for each evaluation phase they submitted
a total of 4 models x 3 contexts = 12 runs.</p>
      <p>We encourage readers to refer to the referenced participant papers for detailed explorations of their
approaches and the motivations behind their systems.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Task 4: SOTA? Results and Discussion</title>
      <p>For Team L3S, in both the evaluation phases, their model results showed that minimal finetuning of
relatively smaller LLMs, specifically Mistral-7B, equips them for (T, D, M, S) extraction task surpassing
the performance of LLMs, specifically the latest GPT-4 proprietary models, with a significantly more
vast parameter space. The overall best results even for the extraction of the (T, D, M, S) elements was
obtained by Mistral given the DocTAET context.</p>
      <p>Comparing Team AMATU and Team L3S, none of the systems from the former team were finetuned
to the task. Thus Team AMATU presents novel insights into the community to leveraging LLM’s
efectively for the (T, D, M, S) extraction objective using clever prompt engineering strategies that shows
comparable performans to the latter teams’ computationally intensive finetuning approach. It maybe
that finetuning would be essential to create the most optimal model, however, from the team’s solutions
the importance prompt engineering for efective downstream performance is clearly emphasized.</p>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusions</title>
      <p>Few-shot</p>
      <p>M
This concludes the results for the CLEF 2024 SimpleText Task 4: SOTA? on tracking the state-of-the-art
in scholarly publications. Our main findings are the following: First, efective prompting paradigms
should be a go-to strategy to test LLMs out-of-the-box for the SOTA? shared task objective. Second,
ifnetuning small-scale models makes them better able to handle the SOTA? objective than larger-scale
LLMs known for their generative AI abilities when simply applied to the IE task. Third, the paper
context over which the IE task is expected to be performed must have an ideal balance of length versus
selectivity of specific sections in the paper that indeed are highly likely to contain mentions of the (T, D,
M, S). On the extreme end of the spectrum, using the full paper text without efective context selection
hinders and seems to distract the LLM downstream IE task performance.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The “SOTA?” track as Task 4 within the SimpleText 2024 evaluation lab at CLEF 2024 has been jointly
funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – project number:
NFDI4DataScience (460234259) and the German BMBF project SCINEXT (01lS22070).
branches out, 2004, pp. 74–81.
[15] M. Staudinger, A. El-Ebshihy, A. M. Ningtyas, F. Piroi, A. Hanbury, AMATU@Simpletext2024: Are
LLMs alone any good for Scientific Entity Extraction?, in: G. Faggioli, N. Ferro, P. Galuščáková,
A. G. S. de Herrera (Eds.), Working Notes of CLEF 2024 - Conference and Labs of the Evaluation
Forum, CEUR Workshop Proceedings, CEUR-WS, Online, 2024.
[16] M. Kardas, P. Czapla, P. Stenetorp, S. Ruder, S. Riedel, R. Taylor, R. Stojnic, Axcell: Automatic
extraction of results from machine learning papers, in: Proceedings of the 2020 Conference on
Empirical Methods in Natural Language Processing (EMNLP), 2020, pp. 8580–8594.
[17] OpenAI, Gpt-3.5 turbo documentation, 2023. URL: https://platform.openai.com/docs/models/
gpt-3-5-turbo, accessed: 2024-06-10.
[18] A. Q. Jiang, A. Sablayrolles, A. Mensch, C. Bamford, D. S. Chaplot, D. d. l. Casas, F. Bressand,</p>
      <p>G. Lengyel, G. Lample, L. Saulnier, et al., Mistral 7b, arXiv preprint arXiv:2310.06825 (2023).
[19] S. Teufel, et al., Argumentative zoning: Information extraction from scientific text, Ph.D. thesis,</p>
      <p>Citeseer, 1999.
[20] S. Kabongo, J. D’Souza, S. Auer, Exploring the latest llms for leaderboard extraction, in: G. Faggioli,
N. Ferro, P. Galuščáková, A. G. S. de Herrera (Eds.), Working Notes of CLEF 2024 - Conference and
Labs of the Evaluation Forum, CEUR Workshop Proceedings, CEUR-WS, Online, 2024.
[21] H. W. Chung, L. Hou, S. Longpre, B. Zoph, Y. Tay, W. Fedus, Y. Li, X. Wang, M. Dehghani, S. Brahma,
et al., Scaling instruction-finetuned language models, Journal of Machine Learning Research 25
(2024) 1–53.
[22] H. Touvron, L. Martin, K. Stone, P. Albert, A. Almahairi, Y. Babaei, N. Bashlykov, S. Batra, P.
Bhargava, S. Bhosale, et al., Llama 2: Open foundation and fine-tuned chat models, arXiv preprint
arXiv:2307.09288 (2023).
[23] J. Achiam, S. Adler, S. Agarwal, L. Ahmad, I. Akkaya, F. L. Aleman, D. Almeida, J. Altenschmidt,
S. Altman, S. Anadkat, et al., Gpt-4 technical report, arXiv preprint arXiv:2303.08774 (2023).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          , E. SanJuan, S. Huet,
          <string-name>
            <given-names>H.</given-names>
            <surname>Azarbonyad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Di Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Vezzani</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kabongo</surname>
            ,
            <given-names>H. B.</given-names>
          </string-name>
          <string-name>
            <surname>Giglou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            , S. Auer,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kamps</surname>
          </string-name>
          ,
          <article-title>Clef 2024 simpletext track: Improving access to scientific texts for everyone</article-title>
          ,
          <source>in: Advances in Information Retrieval: 46th European Conference on Information Retrieval</source>
          ,
          <string-name>
            <surname>ECIR</surname>
          </string-name>
          <year>2024</year>
          , Glasgow, UK, March
          <volume>24</volume>
          -28,
          <year>2024</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>VI</given-names>
          </string-name>
          , Springer-Verlag, Berlin, Heidelberg,
          <year>2024</year>
          , p.
          <fpage>28</fpage>
          -
          <lpage>35</lpage>
          . URL: https://doi.org/10.1007/ 978-3-
          <fpage>031</fpage>
          -56072-
          <issue>9</issue>
          _4. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -56072-
          <issue>9</issue>
          _
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Oelen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Haris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stocker</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>K. E.</given-names>
          </string-name>
          <string-name>
            <surname>Farfar</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Vogt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Prinz</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Wiens</surname>
            ,
            <given-names>M. Y.</given-names>
          </string-name>
          <string-name>
            <surname>Jaradeh</surname>
          </string-name>
          ,
          <article-title>Improving access to scientific literature with knowledge graphs</article-title>
          ,
          <source>Bibliothek Forschung und Praxis</source>
          <volume>44</volume>
          (
          <year>2020</year>
          )
          <fpage>516</fpage>
          -
          <lpage>529</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kabongo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Prinz</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Jaradeh</surname>
            ,
            <given-names>K. E.</given-names>
          </string-name>
          <string-name>
            <surname>Farfar</surname>
          </string-name>
          ,
          <article-title>Orkg benchmarks</article-title>
          , in: S.
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Ilangovan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Stocker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Tiwari</surname>
          </string-name>
          , L. Vogt (Eds.), Open Research Knowledge Graph, Cuvillier, Göttingen, Germany,
          <year>2024</year>
          , pp.
          <fpage>49</fpage>
          -
          <lpage>56</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E.</given-names>
            <surname>SanJuan</surname>
          </string-name>
          , S. Huet,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kamps</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          ,
          <article-title>Overview of the clef 2024 simpletext task 1: Retrieve passages to include in a simplified summary</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Galuščáková</surname>
          </string-name>
          , A. G. S. de Herrera (Eds.),
          <source>Working Notes of CLEF 2024 - Conference and Labs of the Evaluation Forum, CEUR Workshop Proceedings</source>
          , CEUR-WS,
          <year>Online</year>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Azarbonyad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bertin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Augereau</surname>
          </string-name>
          ,
          <article-title>Overview of the CLEF 2023 SimpleText Task 2: Dificult Concept Identification and Explanation</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Galuščáková</surname>
          </string-name>
          , A. G. S. de Herrera (Eds.),
          <source>Working Notes of CLEF 2024 - Conference and Labs of the Evaluation Forum, CEUR Workshop Proceedings</source>
          , CEUR-WS,
          <year>Online</year>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bertin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>McCombie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kamps</surname>
          </string-name>
          ,
          <article-title>Overview of the CLEF 2023 SimpleText Task 3: Scientific text simplification</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Galuščáková</surname>
          </string-name>
          , A. G. S. de Herrera (Eds.),
          <source>Working Notes of CLEF 2024 - Conference and Labs of the Evaluation Forum, CEUR Workshop Proceedings</source>
          , CEUR-WS,
          <year>Online</year>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          , E. SanJuan, S. Huet,
          <string-name>
            <given-names>H.</given-names>
            <surname>Azarbonyad</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. M. D. Nunzio</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Vezzani</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kamps</surname>
          </string-name>
          ,
          <article-title>Overview of the CLEF 2024 simpletext track - improving access to scientific texts for everyone</article-title>
          , in: L.
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mulhem</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Quénot</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Schwab</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Soulier</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. M. D. Nunzio</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Galuščáková</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G. S. de Herrera</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Fifteenth International Conference of the CLEF Association (CLEF 2024), Lecture Notes in Computer Science (LNCS)</source>
          , Springer, Heidelberg, Germany,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Fortunato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. T.</given-names>
            <surname>Bergstrom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Börner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Helbing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Milojević</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Petersen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Radicchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sinatra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Uzzi</surname>
          </string-name>
          , et al.,
          <source>Science of science, Science</source>
          <volume>359</volume>
          (
          <year>2018</year>
          )
          <article-title>eaao0185</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bornmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Haunschild</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mutz</surname>
          </string-name>
          ,
          <article-title>Growth rates of modern science: a latent piecewise growth curve approach to model publication numbers from established and new literature databases</article-title>
          ,
          <source>Humanities and Social Sciences Communications</source>
          <volume>8</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Jochim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gleize</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bonin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ganguly</surname>
          </string-name>
          ,
          <article-title>Identification of tasks, datasets, evaluation metrics, and numeric scores for scientific leaderboards construction, in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Florence, Italy,
          <year>2019</year>
          . URL: https://aclanthology.org/P19-1513. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P19</fpage>
          -1513.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kabongo Kabenamualu</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Auer</surname>
          </string-name>
          ,
          <article-title>Efective context selection in llm-based leaderboard generation: An empirical study</article-title>
          ,
          <source>in: Proceedings of the 29th International Conference on Natural Language &amp; Information Systems</source>
          ,
          <year>2024</year>
          . URL: https://nldb2024.di.unito.it/.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pavao</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Guyon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.-C.</given-names>
            <surname>Letournel</surname>
          </string-name>
          , D.-T. Tran,
          <string-name>
            <given-names>X.</given-names>
            <surname>Baro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. J.</given-names>
            <surname>Escalante</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Escalera</surname>
          </string-name>
          , T. Thomas,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <article-title>Codalab competitions: An open source platform to organize scientific challenges</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>24</volume>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . URL: http://jmlr.org/papers/v24/
          <fpage>21</fpage>
          -
          <lpage>1436</lpage>
          .html.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Proposal, tracking and segmentation (pts): A cascaded network for video object segmentation</article-title>
          , arXiv preprint arXiv:
          <year>1907</year>
          .
          <volume>01203</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>C.-Y. Lin</surname>
          </string-name>
          ,
          <article-title>Rouge: A package for automatic evaluation of summaries</article-title>
          , in: Text summarization
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>