<!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>Voight-Kampf AI Detection Sensitivity</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ritesh Kumar</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arya Trivedi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ojaswa Varshney</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Indian Institute of Information Technology</institution>
          ,
          <addr-line>Surat, Gujarat</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>With the growing sophistication of generative language models, distinguishing between human- and AI-generated text has become increasingly complex. This paper presents a hybrid DistilBERT-based approach evaluated on the PAN 2025 Voight-Kampf authorship verification task. The method demonstrates robust performance across multiple genres and employs standard evaluation metrics such as ROC-AUC, Brier Score, F1, and C@1. Our results highlight both the promise and limitations of current authorship detection systems, paving the way for future work in this domain.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;PAN 2025</kwd>
        <kwd>Voight-Kampf AI Detection Sensitivity</kwd>
        <kwd>Generative AI</kwd>
        <kwd>DistilBERT</kwd>
        <kwd>Voight-Kampf</kwd>
        <kwd>Deep Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Authorship verification has been extensively studied, traditionally focused on attributing anonymous
texts to known authors [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. However, the rise of generative models such as GPT [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and LLaMA
has introduced new complexities. Neural detectors such as GLTR [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and OpenAI’s classifier (now
deprecated) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] have attempted to distinguish human and AI text based on stylistic features or token
probabilities.
      </p>
      <p>
        Recent work in the PAN lab has explored stylometric methods and deep learning approaches for
authorship verification [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Transformer based solutions, including the BERT and RoBERTa variants,
have demonstrated strong results in various PAN challenges. Our approach builds on these foundations,
integrating lightweight transformer encodings with interpretable logistic outputs to retain model
explainability while leveraging deep features.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset and Preprocessing</title>
      <p>
        The dataset[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] comprises paired bullet points and target texts. The preprocessing involved token
normalization, truncation to 512 tokens, and conversion to input format for DistilBERT [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. We
maintained genre balance to avoid model bias. Genre labels were used only for analysis, not for model
training.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Methodology</title>
      <p>Our hybrid system leverages DistilBERT fine tuned on the training dataset with binary cross entropy
loss. Feature engineering included entropy measures and stylistic statistics. We used a logistic regression
layer on top of DistilBERT embeddings to classify authorship.</p>
      <sec id="sec-4-1">
        <title>4.1. Fine Tuning Details</title>
        <p>We fine tuned DistilBERT using the HuggingFace Transformers library. The model was trained for
4 epochs using a batch size of 16 and a learning rate of 5 × 10− 5 with the AdamW optimizer. Early
stopping was used based on validation loss to prevent overfitting.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Feature Engineering</title>
        <p>In addition to the transformer-based embeddings, we extracted shallow stylometric features from the
text:
• Average word length: Calculated as the total number of characters divided by the number of
words.
• Average sentence length: Measured as the average number of words per sentence.
• Punctuation frequency: Relative frequency (per 100 characters) of specific punctuation marks
including periods (.), commas (,), semicolons (;), colons (:), exclamation marks (!), and question
marks (?).
• Type-token ratio: A measure of vocabulary richness, computed as the number of unique words
divided by the total number of words in the text.
• Shannon entropy of character distribution: Entropy was computed over character 1-grams (i.e.,
single-character sequences) to quantify the unpredictability or information density of the text.
These features were concatenated with the [CLS] token embedding from DistilBERT and passed through
a logistic regression layer.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Evaluation Metrics</title>
      <p>
        Following PAN standards [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], we use:
• ROC-AUC: Area under the ROC curve
• Brier Score: Mean squared error of predicted probabilities
• C@1: Modified accuracy penalizing overconfident errors
• F1 and F0.5u: Precision-weighted F-measures, accounting for uncertain cases
• Arithmetic mean: Summary of all above metrics
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Results and Error Analysis</title>
      <p>We observed a ROC-AUC of 0.87, F1 score of 0.84, and a Brier score of 0.15. These indicate strong
performance and good calibration. Confusion matrix results suggest that the model was most confused
on high quality AI fiction and news.</p>
      <p>F0.5u</p>
      <p>Mean
0.89
0.87
0.91
0.79
0.81
0.16
0.15
0.14
0.21
0.19
0.84
0.82
0.85
0.76
0.78</p>
      <p>F1
0.86
0.84
0.88
0.75
0.78
0.83
0.81
0.86
0.72
0.76</p>
      <p>TP</p>
      <sec id="sec-6-1">
        <title>6.1. Error Analysis</title>
        <p>Manual inspection of false positives and false negatives revealed common themes:
• False Positives: Human authored news articles with formulaic structure were occasionally
misclassified as AI generated.
• False Negatives: AI generated fiction that incorporated creative punctuation and varied sentence
structure often fooled the model.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Discussion</title>
      <p>Excerpt
“The central bank announced a hike in interest rates, citing inflation
concerns...”
“Her eyes flickered two glimmers of silver in the fog of an endless,
coded dream...”
Our method captures subtle linguistic anomalies indicative of AI authorship. However, genre specific
overlaps and high quality machine generated news texts challenge detection. Future improvements
may involve:
• Integrating adversarial examples during training
• Using genre aware embeddings
• Ensembling outputs from multiple transformer variants</p>
      <sec id="sec-7-1">
        <title>7.1. Implications for Regulation and Ethics</title>
        <p>
          Our work aligns with ongoing debates around AI content regulation. As governments and platforms
grapple with the detection and labeling of AI generated content [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], automated authorship verification
systems could play a key role in maintaining content transparency and accountability. However, the
ethical risks of misclassifications, e.g., falsely labeling human content as AI must be carefully considered.
        </p>
      </sec>
      <sec id="sec-7-2">
        <title>7.2. Toward Explainable AI Detection</title>
        <p>While transformer models provide strong performance, their lack of transparency remains a concern.
Our hybrid approach, which supplements deep embeddings with interpretable features, provides a step
toward more explainable detection systems that can ofer justifications for their predictions.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>8. Conclusion and Future Work</title>
      <p>This paper presented a DistilBERT based solution to the 2025 PAN Voight-Kampf authorship verification
task. Our hybrid system, which combines deep contextual representations with interpretable stylistic
features, demonstrated competitive performance across genres and evaluation metrics. With a
ROCAUC of 0.87 and an F1 score of 0.84, our approach shows that even lightweight transformers can be
efectively adapted for AI authorship detection under constrained settings.</p>
      <p>Beyond quantitative metrics, the system also revealed valuable qualitative insights highlighting, for
instance, that human like AI generated fiction poses the greatest detection challenge. These results
underline the urgent need for robust, generalizable verification models as generative models continue
to evolve in quality and diversity.</p>
      <p>
        For future work, we aim to extend the system’s capabilities to multilingual datasets and mixed
authorship scenarios where AI and human text are interwoven. Additionally, integrating instruction
tuned LLM detectors and adversarial training could further improve robustness. Emphasis will also
be placed on explainability developing techniques that not only classify text accurately, but also ofer
human understandable justifications for their decisions, which is vital for adoption in legal, educational,
and journalistic domains [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
    </sec>
    <sec id="sec-9">
      <title>Acknowledgments</title>
      <p>
        This work was supported by IIIT Surat. We thank the PAN organizers[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], the CLEF community and
TIRA[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] for providing the datasets, evaluation framework and platform.
      </p>
    </sec>
    <sec id="sec-10">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used ChatGPT and Perplexity in order to: Grammar
and spelling check, Paraphrase and reword. After using these tool(s)/service(s), the author(s) reviewed
and edited the content as needed and take(s) full responsibility for the publication’s content.</p>
    </sec>
    <sec id="sec-11">
      <title>A. Online Resources</title>
      <p>The fine-tuned model used in this work has been made publicly available on Hugging Face: https:
//huggingface.co/OjaswaVarshney/PAN-Clef_Updated</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          , et al.,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <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="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>European</given-names>
            <surname>Commission</surname>
          </string-name>
          ,
          <article-title>Proposal for a regulation laying down harmonised</article-title>
          <source>rules on artificial intelligence (artificial intelligence act)</source>
          ,
          <year>2023</year>
          . Available at https://artificial-intelligence-act.eu/.
        </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>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="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Scott</surname>
          </string-name>
          , Blade runner,
          <year>1982</year>
          . Film. Warner Bros.
        </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>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="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <article-title>A survey of modern authorship attribution methods</article-title>
          ,
          <source>Journal of the American Society for Information Science and Technology</source>
          <volume>60</volume>
          (
          <year>2009</year>
          )
          <fpage>538</fpage>
          -
          <lpage>556</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</article-title>
          ,
          <source>in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: System Demonstrations</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9] OpenAI,
          <source>Ai text classifier (retired)</source>
          ,
          <year>2023</year>
          . Available at https://openai.com/blog/ new-ai
          <article-title>-classifier-for-indicating-ai-written-text.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kestemont</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tschuggnall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Daelemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Specht</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Potthast, Overview of the author identification task at pan-2018: Cross-domain authorship attribution and style change detection</article-title>
          ,
          <source>in: CLEF</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          , T. Wolf,
          <article-title>Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter</article-title>
          , arXiv preprint arXiv:
          <year>1910</year>
          .
          <volume>01108</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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>