<!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>Detecting Generated Text and Attributing Language Model Source with Fine-tuned Models and Semantic Understanding</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Margherita Gambini</string-name>
          <email>m.gambini@iit.cnr.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Avvenuti</string-name>
          <email>marco.avvenuti@unipi.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabrizio Falchi</string-name>
          <email>f.falchi@isti.cnr.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Tesconi</string-name>
          <email>m.tesconi@iit.cnr.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tiziano Fagni</string-name>
          <email>t.fagni@iit.cnr.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CNR - Institute of Informatics and Telematics</institution>
          ,
          <addr-line>via G. Moruzzi 1, 56124, Pisa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>CNR - Institute of Information Science and Technologies</institution>
          ,
          <addr-line>via G. Moruzzi 1, 56124, Pisa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Pisa - School of Engineering</institution>
          ,
          <addr-line>L.go Lucio Lazzarino 1, 56122 Pisa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The improvements in natural language generation have led to the development of sophisticated language models capable of generating long and short texts that are incredibly dificult to distinguish from humanwritten ones. This remarkable generative capability has spread concerns about the potential misuse of such language models, such as the spread of misinformation, plagiarism, and causing disruption in the education system. Therefore, it is important to have automatic systems to distinguish generated texts from human-authored ones (deepfake text detection), as well as recognise the language model which produced a certain text for legal and security issues (generative language model attribution). The aim of the AuTexTification challenge was to address those two tasks on texts generated by state-of-the-art language models like text-davinci-003, being one of the first versions of the powerful ChatGPT. We proposed two detection models for both tasks: fine-tuned BERTweet and TriFuseNet, a three-branched network working on stylistic and contextual features. We achieved an F1 score of 0.616 (0.565) with ifne-tuned BERTweet and 0.715 (0.499) with TriFuseNet on the deepfake text detection (generative language model attribution) task. Our results emphasize the significance of leveraging style, semantics, and context to distinguish machine-generated from human-written texts and identify the generative language model source.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;deepfake text detection</kwd>
        <kwd>NLG</kwd>
        <kwd>machine-generated</kwd>
        <kwd>generative source</kwd>
        <kwd>attribution</kwd>
        <kwd>language models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Advancements in Natural Language Generation have greatly enhanced the quality, diversity, and
control of texts produced by ever more powerful language models, ranging from GPT [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], GPT-2
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], GPT-3 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], PaLM [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], BLOOM [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] to ChatGPT [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and BARD [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to name a few. Despite
being valuable instruments to enhance education [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and business sectors [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], their remarkable
and eficient capacity to generate human-like texts serves as an additional means to manipulate
public opinion by propagating false information, deceptive reviews, or untruthful opinions on
the internet [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ], increasing phishing activities [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ], and undermine academic honesty
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Therefore, it is crucial to advance technology to automatically detect generated text and
thus prevent unauthorized use. Moreover, in legal and security domains, it is insuficient to
merely identify a text as machine-generated. The game-changer lies in Authorship Attribution,
which involves determining the specific generative language model (among many) responsible
for producing a given text [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>
        Many research works addressed the detection of generated text and the attribution of the
generative language model over the first released Transformer-based language models, such
as GPT-2 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], GROVER [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], XLM [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and BART [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], usually obtaining good detection and
transfer-learning performances both on long texts (such as news articles) [
        <xref ref-type="bibr" rid="ref16 ref19 ref20 ref21">19, 20, 16, 21</xref>
        ] and
social media posts (e.g., tweets, reviews) [
        <xref ref-type="bibr" rid="ref15 ref22 ref23 ref24 ref25">22, 23, 24, 25, 15</xref>
        ]. However, the new generation of
large language models (e.g. Google FLAN, Facebook OPT, BLOOM, ChatGPT, LLaMA) is less
explored due to the recent releases [
        <xref ref-type="bibr" rid="ref26 ref27 ref28">26, 27, 28</xref>
        ]. The aim of the AuTexTification challenge [
        <xref ref-type="bibr" rid="ref29 ref30">29, 30</xref>
        ]
was to enhance the development of automated detection systems to recognize text automatically
generated by cutting-edge large language models, such as the Big Science’s BLOOM [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and the
OpenAI Babbage, Curie and DaVinci [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ]. For both English and Spanish language, the organizers
provided human-written samples and texts generated on five diferent writing domains. Two
subtasks were provided for each language: a) (subtask_1) distinguishing machine-generated
texts from human-written ones, focusing on the transfer-learning capabilities of the detector,
and b) (subtask_2) determining which language model generated a text. This paper describes
the participation of the blade-runner team in this challenge, focusing on the English subtasks.
We proposed two detectors used for both tasks: i) the jointly fine-tuned BERTweet [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] with a
classification layer on top of it, and ii) TriFuseNet, a neural network consisting of three branches:
one based on stylistic and textual features, another based on a language model’s embeddings,
and a third based on char-CNN. Our contribution was to leverage the fine-tuning efectiveness
of pre-trained language models [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], as well as leveraging semantic information and contextual
understanding [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. Fine-tuned BERTweet achieved an F1 score of 0.62 (0.57), while TriFuseNet
reached an F1 score of 0.72 (0.5) on subtask_1 (subtask_2). Our results encourage leveraging
stylistic, semantic and contextual information to recognize machine-generated texts from
human-written ones while pushing on the usage of (fine-tuned) pre-trained language models to
detect the generative LM of a generated text.
      </p>
      <p>The rest of the paper is organized as follows. Section 2 reviews previous works for both
subtasks, that is deepfake text detection and generative language model attribution. Section 3
describes the two subtasks and the provided dataset. In Section 4, the architectures for both
developed detectors are presented. Finally, Section 5 illustrates and discuss the results.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        During the last few years, especially with the development of the GPT language model series,
the deepfake text detection research field has surged [
        <xref ref-type="bibr" rid="ref33 ref34">33, 34</xref>
        ], providing techniques to both
recognize texts generated by Transformer-based language models (LM) from those written by
humans and to attribute a generated text to a specific generative LM.
      </p>
      <p>
        Deepfake Text Detection The detection of machine-generated texts has been addressed
encompassing diferent feature engineering and classification methods. As most generative
LM exhibit statistical diferences in word choice with respect to humans [
        <xref ref-type="bibr" rid="ref35 ref36">35, 36</xref>
        ], several
works leveraged features like perplexity [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ], per-token model probability [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ], and TF-IDF
over n-grams [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Moreover, generated texts tend to have diferent linguistic patterns with
respect to human-written ones [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ], such as a lack of syntactic and lexical diversity [
        <xref ref-type="bibr" rid="ref16 ref37 ref39">37, 16, 39</xref>
        ],
repetitiveness [
        <xref ref-type="bibr" rid="ref35 ref36">35, 36</xref>
        ], lack of coherence and purpose [
        <xref ref-type="bibr" rid="ref3 ref36">36, 3</xref>
        ]; Frohling et al. (2021) [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] exploited
this gap and successfully trained a simple machine learning classifier using crafted linguistic
features. Additionally, Zhong et al. (2020)[
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] held on the generative LM’s flaw of producing
nonsensical or inconsistent text to train a graph-based model that leverages the factual structure
of a document, emphasizing the importance of fact-verification as a critical component in
deepfake text detection.
      </p>
      <p>
        Typically, deepfake text detection is approached as a binary classification problem: standard
machine learning algorithms (such as linear regression, SVM, Decision Trees and Naive Bayes)
are widely used together with crafted statistical and stylistic features [
        <xref ref-type="bibr" rid="ref19 ref21">19, 21</xref>
        ], as well as with
semantic textual features [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ] or embeddings [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] extracted from pre-trained LMs. The machine
learning algorithms can also be substituted with (deep) neural networks such as CNN, LSTM
or RNN [
        <xref ref-type="bibr" rid="ref22 ref41 ref42">22, 41, 42</xref>
        ]. Furthermore, techniques that utilize LMs as a foundation are also being
investigated: the concept involves jointly fine-tuning a LM with a neural network classifier on a
combination of human-written and LM-generated texts, allowing to capture the implicit textual
nuances [
        <xref ref-type="bibr" rid="ref16 ref19 ref22 ref23 ref26 ref28 ref35">16, 19, 35, 22, 23, 26, 28</xref>
        ].
      </p>
      <p>
        The aim AuTextification challenge was to promote the development of models able to learn
features that generalize to unseen writing styles. Closely related to this goal, Solaiman et al.
(2019) [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] probed the OpenAI RoBERTa detector on texts generated by diferent versions of
GPT-2. They discovered that the RoBERTa detector trained on top-p sampling performs well
across various sampling methods, demonstrating transferability. Also, fine-tuning RoBERTa
achieves higher accuracy compared to GPT-2, potentially due to superior bidirectional
representations. This is in contrast with Zellers et al. (2019) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]’s work, which suggested using the
generative LM itself for detection. Furthermore, Stif et al. (2021) [ 43] found that GROVER [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]
and OpenAI RoBERTa detectors struggle to generalize efectively, especially for social media
posts. Additionally, Crothers et al. (2022) observed that smaller LMs can efectively detect text
generated by larger models, while Gambini et al. (2022) [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] proved that fine-tuning XLNET on
tweets written by humans, GPT-2 and older generative techniques (Markov Chain, RNN) can
efectively recognize GPT-3 tweets as machine-generated with an accuracy of 82.1%. Last but
not least, Li et al. (2023) [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]’s work is close to the AuTexTification challenge since they tested
the detection of deepfake texts across several writing styles (including opinion statements,
scientific writing and stories) experimenting with out-domain and out-model settings; they
found out that jointly fine-tuning a pre-trained language model (e.g., Longformer [ 44]) with
classification layer obtains the best performance (with an average recall over 90%) across all
testbeds. Considering these findings and aiming to develop a generalizable model, we pursued
two approaches: firstly, we fine-tuned a language model and assessed its generalization
capabilities over similar writing domains (e.g., tweets and reviews); secondly, we developed a
neural network with three branches based on linguistic features, BERTweet embeddings, and
char-CNN respectively. These branches can capture statistical, stylistic, semantic, and structural
diferences between human-written and generated text, providing robust and comprehensive
detection capabilities [
        <xref ref-type="bibr" rid="ref26 ref40">40, 26</xref>
        ].
      </p>
      <p>
        Generative Language Model Attribution Recognizing the LM which generated a text is a
less explored research field, but not less important. Tay et al. (2020) [
        <xref ref-type="bibr" rid="ref41">41</xref>
        ] investigated the extent
to which generated texts can be assigned to the correct generative LM’s configuration (decoding
method, model size and prompt length). Their findings reveal that even a simple classifier
like Bag-of-words followed by a Multilayer Perceptron Network can predict the modeling
configuration with accuracy ( 55.2%) higher than chance. The fact that a bag-of-words detector
performs similarly to a more complex encoder-based detector (e.g., based on the transformer
[45]) means that word order is less important. They also found that detecting the generative LM’s
configuration is harder than discriminating between human-written and machine-generated
texts. These findings support Uchendu et al.’s (2020) [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] study, which shows that basic models
(linguistic and psychological features inputted into traditional machine learning models or
simple neural networks like CNN and RNN) perform efectively in three contexts: i) deciding
whether two articles are written by the same generative LM (F1 score of 0.98), ii) distinguishing
human-written from machine-generated articles (F1 score of 0.92), and iii) identifying the
generative LM used to generate a given article (F1 score of 0.90). Furthermore, Munir et al.
(2021) [46] explored generative LM attribution across four tasks: attributing pre-trained LMs,
attributing fine-tuned LMs to parent pre-trained LMs, attributing pre-trained or fine-tuned LMs
with diferent sampling parameters, attributing fine-tuned variants of a pre-trained LM. The
probed detectors made use of stylometric features (Writeprint) as well as static (leveraging
Glove) and dynamic embeddings (leveraging the last hidden state of XLNET and/or GPT-2).
They showed that the attributor based on fine-tuned XLNet embeddings outperformed the other
approaches with an accuracy higher than 90% over all tasks.
      </p>
      <p>
        These previous works were conducted among the first Transformer-based language models
available from 2019, that is GPT [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], GPT-2 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], CTRL [47], GROVER [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], XLM [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], XLNet [48],
BART [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], PPLM [49] and FAIR [50]. On the other hand, the second task of the AuTextification
challenge targeted more recent language models like ChatGPT (a previous version was based on
text-davinci-003). We contributed with the same approaches used for the deepfake text detection
subtask but trained on a multi-class classification task: fine-tuning a language model could
achieve good results, as Munir et al. (2021) [46] showed in training the XLNet embeddings
followed by a softmax layer. Moreover, with the three-branched network on stylistic features,
language model embeddings and a character-based CNN we combined Uchendu et al.’s (2020)
[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and Munir et al. (2021) [46] findings.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Tasks and Dataset</title>
      <p>
        The AuTextification challenge involved five diferent domains to cover a wide variety of writing
styles, from more structured and formal to less structured and informal: legal documents (legal),
how-to articles (wiki), news articles (news), and social media (tweets, reviews). We focused
solely on the English subtasks:
• subtask_1 - Determine whether the text is automatically generated or not. To promote
generalization across new writing styles, the train set involves three domains (wiki, legal,
tweets), while the test set comprises two diferent domains (reviews, news).
• subtask_2 - Identify the specific text generation model among six options ( bloom-1b7,
bloom-3b, bloom-7b1, babbage, curie, text-davinci-003) [
        <xref ref-type="bibr" rid="ref31 ref5">5, 31</xref>
        ] that produced a given
generated text. Each class corresponds to a text generation model, with the models varying in
the number of neural parameters from 2B to 175B. All five writing styles are involved in
both train and test sets.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Methods</title>
      <p>Two diferent architectures were explored to tackle both tasks: fine-tuning BERTweet and
training a neural network incorporating stylistics, sentence embeddings, and character features.</p>
      <sec id="sec-4-1">
        <title>Writing</title>
      </sec>
      <sec id="sec-4-2">
        <title>Style</title>
        <p>Subtask
wiki
tweets
subtask_1 legal
reviews
news
total</p>
        <p>H
5,918
5,884
5,244
17,046</p>
      </sec>
      <sec id="sec-4-3">
        <title>Train</title>
        <p>G
5,862
5,813
5,124
16,799</p>
      </sec>
      <sec id="sec-4-4">
        <title>Train</title>
        <p>D
total
11,780
11,697
10,368
33,845
H
5,178
5,464
10,642
11,190</p>
      </sec>
      <sec id="sec-4-5">
        <title>Test</title>
        <p>G
5,726
5,464</p>
      </sec>
      <sec id="sec-4-6">
        <title>Test</title>
        <p>D
total
10,904
10,928
21,832
A language model pre-trained or fine-tuned on tweets was employed for both approaches.
This decision was based on a random examination of the train and test sets, revealing that the
maximum character length is 669 and the presence of language patterns specific to social media
posts, such as abbreviations, mentions, hashtags, and informal language. Consequently, these
distinctive features led us to select a language model suitable for analyzing social media texts.
To the best of our knowledge, the most efective advanced language models for handling social
media posts are those tailored for tweets.</p>
        <p>
          To optimize the hyper-parameters, we used a 5-fold cross-validation approach on the training
set. With the selected hyper-parameters we then trained the model under analysis on the
complete training set. Python (3.9.15) and the NVIDIA Tesla V100 (16GB) GPU were used for all
experiments.
4.1. Fine-tuning BERTweet
Jointly fine-tuning a Transformer-based language model followed by a fully connected neural
network for classification purposes is one of the most afirmed techniques for deepfake text
detection [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ], especially on social media texts [
          <xref ref-type="bibr" rid="ref22 ref23 ref24">22, 24, 23</xref>
          ]. As its high performance for the
detection of deepfake social media texts [
          <xref ref-type="bibr" rid="ref23 ref24">24, 23</xref>
          ] shows, BERTweet [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] (pre-trained on English
tweets using the RoBERTa [51] pre-training procedure) is the optimal language model candidate.
Figure 1 shows the designed architecture for both tasks. We used the same architecture for
subtask_2 as well to understand its potential in attributing the correct author (language model)
to the generated texts.
        </p>
        <p>Firstly, a text is tokenized through BERTweet’s tokenizer inserting the special classification
token &lt;s&gt; at the beginning and pad tokens to reach the maximum sequence length allowed (128
tokens). Then, the tokens are fed to BERTweet, generating a 768-dimensional vector for each of
the 128 tokens. The classification network takes the vector associated with the &lt;s&gt; token as
input. It consists of a fully connected dense layer with 768 units and a tanh activation function,
directly connected to a linear layer with a softmax activation. This generates probability scores
for each class, and the class with the highest score is selected as the output. Dropout is applied
after BERTweet and the fully connected dense layer to mitigate overfitting.</p>
        <p>
          We leveraged the Python SimpleTransformers (0.63.9) and Wandb library (0.14.2) [52] to
ifne-tune and optimize the hyper-parameters of the described architecture. The used
hyperparameters are listed in Table 2. We tuned the highlighted hyper-parameters using the Bayesian
Optimization [53] and maximizing the F1-macro score. The number of training epochs is fixed
to reduce the time of the optimization phase; it was set to five as it was the best value for similar
experiments with deepfake tweets [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ].
4.2. TriFuseNet: Stylistic Features, Embeddings and Chars
Both determining whether a text has been automatically generated or not and detecting the
generative source are authorship attribution tasks. Methods leveraging combinations of stylistic
features, contextualized word embeddings from Transformer-based language models, and
charbase deep neural networks are widely used for these kinds of challenges [54, 55]. Stylistic
features capture the unique writing style of an author, such as sentence structure, punctuation
        </p>
        <p>classification network
dropout</p>
        <sec id="sec-4-6-1">
          <title>Dense out_dim=768 activation=tanh</title>
        </sec>
        <sec id="sec-4-6-2">
          <title>Dense out_dim=num_labels dropout activation=softmax</title>
          <p>usage, and vocabulary choice. Contextualized word/sentence embeddings from
Transformerbased models enhance the network’s understanding of the semantics and syntax of the text,</p>
        </sec>
      </sec>
      <sec id="sec-4-7">
        <title>AdamW</title>
        <p>AdamW
linear with warmup</p>
        <p>linear with warmup
allowing it to capture fine-grained linguistic nuances. Additionally, a char-CNN, which operates
on character-level representations, can capture information about spelling patterns, typos, and
other text-level characteristics that are independent of word choice or sentence structure. By
combining these various features, a neural network can leverage high-level and low-level cues
to distinguish genuine text from deepfake text. Figure 2 illustrates TriFuseNet, the implemented
neural network architecture featuring a Stylistic-based, a Contextualized Sentence
Embeddingbased, and a Char-CNN branch.</p>
        <p>Firstly, inputs for each of the three branch are extracted from the input text:
• Stylistic Features - Table 3 shows the 51 extracted features.
• Contextualized Sentence Embedding - As a sentence embedding generator we adopted
TwHIN-BERT-base [56], a multilingual language model for tweet representations that
could have been used for the Spanish subtasks as well. The TwHIN-BERT-base tokenizer
prepares the input for the TwHIN-BERT-base model by tokenizing the text and padding
the tokens to match the maximum sequence length of 128 tokens. Then, the
TwHIN-BERTbase’s last hidden state is averaged on the sequence length, obtaining a 768-dimensional
features vector for the input text.
• Tokenized Chars - We tokenized the input text at the character level using the Keras
Tokenizer and padding to the maximum number of characters (669) among the train and
test sets.</p>
        <p>To reduce the number of features, the Stylistic and Contextualized Sentence Embedding
branches are followed by a dense layer. Instead, the Char-CNN branch consists of an embedding
layer followed by a simple CNN involving convolutional and max pooling layers; the outputs
of the CNN layers are concatenated in one vector. The latter is then concatenated with the
outputs of the Stylistic and Contextualized Sentence Embedding branches. This intermediate
vector is given in input to a classification network consisting of two dense layers with the final
one having softmax activation. The latter generates probability scores for each class, and the
class with the highest score is selected as the output. Dropout is applied after the CNN layers
to mitigate overfitting.</p>
        <p>We leveraged Tensorflow (2.10.1), Keras (2.10.0) and Hyperopt (0.2.7) Python packages to
optimize the hyper-parameters of the described architecture and train the final model. The used
hyper-parameters are listed in Table 4. We tuned the highlighted hyper-parameters using the
Bayesian Optimization [53] and maximizing the F1-macro score. We also employed the Early
Stopping strategy to stop training when the loss does not improve by 0.01 during 6 consecutive
epochs. Therefore, the number of training epochs for optimizing the hyper-parameters is
decided by the Early Stopping technique. To train the final model on the whole training set we
chose the number of training epochs resulting in the best F1_macro score among the 5-folds of
the optimal setting.
aWe erroneously fixed Dense3Size to 51. After the publication of the challenge’s results we optimized TriFuseNet
again using these values.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results and Discussion</title>
      <p>The AuTexTification organizers provided the results of five baselines: Logistic Regression with
bag of n–grams at word and character levels, fine-tuned DeBERTa V3 [ 57] with default
hyperparameters, Symanto Brain [58] (Few and Zero-Shot), and a Random baseline. Table 5 shows
the results for both subtasks. The F1_macro metric was adopted as the main evaluation metric
subtask</p>
      <p>model
subtask_1 TriFuseNet
for the AuTexTification challenge.
abaseline provided by AuTexTification organizers
Subtask_1 - Deepfake Text Detection The significant diference in results between
validation and test is primarily due to the diferent nature of the data present in the training and test
sets and the ability of the models to efectively perform transfer learning. While the TriFuseNet
solution maintains an acceptable level of accuracy even in the test set thanks to the usage
of general high-level and low-level linguistic cues, the fine-tuned Bertweet solution shows
a drastic decrease in accuracy, which significantly afects the quality of the proposed model.
Regarding writing domain detection, both models better recognize the reviews than the news
(Figure 3); this is likely due to the training on tweets, which is a similar writing style domain
to the reviews. Further validating the generalization capabilities of TriFuseNet, it achieves a
significant F1_macro score of 0.7 in detecting generated news, surpassing the performance of
ifne-tuned BERTweet, which only achieves an F1_macro score of 0.497. Overall, TriFuseNet
outperforms all AuTexTification’s baselines, while fine-tuned BERTweet is outperformed by
the Logistic Regression only. This proves that the usage of linguistic features, character-based
neural networks, bag of n-grams at the word and character levels, as well as the embeddings
from a LM capturing hidden linguistic cues is a good strategy for deepfake text detection across
unknown writing styles.</p>
      <p>reviews
news
reviews
wiki
news
tweets
domain</p>
      <p>
        Subtask_2 - Generative LM Attribution Surprisingly, fine-tuning BERTweet is the best
strategy to recognize the size of the text generation model used. This suggests that the hidden
characteristics of texts generated by Transformer-based language models can only be revealed
by the models themselves, as the DeBERTa V3 baseline supports. This is apparently true
even if the fine-tuned language model does not belong to the set of generation models used.
Furthermore, the relatively lower performance of TriFuseNet compared to fine-tuning BERTweet
indicates that the employed generation models may not possess markedly distinct stylistic
writing patterns. However, Figure 4 reveals that our detection models have higher success in
identifying texts generated by the largest model (text-davinci-003), suggesting distinct hidden
and plain linguistic characteristics compared to the other models. Notably, the second model
accurately detected is the smallest one (bloom-1b7 ), hinting at a potential similarity in writing
style between text-davinci-003 and bloom-1b7. As for the detection of writing domains, both
our models excel in identifying the generative source LM of review texts (Figure 3). This can
be attributed to the use of BERTweet and TwHIN-BERT in our models, which are trained or
ifne-tuned on tweets. These models demonstrate a better understanding of the writing style
exhibited in reviews, which bears a resemblance to tweets rather than sentences from sources
like Wikipedia, legal documents, or news articles. Despite being trained or fine-tuned on tweet
data, their performance on tweets is notably lower compared to reviews, as there still exists a
dificulty in recognizing the unique characteristics of short generated texts [
        <xref ref-type="bibr" rid="ref22 ref23 ref35">35, 22, 23</xref>
        ].
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>In this paper, we presented our participation in the AuTextification 2023 challenge, focusing on
deepfake text detection and generative language model attribution for English texts. Regarding
deepfake text detection, the TriFuseNet model demonstrated superior performance compared
text-davinci-003
l
e
d
o
M
g
n
i
t
a
r
e
n
e
G
l
e
d
o
M
g
n
i
t
a
r
e
n
e
G
bloom-1b7
bloom-3b
bloom-7b1
babbage</p>
      <p>curie
bloom-1b7
bloom-3b
bloom-7b1
babbage</p>
      <p>curie
text-davinci-003</p>
      <p>Domain = wiki
Domain = reviews</p>
      <p>Domain = news</p>
      <p>1st 2nd 3rd 4th 5th 6th
Order by True Positive values</p>
      <p>Fine-tuned Bertweet
TriFuseNet
1st 2nd 3rd 4th 5th 6th
Order by True Positive values</p>
      <p>1st 2nd 3rd 4th 5th 6th</p>
      <p>Order by True Positive values
to baseline models, efectively detecting deepfake texts across various writing styles with
an F1_macro score of 0.72. This indicates the importance of incorporating such linguistic
features, character-based neural networks, and language model embeddings to capture hidden
linguistic cues in deepfake text detection. Concerning generative language model attribution,
ifne-tuning BERTweet proves to be a better strategy than TriFuseNet for recognizing the
size of the text generation model used with an F1_macro score of 0.57. This suggests that
Transformer-based language models reveal the hidden characteristics of their generated texts,
as the AuTexTification’s DeBERTa V3 baseline supports. However, TriFuseNet successfully
identifies distinct hidden and plain linguistic characteristics in texts generated by the largest
model, although with slightly lower performances. The main limitation of our detection models
is the usage of language models pre-trained or fine-tuned on tweets, a particular category of
writing style. By exploiting more general language models, such as Longform, the results may
be improved for both models and subtasks.</p>
      <p>Overall, our findings contribute to the understanding of deepfake text detection and generative
language model attribution. They emphasize the significance of linguistic features and
characterbased approaches in deepfake text detection and highlight the role of fine-tuning a pre-trained
language model for the accurate attribution of generative language models. These insights pave
the way for further advancements in fighting deepfake texts and enhancing our understanding
of generative language models.
Springer International Publishing, Cham, 2021, pp. 523–538.
[43] H. Stif, F. Johansson, Detecting computer-generated disinformation, International Journal
of Data Science and Analytics (2021) 1–21.
[44] I. Beltagy, M. E. Peters, A. Cohan, Longformer: The long-document transformer, arXiv
preprint arXiv:2004.05150 (2020).
[45] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, I.
Polosukhin, Attention is all you need, in: Proceedings of the 31st International Conference on
Neural Information Processing Systems, NIPS’17, Curran Associates Inc., Red Hook, NY,
USA, 2017, p. 6000–6010.
[46] S. Munir, B. Batool, Z. Shafiq, P. Srinivasan, F. Zafar, Through the looking glass: Learning
to attribute synthetic text generated by language models, in: Proceedings of the 16th
Conference of the European Chapter of the Association for Computational Linguistics:
Main Volume, Association for Computational Linguistics, Online, 2021, pp. 1811–1822. URL:
https://aclanthology.org/2021.eacl-main.155. doi:10.18653/v1/2021.eacl-main.155.
[47] N. S. Keskar, B. McCann, L. R. Varshney, C. Xiong, R. Socher, Ctrl: A conditional transformer
language model for controllable generation, arXiv:1909.05858 [Preprint], 2019.
[48] Z. Yang, Z. Dai, Y. Yang, J. Carbonell, R. Salakhutdinov, Q. V. Le, Xlnet: Generalized
autoregressive pretraining for language understanding, in: Proceedings of the 33rd
International Conference on Neural Information Processing Systems, Curran Associates
Inc., Red Hook, NY, USA, 2019.
[49] S. Dathathri, A. Madotto, J. Lan, J. Hung, E. Frank, P. Molino, J. Yosinski, R. Liu, Plug and
play language models: A simple approach to controlled text generation, arXiv preprint
arXiv:1912.02164 (2019).
[50] N. Ng, K. Yee, A. Baevski, M. Ott, M. Auli, S. Edunov, Facebook fair’s wmt19 news
translation task submission, arXiv preprint arXiv:1907.06616 (2019).
[51] Y. Liu, M. Ott, N. Goyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. Zettlemoyer,
V. Stoyanov, Roberta: A robustly optimized bert pretraining approach, arXiv preprint
arXiv:1907.11692 (2019).
[52] T. Rajapakse, Simple transformers, 2021. URL: https://simpletransformers.ai/.
[53] S. Paul, Bayesian hyperparameter optimization - a primer, 2020. URL: https://wandb.ai/
site/articles/bayesian-hyperparameter-optimization-a-primer.
[54] J. Tyo, B. Dhingra, Z. C. Lipton, On the state of the art in authorship attribution and
authorship verification, arXiv preprint arXiv:2209.06869 (2022).
[55] E. Lukin, J. C. Roberts, D. Berdik, E. Mugar, P. Juola, Adjectives and adverbs as stylometric
analysis parameters, International Journal of Digital Humanities (2023) 1–13.
[56] X. Zhang, Y. Malkov, O. Florez, S. Park, B. McWilliams, J. Han, A. El-Kishky, Twhin-bert:
A socially-enriched pre-trained language model for multilingual tweet representations,
arXiv preprint arXiv:2209.07562 (2022).
[57] P. He, J. Gao, W. Chen, Debertav3: Improving deberta using electra-style pre-training with
gradient-disentangled embedding sharing, 2021. arXiv:2111.09543.
[58] Symanto, Symanto brain, 2023. URL: https://www.symanto.com/nlp-tools/symanto-brain/.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Narasimhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Salimans</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Improving language understanding by generative pre-training (</article-title>
          <year>2018</year>
          ). URL: https://s3-us
          <article-title>-west-2.amazonaws.com/openai-assets/ research-covers/language-unsupervised/language_understanding_paper</article-title>
          .pdf.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Luan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Language models are unsupervised multitask learners</article-title>
          , In: OpenAI Blog [Internet],
          <year>2019</year>
          . URL: https://openai. com/blog/better-language-models/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <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. D.</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>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          , G. Krueger,
          <string-name>
            <given-names>T.</given-names>
            <surname>Henighan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ziegler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hesse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          , E. Sigler,
          <string-name>
            <given-names>M.</given-names>
            <surname>Litwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Berner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>McCandlish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          , in: H.
          <string-name>
            <surname>Larochelle</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ranzato</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Hadsell</surname>
            ,
            <given-names>M. F.</given-names>
          </string-name>
          <string-name>
            <surname>Balcan</surname>
          </string-name>
          , H. Lin (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>33</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2020</year>
          , pp.
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          . URL: https://proceedings.neurips.cc/paper/ 2020/file/1457c0d6bfcb4967418bfb8ac142f64a-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Barham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. W.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gehrmann</surname>
          </string-name>
          , et al.,
          <article-title>Palm: Scaling language modeling with pathways</article-title>
          ,
          <source>arXiv preprint arXiv:2204.02311</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Akiki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pavlick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ilić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hesslow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Castagné</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Luccioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yvon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gallé</surname>
          </string-name>
          , et al.,
          <article-title>Bloom: A 176b-parameter open-access multilingual language model</article-title>
          ,
          <source>arXiv preprint arXiv:2211.05100</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          , T. Han,
          <string-name>
            <surname>S</surname>
          </string-name>
          . Ma, J. Zhang,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          , et al.,
          <article-title>Summary of chatgpt/gpt-4 research and perspective towards the future of large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2304</source>
          .
          <year>01852</year>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Pichai</surname>
          </string-name>
          ,
          <article-title>An important next step on our ai journey</article-title>
          ,
          <year>2023</year>
          . URL: https://blog.google/ technology/ai/bard-google
          <article-title>-ai-search-updates/.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Qadir</surname>
          </string-name>
          ,
          <article-title>Engineering education in the era of chatgpt: Promise and pitfalls of generative ai for education</article-title>
          ,
          <source>in: 2023 IEEE Global Engineering Education Conference (EDUCON)</source>
          , IEEE,
          <year>2023</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A. S.</given-names>
            <surname>George</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. H.</given-names>
            <surname>George</surname>
          </string-name>
          ,
          <article-title>A review of chatgpt ai's impact on several business sectors</article-title>
          ,
          <source>Partners Universal International Innovation Journal</source>
          <volume>1</volume>
          (
          <year>2023</year>
          )
          <fpage>9</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>G.</given-names>
            <surname>Jawahar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abdul-Mageed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. V.</given-names>
            <surname>Lakshmanan</surname>
          </string-name>
          ,
          <article-title>Automatic detection of machine generated text: A critical survey</article-title>
          , arXiv preprint arXiv:
          <year>2011</year>
          .
          <volume>01314</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Floridi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chiriatti</surname>
          </string-name>
          , Gpt-3
          <article-title>: Its nature, scope, limits, and consequences</article-title>
          ,
          <source>Minds and Machines</source>
          <volume>30</volume>
          (
          <year>2020</year>
          )
          <fpage>681</fpage>
          -
          <lpage>694</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. V.</given-names>
            <surname>Naragam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nilizadeh</surname>
          </string-name>
          ,
          <article-title>Generating phishing attacks using chatgpt</article-title>
          ,
          <source>arXiv preprint arXiv:2305.05133</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>K. T. Gradon</surname>
          </string-name>
          ,
          <article-title>Electric sheep on the pastures of disinformation and targeted phishing campaigns: The security implications of chatgpt</article-title>
          ,
          <source>IEEE Security and Privacy</source>
          <volume>21</volume>
          (
          <year>2023</year>
          )
          <fpage>58</fpage>
          -
          <lpage>61</lpage>
          . doi:
          <volume>10</volume>
          .1109/MSEC.
          <year>2023</year>
          .
          <volume>3255039</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Elsen-Rooney</surname>
          </string-name>
          ,
          <article-title>Nyc education department blocks chatgpt on school devices</article-title>
          , networks,
          <year>2023</year>
          . URL: https://ny.chalkbeat.org/
          <year>2023</year>
          /1/3/23537987/ nyc-schools
          <article-title>-ban-chatgpt-writing-artificial-intelligence.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <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>
          ,
          <source>in: 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>
          . doi:
          <volume>10</volume>
          . 18653/v1/
          <year>2020</year>
          .emnlp-main.
          <volume>673</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <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: Proceedings of the 33rd International Conference on Neural Information Processing Systems</source>
          , Curran Associates Inc.,
          <string-name>
            <surname>Red</surname>
            <given-names>Hook</given-names>
          </string-name>
          ,
          <string-name>
            <surname>NY</surname>
          </string-name>
          , USA,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Conneau</surname>
          </string-name>
          ,
          <article-title>Cross-lingual language model pretraining</article-title>
          , arXiv preprint arXiv:
          <year>1901</year>
          .
          <volume>07291</volume>
          (
          <year>2019</year>
          ). URL: https://arxiv.org/abs/
          <year>1901</year>
          .07291.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghazvininejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          , L. Zettlemoyer, BART:
          <article-title>Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension, in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>7871</fpage>
          -
          <lpage>7880</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .acl-main.
          <volume>703</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>703</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>I.</given-names>
            <surname>Solaiman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brundage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Release strategies and the social impacts of language models</article-title>
          , arXiv:
          <year>1908</year>
          .09203 [Preprint],
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Duan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Neural deepfake detection with factual structure of text</article-title>
          ,
          <source>in: 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>2461</fpage>
          -
          <lpage>2470</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .emnlp-main.
          <volume>193</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp-main.
          <volume>193</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>L.</given-names>
            <surname>Fröhling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zubiaga</surname>
          </string-name>
          ,
          <article-title>Feature-based detection of automated language models: tackling gpt-2, gpt-3 and grover</article-title>
          ,
          <source>PeerJ Computer Science</source>
          <volume>7</volume>
          (
          <year>2021</year>
          )
          <article-title>e443</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>T.</given-names>
            <surname>Fagni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Falchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gambini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Martella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tesconi</surname>
          </string-name>
          , Tweepfake:
          <article-title>About detecting deepfake tweets</article-title>
          ,
          <source>Plos one 16</source>
          (
          <year>2021</year>
          )
          <article-title>e0251415</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Gambini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Fagni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Falchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tesconi</surname>
          </string-name>
          ,
          <article-title>On pushing deepfake tweet detection capabilities to the limits</article-title>
          ,
          <source>in: Proceedings of the 14th ACM Web Science Conference</source>
          <year>2022</year>
          , WebSci '22,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2022</year>
          , p.
          <fpage>154</fpage>
          -
          <lpage>163</lpage>
          . URL: https://doi.org/10.1145/3501247.3531560. doi:
          <volume>10</volume>
          .1145/3501247.3531560.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Saravani</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ray</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ray</surname>
          </string-name>
          ,
          <article-title>Automated identification of social media bots using deepfake text detection</article-title>
          ,
          <source>in: Information Systems Security: 17th International Conference, ICISS</source>
          <year>2021</year>
          , Patna, India,
          <source>December 16-20</source>
          ,
          <year>2021</year>
          , Proceedings, Springer-Verlag, Berlin, Heidelberg,
          <year>2021</year>
          , p.
          <fpage>111</fpage>
          -
          <lpage>123</lpage>
          . URL: https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -92571-
          <issue>0</issue>
          _7. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -92571-
          <issue>0</issue>
          _
          <fpage>7</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>P.</given-names>
            <surname>Kowalczyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Röder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dürr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Thiesse</surname>
          </string-name>
          ,
          <article-title>Detecting and understanding textual deepfakes in online reviews (</article-title>
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J.</given-names>
            <surname>Pu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Sarwar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Abdullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rehman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhattacharya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Javed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Viswanath</surname>
          </string-name>
          ,
          <article-title>Deepfake text detection: Limitations and opportunities</article-title>
          , in:
          <year>2023</year>
          2023
          <string-name>
            <given-names>IEEE</given-names>
            <surname>Symposium</surname>
          </string-name>
          <article-title>on Security and Privacy (SP) (SP)</article-title>
          ,
          <source>IEEE Computer Society</source>
          , Los Alamitos, CA, USA,
          <year>2023</year>
          , pp.
          <fpage>1613</fpage>
          -
          <lpage>1630</lpage>
          . URL: https://doi.ieeecomputersociety.
          <source>org/10.1109/SP46215</source>
          .
          <year>2023</year>
          .
          <volume>00002</volume>
          . doi:
          <volume>10</volume>
          . 1109/SP46215.
          <year>2023</year>
          .
          <volume>00002</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>E.</given-names>
            <surname>Mitchell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khazatsky</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 machinegenerated text detection using probability curvature</article-title>
          ,
          <source>arXiv preprint arXiv:2301.11305</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Bi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Deepfake text detection in the wild</article-title>
          ,
          <source>arXiv preprint arXiv:2305.13242</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>A. M. Sarvazyan</surname>
            ,
            <given-names>J. Á.</given-names>
          </string-name>
          <string-name>
            <surname>González</surname>
            ,
            <given-names>M. Franco</given-names>
          </string-name>
          <string-name>
            <surname>Salvador</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chulvi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Rosso</surname>
          </string-name>
          , Overview of autextification at iberlef 2023:
          <article-title>Detection and attribution of machine-generated text in multiple domains</article-title>
          ,
          <source>in: Procesamiento del Lenguaje Natural</source>
          , Jaén, Spain,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Jiménez-Zafra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Montes-y</surname>
          </string-name>
          <string-name>
            <surname>Gómez</surname>
          </string-name>
          ,
          <source>Overview of IberLEF 2023: Natural Language Processing Challenges for Spanish and other Iberian Languages, Procesamiento del Lenguaje Natural</source>
          <volume>71</volume>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>O. AI</surname>
          </string-name>
          , Open ai models,
          <year>2023</year>
          . URL: https://platform.openai.com/docs/models.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>D. Q.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Vu</surname>
          </string-name>
          , A. T. Nguyen,
          <article-title>BERTweet: A pre-trained language model for English Tweets</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>9</fpage>
          -
          <lpage>14</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>E.</given-names>
            <surname>Crothers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Japkowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Viktor</surname>
          </string-name>
          ,
          <article-title>Machine generated text: A comprehensive survey of threat models and detection methods</article-title>
          ,
          <source>arXiv preprint arXiv:2210.07321</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>R.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-N.</given-names>
            <surname>Chuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>The science of detecting llm-generated texts</article-title>
          ,
          <source>arXiv preprint arXiv:2303.07205</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ippolito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Duckworth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Callison-Burch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Eck</surname>
          </string-name>
          ,
          <article-title>Automatic detection of generated text is easiest when humans are fooled</article-title>
          , arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>00650</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>A.</given-names>
            <surname>Holtzman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Buys</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Forbes</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Choi,</surname>
          </string-name>
          <article-title>The curious case of neural text degeneration</article-title>
          , arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>09751</volume>
          (
          <year>2019</year>
          ). URL: https://arxiv.org/abs/
          <year>1904</year>
          .09751, read
          <article-title>"TEXT GENERATION DECODING STRATEGIES" section</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <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.</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, Association for Computational Linguistics</article-title>
          , Florence, Italy,
          <year>2019</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>116</lpage>
          . URL: https://aclanthology.org/P19-3019. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P19</fpage>
          -3019.
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>B.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>How close is chatgpt to human experts? comparison corpus, evaluation, and detection</article-title>
          ,
          <source>arXiv preprint arXiv:2301.07597</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>A.</given-names>
            <surname>See</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pappu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Saxena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yerukola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>Do massively pretrained language models make better storytellers?</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>10705</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>E.</given-names>
            <surname>Crothers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Japkowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Viktor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Branco</surname>
          </string-name>
          ,
          <article-title>Adversarial robustness of neural-statistical features in detection of generative transformers</article-title>
          , in: 2022
          <source>International Joint Conference on Neural Networks (IJCNN)</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . doi:
          <volume>10</volume>
          .1109/IJCNN55064.
          <year>2022</year>
          .
          <volume>9892269</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bahri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Brunk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Metzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tomkins</surname>
          </string-name>
          ,
          <article-title>Reverse engineering configurations of neural text generation models, in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>275</fpage>
          -
          <lpage>279</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>25</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>S. G.</given-names>
            <surname>Tesfagergish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Damaševičius</surname>
          </string-name>
          , J. Kapočiu¯tė-Dzikienė,
          <article-title>Deep fake recognition in tweets using text augmentation, word embeddings and deep learning</article-title>
          , in: O.
          <string-name>
            <surname>Gervasi</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Murgante</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Misra</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Garau</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Blečić</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Taniar</surname>
            ,
            <given-names>B. O.</given-names>
          </string-name>
          <string-name>
            <surname>Apduhan</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. M. A. C. Rocha</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Tarantino</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. M. Torre</surname>
          </string-name>
          (Eds.),
          <source>Computational Science and Its Applications - ICCSA</source>
          <year>2021</year>
          ,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>