<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Team karami-kheiri at PAN: Enhancing Machine-Generated Text Detection with Ensemble Learning Based on Transformer Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mohammad Karami Sheykhlan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Saleh Kheiri Abdoljabbar</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mona Nouri Mahmoudabad</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Mohaghegh Ardabili</institution>
          ,
          <addr-line>Daneshgah St., Ardabil, 5619911367</addr-line>
          ,
          <country country="IR">Iran</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Tabriz</institution>
          ,
          <addr-line>Bahman Boulevard, Tabriz, 5166616471</addr-line>
          ,
          <country country="IR">Iran</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <abstract>
        <p>The advancement of large language models (LLMs) and their increasing utilization for text generation have raised significant concerns about misinformation and potential misuse. This research focuses on developing a dependable model to diferentiate between human-authored text and LLM-generated content. By employing transformer models and ensemble learning techniques, we aim to improve the accuracy and reliability of text classification. Our results indicate that the proposed model efectively identifies and categorizes texts, providing a valuable tool for addressing the challenges posed by the widespread use of LLM-generated text.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;PAN 2024</kwd>
        <kwd>Authorship verification</kwd>
        <kwd>Ensemble learning</kwd>
        <kwd>Transformers</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Recent advancements in LLMs, particularly with the development of sophisticated systems like GPT-3.5
and GPT-4, have revolutionized content creation across various fields, from advertising and news
writing to education and medical research. These models are now capable of generating text that closely
mimics human writing, enhancing productivity in numerous professional workflows. However, this
rapid integration comes with significant challenges, including the spread of misinformation [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], ethical
dilemmas [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and academic integrity issues [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ]. The ability of LLMs to produce highly convincing
but potentially misleading or inaccurate content raises concerns about their misuse in generating fake
news, deceptive social media posts, and even facilitating academic dishonesty [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. As such, it has
become increasingly important to develop reliable methods for distinguishing between human-authored
and machine-generated texts to mitigate these risks and ensure the responsible use of LLMs. In response
to these challenges, PAN@CLEF 2024 has introduced the Voight-Kampf Generative AI Authorship
Verification task.
      </p>
      <p>The detection of AI-generated text has become a critical area of research, driven by the need to
safeguard the integrity of information across digital platforms. Traditional approaches to text
verification, which rely heavily on stylistic and linguistic features, are often insuficient when faced with
the sophistication of modern LLMs. These models can generate content that not only mirrors human
writing but also adapts to various contexts and styles, making manual and even some automated
detection methods obsolete. Consequently, more advanced techniques are required to diferentiate
between human-authored and machine-generated text efectively.</p>
      <p>In this study, initially, we fine-tuned transformer models using the training dataset. This process
involved adjusting the model parameters to fit the specific characteristics of our dataset better, thereby
improving the model’s performance on our particular task. We then compared their accuracy with that
of a cumulative learning model. The results indicated that incorporating the cumulative learning model
improved predictive accuracy. This enhancement highlights the potential of cumulative learning in
refining the performance of transformer models and underscores its value in developing more reliable
AI systems for text classification tasks.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <p>
        In recent years, the field of AI-text generator detection has seen significant advancements, driven by the
increasing sophistication of LLMs such as GPT-3.5 and GPT-4. Early approaches focused on identifying
stylistic and lexical discrepancies between human-written and machine-generated texts. These methods
often utilized shallow machine learning techniques and handcrafted features, but their efectiveness
diminished as LLMs became more advanced. Islam et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] used nine traditional machine learning
models and two deep learning models to detect AI-generated texts. They found that the Extremely
Randomized Trees model provided better accuracy compared to the other models. In contrast, Prova [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
utilized both traditional models and transformer models for this task and found that the performance of
the transformer models was significantly better. Therefore, more recent research has shifted towards
leveraging deep learning models, particularly transformers, to improve detection accuracy. Alshammari
et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] employed a novel classifier using Transformer-based models AraELECTRA and XLM-R, which
significantly outperforms GPTZero and OpenAI Text Classifier, achieving up to 99% accuracy with the
integration of a Dediacritization Layer. Nitu and Dascalu [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] introduced a corpus of 60,000 Romanian
documents, encompassing both human-written and machine-generated texts across five domains. They
present two techniques for detecting machine-generated content: a Transformer-based model and a
machine-learning model leveraging linguistic features. The Transformer-based method achieved an F1
score of 0.96, outperforming the linguistic feature-based method in two domains. Additionally, the study
includes a text similarity analysis and SHAP analysis to identify key linguistic features influencing
the classifier’s decisions. Techniques such as fine-tuning pre-trained models on labeled datasets of
human and AI-generated text have shown promise. Additionally, ensemble learning methods, which
combine multiple model predictions to enhance robustness, have been explored as a way to address
the limitations of single-model approaches. Qu and Meng [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] achieved first place in Task 8 of SemEval
2024 by using an ensemble learning approach to detect machine-generated texts. Their innovative
method demonstrated superior performance in accurately distinguishing between human-written and
AI-generated content, setting a new benchmark in the field.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Task and Dataset</title>
      <p>With the rapid advancement and widespread adoption of LLMs, distinguishing between human- and
machine-authored texts has become increasingly challenging. Leveraging expertise in authorship
verification, the Generative AI Authorship Verification Task @ PAN, in collaboration with the
VoightKampf Task @ ELOQUENT Lab, aims to address this by having participants identify the human-written
text from a pair of texts. This builder-breaker setup will see PAN participants develop detection systems,
while ELOQUENT participants focus on creating text generation and obfuscation methods.</p>
      <p>
        The dataset includes various genres such as news articles, Wikipedia intro texts, and fanfiction,
sourced from ELOQUENT participants. Additionally, a bootstrap dataset containing real and fake news
articles from 2021 U.S. headlines is provided for training purposes. To access the dataset, participants
must register on TIRA [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and request access on Zenodo1. The dataset contains copyrighted material
and is restricted to research use only. The test data will be provided in a single JSONL file format, with
each line containing a pair of texts, and participants must identify which text is human-authored.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. System Overview</title>
      <sec id="sec-4-1">
        <title>4.1. Data preparation</title>
        <p>In this task, we focused on improving the classification of text by specifically ignoring newline characters
within the data while preserving all other information. This approach allows us to maintain the integrity
of the content while addressing the task as a classification problem. To achieve this, we utilized the
capabilities of three powerful transformer models: BERT, Roberta, and Electra. Each of these models
comes with its own tokenizer, which plays a crucial role in preparing the text for the binary classification
process. These models are well-regarded in the field of natural language processing for their efectiveness
in understanding and generating human-like text. Considering the inherent 512-token limit of these
models, we decided to focus on the first 512 tokens of each text sample. This decision was made to
ensure that our models could process the data eficiently without exceeding their maximum token
capacity. For text samples that exceeded 512 tokens, only the initial 512 tokens were included in the
analysis, while the remaining tokens were disregarded. This approach ensures that we work within
the constraints of the models while still capturing a significant portion of the text for classification
purposes.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Transformer-based Models</title>
        <p>
          BERT (Bidirectional Encoder Representations from Transformers), Roberta (Robustly Optimized BERT
Approach), and Electra (Eficiently Learning an Encoder that Classifies Token Replacements
Accurately) are three advanced transformer models that have significantly impacted the field of NLP. BERT,
introduced by Google, revolutionized NLP by utilizing bidirectional training, allowing the model to
understand the context of a word based on all its surroundings, leading to state-of-the-art performance
on various tasks. Roberta, a refinement of BERT by Facebook AI, enhanced the pre-training process by
using larger batches, more data, and longer training times, which resulted in improved performance
and robustness. Electra, also developed by Google, introduced a novel pre-training approach where
the model learns to distinguish real input tokens from "fake" ones generated by a separate generator
model. This method makes Electra more eficient and often faster to train compared to BERT, while
still achieving competitive or superior performance. Each of these models has its own tokenizer to
prepare text for analysis. These models apply to a variety of NLP tasks, ranging from text classification
tasks [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] to text summarization [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] and other tasks.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Ensemble learning</title>
        <p>Hard Ensemble Learning is an advanced technique in machine learning that involves combining multiple
models, referred to as base learners, to create a more powerful and robust predictive model. Unlike
conventional ensemble methods like bagging and boosting, which mainly aim to combine diverse but
weaker models, Hard Ensemble Learning incorporates several complex and high-performance models
to address dificult tasks. By harnessing the collective intelligence of various models, each trained on
distinct data aspects, this approach enhances overall predictive accuracy and generalization.</p>
        <p>In this study, we developed three transformer models: BERT, RoBERTa, and Electra. Each model was
ifne-tuned using the respective training dataset. Our objective with ensemble learning is to combine the
strengths of these models to improve overall system performance. Detailed specifics will be provided in
the following section.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiments</title>
      <sec id="sec-5-1">
        <title>5.1. Hyperparameter tuning and Evaluation</title>
        <p>In this study, we utilized Google Colaboratory’s GPU to fine-tune the BERT, Roberta, and Electra
models. Due to token constraints, we limited our consideration to 512 tokens. For all models, we set the
hyperparameter learning rate to 2e-5 and the epoch value to 10.</p>
        <p>
          In our study, we evaluated the system using the same metrics as previous PAN authorship verification
tasks [
          <xref ref-type="bibr" rid="ref14">14, 15, 16, 17</xref>
          ]. These metrics are:
• ROC-AUC: Measures the area under the Receiver Operating Characteristic curve to assess how
well the system distinguishes between diferent classes.
• Brier Score: Evaluates accuracy by looking at the complement of the mean squared loss.
• C@1: A modified accuracy score that assigns a score of 0.5 to non-answers and calculates the
average accuracy of the remaining answers.
• F1 Score: The harmonic mean of precision and recall, providing a balance between the two.
• F0.5u: A precision-weighted F measure that treats non-answers as false negatives, focusing more
on precision.
        </p>
        <p>• The arithmetic mean of all the metrics above.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Results</title>
        <p>Given LLMs’ complexity and human-like text generation, traditional feature extraction methods used in
tasks like Author Profiling [ 18] and Authorship Attribution [19], which previously produced acceptable
results, are no longer suficient. In this section, we present our experimental results on the
VoightKampf Generative AI Authorship Verification 2024 task using BERT, Roberta, Electra models, and
ensemble learning, which leverage the majority vote of the three models for test data samples. The test
samples included an ID, text1, and text2. Participants were required to identify which of text1 or text2
was authored by a human or a machine using numerical values in the is_human variable.</p>
        <p>We divided the dataset into 60%, 20%, and 20% for the training, validation, and testing phases,
respectively. In our approach to classifying test samples, we employed a straightforward method. If
the model determined that a human authored text1, we manually assigned a value less than 0.5 to the
is_human variable. Conversely, if the model determined that a human authored text2, we assigned
a value greater than 0.5 to the is_human variable. In cases where the model was unable to make a
decision, we assigned a value of 0.5 to the is_human variable.</p>
        <p>Table 1 shows the performance of the approaches used. The experimental results indicate that
the hard voting classifier approach is more efective in distinguishing between human-generated and
LLM-generated texts. Therefore, we employed the Ensemble learning model for evaluation on the final
test set. The performance of this approach on the final dataset is presented in Table 2.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>In this study, we addressed the challenge of distinguishing between human-written texts and those
generated by LLMs. Our approach leveraged Ensemble learning, incorporating fine-tuned versions
of BERT, Roberta, and Electra models. By utilizing these advanced transformer models and applying
meticulous fine-tuning on the provided dataset, we were able to enhance the accuracy and reliability of
our text classification system. Our findings underscore the potential of Ensemble learning combined
with transformer models in advancing the field of authorship verification and enhancing the detection
of AI-generated texts.
the Fifteenth International Conference of the CLEF Association (CLEF 2024), Lecture Notes in
Computer Science, Springer, Berlin Heidelberg New York, 2024.
[15] J. Bevendorf, M. Wiegmann, E. Stamatatos, M. Potthast, B. Stein, Overview of the Voight-Kampf
Generative AI Authorship Verification Task at PAN 2024, in: G. F. N. Ferro, P. Galuščáková, A. G. S.
de Herrera (Eds.), Working Notes of CLEF 2024 - Conference and Labs of the Evaluation Forum,
CEUR-WS.org, 2024.
[16] J. Bevendorf, M. Wiegmann, J. Karlgren, L. Dürlich, E. Gogoulou, A. Talman, E. Stamatatos,
M. Potthast, B. Stein, Overview of the “Voight-Kampf” Generative AI Authorship Verification
Task at PAN and ELOQUENT 2024, 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.org, 2024.
[17] A. A. Ayele, N. Babakov, J. Bevendorf, X. B. Casals, B. Chulvi, D. Dementieva, A. Elnagar, D. Freitag,
M. Fröbe, D. Korenčić, M. Mayerl, D. Moskovskiy, A. Mukherjee, A. Panchenko, M. Potthast,
F. Rangel, N. Rizwan, P. Rosso, F. Schneider, A. Smirnova, E. Stamatatos, E. Stakovskii, B. Stein,
M. Taulé, D. Ustalov, X. Wang, M. Wiegmann, S. M. Yimam, E. Zangerle, Overview of PAN 2024:
Multi-Author Writing Style Analysis, Multilingual Text Detoxification, Oppositional Thinking
Analysis, and Generative AI Authorship Verification, in: L. Goeuriot, P. Mulhem, G. Quénot,
D. Schwab, L. Soulier, G. M. D. Nunzio, P. Galuščáková, A. G. S. de Herrera, G. Faggioli, N. Ferro
(Eds.), Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of
the Fifteenth International Conference of the CLEF Association (CLEF 2024), Lecture Notes in
Computer Science, Springer, Berlin Heidelberg New York, 2024.
[18] H. B. Giglou, M. Rahgouy, T. Rahgooy, M. K. Sheykhlan, E. Mohammadzadeh, Author profiling: Bot
and gender prediction using a multi-aspect ensemble approach, in: L. Cappellato, N. Ferro, D. E.
Losada, H. Müller (Eds.), Working Notes of CLEF 2019 - Conference and Labs of the Evaluation
Forum, Lugano, Switzerland, September 9-12, 2019, volume 2380 of CEUR Workshop Proceedings,
CEUR-WS.org, 2019. URL: https://ceur-ws.org/Vol-2380/paper_231.pdf.
[19] M. Rahgouy, H. Giglou, T. Rahgooy, M. Sheykhlan, E. Mohammadzadeh, Cross-domain Authorship
Attribution: Author Identification using a Multi-Aspect Ensemble Approach, in: L. Cappellato,
N. Ferro, D. Losada, H. Müller (Eds.), CLEF 2019 Labs and Workshops, Notebook Papers,
CEURWS.org, 2019. URL: http://ceur-ws.org/Vol-2380/.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I.</given-names>
            <surname>Vykopal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pikuliak</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Srba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Moro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Macko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bielikova</surname>
          </string-name>
          ,
          <article-title>Disinformation capabilities of large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2311.08838</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Wahle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ruas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kirstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Gipp</surname>
          </string-name>
          ,
          <article-title>How large language models are transforming machineparaphrased plagiarism</article-title>
          ,
          <source>arXiv preprint arXiv:2210.03568</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shu</surname>
          </string-name>
          ,
          <article-title>Combating misinformation in the age of llms: Opportunities and challenges</article-title>
          ,
          <source>arXiv preprint arXiv:2311.05656</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>X.</given-names>
            <surname>Qu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <article-title>Tm-trek at semeval-2024 task 8: Towards llm-based automatic boundary detection for human-machine mixed text</article-title>
          ,
          <source>arXiv preprint arXiv:2404.00899</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Stokel-Walker</surname>
          </string-name>
          ,
          <article-title>Ai bot chatgpt writes smart essays-should academics worry?</article-title>
          ,
          <source>Nature</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Spiegel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Macko</surname>
          </string-name>
          , Kinit at semeval
          <article-title>-2024 task 8: Fine-tuned llms for multilingual machinegenerated text detection</article-title>
          ,
          <source>arXiv preprint arXiv:2402.13671</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sutradhar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Noor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Raya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Maisha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Farid</surname>
          </string-name>
          ,
          <article-title>Distinguishing human generated text from chatgpt generated text using machine learning</article-title>
          .
          <source>arxiv, arXiv preprint arXiv:2306.01761</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Prova</surname>
          </string-name>
          ,
          <article-title>Detecting ai generated text based on nlp and machine learning approaches</article-title>
          ,
          <source>arXiv preprint arXiv:2404.10032</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>H.</given-names>
            <surname>Alshammari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>El-Sayed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Elleithy</surname>
          </string-name>
          ,
          <article-title>Ai-generated text detector for arabic language using encoder-based transformer architecture</article-title>
          ,
          <source>Big Data and Cognitive Computing</source>
          <volume>8</volume>
          (
          <year>2024</year>
          )
          <fpage>32</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nitu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dascalu</surname>
          </string-name>
          ,
          <article-title>Beyond lexical boundaries: Llm-generated text detection for romanian digital libraries</article-title>
          ,
          <source>Future Internet</source>
          <volume>16</volume>
          (
          <year>2024</year>
          )
          <fpage>41</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kolyada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Grahm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Elstner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Loebe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hagen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <article-title>Continuous Integration for Reproducible Shared Tasks with TIRA.io</article-title>
          , in: J.
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Maistro</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Kruschwitz</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Caputo (Eds.),
          <source>Advances in Information Retrieval. 45th European Conference on IR Research (ECIR</source>
          <year>2023</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2023</year>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>241</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>M. K. Sheykhlan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Shafi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kosari</surname>
          </string-name>
          , Pars-hao:
          <article-title>Hate speech and ofensive language detection on persian social media using ensemble learning</article-title>
          ,
          <source>Authorea Preprints</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lapata</surname>
          </string-name>
          ,
          <article-title>Text summarization with pretrained encoders</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>08345</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. B.</given-names>
            <surname>Casals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dementieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Elnagar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Freitag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Korenčić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mayerl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mukherjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Panchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smirnova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Taulé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ustalov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          , E. Zangerle,
          <article-title>Overview of PAN 2024: Multi-Author Writing Style Analysis, Multilingual Text Detoxification, Oppositional Thinking Analysis, and Generative AI Authorship Verification</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</source>
          , Multimodality, and
          <string-name>
            <surname>Interaction</surname>
          </string-name>
          . Proceedings of
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>