<!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>International Journal of
Advanced Computer Science and Applications 4 (2014). doi:10.14569/SpecialIssue.
2014.040109.
[23] R. Y. Pang</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1038/nature14236</article-id>
      <title-group>
        <article-title>ERINIA: Evaluating the Robustness of Non-Credible Text Identification by Anticipating Adversarial Actions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Piotr Przybyła</string-name>
          <email>piotr.przybyla@upf.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Horacio Saggion</string-name>
          <email>horacio.saggion@upf.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Computer Science, Polish Academy of Sciences</institution>
          ,
          <addr-line>Warsaw</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LaSTUS Lab, TALN Group, Universitat Pompeu Fabra</institution>
          ,
          <addr-line>Barcelona</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>11907</volume>
      <fpage>16</fpage>
      <lpage>20</lpage>
      <abstract>
        <p>The ERINIA project is aimed to address the challenges posed by the increasing importance of automatic assessment of text credibility. Text classifiers are commonly used by platforms hosting user-generated content, including social media, to aid or replace human moderation in filtering out text that is undesirable for some reason - bullying, hate speech, fake news, etc. Unfortunately, deep neural networks are known for their vulnerability to adversarial examples, i.e. data instances with small modifications that preserve the original meaning, yet change the prediction of the target classifier. Here we describe the research actions of the ERINIA project, planned to tackle this challenge by assessing the robustness of currently used classifiers in the misinformation context, creating better methods for discovering adversarial examples and detecting machine-generated content.</p>
      </abstract>
      <kwd-group>
        <kwd>robustness</kwd>
        <kwd>credibility assessment</kwd>
        <kwd>adversarial examples</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Herein we summarise the ongoing project Evaluating the Robustness of Non-Credible Text
Identification by Anticipating Adversarial Actions (ERINIA), carried out with the TALN group1 at
CEUR
Workshop
Proceedings</p>
    </sec>
    <sec id="sec-2">
      <title>2. Motivation</title>
      <p>
        The challenges that misinformation poses, both at the level of individuals and societies, are
widely known [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. The abundance of misleading or wrong information on platforms hosting
user-generated content3 has naturally led to attempts to limit its prevalence through a variety
of means, motivated not only by avoiding harm for users, but also by legal requirements in
many countries [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Using the tools available in the field of artificial intelligence (AI), especially machine learning
(ML), has long been recognised as a possible help in these eforts [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. More specifically, assessing
credibility of content can be seen as as a binary text classification: diferentiating between
credible and unreliable (fake) instances. Many tasks have been investigated through this lens,
including detection of fake news [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], social media bots [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], biased journalism [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], rumours [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ],
propaganda [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] or inaccurate statements [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The vast majority of the proposed solutions
are based on deep neural networks, either trained from scratch or based on pretrained large
language models.
      </p>
      <p>
        To deal with misinformation, but also other undesirable types of content (e.g. hate speech or
bullying), the major platforms have implemented content filtering systems involving a mixture
of AI- and human-based elements [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In some situations, automatic classifiers can even play a
dominant role4. Unfortunately, the neural network architectures usually applied to such tasks
show susceptibility to adversarial examples [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], i.e. data instances that have been maliciously
modified in order to fool a classifier. The misinformation spreaders are likely to try to use
such techniques to circumvent the filters in place. Additionally, text generators capable of
producing realistic content in response to a prompt make it easy to massively produce content
with deceptive purposes [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and this possibility has become even more likely with the release
of the newest models, such as ChatGPT [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>For example, consider a hypothetical scenario, where a malicious actor causes confusion and
distress by spreading entirely made-up rumours, e.g. about a hazardous fallout, using alarming
headings such as Radioactive dust approaching from the Mediterranean!. The platforms used
for hosting such content, e.g. social media and search engines, should detect all mentions of
this information and act accordingly: recommending debunking articles, discouraging from
sharing or banning the spreaders altogether. But if the ML model used for detection is not
robust enough, the actor might rephrase the heading, e.g. as Radioactive dust coming from the
south!, avoid the detection and continue the misinformation campaign.</p>
      <p>The reasons outlined above lead to a need to assess the robustness of the credibility assessment
models, i.e. their ability to maintain the expected accuracy level even in adversarial setting,
where the content creator attempts to mislead the classifier. This is precisely the goal of the
ERINIA project, implemented by developing methods and resources that help the discovery of
the adversarial examples, improving our understanding of how easy it is to attack the common
text classification methods. This could inform the discussion on whether such algorithms are
ift to shape the content of the media channels of great importance for the modern societies.
3Note that we are only discussing textual content here, as the most wide-spread carrier of misinformation.
4https://www.reuters.com/technology/twitter-exec-says-moving-fast-moderation-harmful-content-surges-202212-03/</p>
    </sec>
    <sec id="sec-3">
      <title>3. Action plan</title>
      <p>
        The investigation of adversarial examples (AEs) in the context of NLP is a relatively new efort
[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], with many potentially interesting research directions widely open. Thus, within ERINIA,
we plan to make contributions towards various areas: firstly, assessing the current situation
regarding vulnerability of existing models (section 3.1), secondly, improving the search for
adversarial examples through reinforcement learning (section 3.2) or meaning preservation
(section 3.3). Finally, we are also experimenting with detecting machine-generated text (section
3.4).
      </p>
      <sec id="sec-3-1">
        <title>3.1. Assessment of robustness against current attacks</title>
        <p>
          The first goal of this action is to improve understanding of the current situation. This is
necessary because content management platforms are already using machine learning-based
tools [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] and many attack methods, albeit simple, exist [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. The second goal is to establish a
foundation for measuring the efectiveness of adversarial attacks, that could then be used to
evaluate emerging methods, both in terms of new attacks and robust classifiers.
        </p>
        <p>
          The results of this action is the BODEGA (Benchmark for Adversarial Example Generation
in Credibility Assessment) framework, published recently [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. It is based on four
misinformation detection tasks (news bias assessment, propaganda detection, fact checking and rumour
detection), used to train two types of general-purpose text classifiers (BiLSTM and a fine-tuned
language model). Their robustness is then assessed by running eight AE generation techniques
and checking if the classifiers indeed change their output after small modifications. The
evaluation is based on a custom-designed measure, taking into account two aspects of similarity:
surface forms and meaning.
        </p>
        <p>
          The results of the experiments show that the fine-tuned language model is more robust
than BiLSTM, but the success of an attack depends on the scenario, and in some cases the
AEs based on character replacements (DeepWordBug) perform better, while in others more
complex solutions (BERTT-ATTACK) are appropriate. It also appears that tasks with a longer
text (i.e. news bias assessment) are more vulnerable to attacks than those with shorter input
(i.e. fact checking). BODEGA is based on the OpenAttack framework [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] and openly available
for download and use.5
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Reinforcement learning for adversarial examples</title>
        <p>As explained above, discovering AE is paramount to understand the vulnerability of a classifier
before it is deployed in a sensitive application. The task can be seen as performing a search in a
vast space – we have ( ∗  )  possibilities to perform  word replacements in a text of length
 using a dictionary of size  . Most of the currently used methods rely on a human-designed
heuristic, iterated until a classifier’s decision is flipped.</p>
        <p>However, it might be more eficient to train an ML model to design a procedure for a AE
generation automatically. The ML framework used to train agents that can learn a behaviour
in a given environment is reinforcement learning (RL). In this approach, an agent can perform</p>
        <sec id="sec-3-2-1">
          <title>5https://github.com/piotrmp/BODEGA</title>
          <p>actions that change the state of its environment and receive rewards, indicating the success of
the current strategy. During training, the agent tries many diferent strategies and gradually
learns to choose those that provide the highest rewards. The application of this framework for
discovering AEs is quite natural: state corresponds to the current text of the example, actions
to making modifications (e.g. word replacements) and rewards to AE quality measurement.</p>
          <p>
            Essentially, this would mean training an ML model to find weaknesses in another ML model.
Reinforcement learning has already been shown to lead to solutions that humans find surprising,
e.g. in computer games [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ]. Some initial experiments on similar solutions have shown
promising results [19, 20] and we hope to apply this approach to misinformation detection
within the ERINIA project.
          </p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Meaning preservation for adversarial examples</title>
        <p>The modifications of the original text, turning it into an AE, are not unlimited: if too many are
made, they change the meaning of the text, which fails to fulfil its original role. For example, a
credible news piece might become unreliable after enough word replacements are performed in
its text. Thus, another direction we aim to explore is meaning preservation, i.e. finding ways in
which a text might be modified into an AE that preserve its original semantics.</p>
        <p>This problem is not entirely novel, as it can be seen as paraphrasing [21], but including
additional constraints on the modified text, namely that it changes the classifier’s decision.
Other tasks of paraphrasing with constraints include text simplification, i.e. making a document
easier to read and understand [22], and style transfer, i.e. rewriting the text in a diferent style
[23]. We hope to draw the inspiration from these areas to improve the AE generation methods
in order to test the robustness of credibility assessment against such examples.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Detection of machine-generated text</title>
        <p>
          Finding solutions that perform well in adversarial scenario requires understanding the
perspective of the adversary, i.e. the author of the misinformation content. Since fake news articles are
carefully designed to maximise their emotional appeal [24], writing them manually is likely to
take significant efort. Thus, it seems plausible that the misinformation spreaders might turn
to automatic text generators to increase their speed, especially when faced with the need to
prepare many version of the same article to bypass content filtering. The NLP community was
aware of such possibilities when the first models generating human-like text emerged [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], but
recent advancements in the field, e.g. ChatGPT [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] have increased these concerns.
        </p>
        <p>Detecting machine-generated content might be helpful in recognising attempts to circumvent
content filtering procedures. While the current text generators produce content that untrained
humans cannot detect [25], this task might be performed by automatic classifiers instead.
Therefore, automatic text detection has been added to ERINIA goals to address this emerging
challenge.</p>
        <p>Our contribution [26] has been realised within the framework of the shared task
AuTexTification: Automated Text Identification [27], a part of 5th Workshop on Iberian Languages Evaluation
Forum (IberLEF 2023). We propose a collection of sequential features that measure the
predictability of tokens, i.e. how likely they are according to language models. The underlying
assumption is that model-generated text is formulaic and repetitive, while human authors can
compose surprising and creative writing. The predictability is supplemented with features
describing grammatical correctness, word frequency and linguistic patterns. Finally, a neural
network combining LSTM [28] and RoBERTa [29] is trained on the examples of human- and
machine-generated content provided through the shared task.</p>
        <p>Our solution has achieved the best performance in the binary classification task, both for
English and Spanish input [27]. We hope this contribution will aid further development in the
ifeld, including in context of misinformation detection.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Impact and future work</title>
      <p>Given the seriousness of the challenges posed by adversarial character of the misinformation,
we don’t expect them to be solved by a single project of limited size, such as ERINIA. Instead,
we hope to deliver impact by enabling and encouraging further work in this area by NLP
researchers and other stakeholders.</p>
      <p>In particular, we expect the following new directions to follow our project and similar eforts:
• Improved understanding of text classification robustness. We hope that our analysis
of the vulnerability of the models used in content filtering will contribute to a wider
discussion on whether these models are fit for the role they play in the current online
ecosystem.
• Better ways to discover adversarial examples. We know for sure the AEs exist, as
even the simple methods available now uncover plenty of them. Thus, we expect the
development of new methods for finding AEs, including our contributions based on
reinforcement learning and meaning preservation, will allow these weaknesses to be
spotted and fixed before the classifiers are deployed in publicly accessible systems.
• Established procedures for verifying robustness of newly introduced models.</p>
      <p>Thanks to the provision of BODEGA, there is a fast and easy way to test a given text
classification algorithm against common attacks. Continuing this efort by adding new
misinformation tasks and updated algorithms (both for attack and defense) is essential
for establishing clear workflows to verify if a given model is ready for its deployment in
an adversarial scenario.
• More robust text classification models. The currently common architectures based
on deep neural networks appear to be particularly susceptible to adversarial examples.
We expect the exploration made within ERINIA and similar eforts will be followed by
the design of text classifiers that are more robust, without sacrificing the classification
accuracy.
• High-certainty text authorship assessment. Crucially, platforms hosting user-generated
content need reliable methods to uncover if given text was indeed authored by a user,
or an automatic generator. While the performance of our submission was better than
of other approaches, we do not believe it is yet suficient for a high-stakes application
scenario. Hopefully, more accurate methods will follow, delivering higher certainty in
practical usecases.</p>
      <p>Finally, we need to emphasise that while many of the issues tackled in this project may
appear technical and hard to understand, they are relevant to the society as a whole. ML models
have an increasingly important role on shaping the public debate and media landscape and we
consider it paramount that their role is transparently demonstrated by the content platforms,
understood by their users and controlled by policymakers.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>The work is a part of ERINIA project that has received funding from the European Union’s
Horizon Europe research and innovation programme under grant agreement No 101060930.
Views and opinions expressed are however those of the author(s) only and do not necessarily
reflect those of the European Union. Neither the European Union nor the granting
authority can be held responsible for them. We acknowledge partial support from grant number
MCIN/AEI/10.13039/501100011033 under the Maria de Maeztu Units of Excellence Programme
(CEX2021-001195-M) and by Google Cloud through Research Credits6</p>
      <sec id="sec-5-1">
        <title>6https://edu.google.com/programs/credits/research/</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Tucker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Guess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Barberá</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Vaccari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Siegel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sanovich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Stukal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Nyhan</surname>
          </string-name>
          , Social Media, Political Polarization, and
          <article-title>Political Disinformation: A Review of the Scientific Literature</article-title>
          ,
          <source>Technical Report, Hewlett Foundation</source>
          ,
          <year>2018</year>
          . URL: https://hewlett.org/library/ social
          <article-title>-media-political-polarization-political-disinformation-review-scientific-literature/.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>S. van der Linden</surname>
          </string-name>
          ,
          <article-title>Misinformation: susceptibility, spread, and interventions to immunize the public</article-title>
          ,
          <source>Nature Medicine 2022 28:3</source>
          <volume>28</volume>
          (
          <year>2022</year>
          )
          <fpage>460</fpage>
          -
          <lpage>467</lpage>
          . URL: https://www.nature.com/ articles/s41591-022-01713-6. doi:
          <volume>10</volume>
          .1038/s41591-022-01713-6.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Durach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bargaoanu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Nastasiu</surname>
          </string-name>
          , Tackling Disinformation:
          <article-title>EU Regulation of the Digital Space</article-title>
          ,
          <source>Romanian Journal of European Afairs</source>
          <volume>20</volume>
          (
          <year>2020</year>
          )
          <fpage>5</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Ciampaglia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mantzarlis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Maus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Menczer</surname>
          </string-name>
          , Research Challenges of Digital Misinformation:
          <article-title>Toward a Trustworthy Web</article-title>
          ,
          <source>AI</source>
          Magazine
          <volume>39</volume>
          (
          <year>2018</year>
          )
          <article-title>65</article-title>
          . URL: https://144. 208.67.177/ojs/index.php/aimagazine/article/view/2783. doi:
          <volume>10</volume>
          .1609/aimag.v39i1.
          <fpage>2783</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Przybyła</surname>
          </string-name>
          ,
          <article-title>Capturing the Style of Fake News</article-title>
          ,
          <source>in: Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20)</source>
          , volume
          <volume>34</volume>
          , AAAI Press, New York, USA,
          <year>2020</year>
          , pp.
          <fpage>490</fpage>
          -
          <lpage>497</lpage>
          . URL: https://aaai.org/ojs/index.php/AAAI/article/view/5386. doi:
          <volume>10</volume>
          .1609/aaai.v34i01.
          <fpage>5386</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Varol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Ferrara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Flammini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Menczer</surname>
          </string-name>
          ,
          <article-title>Arming the public with artificial intelligence to counter social bots</article-title>
          ,
          <source>Human Behavior and Emerging Technologies</source>
          <volume>1</volume>
          (
          <year>2019</year>
          )
          <fpage>48</fpage>
          -
          <lpage>61</lpage>
          . doi:
          <volume>10</volume>
          .1002/hbe2.
          <fpage>115</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kiesel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Reinartz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <surname>A Stylometric</surname>
          </string-name>
          <article-title>Inquiry into Hyperpartisan and Fake News, in: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics</article-title>
          (Volume
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>231</fpage>
          -
          <lpage>240</lpage>
          . URL: https://www.aclweb.org/anthology/P18-1022.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J</given-names>
            .
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ciravegna</surname>
          </string-name>
          ,
          <article-title>Neural language model based training data augmentation for weakly supervised early rumor detection</article-title>
          ,
          <source>in: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM</source>
          <year>2019</year>
          ,
          <article-title>Association for Computing Machinery</article-title>
          , Inc,
          <year>2019</year>
          , pp.
          <fpage>105</fpage>
          -
          <lpage>112</lpage>
          . URL: https://dl.acm. org/doi/10.1145/3341161.3342892. doi:
          <volume>10</volume>
          .1145/3341161.3342892. arXiv:
          <year>1907</year>
          .07033.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>G. da San</given-names>
            <surname>Martino</surname>
          </string-name>
          , A.
          <string-name>
            <surname>Barrón-Cedeño</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Wachsmuth</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Petrov</surname>
          </string-name>
          , P. Nakov, SemEval2020 Task 11:
          <article-title>Detection of Propaganda Techniques in News Articles</article-title>
          ,
          <source>in: Proceedings of the Fourteenth Workshop on Semantic Evaluation (SemEval-2020)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1377</fpage>
          -
          <lpage>1414</lpage>
          . URL: http://propaganda.qcri.org/annotations/definitions.htmlhttp://arxiv.org/abs/
          <year>2009</year>
          . 02696. arXiv:
          <year>2009</year>
          .02696.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vlachos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Cocarascu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Christodoulopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mittal</surname>
          </string-name>
          ,
          <source>The FEVER2</source>
          .
          <article-title>0 Shared Task</article-title>
          ,
          <source>in: Proceedings of the Second Workshop on Fact Extraction and VERification (FEVER)</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Singhal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Paudel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Thota</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kumarswamy</surname>
          </string-name>
          , G. Stringhini, S. Nilizadeh, SoK: Content Moderation in Social Media, from Guidelines to Enforcement, and Research to Practice,
          <source>in: The 8th IEEE European Symposium on Security and Privacy (EuroS&amp;P</source>
          <year>2023</year>
          ), IEEE,
          <year>2022</year>
          . URL: https://arxiv.org/abs/2206.14855v2. doi:
          <volume>10</volume>
          .48550/arxiv.2206.14855. arXiv:
          <volume>2206</volume>
          .
          <fpage>14855</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Szegedy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zaremba</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bruna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Erhan</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Goodfellow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <article-title>Intriguing properties of neural networks (</article-title>
          <year>2013</year>
          ). URL: https://arxiv.org/abs/1312.6199v4. arXiv:
          <volume>1312</volume>
          .
          <fpage>6199</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <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>O.</given-names>
            <surname>Jack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Openai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Openai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Openai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. R.</given-names>
            <surname>Openai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Openai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wook</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Openai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kreps</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. M. Politiwatch</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Newhouse</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Blazakis</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Mcgufie</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Release Strategies and the Social Impacts of Language Models</article-title>
          ,
          <source>Technical Report, OpenAI</source>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1908</year>
          .09203v2. arXiv:
          <year>1908</year>
          .09203.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14] OpenAI, GPT-4
          <source>Technical Report, Technical Report, OpenAI</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>W. E.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. Z.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Alhazmi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Adversarial Attacks on Deep-learning Models in Natural Language Processing</article-title>
          ,
          <source>ACM Transactions on Intelligent Systems and Technology (TIST) 11</source>
          (
          <year>2020</year>
          ). URL: https://dl.acm.org/doi/10.1145/3374217. doi:
          <volume>10</volume>
          .1145/3374217.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>P.</given-names>
            <surname>Przybyła</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shvets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Saggion</surname>
          </string-name>
          , BODEGA:
          <article-title>Benchmark for Adversarial Example Generation in Credibility Assessment, arXiv preprint (</article-title>
          <year>2023</year>
          ). URL: https://arxiv.org/abs/2303. 08032v1. arXiv:
          <volume>2303</volume>
          .
          <fpage>08032</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          , M. Sun,
          <article-title>OpenAttack: An Open-source Textual Adversarial Attack Toolkit, in: ACL-IJCNLP 2021 - 59th Annual Meeting of the Association for Computational Linguistics and the 11th</article-title>
          <source>International Joint Conference on Natural Language Processing, Proceedings of the System Demonstrations, Association for Computational Linguistics (ACL)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>363</fpage>
          -
          <lpage>371</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .acl-demo.
          <volume>43</volume>
          . doi:
          <volume>10</volume>
          .18653/V1/
          <year>2021</year>
          .ACL-DEMO.
          <year>43</year>
          . arXiv:
          <year>2009</year>
          .09191.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mnih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kavukcuoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Silver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Rusu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Veness</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Bellemare</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Graves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Riedmiller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Fidjeland</surname>
          </string-name>
          , G. Ostrovski,
          <string-name>
            <given-names>S.</given-names>
            <surname>Petersen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Beattie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sadik</surname>
          </string-name>
          , I. Antonoglou,
          <string-name>
            <given-names>H.</given-names>
            <surname>King</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kumaran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wierstra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Legg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hassabis</surname>
          </string-name>
          ,
          <article-title>Human-level control through deep reinforcement learning</article-title>
          ,
          <source>Nature</source>
          <volume>518</volume>
          (
          <year>2015</year>
          )
          <fpage>529</fpage>
          -
          <lpage>533</lpage>
          . URL: https://www.nature.com/
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>