<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Conference and Labs of the Evaluation Forum, September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>BCAV: A Generative AI Author Verification Model Based on the Integration of Bert and CNN Notebook for PAN at CLEF 2024</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Guihong Sun</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wenyin Yang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Li Ma</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Foshan University</institution>
          ,
          <addr-line>Foshan</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>0</volume>
      <fpage>9</fpage>
      <lpage>12</lpage>
      <abstract>
        <p>As large language models (LLMs) continue to advance at astonishing speeds and are increasingly widely adopted, it becomes increasingly difficult for people to discern whether a given text is written by a human or a machine. Authorship verification has become a crucial and challenging task. This paper employs a text classification model that combines BERT and Convolutional Neural Networks (CNNs) in order to leverage BERT's powerful contextual understanding capabilities and CNN's efficient local feature extraction abilities to enhance text classification performance. The introduction of CNN effectively compensates for BERT's shortcomings in extracting features at the phrase level, particularly in capturing local features in the text, such as capturing n-gram features. Experimental results demonstrate that our approach outperforms baseline models significantly, with improvements of up to 6% in the ROC-AUC metric and nearly 3% in the Mean metric. We thus validate the effectiveness of this approach.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;PAN 2024</kwd>
        <kwd>Generative AI Authorship Verification</kwd>
        <kwd>BERT</kwd>
        <kwd>CNN1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>average score of 0.734. These results significantly outperformed other baseline models such as
Unsking and Fast DetectGPT, highlighting the enhanced ability of Bert_Transformer in
distinguishing between human and machine-generated text. This success underscores the
effectiveness of our approach in addressing the complexity of generative AI authorship
verification.</p>
    </sec>
    <sec id="sec-2">
      <title>2.Background</title>
      <p>
        In recent years, neural networks have seen extensive practice in text generation tasks,
encompassing rule-based systems, statistical methods, and more recently, deep learning
techniques. One of the most significant advancements has been the development of
Transformer-based models such as GPT and BERT . An approach [
        <xref ref-type="bibr" rid="ref7">3</xref>
        ]was proposed by authors to
control text generation simply, enabling researchers to adjust the generated text's theme, style,
or emotional inclination without retraining the model. The CTRL [
        <xref ref-type="bibr" rid="ref8">4</xref>
        ]model emphasizes
achieving finer-grained control in generation tasks by driving the model to generate text of
specific styles or themes through preconditioning codes.
      </p>
      <p>
        BERT, proposed by Devlin et al.[
        <xref ref-type="bibr" rid="ref9">5</xref>
        ], revolutionized the field of NLP by providing a robust
mechanism for contextual word representation. Unlike traditional models that consider words
individually, BERT captures bidirectional context, thus improving performance across a wide
range of NLP tasks. However, BERT's ability to handle long-distance dependency relationships
comes at the cost of sacrificing some local features, which are crucial for certain text
classification tasks.
      </p>
      <p>On the other hand, Convolutional Neural Networks (CNNs) are well-known for their ability to
efficiently capture local patterns through convolution operations. Initially popularized in
computer vision, CNNs have successfully adapted to text processing tasks, where they can
effectively identify n-gram features. Some scholars[6] have reexamined CNNs' application in
sentence classification tasks, particularly how fine-tuning pre-trained models and data
augmentation techniques enhance performance. Others[7] have studied CNN performance
across multiple text classification datasets, comparing the effects of different convolutional
layer configurations and hyperparameter settings.</p>
      <p>
        Combining the strengths of BERT and CNNs, recent studies[8][9][
        <xref ref-type="bibr" rid="ref6">10</xref>
        ] have explored hybrid
models that leverage both global context and local features. These hybrid approaches have
shown promising results but still require further exploration and validation. This study aims to
fill this gap by proposing and evaluating a new BCAV hybrid model to address text generation
tasks.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. System Overview</title>
      <sec id="sec-3-1">
        <title>3.1Dataset and Preprocessing</title>
        <p>This study utilized the "Generative AI Authorship Verification Task" dataset provided by
PAN@CLEF, which is a publicly available dataset specifically designed for verifying the
authorship of generated AI text. The PAN@CLEF dataset contains a large number of text
samples generated by different algorithms as well as text samples written by humans. These
texts cover various types and topics, including news articles, blog posts, comments, and more.
The PAN@CLEF dataset is typically organized into a series of text pairs, with each pair
accompanied by a label indicating whether they were written by the same author. The structure
specifically includes text pairs and labels, and the file formats are as follows:
{"id": "alpaca-7b/news-2021-01-01-2021-12-31-bideninauguration/art-022", "text": "..."}
{"id": "alpaca-7b/news-2021-01-01-2021-12-31-bideninauguration/art-025", "text": "..."}
The validation set provided by the "Generative AI Authorship Verification Task" in
PAN@CLEF is a crucial component for testing and optimizing authorship verification models.
Each text pair in the dataset is labeled as "0" or "1" to identify whether the texts are from the
same author. The validation set is saved in JSONL format, with each line containing a text pair：
{"id": "VHSN9BmKWQqLABGg", "text1": "...", "text2": "..."}
{"id": "ywVXxXG12zUebGyiL8Q", "text1": "...", "text2": "..."}</p>
        <p>In this study, the PAN@CLEF dataset was utilized to train and evaluate a hybrid model that
combines BERT and CNN, with the aim of improving the accuracy of text authorship verification.
Specifically, this dataset helped us systematically understand and identify the characteristics of
text generated by different types of generators. Through a series of experiments on the
PAN@CLEF dataset, we assessed the model's performance in distinguishing between
machine-generated text and human text. We employed various evaluation metrics such as
accuracy, recall, and F1 score to comprehensively analyze the model's effectiveness. The results
indicate that our model can achieve satisfactory performance in handling this specific task.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2Network Architecture</title>
        <p>In our research, we designed and implemented a hybrid neural network model that
combines BERT and CNN to perform complex text classification tasks, specifically aimed at
distinguishing between human-written and machine-generated text. The structure of this model
is illustrated in Figure 1. This model architecture is intended to fully leverage BERT's deep
semantic processing capabilities and CNN's local feature extraction abilities to enhance the
model's performance in handling fine-grained text analysis tasks. We use the BERT-based
uncased model from Hugging Face's Transformers library as our base pre-trained BERT layer.
The model first processes the input text using the pre-trained BERT layer, extracting word
embeddings rich in contextual information. BERT, serving as the foundational feature extractor,
captures long-range dependencies in the text through its Transformer architecture.
Subsequently, an attention mechanism layer is applied to the BERT output to enhance the focus
and processing of critical parts of the text, thereby optimizing information flow to the
subsequent layers. Multiple CNN layers then process these attention-weighted embeddings,
utilizing convolutional kernels to extract local features of the text, such as n-gram patterns,
which are particularly important for capturing the local semantics and style of the text. To
improve the model's generalization ability on unseen data and prevent overfitting, a Dropout
layer is introduced. For optimizing the model, we use a binary cross-entropy loss function to
fine-tune the model's accuracy. Finally, a fully connected layer maps the output features from
the CNN to classification results, determining whether a text is human-authored.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments and Results</title>
      <sec id="sec-4-1">
        <title>4.1Experimental Setting</title>
        <p>In this study, we utilized the pre-trained bert-base-uncased version of the BERT model as the
foundation for text feature extraction. Due to its balanced performance and computational
efficiency, it is suitable for complex text processing tasks under limited resources. We
configured three sizes of convolutional kernels (3, 4, 5), each with 100 filters, to capture
different lengths of n-gram features through multi-scale convolutional layers, thereby
improving the model's sensitivity to local text patterns.During the training process, we chose a
batch size of 8, a learning rate of 2e-5, and a total of 50 training epochs to ensure that the model
could learn sufficiently and avoid overfitting. Additionally, we used the Adam optimizer,
selected for its optimization effectiveness in training deep learning models, particularly in
handling gradient sparsity and weight decay.To ensure the reproducibility of experiments, we
set a fixed random seed, and all experiments were conducted in a computing environment
equipped with NVIDIA GeForce GTX 1660 Ti and Intel(R) Core(TM) i7-9750H CPU @ 2.60GHz.</p>
        <p>The main experimental process consists of three stages: data preparation, model training,
and performance evaluation.Firstly, in the data preparation stage, the dataset undergoes
preprocessing, including text cleaning, tokenization, and encoding using the BERT tokenizer.
Additionally, the data is randomly split into training and validation sets.In the model training
stage, the model iteratively learns on the training set. At the end of each epoch, the model's
performance is evaluated on the validation set to monitor for overfitting during the training
process.Finally, in the performance evaluation stage, we use standard classification metrics such
as accuracy, ROC-AUC, etc., to evaluate the model. Special attention is given to the model's
performance on an independent test set to validate its generalization ability in real-world
applications.Through this series of detailed and rigorous experimental procedures, we ensure
the accuracy and practicality of the research results.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2Result</title>
        <p>To comprehensively evaluate the performance of our proposed BCAV, we selected a series of
metrics, including ROC-AUC, Brier score, C@1, F1, and F0.5u. These metrics not only reflect the
overall performance of the model but also provide different perspectives on performance
evaluation, helping us to understand the model's performance in specific aspects. Additionally,
we calculate the arithmetic
mean
of these metrics to provide a single
measure for
comprehensive comparison of different models.</p>
        <p>The specific performance metrics are as follows:
in a classification task. It is calculated based on integration:</p>
        <p>ROC-AUC measures the model's ability to distinguish between positive and negative samples
Brier score is used to measure the accuracy of probability predictions. It is calculated as:
ROC-AUC = ∫ TPR( )  (FPR( ))</p>
        <p>Brier Score =</p>
        <p>∑(fi − oi)2
1
0

1

 =1
actual label of sample i (0 or 1).</p>
        <p>C@1 is a metric used for evaluating classification tasks. It is calculated as:</p>
        <p>N</p>
        <p>N1 ∑i=1 I(ŷi = −1)∑jN=1 I(ŷj = yj))</p>
        <p>N
where N is the number of samples,   is the predicted probability for sample i, and   is the</p>
        <p>where I is the indicator function that takes a value of 1 if the condition inside the parentheses
is true, otherwise 0.  ̂ is the predicted label for sample i, and   is the actual label of sample
F1 score is the harmonic mean of precision and recall. It is calculated as:</p>
        <p>F1 =
2×Precision×Recall</p>
        <p>Precision+Recall
Where Precision=</p>
        <p>TP
TP+FP
 

=</p>
        <p>TP .</p>
        <p>TP+FN
F0.5u score is a weighted F score that emphasizes precision. It is calculated as:
comprehensive performance score, which facilitates direct comparison between different
（1）
（2）
（3）
（4）
（5）
models to determine which model structure or parameter settings are more suitable for our
application needs. This multi-metric evaluation approach ensures the comprehensiveness and
reliability of the evaluation results, providing a solid foundation for the optimization and
application of future models. Our evaluation results are shown in Table 1:</p>
        <p>Approach
Baseline Unmasking
Baseline Fast-DetectGPT</p>
        <p>BCAV</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <sec id="sec-5-1">
        <title>Table1：Evaluation Results Of Bert-CNN</title>
        <p>ROC-AUC</p>
        <p>In this study, we proposed and implemented a hybrid neural network model combining
BERT and CNN aimed at improving the performance of text classification tasks, particularly for
authorship verification. The results indicate that the BCAV hybrid model proposed in this study
achieves satisfactory results in text classification tasks. Its excellent performance across
multiple evaluation metrics demonstrates the effectiveness of this model structure, providing
valuable insights for future natural language processing tasks.</p>
        <p>In future work, we will continue to refine our approach and strive for better results in
authorship verification.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgement</title>
      <p>This work was supported by grants from the Guangdong-Foshan Joint Fund Project (No.
2022A1515140096) and Open Fund for Key Laboratory of Food Intelligent Manufacturing in
Guangdong Province (No. GPKLIFM-KF-202305).
[6]Carpuat M, de Marneffe M C, Meza-Ruiz I. Proceedings of the 2022 Conference of the North
American Chapter of the Association for Computational Linguistics: Human Language
Technologies[C]//Proceedings of the 2022 Conference of the North American Chapter of
the Association for Computational Linguistics: Human Language Technologies. 2022.
[7]Lv C, Xu J, Zheng X. Spiking convolutional neural networks for text classification[C]//The</p>
      <p>
        Eleventh International Conference on Learning Representations. 2022.
[8]Quoc Tran K, Trong Nguyen A, Hoang P G, et al. Vietnamese hate and offensive detection
using PhoBERT-CNN and social media streaming data[J]. Neural Computing and
Applications, 2023, 35(1): 573-594.
[9]Xiong G, Yan K, Zhou X. A distributed learning based sentiment analysis methods with Web
applications[J]. World Wide Web, 2022, 25(5): 1905-1922.
[
        <xref ref-type="bibr" rid="ref6">10</xref>
        ]Sadat M, Caragea C. Scinli: A corpus for natural language inference on scientific text[J].
arXiv preprint arXiv:2203.06728, 2022.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. B.</given-names>
            <surname>Casals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dementieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Elnagar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Freitag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Smirnova</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Taulé</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Ustalov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Wiegmann</surname>
          </string-name>
          , E. Zangerle,
          <article-title>Overview of PAN 2024: Multi-Author Writing Style Analysis, Multilingual Text Detoxification, Oppositional Thinking Analysis, and Generative AI Authorship Verification, in: Experimental IR Meets Multilinguality, Multimodality, and Interaction</article-title>
          .
          <source>Proceedings of the Fourteenth International Conference of the CLEF Association (CLEF</source>
          <year>2024</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [2]
          <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>
          , M.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Potthast</surname>
          </string-name>
          ,
          <article-title>Continuous Integration for Reproducible Shared Tasks with TIRA.io</article-title>
          , in: J.
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Maistro</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Kruschwitz</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Caputo (Eds.),
          <source>Advances in Information Retrieval. 45th European Conference on IR Research (ECIR</source>
          <year>2023</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2023</year>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>241</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          URL:https://link.springer.com/chapter/10.1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>doi:10</source>
          .1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Dathathri</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Madotto</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lan</surname>
            <given-names>J</given-names>
          </string-name>
          , et al.
          <article-title>Plug and Play Language Models: A Simple Approach to Controlled Text Generation</article-title>
          [J].
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Keskar</surname>
            <given-names>N S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCann</surname>
            <given-names>B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varshney L R</surname>
          </string-name>
          , et al.
          <article-title>Ctrl: A conditional transformer language model for controllable generation</article-title>
          [J].
          <source>arXiv preprint arXiv:1909.05858</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Devlin</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            <given-names>M W</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            <given-names>K</given-names>
          </string-name>
          , et al.
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          [J].
          <source>arXiv preprint arXiv:1810.04805</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>