<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>J. Yang);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Genre-Aware Contrastive Learning for AI Text Detection: A RoBERTa-Based Approach</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Junlong Yang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kai Yan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Foshan University</institution>
          ,
          <addr-line>Foshan</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>This paper presents a detection method for the PAN 2025 Voight-Kampf Generative AI Detection task, which combines RoBERTa with a contrastive learning mechanism. Building on RoBERTa, we introduce genre embeddings and contrastive loss to enhance the model's sensitivity to the textual genre and semantic diferences. Experimental results show that our method achieves excellent performance on the oficial validation set with genre information, and also performs robustly on a custom validation set without genre labels, demonstrating strong generalization capabilities. Our findings validate the efectiveness of integrating deep semantic modeling with structured representation learning ,ofering a novel approach to generative text detection.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Authorship verification</kwd>
        <kwd>RoBERTa</kwd>
        <kwd>Contrastive learning</kwd>
        <kwd>Text classification</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent years, the rapid advancement of natural language processing technologies has enabled large
language models, such as GPT-4, Gemini, and LLaMA, to generate fluent, coherent, and semantically
rich text [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1, 2, 3, 4</xref>
        ]. While these models have transformed areas such as content creation and
intelligent customer service, they also pose potential risks, including misinformation dissemination,
academic dishonesty, and opinion manipulation. For example, students may use AI-generated content
for assignments, and malicious actors may generate large volumes of fake news using AI.
      </p>
      <p>
        Against this backdrop, distinguishing AI-generated content from human-written text has become
a critical challenge for both academia and industry. To promote progress on this problem, the PAN
2025 shared task [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] introduced the Voight-Kampf Generative AI Detection Task [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which requires
participants to classify whether a given text is human-written or AI-generated based on its linguistic
properties. All models are evaluated through the TIRA platform [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], which ensures standardized and
reproducible experimental setups.
      </p>
      <p>In this study, we propose a detection framework that integrates genre embedding and contrastive
learning for the PAN 2025 Voight-Kampf task. The task requires predicting a confidence score for
each input text: scores below 0.5 are classified as human-written, scores above 0.5 as AI-generated, and
exactly 0.5 as undecidable.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        As the quality of AI-generated text improves, distinguishing it from human-authored content has
emerged as a major research focus. Traditional detection methods often rely on handcrafted features
such as statistical indicators, stylistic diferences, or perplexity scores. For example, GLTR uses a
language model to compute word probabilities and assess whether the text aligns with natural language
patterns[
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. Similarly, OpenAI’s Text Classifier models output distributions from GPT to detect
anomalous word choices.
      </p>
      <p>
        However, such approaches often depend heavily on the internal mechanics of the language model
and tend to generalize poorly, especially when applied across diferent domains and genres[
        <xref ref-type="bibr" rid="ref10 ref11 ref12">10, 11, 12</xref>
        ].
As a result, researchers have turned to discriminative deep learning methods. Pretrained models like
BERT and RoBERTa have been widely adopted, showing strong performance in binary classification
tasks due to their deep semantic modeling capabilities[
        <xref ref-type="bibr" rid="ref13 ref3">3, 13, 14, 15</xref>
        ].
      </p>
      <p>
        Contrastive learning has also gained traction in NLP as a means of learning better representations,
drawing inspiration from vision-based models like SimCLR and MoCo[
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. Approaches such as
SimCSE, CoSent, and CPT have proven efective in semantic matching and representation learning[ 16,
17, 18]. In the context of generative text detection, some studies incorporate contrastive learning by
treating samples from the same genre or model as positive pairs to optimize embedding space structures
or by including stylistic features in classification[19, 18, 20] .
      </p>
      <p>Despite these advances, the integration of genre labels with representation learning remains
underexplored. Our work addresses this gap by combining RoBERTa, genre embeddings, and contrastive
learning within a unified framework and empirically validating its efectiveness and generalization
capabilities on the PAN 2025 dataset.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <p>Our method consists of two main components: a RoBERTa-based classifier and a contrastive learning
module.</p>
      <sec id="sec-3-1">
        <title>3.1. RoBERTa Text Classifier</title>
        <p>
          We adopt RoBERTa-large as the encoder to extract deep semantic representations of input texts[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].For
each input, the vector at the [CLS] position is used as the global representation. This representation is
passed through a dropout layer and a linear classifier to produce a scalar output for binary classification,
trained using the Binary Cross-Entropy loss:
ℒBCE = − [ · log(ˆ) + (1 − ) · log(1 − ˆ)]
(1)
        </p>
        <p>To enable contrastive learning, we add a projection head and incorporate genre information as an
embedding vector. Specifically:
• We define a learnable genre embedding lookup table (dimension 64), assigning each genre a
unique vector.
• The [] representation is concatenated with the corresponding genre embedding:
[CLS; egenre].
• The concatenated vector is fed into a two-layer MLP with ReLU activation to produce a contrastive
embedding:
z = MLP([CLS; egenre]) ∈ R128
(2)
The model thus outputs:
• logits:used for classification with BCE loss
• contrastive embedding:used to compute the contrastive loss</p>
        <p>This dual-branch architecture allows the model to jointly optimize classification and representation
learning jointly,enhancing generalization [19, 18].</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Contrastive Learning Module</title>
        <p>
          To improve representation separability, we employ an InfoNCE-style contrastive loss[
          <xref ref-type="bibr" rid="ref10">10, 16</xref>
          ]:
• For each sample pair  and , if their labels match, they are treated as a positive pair; otherwise, a
negative pair.
• A binary mask is used to prevent self-pairs: mask, = 0
• Cosine similarity is computed using L2-normalized vectors:
sim, =
 · 

where  is a temperature hyperparameter.
        </p>
        <p>The contrastive loss for a sample  is defined as:</p>
        <p>The final loss function is:
where () denotes the set of positive pairs for sample .
with  controlling the balance between the two objectives.
4. Experiments
4.1. Datasets
ℒi = −
1</p>
        <p>∑︁ log
|()| ∈()</p>
        <p>
          exp(sim,)
∑︀̸= exp(sim, )
ℒtotal = ℒBCE +  · ℒ contrastive
(3)
(4)
(5)
We evaluate our method using the oficial PAN 2025 Voight-Kampf dataset and a custom validation set
named VK-CleanBench-2024. The oficial dataset includes fields such as text, label, model, genre, and
id. Labels are binary: 0 for human-written, 1 for AI-generated. Genre values include categories like
essays and fiction. We concatenate the genre with the text during tokenization and pad or truncate to a
maximum length of 512 tokens for RoBERTa-large[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>To assess generalization in the absence of genre information, we construct the VK-CleanBench-2024
validation set using publicly available data from PAN 2024 Voight-Kampf Authorship Verification. This
set contains only id, text, and label fields. No genre is included during inference. The dataset is cleaned
and de-duplicated to ensure independence from the training set and simulate real-world detection
scenarios without structured metadata.</p>
      </sec>
      <sec id="sec-3-3">
        <title>4.2. Experimental Setup</title>
        <p>
          In our experimental setup, we employ RoBERTa-large as the pre-trained language model[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], with a
maximum input sequence length of 512 and a batch size of 32. The optimizer used is AdamW[
          <xref ref-type="bibr" rid="ref13 ref3">3, 13</xref>
          ]
with an initial learning rate of 2e-5. For the contrastive learning component, the temperature parameter
is set to 0.5, and the loss weight coeficient  is set to 0.1 to balance the training objectives between
classification and representation learning. The model is trained for up to 10 epochs, with an early
stopping strategy based on the F1 score on the validation set (patience = 2) to prevent overfitting and
enhance generalization[19].
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>4.3. Experiment Results</title>
        <p>The validation performance on the oficial PAN 2025 Voight-Kampf dataset is shown in Table 1. During
tokenization, the genre is concatenated with the input text, allowing the model to leverage contextual
cues beyond the raw text. The model achieves near-perfect results across all evaluation metrics,
indicating strong performance under well-structured and annotated conditions.</p>
        <p>To assess the model’s robustness and generalization, we further evaluate it on the
VK-CleanBench2024 dataset, shown in Table 2. This setup removes genre metadata at inference time, simulating more
realistic scenarios. Although performance drops slightly, the model remains competitive, demonstrating
its adaptability to genre-agnostic inputs.</p>
        <p>In response to reviewer suggestions, we conducted additional ablation studies to evaluate the
individual contributions of the genre vector and the contrastive loss. The results are summarized in</p>
        <p>Mean
0.961</p>
        <p>Mean
0.947
0.942</p>
        <p>Mean
0.877</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5. Conclusion</title>
      <p>
        We propose a RoBERTa-based text classification framework that integrates genre embeddings and
contrastive learning for the PAN 2025 Voight-Kampf Generative AI Detection task. By incorporating genre
information and optimizing the representation space, our method improves the modeling of fine-grained
diferences between human and AI-generated text[
        <xref ref-type="bibr" rid="ref3">3, 19, 18</xref>
        ]. Experiments confirm its efectiveness
across datasets both with and without genre metadata, demonstrating robust generalization.
      </p>
      <p>In future work, we plan to explore additional auxiliary signals such as writing style features and
multimodal data[21, 22, 23], aiming to enhance detection in multi-genre and cross-lingual scenarios,
with special attention to low-resource genres.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This work is supported by the National Natural Science Foundation of China (No.62276064).</p>
    </sec>
    <sec id="sec-6">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this paper, generative AI tools (specifically ChatGPT) were employed to
assist in English language polishing and in translating parts of the manuscript from Chinese to English.
All conceptual contributions, ideas, methods, experiments, analyses, and conclusions are entirely the
work of the authors. The authors reviewed and verified all AI-assisted edits to ensure accuracy and
appropriateness.
[14] Z. Zhang, X. Han, Z. Liu, X. Jiang, M. Sun, Q. Liu, Ernie: Enhanced language representation
with informative entities, in: Proceedings of the 57th Annual Meeting of the Association for
Computational Linguistics, 2019, pp. 1441–1451.
[15] C. Rafel, N. Shazeer, A. Roberts, K. Lee, S. Narang, M. Matena, Y. Zhou, W. Li, P. J. Liu, Exploring
the limits of transfer learning with a unified text-to-text transformer, Journal of Machine Learning
Research 21 (2020) 1–67.
[16] T. Gao, X. Yao, D. Chen, Simcse: Simple contrastive learning of sentence embeddings, in:
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021,
pp. 6894–6910.
[17] Y. Hou, X. Li, H. Pan, S. He, J. Zhou, Cpt: A pre-trained unbalanced transformer for both chinese
language understanding and generation, in: Findings of the Association for Computational
Linguistics: ACL 2022, 2022, pp. 2891–2903.
[18] W. Yang, Y. Zhao, K. Wu, W. Lu, Cosent: Supervised contrastive learning for sentence embeddings,
2022. arXiv:2201.07313.
[19] Y. Bao, Y. Du, L. Dong, W. Zhang, F. Wei, M. Zhou, Contrastive pre-training for human-authored
and machine-generated text classification, in: Findings of the Association for Computational
Linguistics: EMNLP 2021, 2021, pp. 4424–4434.
[20] E. Tian, Gptzero: Detecting ai-generated text, https://gptzero.me, 2023.
[21] R. Schwartz, M. Sap, I. Konstas, W. Ammar, N. A. Smith, Story cloze evaluations and adversarial
story generation, in: Proceedings of the 2017 Conference on Computational Natural Language
Learning, 2017, pp. 100–109.
[22] A. Uchendu, R. Varshney, S. Lee, Y. Wang, Authorship attribution in multi-author corpora: The role
of stylometric and deep learning features, in: Proceedings of the 28th International Conference on
Computational Linguistics, 2020, pp. 6713–6725.
[23] D. Ippolito, D. Duckworth, C. Callison-Burch, D. Eck, Comparison of diverse generative models
for text, in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language
Processing, 2019, pp. 2100–2111.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1] OpenAI, Gpt-4
          <source>technical report</source>
          ,
          <year>2023</year>
          . https://openai.com/research/gpt-4.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>G. DeepMind</surname>
          </string-name>
          , Gemini: Multimodal language models,
          <year>2023</year>
          . https://deepmind.google/discover/blog/ google-gemini-ai/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <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>
          . arXiv:
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E.</given-names>
            <surname>Mitchell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bosselut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Finn</surname>
          </string-name>
          , Detectgpt:
          <article-title>Zero-shot machine-generated text detection using probability curvature</article-title>
          ,
          <source>arXiv preprint arXiv:2301.11305</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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="ref6">
        <mixed-citation>
          [6]
          <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="ref7">
        <mixed-citation>
          [7]
          <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 id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gehrmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Strobelt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Rush</surname>
          </string-name>
          , Gltr:
          <article-title>Statistical detection and visualization of generated text, in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: System Demonstrations</article-title>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zellers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Holtzman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Rashkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bisk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Farhadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Roesner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <article-title>Defending against neural fake news</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>32</volume>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kornblith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Norouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <article-title>A simple framework for contrastive learning of visual representations</article-title>
          ,
          <source>in: International Conference on Machine Learning (ICML)</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <article-title>Momentum contrast for unsupervised visual representation learning</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>9729</fpage>
          -
          <lpage>9738</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kirchenbauer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Geiping</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Goldblum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Carlini</surname>
          </string-name>
          , T. Goldstein,
          <article-title>Watermarking language models for detection</article-title>
          ,
          <source>arXiv preprint arXiv:2301.10226</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>