<!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>Unibuc - NLP at "Voight-Kampf " Generative AI Detection PAN 2025</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Teodor Marchitan</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>Claudiu Creanga</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liviu P. Dinu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Mathematics and Computer Science, University of Bucharest</institution>
          ,
          <country country="RO">Romania</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>HLT Research Center</institution>
          ,
          <addr-line>Bucharest</addr-line>
          ,
          <country country="RO">Romania</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Interdisciplinary School of Doctoral Studies, University of Bucharest</institution>
          ,
          <country country="RO">Romania</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>This paper describes the approach of the Unibuc - NLP team in tackling the "Voight-Kampf" Generative AI Detection task from PAN at CLEF 2025 [1, 2]. In the Subtask 1: Voight-Kampf AI Detection Sensitivity we have explored diferent approaches of leveraging embeddings extracted from LLMs, using either classical ML models or further fine-tuning LLMs with a classification head for the downstream binary classification task. Our experiments showed that using a majority vote ensemble of classical ML models (Light GBM, XGB, Logistic Regression and SVM) is comparable with fine-tuning for downstream task achieving around 99.4% F1 score. For the Subtask 2: Human-AI Collaborative Text Classification we explored a way of combining features at diferent layers extracted using transformer backbone with layer-wise projection and attentive pooling which proved modest results.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;PAN 2025</kwd>
        <kwd>Voight-Kampf Generative AI Detection 2025</kwd>
        <kwd>LLM</kwd>
        <kwd>Classical ML</kwd>
        <kwd>NLP</kwd>
        <kwd>Machine-Generated Text Detection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        As artificial intelligence continues to advance and generative AI technologies are more and more popular,
distinguishing between machine-generated and human-authored texts has become very dificult. The
"Voight-Kampf" Generative AI Detection task from PAN at CLEF 2025 [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] aims to advance the research
in the field and find ways to develop real systems capable of detecting not only AI generated texts but
also machine-altered ones. The need for such systems is becoming a necessity day by day in order to
maintain the intergrity and authenticity of the content from the internet. Such tools can help mitigate
the risks associated with social manipulation, deepfakes, fake news, propaganda, misinformation and
so on.
      </p>
      <p>For the Subtask 1: Voight-Kampf AI Detection Sensitivity we experimented various methods of
utilizing the embeddings from large language models (LLMs), including classical machine learning
approaches and fine-tuning classification head for the binary classification task. The results indicate
that a majority vote ensemble of classical models - specifically LightGBM, XGBoost, Logistic Regression
and SVM - ofers a slightly better performance and faster training times and resources compared to the
ifne-runing approach.</p>
      <p>For the Subtask 2: Human-AI Collaborative Text Classification, we have tried a diferent approach
by fusing together layers of a transformer backbone model with layer-wise projection and attentive
pooling strategies.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>The detection of AI-generated text has become a rapidly evolving research area, particularly with
the advent of large language models. Recent shared tasks such as the PAN 2024 "Voight-Kampf"</p>
      <p>
        Generative AI Authorship Verification challenge have provided valuable benchmarks and insights into
the capabilities and limitations of current detection systems [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. Early approaches to authorship
verification, such as one-class classification [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and compression-based models [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] have been extended
to address the challenges posed by neural text generation [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ]. More recent work has focused on
zero-shot detection methods, leveraging statistical properties of model outputs [9]. Despite these
advances, studies have shown that both human and automated heuristics can be unreliable, especially
as generative models improve in mimicking human style [10, 11]. Our work builds on these foundations,
evaluating both classical and transformer-based approaches for robust detection of machine-generated
and collaboratively authored texts.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset</title>
      <sec id="sec-3-1">
        <title>3.1. Subtask 1: Voight-Kampf AI Detection Sensitivity</title>
        <p>The first subtask is formulated as a binary classification problem and the dataset contains either
humanwritten texts (label 0) or ai-written texts (label 1). The genre of the text is also available and it can be
one of the following: essays, news or fiction. Some of the news texts were sampled from the last year
task dataset [12].</p>
        <p>Overall the train split has 23, 707 samples and dev split has 3, 589. The distribution of the labels in
each split is shown in Table 1. The predominant genre for both labels is fiction, followed by essays and
news. As for the models used to generate text, gpt [13] comes first followed by mistral [ 14], gemini
[15], llama [16] and deepseek [17] (more info in section 7 and Figure 2).</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Subtask 2: Human-AI Collaborative Text Classification</title>
        <p>The second subtask is a multi-class classification problem where the goal is to classify texts into six
distinct categories based on the nature of human and machine contributions:
• Fully human-written: The document is entirely authored by a human without any AI assistance.
• Human-initiated, then machine-continued: A human starts writing, and an AI model
completes the text.
• Human-written, then machine-polished: The text is initially written by a human but later
refined or edited by an AI model.
• Machine-written, then machine-humanized (obfuscated): An AI generates the text, which
is later modified to obscure its machine origin.
• Machine-written, then human-edited: The content is generated by an AI but subsequently
edited or refined by a human.
• Deeply-mixed text: The document contains interwoven sections written by both humans and</p>
        <p>AI, without a clear separation.</p>
        <p>Overall the train split has 288, 919 samples and dev split has 72, 661. The distribution of the labels
in each split is shown in Table 2.</p>
        <p>In the train split, models used for text rewriting and generation are mostly from mistral [14], gpt
[13], gemini [15] and llama [16] (more info in Figure 3). Most of the texts that are fully human-written,
machine-written then machine-humanized or human-written then machine-polished come from the
LLM-DetectAlve dataset [18]. The next big source of the texts is TriBERT [19] where ChatGPT is mainly
used to produce deeply-mixed texts and human-initiated then machine-continued.</p>
        <p>On the other hand, in the dev split llama [16] is mainly used for text generation followed by gpt [13]
and mistral [14], gemini [15] being less used in this split. While in this split a good amount of fully
human-written, machine-written then machine-humanized or human-written then machine-polished
texts come from the LLM-DetectAlve dataset [18], there is a huge amount of human-written and
human-initiated then machine-continued texts that are sampled from m4gt-bench [20]. Also in dev set
there are more samples from RoFT [21] than in the train set (more information in Figure 4).</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. System overview</title>
      <p>We explored 3 diferent ways of laveraging LLM embeddings for either binary or multi-class classification
tasks. For subtask 1 we conducted experiments with systems described in sections 4.1 and 4.2. For the
second subtask we did our experiments with systems from sections 4.2 and 4.3.</p>
      <sec id="sec-4-1">
        <title>4.1. Frozen LLM embeddings with classical machine learning models</title>
        <p>
          This approach is using the last layer embeddings extracted from Qwen3-0.6B [22] to train diferent
classic machine learning classifiers:
• Light GBM [23]
• XGBoost [
          <xref ref-type="bibr" rid="ref9">24</xref>
          ]
• Logistic Regression [
          <xref ref-type="bibr" rid="ref10">25</xref>
          ]
• SVM [
          <xref ref-type="bibr" rid="ref11">26</xref>
          ]
        </p>
        <p>In the final approach we used an ensemble of the above models combining predictions in a majority
voting manner. So the final prediction is the class voted by most of the models in the ensemble. The
embeddings model was kept frozen and used only to extract embeddings from the last layer.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. LLM fine-tuning with classification head for downstream task</title>
        <p>The next approach also laverages the rich representational capacity of large language models, which
can capture both complex linguistic patterns and semantic relationships through their high-dimensional
vector space representations, and used as input for the final classification head. Experiments were
conducted with embeddings extracted using difernet LLM backbones: Qwen2.5-0.5B 1, Qwen3-0.6B 2,
Mistral7B-v0.1 3, Llama-3.1-8B 4 and fine-tuning them with a classification head on top of the last token.</p>
        <sec id="sec-4-2-1">
          <title>1https://huggingface.co/Qwen/Qwen2.5-0.5B 2https://huggingface.co/Qwen/Qwen3-0.6B 3https://huggingface.co/mistralai/Mistral-7B-v0.1 4https://huggingface.co/meta-llama/Llama-3.1-8B</title>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Combine transformer-based embeddings at diferent layers with layer-wise projection and attentive pooling</title>
        <p>We experimented this approach only for subtask 2. It uses embeddings from transformer-based models,
combines them using frame-wise projection, pooling strategies and a lightweight classification head.
4.3.1. Backbone and Feature Extractor
The model uses a pretrained transformer as a backbone to extract contextualized token embeddings.
This part of the model is always kept frozen during the training process.
4.3.2. Layer Aggregation Block
The information across multiple hidden layers of the transformer are aggregated using a learnable,
softmax-normalized weighted scheme. The weighted sum of hidden states is normalized via layer
normalization (without element-wise afine tranformation), producing a single sequence of contextual
embeddings for each input.
4.3.3. Frame-wise Processing Block
The aggregated embeddings are further processed by a configurable frame-wise module, which can be
either a simple linear projection or a small neural network. This step reduces the dimensionality and
introduces additional non-linearity, preparing the features for temporal pooling.
4.3.4. Time Pooling Strategies
To summarize the sequence of embeddings into a fixed-size representation, the model supports several
time pooling strategies:
• Statistical Pooling (SP): Concatenates the mean and standard deviation across the sequence.
• Attentive Statistical Pooling (ASP): Computes attention-weighted statistics using a learnable
attention mechanism.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experimental setup</title>
      <p>
        For both subtasks, we kept 20% of the training set for validation and hyperparameter tuning (taking into
consedireation the label distribution as well), and the dev split was used to test the final models. For
the dataset splits and implementation for classical machine learning models (4.1) we used scikit-learn
[
        <xref ref-type="bibr" rid="ref12">27</xref>
        ] 5, xgboost 6 and lightgbm 7 whereas for LLM fine-tuning (4.2) and transformer-based embeddings
combined (4.3) we used PyTorch [
        <xref ref-type="bibr" rid="ref13">28</xref>
        ] 8.
      </p>
      <p>
        In order to find the best parameters for each of the classical models from 4.1 we did hyperparameter
tuning using optuna [
        <xref ref-type="bibr" rid="ref14">29</xref>
        ] 9 and the final configuration is reported in Table 6.
      </p>
      <p>
        For the second approach 4.2 we loaded the backbone LLMs using QLoRA [
        <xref ref-type="bibr" rid="ref15">30</xref>
        ] (full parameters
in Table 7) in order to be able to fine-tune the entire model (including the LLM backbone) for the
downstream task 10. All hyperparameters used for training in Table 8.
      </p>
      <p>
        The backbone transformer model used for the last approach 4.3 is RoBERTa [
        <xref ref-type="bibr" rid="ref16">31</xref>
        ] 11. The final model
we used a hidden dimension of 128 for the frame-wise processing block and an attentive statistical
5https://scikit-learn.org/stable/
6https://xgboost.readthedocs.io/en/release_3.0.0/
7https://lightgbm.readthedocs.io/en/stable/
8https://pytorch.org
9https://optuna.org
10All experiments were conducted using 1 Nvidia RTX 4090 GPU
11https://huggingface.co/FacebookAI/roberta-base
pooling with 4 heads and 256 hidden dimension with ReLU activation. All other training parameters
are available in Table 9.
      </p>
      <p>
        The evaluation platform used for this challenge was TIRA [
        <xref ref-type="bibr" rid="ref17">32</xref>
        ].
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Results</title>
      <sec id="sec-6-1">
        <title>6.1. Subtask 1: Voight-Kampf AI Detection Sensitivity</title>
        <p>The metrics used to evaluate the system are the following:
• ROC-AUC: The area under the ROC (Receiver Operating Characteristic) curve.
• Brier: The complement of the Brier score (mean squared loss).
• C@1: A modified accuracy score that assigns non-answers (score = 0.5) the average accuracy of
the remaining cases.
• F1: The harmonic mean of precision and recall.
• F0.5u: A modified F0.5 measure (precision-weighted F measure) that treats non-answers (score =
0.5) as false negatives.</p>
        <p>• Mean: The arithmetic mean of all the metrics above.</p>
        <p>The overall results of the first approach 4.1 are available in Table 3 and those using the second
approach 4.2 are available in Table 4.</p>
        <p>Looking at Figure 6 it seems like the biggest problem for the model is that is classifies fiction
texts generated with gemini-1.5-pro and llama-3.1-8b-instruct as human-written fiction texts. In the
embeddings visualization plot Figure 5 we can see that there are some red squares (ai-written fiction)
that are really close to the blue squares (human-written fiction).</p>
      </sec>
      <sec id="sec-6-2">
        <title>6.2. Subtask 2: Human-AI Collaborative Text Classification</title>
        <p>The metrics used to evaluate the system are the following:
• Recall (Macro): Macro recall is the average recall computed independently for each class,
measuring the proportion of true positives identified out of all actual instances for each class,
and then averaging across all classes.
• F1 (Macro): Macro F1 is the average of the F1 scores calculated for each class, where the F1 score
is the harmonic mean of precision and recall, providing a balanced measure of a model’s accuracy
across all classes.
• Accuracy: Accuracy is the proportion of all predictions that are correct, calculated as the number
of correct predictions divided by the total number of predictions.</p>
        <sec id="sec-6-2-1">
          <title>The overall results of the third approach 4.3 are available in Table 5.</title>
          <p>Looking at Figure 7 we can see that the hardest dataset is m4gt-bench (which was not present in the
training dataset at all) with 28, 192 samples that were not classified as human-initiated, then
machinecontinued (97% of the samples from m4gt-bench with this label) and 1, 750 were not classifier as fully
human-written (55% of the samples from m4gt-bench with this label). Furthermore looking at Figure 8
and Figure 9 we see that llama2 is the hardest model to be detected (also not present in the training
split at all) with 11, 793 samples that were human-written, then machine-continued misclassified as
human-written, then machine-polished. We have also reported the metrics we got on the dev set when
removing the samples from m4gt-bench Table 5 to prove that the architecture we used for this type of
classification fails to generalize well on unseen data, but manages to learn good enough representations
from the training set.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusions and Future Work</title>
      <p>The experimental results demonstrate that both classical machine learning models and fine-tuned large
language models (LLMs) achieve exceptionally high performance on the subtask 1 of distinguishing
between human-written and ai-written texts, with F1, ROC-AUC, and related metrics consistently
above 0.99 for most models. However, detailed error analysis reveals that the main challenge lies
in distinguishing between human-written and AI-generated fiction, especially for texts produced by
advanced models such as gemini-1.5-pro and llama-3.1-8b-instruct, which were also fewer in the train set,
where the model tends to misclassify AI-generated fiction as human-written. This is further supported
by the embeddings visualization, which shows significant overlap between these classes.</p>
      <p>For the human-AI collaborative text classification subtask, the results are more modest, with macro F1
and recall scores around 0.43 and accuracy at 0.51, suggesting that this remains a challenging problem
and that current models struggle to generalize in this setting, the diference between human-written
then machine-continued and human-written then machine-polished being very subtle and hard to be
detected, especially when the generative model has never been seen in the training dataset.</p>
      <p>Future work will focus on addressing these limitations by exploring more sophisticated representation
learning techniques, incorporating additional context or metadata, and experimenting with advanced
ensemble methods. Furthermore, targeted data augmentation and adversarial training could help the
models better distinguish subtle diferences between human and machine-generated texts, particularly in
challenging genres such as fiction. Finally, interpretability analyses and error-driven model refinement
will be essential to further improve robustness and reliability in real-world applications.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgements</title>
      <p>This research is supported by the project “Romanian Hub for Artificial Intelligence - HRIA”, Smart
Growth, Digitization and Financial Instruments Program, 2021-2027, MySMIS no. 334906.
Computational Linguistics, Punta Cana, Dominican Republic, 2021, pp. 2001–2016. URL: https:
//aclanthology.org/2021.findings-emnlp.172/. doi: 10.18653/v1/2021.findings-emnlp.172.
[9] A. Hans, A. Schwarzschild, V. Cherepanova, H. Kazemi, A. Saha, M. Goldblum, J. Geiping, T.
Goldstein, Spotting llms with binoculars: Zero-shot detection of machine-generated text, 2024. URL:
https://arxiv.org/abs/2401.12070. arXiv:2401.12070.
[10] M. Jakesch, A. Bhat, D. Buschek, L. Zalmanson, M. Naaman, Co-writing with opinionated language
models afects users’ views, in: Proceedings of the 2023 CHI Conference on Human Factors in
Computing Systems, CHI ’23, ACM, 2023, p. 1–15. URL: http://dx.doi.org/10.1145/3544548.3581196.
doi:10.1145/3544548.3581196.
[11] V. S. Sadasivan, A. Kumar, S. Balasubramanian, W. Wang, S. Feizi, Can ai-generated text be reliably
detected?, 2025. URL: https://arxiv.org/abs/2303.11156. arXiv:2303.11156.
[12] 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: CEUR Workshop Proceedings, volume 3740, 2024, p. Paper 225.</p>
      <p>URL: https://ceur-ws.org/Vol-3740/paper-225.pdf, accessed: 2025-05-30.
[13] OpenAI, Gpt-4 technical report, 2024. URL: https://arxiv.org/abs/2303.08774. arXiv:2303.08774.
[14] A. Q. Jiang, A. Sablayrolles, A. Mensch, C. Bamford, D. S. Chaplot, D. de las Casas, F.
Bressand, G. Lengyel, G. Lample, L. Saulnier, L. R. Lavaud, M.-A. Lachaux, P. Stock, T. L. Scao,
T. Lavril, T. Wang, T. Lacroix, W. E. Sayed, Mistral 7b, 2023. URL: https://arxiv.org/abs/2310.06825.
arXiv:2310.06825.
[15] G. Team, Gemini: A family of highly capable multimodal models, 2025. URL: https://arxiv.org/abs/
2312.11805. arXiv:2312.11805.
[16] H. Touvron, T. Lavril, G. Izacard, X. Martinet, M.-A. Lachaux, T. Lacroix, B. Rozière, N. Goyal,
E. Hambro, F. Azhar, A. Rodriguez, A. Joulin, E. Grave, G. Lample, Llama: Open and eficient
foundation language models, 2023. URL: https://arxiv.org/abs/2302.13971. arXiv:2302.13971.
[17] DeepSeek-AI, Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning,
2025. URL: https://arxiv.org/abs/2501.12948. arXiv:2501.12948.
[18] M. Abassy, K. Elozeiri, A. Aziz, M. N. Ta, R. V. Tomar, B. Adhikari, S. E. D. Ahmed, Y. Wang,
O. Mohammed Afzal, Z. Xie, J. Mansurov, E. Artemova, V. Mikhailov, R. Xing, J. Geng, H. Iqbal, Z. M.
Mujahid, T. Mahmoud, A. Tsvigun, A. F. Aji, A. Shelmanov, N. Habash, I. Gurevych, P. Nakov,
LLMDetectAIve: a tool for fine-grained machine-generated text detection, in: D. I. Hernandez Farias,
T. Hope, M. Li (Eds.), Proceedings of the 2024 Conference on Empirical Methods in Natural
Language Processing: System Demonstrations, Association for Computational Linguistics, Miami,
Florida, USA, 2024, pp. 336–343. URL: https://aclanthology.org/2024.emnlp-demo.35/. doi:10.
18653/v1/2024.emnlp-demo.35.
[19] Z. Zeng, L. Sha, Y. Li, K. Yang, D. Gašević, G. Chen, Towards automatic boundary detection for
human-ai collaborative hybrid essay in education, 2023. URL: https://arxiv.org/abs/2307.12267.
arXiv:2307.12267.
[20] Y. Wang, J. Mansurov, P. Ivanov, J. Su, A. Shelmanov, A. Tsvigun, O. M. Afzal, T. Mahmoud,
G. Puccetti, T. Arnold, A. F. Aji, N. Habash, I. Gurevych, P. Nakov, M4gt-bench: Evaluation
benchmark for black-box machine-generated text detection, 2024. URL: https://arxiv.org/abs/2402.
11175. arXiv:2402.11175.
[21] L. Kushnareva, T. Gaintseva, G. Magai, S. Barannikov, D. Abulkhanov, K. Kuznetsov, E. Tulchinskii,
I. Piontkovskaya, S. Nikolenko, Ai-generated text boundary detection with roft, 2024. URL: https:
//arxiv.org/abs/2311.08349. arXiv:2311.08349.
[22] A. Yang, A. Li, B. Yang, B. Zhang, B. Hui, B. Zheng, B. Yu, C. Gao, C. Huang, C. Lv, C. Zheng, D. Liu,
F. Zhou, F. Huang, F. Hu, H. Ge, H. Wei, H. Lin, J. Tang, J. Yang, J. Tu, J. Zhang, J. Yang, J. Yang,
J. Zhou, J. Zhou, J. Lin, K. Dang, K. Bao, K. Yang, L. Yu, L. Deng, M. Li, M. Xue, M. Li, P. Zhang,
P. Wang, Q. Zhu, R. Men, R. Gao, S. Liu, S. Luo, T. Li, T. Tang, W. Yin, X. Ren, X. Wang, X. Zhang,
X. Ren, Y. Fan, Y. Su, Y. Zhang, Y. Zhang, Y. Wan, Y. Liu, Z. Wang, Z. Cui, Z. Zhang, Z. Zhou, Z. Qiu,
Qwen3 technical report, 2025. URL: https://arxiv.org/abs/2505.09388. arXiv:2505.09388.
[23] G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, T.-Y. Liu, Lightgbm: A highly eficient</p>
    </sec>
    <sec id="sec-9">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used ChatGPT in order to: Generate literature review,
Grammar and spelling check. After using these tools, the authors reviewed and edited the content as
needed and take full responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dementieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Gipp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Greiner-Petter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Karlgren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mayerl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</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>A.</given-names>
            <surname>Shelmanov</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>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          , E. Zangerle, Overview of PAN 2025:
          <article-title>Voight-Kampf Generative AI Detection, Multilingual Text Detoxification, Multi-Author Writing Style Analysis, and Generative Plagiarism Detection</article-title>
          , in: J.
          <string-name>
            <surname>C. de Albornoz</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Gonzalo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Plaza</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G. S. de Herrera</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Mothe</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Piroi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Spina</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Sixteenth International Conference of the CLEF Association (CLEF</source>
          <year>2025</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Karlgren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tsivgun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abassy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mansurov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Ta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Elozeiri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. V.</given-names>
            <surname>Tomar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Geng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Artemova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shelmanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Habash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <article-title>Overview of the “VoightKampf” Generative AI Authorship Verification Task at PAN</article-title>
          and
          <article-title>ELOQUENT 2025</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>Rosso</surname>
          </string-name>
          , D. Spina (Eds.),
          <source>Working Notes of CLEF 2025 - Conference and Labs of the Evaluation Forum, CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <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>
          . URL: https://link. springer.com/chapter/10.1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <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, in: Experimental IR Meets Multilinguality, Multimodality, and Interaction</article-title>
          .
          <source>Proceedings of the Fourteenth International Conference of the CLEF Association (CLEF</source>
          <year>2024</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Koppel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schler</surname>
          </string-name>
          ,
          <article-title>Authorship verification as a one-class classification problem</article-title>
          ,
          <source>in: Proceedings of the Twenty-First International Conference on Machine Learning</source>
          , ICML '04,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2004</year>
          , p.
          <fpage>62</fpage>
          . URL: https://doi.org/10.1145/1015330. 1015448. doi:
          <volume>10</volume>
          .1145/1015330.1015448.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O.</given-names>
            <surname>Halvani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Graner</surname>
          </string-name>
          ,
          <article-title>On the usefulness of compression models for authorship verification</article-title>
          ,
          <source>in: Proceedings of the 12th International Conference on Availability, Reliability and Security</source>
          , ARES '17,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2017</year>
          . URL: https://doi.org/10.1145/3098954.3104050. doi:
          <volume>10</volume>
          .1145/3098954.3104050.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Uchendu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Authorship attribution for neural text generation</article-title>
          , in: B.
          <string-name>
            <surname>Webber</surname>
            , T. Cohn,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>He</surname>
          </string-name>
          , Y. Liu (Eds.),
          <source>Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>8384</fpage>
          -
          <lpage>8395</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .emnlp-main.
          <volume>673</volume>
          /. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          . emnlp-main.
          <volume>673</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Uchendu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ma</surname>
          </string-name>
          , T. Le,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>TURINGBENCH:</surname>
          </string-name>
          <article-title>A benchmark environment for Turing test in the age of neural text generation</article-title>
          , in: M.
          <article-title>-</article-title>
          <string-name>
            <surname>F. Moens</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Specia</surname>
          </string-name>
          , S. W.-t. Yih (Eds.),
          <source>Findings of the Association for Computational Linguistics: EMNLP</source>
          <year>2021</year>
          ,
          <article-title>Association for gradient boosting decision tree</article-title>
          , in: I. Guyon,
          <string-name>
            <given-names>U. V.</given-names>
            <surname>Luxburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vishwanathan</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>30</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2017</year>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2017/file/ 6449f44a102fde848669bdd9eb6b76fa-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guestrin</surname>
          </string-name>
          ,
          <article-title>Xgboost: A scalable tree boosting system</article-title>
          ,
          <source>in: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '16</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2016</year>
          , p.
          <fpage>785</fpage>
          -
          <lpage>794</lpage>
          . URL: http://dx.doi.org/10.1145/2939672.2939785. doi:
          <volume>10</volume>
          .1145/2939672.2939785.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [25]
          <string-name>
            <surname>J. B</surname>
          </string-name>
          .
          <article-title>and, Application of the logistic function to bio-assay</article-title>
          ,
          <source>Journal of the American Statistical Association</source>
          <volume>39</volume>
          (
          <year>1944</year>
          )
          <fpage>357</fpage>
          -
          <lpage>365</lpage>
          . URL: https://doi. org/10.1080/01621459.
          <year>1944</year>
          .
          <volume>10500699</volume>
          . doi:
          <volume>10</volume>
          .1080/01621459.
          <year>1944</year>
          .
          <volume>10500699</volume>
          . arXiv:https://doi.org/10.1080/01621459.
          <year>1944</year>
          .
          <volume>10500699</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hearst</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dumais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Osuna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Platt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Scholkopf</surname>
          </string-name>
          ,
          <article-title>Support vector machines</article-title>
          ,
          <source>IEEE Intelligent Systems and their Applications</source>
          <volume>13</volume>
          (
          <year>1998</year>
          )
          <fpage>18</fpage>
          -
          <lpage>28</lpage>
          . doi:
          <volume>10</volume>
          .1109/5254.708428.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nothman</surname>
          </string-name>
          , G. Louppe,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , Édouard Duchesnay,
          <article-title>Scikit-learn: Machine learning in python, 2018</article-title>
          . URL: https://arxiv.org/abs/1201.0490. arXiv:
          <volume>1201</volume>
          .
          <fpage>0490</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>A.</given-names>
            <surname>Paszke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Massa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lerer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bradbury</surname>
          </string-name>
          , G. Chanan,
          <string-name>
            <given-names>T.</given-names>
            <surname>Killeen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Gimelshein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Antiga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Desmaison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Köpf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>DeVito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tejani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chilamkurthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Steiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chintala</surname>
          </string-name>
          ,
          <string-name>
            <surname>Pytorch:</surname>
          </string-name>
          <article-title>An imperative style, high-performance deep learning library</article-title>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1912</year>
          .01703. arXiv:
          <year>1912</year>
          .01703.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>T.</given-names>
            <surname>Akiba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Yanase</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ohta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Koyama</surname>
          </string-name>
          ,
          <article-title>Optuna: A next-generation hyperparameter optimization framework</article-title>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1907</year>
          .10902. arXiv:
          <year>1907</year>
          .10902.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>T.</given-names>
            <surname>Dettmers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pagnoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Holtzman</surname>
          </string-name>
          , L. Zettlemoyer, Qlora: Eficient finetuning of quantized llms,
          <year>2023</year>
          . URL: https://arxiv.org/abs/2305.14314. arXiv:
          <volume>2305</volume>
          .
          <fpage>14314</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Roberta: A robustly optimized bert pretraining approach</article-title>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1907</year>
          . 11692. arXiv:
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [32]
          <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>
          ,
          <source>in: 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>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>