<!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>H. Ivison, Y. Wang, V. Pyatkin, N. Lambert, M. Peters, P. Dasigi, J. Jang, D. Wadden, N. A. Smith,
I. Beltagy, H. Hajishirzi, Camels in a changing climate: Enhancing lm adaptation with tulu</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.18653/v1/2020.emnlp-demos.6</article-id>
      <title-group>
        <article-title>Overview of the Preference Prediction Task at the ELOQUENT 2025 lab for evaluating generative language model quality</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vladislav Mikhailov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ekaterina Artemova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zoia Butenko</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lilja Øvrelid</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Erik Velldal</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Toloka AI</institution>
          ,
          <addr-line>Amsterdam</addr-line>
          ,
          <country country="NL">Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Oslo</institution>
          ,
          <addr-line>Oslo</addr-line>
          ,
          <country country="NO">Norway</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>2</volume>
      <issue>2023</issue>
      <fpage>38</fpage>
      <lpage>45</lpage>
      <abstract>
        <p>The Preference Prediction shared task, part of the ELOQUENT Lab at CLEF-2025, challenges participants to build systems that simulate human judgment in evaluating pairs of LLM-generated responses. This novel task includes two sub-tasks. The first sub-task requires predicting which of two model responses humans prefer, using an accuracy metric. The second sub-task extends the first one by asking systems to provide natural language explanations for their predictions, automatically evaluated through standard NLG metrics and an LLM-as-a-judge approach. This overview paper summarizes the task design, evaluation methods, participation statistics, baseline performance, and lessons learned. We discuss the system performance in both sub-tasks. The results show room for improvement in generating coherent and human-like explanations, despite acceptable performance in the preference prediction.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Large language models</kwd>
        <kwd>Evaluation</kwd>
        <kwd>Preference prediction</kwd>
        <kwd>Human explanation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Side-by-side evaluation has become a widely adopted paradigm for assessing how well large language
models (LLMs) align with human preferences across various natural language tasks. Generally, human
annotators compare two LLM-generated responses to a prompt and indicate which answer is the best
based on criteria such as coherence, helpfulness, factuality, and safety. To mitigate the high cost and
scalability challenges of collecting human judgments, recent research has focused on developing “judge”
models that can automatically predict human preferences with increasing accuracy. Notable eforts
include RewardBench [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and MT-Bench with Chatbot Arena [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], which propose benchmarks and
evaluation protocols to assess the reliability of automated judging. These studies demonstrate that
LLMs are increasingly capable of approximating human preferences, but also raise questions about
consistency and robustness across domains.
      </p>
      <p>
        Despite progress in preference prediction, the ability of LLMs to explain why a particular response
should be preferred remains underexplored. Recent work has highlighted that LLM judges may exhibit
unfairness or instability when tasked with evaluative reasoning [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and new benchmarks such as
JudgeBench [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] seek to explicitly measure the interpretability and justification quality of these systems.
Understanding not only what prediction a judge model makes but also why it makes that prediction is
critical for fostering transparency and alignment in AI systems. This shared task addresses this gap by
evaluating not only the correctness of preference predictions but also the quality of natural language
explanations generated by the participants’ systems.
      </p>
      <p>The first year of the Preference Prediction 1 tests the capability of systems to predict human preferences
for diferent outputs from LLMs and explain their predictions with respect to five criteria: relevance,
naturalness, truthfulness, safety, and overall quality. This task ofers two sub-tasks:
2. Preference prediction &amp; explanation generation. Predict human preferences between two</p>
      <p>LLM responses with respect to the criteria and explain the system’s predictions.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Dataset</title>
      <sec id="sec-2-1">
        <title>2.1. Machine-generated Data Collection</title>
        <sec id="sec-2-1-1">
          <title>Model</title>
          <p>GPT-4o
Mistral-7B-IT
Llama-3-70B-IT
tulu-2-dpo-70b
Claude 3.7 Sonnet</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Base</title>
          <p>GPT-4
Mistral-7B-v0.3
Llama-3-70B
Llama-2-70B
N/A</p>
        </sec>
        <sec id="sec-2-1-3">
          <title>License</title>
          <p>
            OpenAI
Apache 2.0
LLaMA 3
Apache 2.0
Anthropic
Hurst et al. [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ]
          </p>
          <p>
            Jiang et al. [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ]
Grattafiori et al. [7]
          </p>
          <p>Ivison et al. [8]</p>
          <p>Anthropic [9]
1http://eloquent-lab.github.io/task-preference-prediction/</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Response Generation</title>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Data Labeling</title>
        <p>We conducted an in-house annotation to label the response pairs. The annotation team consisted of a
team leader, with a near-native proficiency in English and a background in computational linguistics,
and 15 native English-speaking annotators who had experience creating data sets for learning from
human feedback and for explainable AI methods. The team leader manually checked the annotations
and exchanged feedback with the annotators. The average number of tasks completed by an annotator
in the final dataset was 87. The average pay rate was $15/hour.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Annotation Schema</title>
        <p>The annotation task consisted of two sub-tasks:
• Selecting the better of two LLM responses based on five evaluation criteria;
• Providing a written explanation for each judgment.</p>
        <p>The annotators were asked to evaluate each criterion independently, selecting the better response for
that specific criterion without considering their judgments for other criteria. For each criterion, they
could choose among four options:
• A is better,
• B is better,
• Both are good,
• Both are bad.</p>
        <p>We used the following set of evaluation criteria:
• Relevance: Which response better follows the prompt and completes the user’s request?
• Naturalness: Which response is more human-like?
• Truthfulness: Which response is more truthful?
• Safety: Which response is less harmful?
• Overall quality: Which response is best overall?</p>
        <p>The prompt and responses were displayed side by side in a web-based interface, with radio buttons
for each criterion and a text field for explanations.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Evaluation</title>
      <p>Dataset and codebase Our shared task dataset is created as part of Primeape,2 a novel
benchmark of human-annotated preferences and explanations for evaluating LLM judges. The
dataset is served as the development and private test set.3 We ofer a baseline based on
meta-llama/Llama-3.1-8B-Instruct,4 which is utilized as a judge LLM in a zero-shot regime.
Our baseline and evaluation codebase is available in the ELOQUENT 2025 GitHub repository.5
Subtask 1 was evaluated using accuracy across five criteria: relevance, naturalness, truthfulness,
safety, and overall quality. For each instance, systems were required to select the preferred response,
and their predictions were compared to human-annotated preferences for each criterion.
Subtask 2 extended Subtask 1 by requiring systems to also generate natural language explanations
for their predictions. The explanation quality was assessed using multiple standard language generation
evaluation metrics: BERTScore and ROUGE-L were used to measure lexical and semantic similarity
with human-written reference explanations, while an LLM-as-a-judge framework provided a more
interpretive assessment. The latter was implemented via a custom evaluation script that constructs a
detailed prompt in which a large language model (LLM) is instructed to assess whether an AI-generated
explanation aligns with the human rationale. The prompt includes the user instruction, outputs from
two assistants, the AI system’s decision and explanation, and the human judgment. The LLM is asked
to ignore irrelevant biases such as response order and length and to output a verdict in the form of
[[Yes]] or [[No]]. These outputs are then used to compute alignment scores as the percentage of
the system-generated explanations that align with the human-written explanations.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Participant Submissions</title>
      <p>Subtask 1: Preference Prediction The first subtask evaluated systems on their ability to predict
human preferences across five criteria: relevance, naturalness, truthfulness, safety, and overall quality.
2This is ongoing work on multilingual human preference prediction and explanation. The English subset is created as part of
the Preference Prediction shared task. Data collection and annotation will be documented in detail in an upcoming paper. To
be available at https://github.com/Toloka/primeape.
3https://huggingface.co/datasets/Eloquent/preference_prediction
4https://huggingface.co/meta-llama/Llama-3.1-8B-Instruct
5https://github.com/eloquent-lab/eloquent-lab.github.io/tree/main
See Table 3 for the subtask results. The top-performing system was submitted by VerbaNexAI [11],
achieving the highest average accuracy of 56.99%, with particularly strong performance in truthfulness
(75.16%) and safety (94.15%). The UTK team [12] secured second place with an average accuracy of
38.72%, outperforming the baseline in all categories, most notably in relevance and naturalness. The
baseline model, based on simple prompting without fine-tuning, achieved an average accuracy of 29.70%.
Although the FHS team submitted strong results (average accuracy of 53.89%), their submission was
received after the deadline and was not included in the oficial ranking.</p>
      <p>Team
VerbaNexAI
UTK
Baseline</p>
      <p>Avg. (Acc./ROUGE-L/BERTScore/LLM-Judge)
56.99 / 20.04 / 87.00 / 33.04
38.72 / 9.00 / 83.46 / 18.38
29.70 / 8.40 / 83.13 / 24.27</p>
      <sec id="sec-4-1">
        <title>Subtask 2: Preference Prediction &amp; Explanation Generation The second subtask extended the</title>
        <p>evaluation to include explanation generation, with systems assessed across four metrics: accuracy,
ROUGE-L, BERTScore, and an LLM-as-a-judge evaluation (using GPT-4o). See Table 4 for the subtask
results. VerbaNexAI again achieved top performance across all criteria, with an average accuracy of
56.99%, and strong explanation quality as reflected in high BERTScores (87.00%) and favorable
LLMas-a-judge ratings (33.04). Their explanations were particularly strong in the safety and truthfulness
categories. UTK placed second with a lower average accuracy (38.72%) and explanation metrics slightly
behind VerbaNexAI, but ahead of the baseline. The baseline system performed reasonably in BERTScore
(83.13%) but struggled in accuracy (29.70%) and LLM-as-a-judge scores (24.27). The final ranking was
determined using a Borda count [13, 14], with VerbaNexAI achieving a top performance.</p>
        <sec id="sec-4-1-1">
          <title>4.1. System description</title>
          <p>Subtask 1: Preference Prediction VerbaNexAI employed a lightweight in-context learning approach
without any fine-tuning. Their system used meta- llama/Llama-3.2-1B-Instruct for generation
and facebook/bart-large-cnn for summarization. To construct prompts, they used sentence
embeddings generated by all-MiniLM-L6-v2 to retrieve the most similar examples from a training
pool. These examples were summarized before being inserted into the final few-shot prompt. A custom
system instruction guided the model in generating preference judgments and explanations.
Postprocessing involved parsing model outputs with regular expressions, comparing predicted preferences
to ground truth, and computing cosine similarity between explanation embeddings. The system was
notable for its modular architecture, retrieval-augmented prompting, and compact model size (100M–1B
parameters), achieving the best overall performance in both sub-tasks.</p>
          <p>Team UTK used a fine-tuning approach based on unsloth/llama-3-8b-Instruct-bnb-4bit,
applying QLoRA (Quantized Low-Rank Adaptation) for eficient adaptation. They trained the model
on the shared task validation dataset using a structured setup that included LoRA rank 64, attention
and feed-forward projection tuning,mixed precision (FP16), gradient checkpointing, batch size 2 with
accumulation for efective batch size of 8, trained over 3 epochs, 8-bit AdamW optimizer and a sequence
length of 2048 tokens. The training was conducted on a single NVIDIA H100 (80GB) GPU. No ensembling
or post-processing techniques were used; predictions were directly generated from the fine-tuned model.
This approach performed well across multiple criteria, especially in relevance and naturalness.</p>
          <p>The FHS team (not ranked) submitted a multi-headed classification model built on
google-bert/bertbase-uncased, fine-tuned on UltraFeedback and the shared task development split. Each model head
specialized in one of the five preference fields. Their approach was minimalist and highly
parametereficient (100M–1B), focused on instruction tuning without any generation component. While their
system delivered strong scores—especially in truthfulness and naturalness—it was submitted after the
oficial deadline and thus excluded from final rankings.</p>
          <p>Subtask 2: Preference Prediction with Explanation Generation VerbaNexAI submitted the
topperforming system for Subtask 2, utilizing a lightweight in-context learning approach without any
finetuning. Their solution employed the meta-llama/Llama-3.2-1B-Instruct model for generating
both preference predictions and explanations, and used facebook/bart-large-cnn for
summarization. To construct few-shot prompts, sentence embeddings were computed using all-MiniLM-L6-v2,
and the most relevant training examples were retrieved and compressed through summarization before
inclusion in the prompt. A custom system instruction guided generation. Post-processing involved
regular expression parsing of outputs and computing cosine similarity between explanation embeddings
for evaluation. No ensembling or model fine-tuning was used. The system relied entirely on models
in the 100M–1B parameter range and achieved the highest average performance across all metrics,
including accuracy, ROUGE-L, BERTScore, and LLM-as-a-judge scores.</p>
          <p>Team UTK submitted a fine-tuned model based on unsloth/llama-3-8b-Instruct-bnb-4bit,
part of the LLaMA-3 family. Their system was developed using QLoRA (Quantized Low-Rank
Adaptation), enabling eficient finetuning on resource-constrained hardware. The model was trained on the
2025_validation dataset with the following configuration:
• LoRA Parameters: Rank = 64; target modules = [q_proj, k_proj, v_proj, o_proj,
gate_proj, up_proj, down_proj]; LoRA alpha = 64; dropout = 0
• Training Parameters: learning rate = 2e-4; optimizer = adamw_8bit; batch size = 2 with
gradient accumulation = 4; epochs = 3; sequence length = 2048; mixed precision (fp16); gradient
checkpointing enabled; warmup steps = 5
Training was performed on a single NVIDIA H100 GPU. No ensembling or post-processing (e.g.,
reranking or rescoring) was applied. All predictions and explanations were directly generated from
the fine-tuned model. The system used models in the 1B–8B parameter range and delivered strong
performance across all metrics, particularly in accuracy and BERTScore.
The Preference Prediction shared task at ELOQUENT 2025 introduced a novel two-part benchmark
to evaluate LLMs’ alignment with human preferences –not only in terms of prediction accuracy but
also in their ability to generate coherent and human-like justifications. Subtask 1 focused on predicting
human preference judgments across five fine-grained criteria, while Subtask 2 extended this challenge
by requiring natural language explanations for the predictions. The task attracted some participation,
with VerbaNexAI and UTK submitting high-performing systems based on in-context learning and
parameter-eficient fine-tuning strategies, respectively. The results highlighted meaningful progress
in preference modeling, particularly for the truthfulness and safety criteria. However, there remains
considerable room for improvement in generating explanations that align with humans, as evidenced
by the gap in the LLM-as-a-judge scores. We hope this shared task encourages future research at the
intersection of preference modeling and interpretability of LLM-based systems. The dataset, evaluation
tools, and baseline results released throughout this task ofer a foundation for continued development
in this research direction.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Declaration on Generative AI</title>
      <p>We used Grammarly6 to correct grammar, spelling, and phrasing errors in the text of this paper.
The authors reviewed and revised the GenAI tool’s suggestions, and take full responsibility for the
publication’s content.
2023, pp. 670–686. URL: https://aclanthology.org/2023.eacl-main.48/. doi:10.18653/v1/2023.
eacl-main.48.
[14] P. Colombo, N. Noiry, E. Irurozki, S. Clémençon, What are the best systems? new perspectives on
nlp benchmarking, Advances in neural information processing systems 35 (2022) 26915–26932.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lambert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Pyatkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Morrison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Miranda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chandu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dziri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          , et al.,
          <article-title>Rewardbench: Evaluating reward models for language modeling</article-title>
          ,
          <source>arXiv preprint arXiv:2403.13787</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zheng</surname>
          </string-name>
          , W.-L. Chiang,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-W.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Xing</surname>
          </string-name>
          , et al.,
          <article-title>Judging llm-as-a-judge with mt-bench and chatbot arena</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>36</volume>
          ,
          <year>2023</year>
          , pp.
          <fpage>46595</fpage>
          -
          <lpage>46623</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Sui</surname>
          </string-name>
          ,
          <article-title>Large language models are not fair evaluators</article-title>
          , in: L.
          <string-name>
            <surname>-W. Ku</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Martins</surname>
          </string-name>
          , V. Srikumar (Eds.),
          <source>Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          , Bangkok, Thailand,
          <year>2024</year>
          , pp.
          <fpage>9440</fpage>
          -
          <lpage>9450</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Montgomery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. Y.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cuadron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Popa</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Stoica</surname>
          </string-name>
          ,
          <article-title>JudgeBench: A benchmark for evaluating LLM-based judges</article-title>
          ,
          <source>arXiv preprint arXiv:2410.12784</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hurst</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lerer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Goucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Perelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ostrow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Welihinda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hayes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          , et al.,
          <source>GPT-4o System Card, arXiv preprint arXiv:2410.21276</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <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>Mensch</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>
          , D. de las Casas,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bressand</surname>
          </string-name>
          , G. Lengyel,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Saulnier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. R.</given-names>
            <surname>Lavaud</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Stock</surname>
            ,
            <given-names>T. L.</given-names>
          </string-name>
          <string-name>
            <surname>Scao</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>
          , Mistral 7b,
          <year>2023</year>
          . URL: https://arxiv.org/abs/2310.06825. arXiv:
          <volume>2310</volume>
          .
          <fpage>06825</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>