<!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>October</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Are Misinformation Propagation Models Holistic Enough? Identifying Gaps and Needs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Raquel Rodríguez-García</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Álvaro Rodrigo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roberto Centeno</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>NLP &amp; IR Group, Universidad Nacional de Educación a Distancia (UNED)</institution>
          ,
          <addr-line>28040 Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>20</volume>
      <issue>2024</issue>
      <fpage>62</fpage>
      <lpage>73</lpage>
      <abstract>
        <p>Misinformation has experienced increased online difusion, mainly due to the low control of published content and low interest in fact-checking it from social media users. Many eforts have focused on misinformation-related tasks, although typically centered on one perspective, such as shared texts or users' connections. There is a lack of holistic integrations of these local and global perspectives. Misinformation propagation models allow us to simulate how misinformation spreads through social media, and they are a way to combine both of those dimensions. In this work, we present a comprehensive study of the state of the art in this task to highlight these approaches' limitations and to establish the requirements for these models to approach misinformation propagation from a more holistic perspective.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Rumor Propagation</kwd>
        <kwd>Fake News</kwd>
        <kwd>Multi-agent Systems</kwd>
        <kwd>Epidemiological Models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Misinformation has proven to have a perverse efect by manipulating the public through diferent
techniques, such as appealing to their emotions or fears to foster its believability [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. It has negatively
afected democratic processes, such as the 2016 and 2020 US Elections [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ], and spread potentially
harmful content, such as the misinformation regarding the COVID-19 pandemic [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Many eforts
are underway to determine what distinguishes fake content from other information [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], to detect its
presence [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], or what users are more susceptible [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. At the micro level, fake news detection is addressed
by analyzing the information within a message. Recent eforts exploit Large Language Models (LLMs)
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for their enhanced performance. Other methods have explored the detection from a more rounded
standpoint, exploiting characteristics from Twitter (now X) threads [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], such as the depth of the tree, or
subjective metrics such as biases and credibility [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], outperforming state-of-the-art models.
      </p>
      <p>
        At the macro or social network level, there have been eforts to detect profiles sharing
misinformation [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], showing that information on user interactions improves results obtained using only user
information. The detection of bots is also explored through user features and network topology [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ],
showing how bot formations foster high propagation rates. It has also been approached from the lens
of the difering stances within communities [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. These features, from user characteristics to network
topology, prove informative for these tasks [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>
        From these eforts, we notice a general lack of holistic integration. Some approaches to detect
spreaders have integrated information from diferent levels [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], such as shared information, user
profiles, and ego networks. Nonetheless, most eforts focus on disjointed perspectives, either local
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] or global [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Holistic integration might limit the risk misinformation poses [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], especially
considering the complexity of organized campaigns. Propagation models, which allow us to simulate
how misinformation disseminates online, are a way to combine both dimensions.
      </p>
      <p>
        There are significant eforts toward modeling the users and their psychological capabilities or
behaviors [
        <xref ref-type="bibr" rid="ref17 ref7">17, 7</xref>
        ], although none includes the shared information. Some approaches have considered
the topics of the messages, their emotion, or users’ common interests [
        <xref ref-type="bibr" rid="ref18 ref19 ref20">18, 19, 20</xref>
        ], disregarding the
value of the content by itself. Regarding the macro level, most eforts employ synthetic networks [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
Other approaches have used real topologies without the matching shared information [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], although it
is crucial to the difusion [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
      </p>
      <p>
        As it becomes apparent, misinformation has been commonly studied from the perspective of separate
signals. Although propagation models present an opportunity to connect them, there is still a lack of
research. The content of the shared information plays a significant role in the difusion [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], difering
from real information [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Current eforts disregard this component, which seems counterintuitive,
given that the users interact with a message, textual or otherwise. With this work, we aim to
highlight current limitations within these models, afecting their holistic integration and exploring the
requirements for proper experimental frameworks.
      </p>
      <p>This paper is structured as follows. We review state-of-the-art propagation models in Section 2. In
Section 3, we expose their limitations, and in Section 4, we identify the requirements for these holistic
models. Finally, in Section 5, we highlight our conclusions.</p>
    </sec>
    <sec id="sec-2">
      <title>2. State of the Art</title>
      <p>This section reviews the state-of-the-art propagation models. We start with early approaches in Section
2.1, then continue with epidemiological-based models in Section 2.2. In Section 2.3, we introduce
non-epidemiological models, while Section 2.4 covers agent-based social models.</p>
      <sec id="sec-2-1">
        <title>2.1. Early Approaches</title>
        <p>
          Based on ordinary diferential equations (ODEs), epidemiological models have been extensively
employed to study the difusion of a virus within a population [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]. These models introduce one or
several infected individuals into a population. The disease spreads amongst those susceptible until it
has afected the whole group, or its difusion slowly stops. These models divide the population into
exclusive categories: Susceptible, Infected, and Removed. These are the states the users are in regarding
the disease, and they give this model its name: the SIR model.
        </p>
        <p>
          One of the first approaches to information difusion adapts this epidemiological model [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] as an
“intellectual epidemic”, initially devised for its application in Information Retrieval. This approach
creates a simile between the spread of a disease and the dissemination of information. Using the concepts
in the epidemiological model as an analogy, the disease is now an idea or a piece of information, and
the individuals are readers waiting to come into contact with it.
        </p>
        <p>
          Stemming from the initial epidemiological model [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], other variations were proposed, such as the
Daley-Kendall (DK) or Ignorant-Spreader-Stifler (ISS) model [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ], including rumor-specific concepts,
such as a decay rate to symbolize the forgetting of the information or its “news value”. A later adaptation,
the Maki-Thompson model [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ], simplifies the former by altering the rate at which spreaders turn into
stiflers.
        </p>
        <p>
          These previous models, and others in this section, might rely on stochastic or deterministic processes.
In a stochastic process, the transitions between the compartments are probabilistic (finite-state Markov
Chain). In a deterministic model, transitions are expressed through diferential equations. A
deterministic model is simpler than a stochastic one. However, it presents some drawbacks, such as the transition
rates being proportional to the population size [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ] and not allowing for individual behavior or network
heterogeneity. Stochastic models incorporate randomness and are also more realistic [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ], at the cost of
higher complexity [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Extension of Epidemiological Models</title>
        <p>Based on the previous models, a formal definition of information difusion we will use for these next
sections corresponds with the interactions between a population of N individuals, with an underlying
graph (directed or undirected)  = (, ) for a set of vertices  = {0, ..., − 1} and a set of edges
 = {0, ..., − 1} that connects them. A node represents a user, and the edges between the users
denote the connections, either explicit (follower-followee relationships) or implicit (interaction-based).
Difusion would be measured in users’ internal stance (state) regarding the information per time unit.</p>
        <p>
          Many other models inspired by epidemiological difusion have been proposed since its early
approximation, adapted to rumor difusion, such as the Susceptible-Infected (SI) model [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ], where users
carry the information forever. The Susceptible-Infected-Susceptible (SIS) model [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ], where the
population would become Susceptible again, reflecting that users might forget the information. Lastly,
the Susceptible-Infected-Recovered-Susceptible (SIRS) model [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ] considers the possibility of gaining
immunity after going through the infection (Recovered), and the possibility of losing it after some time
(Susceptible).
        </p>
        <p>
          These models face the problem of a clear divergence between information and epidemic transmission
and the complexity of the former. Information difusion depends on many factors, such as network
topology or social interactions. Epidemiological models work on the assumption of a homogeneously
interacting population, which contrasts with complex social media networks, facing unexpected deviations
from the results obtained in epidemic fields [
          <xref ref-type="bibr" rid="ref35 ref36">35, 36</xref>
          ]. Another shortcoming involves the compartments
for the population. Individuals might not get Infected but rather turn Fact Checkers against
misinformation or undergo a period of indecision. Due to these limitations, other models aim to include complex
factors not directly extracted from epidemiological behaviors but inspired by their interactions.
        </p>
        <p>
          In the Susceptible-Exposed-Infected-Recovered (SEIR) model [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ], individuals might go through an
Exposed state after being in contact with an Infected node. Some variations consider the fuzziness of
a rumor and a hesitating mechanism before sharing [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ], a Skeptic state where users never share the
information received (SEIZ) [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ], or a transition to a Recovered state (SEIZR) [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ]. The
SusceptibleKnown-Infected-Recovered (SKIR) model [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ] creates a state for the individuals that spread the anti-rumor,
drawing inspiration from evolutionary game theory for users’ behaviors. Also modeling their opinions,
the Susceptible-Positively Infected-Negatively Infected-Recovered (SPNR) model [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ] includes two diferent
stances towards the rumor: Positively or Negatively Infected. Regarding their emotion, the
Emotionbased SIS model (ESIS) [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] classifies the message into seven diferently weighted classes, such as fear
or happiness, thus rendering some emotions more efective for spreading.
        </p>
        <p>
          Other more complex models consider more states, such as the SCNDR model [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ], where Susceptible
users in this model might turn Credulous, Neutrals, or Denies, as well as turn Recovered. Besides believing
the information or not, individuals might share it, not act or warn other users. The ICSAR model [
          <xref ref-type="bibr" rid="ref44">44</xref>
          ]
considers the states: Ignorant, Carrier, Spreader, Advocate and Removed. These states can be further
classified based on whether their information is a rumor or the truth. While users might transition
between the diferent states and stances, Advocate and Removed are sink states, thus reflecting how
users might not be persuaded to change their opinion.
        </p>
        <p>
          As it becomes apparent, many models have drawn inspiration from epidemiology studies. Although
they have been extended to account for information difusion particularities, they still struggle to
reflect intricate behavior. Dividing the population into compartments simplifies the problem, but it
faces the dificulty of reflecting complex social behavior with a discrete label. As an example, in the
IS1S2C1C2R1R2 model [
          <xref ref-type="bibr" rid="ref45">45</xref>
          ], the diference between the Super Authoritative and Authoritative or Super
Rumor Spreader and Rumor Spreader states might have more to do with node qualities and network
position rather than a state in a finite state machine.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Non-Epidemiological Models</title>
        <p>Although epidemiological models have been extensively used in information difusion, other
mathematical models have been proposed. Some include Independent Cascades, the Linear Threshold Maximization
model, or Hawkes Processes.</p>
        <p>
          Independent Cascades start with a set of active nodes [
          <xref ref-type="bibr" rid="ref46">46</xref>
          ]. With each step, they might activate other
surrounding inactive nodes with a set probability dependent on the connecting edge. There is only one
chance for a node to activate its neighbors. This model has been used in the difusion of information
[
          <xref ref-type="bibr" rid="ref47">47</xref>
          ], showing that the dynamics can reflect those of social media [
          <xref ref-type="bibr" rid="ref48 ref49">48, 49</xref>
          ]. Other variations do not limit
influence to a one-time-only event but a window [
          <xref ref-type="bibr" rid="ref50">50</xref>
          ].
        </p>
        <p>
          The Linear Threshold model [
          <xref ref-type="bibr" rid="ref51">51</xref>
          ] establishes a threshold of surrounding neighbors for the users to
change their behavior. Once a node is active, it cannot be deactivated. Other variations introduce
weights between the nodes to account for social dynamics [
          <xref ref-type="bibr" rid="ref52">52</xref>
          ]. Further adaptations also introduce user
information and the similarity between previously shared content [
          <xref ref-type="bibr" rid="ref53">53</xref>
          ].
        </p>
        <p>
          Multivariate Hawkes Process is a type of stochastic point process model characterized by its ability
to self-excite. Hawkes Point Process model was originally proposed to investigate earthquake events
[
          <xref ref-type="bibr" rid="ref54">54</xref>
          ]. These models have been used for information difusion on social media [
          <xref ref-type="bibr" rid="ref55">55</xref>
          ] and to devise how to
mitigate its efects [
          <xref ref-type="bibr" rid="ref56">56</xref>
          ].
        </p>
        <p>
          There are other lesser-known models, such as Push-Pull [
          <xref ref-type="bibr" rid="ref57">57</xref>
          ], which employs a pair-wise interaction
where the user shares their information to attempt to “push” or “pull” others. Markov Chains have also
been explored for this task, both discrete-time [
          <xref ref-type="bibr" rid="ref58">58</xref>
          ], and continuous-time [
          <xref ref-type="bibr" rid="ref59">59</xref>
          ].
        </p>
        <p>
          These previous models are more commonly Influence Maximization problems. Normally, a
higherlevel controller supervises the optimization and the simulations, so individuality is limited. Additionally,
some of these problems are NP-Hard. Although there are many eforts towards its reduction and
optimization [
          <xref ref-type="bibr" rid="ref47 ref50">47, 50</xref>
          ], time complexity is high.
        </p>
        <p>
          Beyond the epidemiological analogy, other models have been proposed inspired by diferent naturally
occurring phenomena. Such is the case of the Energy Model [
          <xref ref-type="bibr" rid="ref60">60</xref>
          ] and the Forest Fire Model [
          <xref ref-type="bibr" rid="ref61">61</xref>
          ]. The
Energy Model is based on the physical theory of heat energy. This model alters the traditional paradigm
of a binary value for the difusion, whether the user is infected or not, and leverages a continuous range
of agreement with the rumor, constituting their “energy”.
        </p>
        <p>
          The Forest Fire Model [
          <xref ref-type="bibr" rid="ref61">61</xref>
          ] is influenced by the process of fire spreading in a forest. Drawing inspiration
from the diverse factors that afect the formation and spread of fire, it creates a simile with social
interactions. The forest density relates to users’ ego networks, and the area’s topography relates
to the account activity. Further extensions allow users to receive the information without sharing
it and a similarity score between them to assess their probability of sharing [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. Although textual
characteristics are included, they are used to model the users to establish similarity scores through
matching keywords, not as part of the shared content.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Agent-Based Social Models</title>
        <p>
          A more recent trend is to exploit the potential of Agent-Based Social Systems (ABSS). Most previous
models assume homogeneity in user behavior, influence, or topology, which is limiting [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. ABSS also
adopts compartmental epidemiological models while solving those issues.
        </p>
        <p>
          The SIR epidemiological model has been adapted to ABSS technologies [
          <xref ref-type="bibr" rid="ref62">62</xref>
          ]. This model considers
Infected users might get Cured by realizing the rumor is fake and stop sharing. Other studies distinguish
malicious and regular users and study their influence and susceptibility based on a belief system [
          <xref ref-type="bibr" rid="ref63">63</xref>
          ].
Similarly, it has been extended to account for bots and influencers with diferent behaviors [
          <xref ref-type="bibr" rid="ref64">64</xref>
          ], as well
as time dynamics or trust measures between agents [
          <xref ref-type="bibr" rid="ref65">65</xref>
          ]. These approaches face the problem of only
focusing on user-specific characteristics.
        </p>
        <p>
          Other eforts have modeled individual processes in users’ perceptions, such as an uncertainty-based
SIR model, where uncertainty is modeled through ambiguity and ignorance [
          <xref ref-type="bibr" rid="ref66">66</xref>
          ], or a cognitive-inspired
model where belief is measured based on dissonance and exposure [
          <xref ref-type="bibr" rid="ref67">67</xref>
          ]. Other common social efects
and theories, such as homophily or social influence, have also been studied, such as a segregation
between gullibles and skeptics within the population [
          <xref ref-type="bibr" rid="ref68">68</xref>
          ], aiding the spread of a rumor, or social context
based o similarity and influence propagation [
          <xref ref-type="bibr" rid="ref69">69</xref>
          ].
        </p>
        <p>
          Social sciences have been another interesting topic of research. The Big Five model [
          <xref ref-type="bibr" rid="ref70">70</xref>
          ] has been
estimated to explore user similarity [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], homophily regarding political views [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], or a trust model
based on users’ identity, behavior, and relationships [
          <xref ref-type="bibr" rid="ref71">71</xref>
          ]. Game theory and decision theory have also
been studied in the context of fake news [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], introducing common deception strategies to benefit from
the uncertainty. Social Impact Theory has also been used for modeling rumors [
          <xref ref-type="bibr" rid="ref72">72</xref>
          ] by introducing other
components such as persuasiveness or environmental bias. Lastly, echo chambers are also explored
from diferent levels [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]: individual, environmental, and technological. Based on their experiments,
the individual level is enough to polarize the networks, but adding the other two components generates
more distinct groups.
        </p>
        <p>
          The last and more recent approach exploits the capacity of large language models (LLMs) to simulate
the opinions shared [
          <xref ref-type="bibr" rid="ref73 ref74">73, 74</xref>
          ]. Each agent potentially has diferent individual traits, personalities, and
memories, and they can engage in discussions where they can reflect on their opinions and update
them as needed. This new framework allows for fully customizable and rich environments to simulate
how disinformation spreads.
        </p>
        <p>
          An advantage of these approaches is the ability to test complex social-based behavior, such as
simultaneous information [
          <xref ref-type="bibr" rid="ref75">75</xref>
          ] or real discussions between the agents. Although mathematical models
have been used with centralized and decentralized measures [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], ABSS is more versatile and has been
studied further in this context to identify influential nodes and delay the difusion process [
          <xref ref-type="bibr" rid="ref76">76</xref>
          ], to
study the simultaneous spread of a rumor and its counterinformation [
          <xref ref-type="bibr" rid="ref75">75</xref>
          ], and other measures based
on user attention [
          <xref ref-type="bibr" rid="ref64">64</xref>
          ]. The main problem in many of these studies is the lack of real data validation.
When including some of these social theories, the need arises to determine information from the user
that might not be easily extracted or determined. This forces the models to employ estimations or
distributions, which introduce biases.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Current Limitations</title>
      <p>Propagation simulation models have some limitations, which afect their holistic integration. We can
summarize them based on the five main areas we explore below.</p>
      <p>
        Users. Whenever users are characterized, their metrics are established through probability
distributions or means that cannot be validated, partly due to their complexity and the dificulty of extracting
them from real data. Some proposals also employ psychological models without contemplating that
associations between social media usage and these traits are not always found [
        <xref ref-type="bibr" rid="ref77">77</xref>
        ]; they might not
align with the modeled behavior, or they might vary over time.
      </p>
      <p>
        Content. Users have been the main focus in this area. Few studies consider the message through
incomplete dimensions [
        <xref ref-type="bibr" rid="ref78">78</xref>
        ] or to establish user similarity based on posted content [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. As such, content
within the difusion has not been explored. There is also a very pointed focus on the dichotomy of fake
and real news. A priori, information is unverified and might remain so. Focusing on the characteristics
rather than the truth value seems more realistic and valuable.
      </p>
      <p>Network. In most cases, the topologies used are synthetic or do not match the real difusion.
This makes it impossible to connect users with their characteristics and topology, although it is an
essential component. Another limitation is creating a network with as many users as participants in the
conversation, which already creates an implicit bias. Although it would be computationally impossible
to include all the users in any social media network, only including those participating makes another
issue arise: predicting when users will not participate.</p>
      <p>
        Internal state. Most studies measure interaction based on states, which reflect an internal measure
of the users participating in the difusion. Messages are used to make an abstraction of the users’ state.
This also allows intermediate states to reflect user behaviors that cannot be found in the real data. This
situation can be avoided by using the messages directly, reflecting difusion more accurately since users
can share more than one message, but their state would remain a bounded constant. Messages were
only employed in one study [
        <xref ref-type="bibr" rid="ref63">63</xref>
        ], aggregating difusion into zero messages, over 500, and in-between.
This would suggest that 500 retweets have the same relevance as 50.000, which should not be correct.
      </p>
      <p>
        Evaluation. In most cases, validation is done through empirical evaluation or the analysis of
mathematical properties of the difusion within the networks. Although mathematical properties
provide a theoretical background, real complex networks are characterized by their non-trivial features,
which do not appear in synthetic graphs. Regarding empirical evaluation, incomplete data is most
commonly employed, which forces the issue of its validity. Some approaches have been evaluated
aggregating at the time level [
        <xref ref-type="bibr" rid="ref63">63</xref>
        ], which dismisses how relevancy works in social media: 500 retweets
Dataset
FakeNewsNet[
        <xref ref-type="bibr" rid="ref79">79</xref>
        ]
Palin and Obama[
        <xref ref-type="bibr" rid="ref80">80</xref>
        ]
ReCOVery[
        <xref ref-type="bibr" rid="ref81">81</xref>
        ]
CoAID[
        <xref ref-type="bibr" rid="ref82">82</xref>
        ]
MediaEval[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]
PHEME-9[
        <xref ref-type="bibr" rid="ref83">83</xref>
        ]
SNAP[
        <xref ref-type="bibr" rid="ref84">84</xref>
        ]
      </p>
      <p>Content Temporal
✓ ✓
✗ ✓
✓ ✓
✓ ✓
✓ ✗
✓ ✓
✗ ✗</p>
      <p>Network
✗
✗
✗
✗
✓
✓
✓</p>
      <p>User Stance
✓ ✗
✓ ✓
✓ ✗
✓ ✗
✗ ✓
✓ ✓
✗ ✗</p>
      <p>Topic
Politics</p>
      <p>Politics
COVID-19
COVID-19
Conspiracies</p>
      <p>General
in 10 minutes do not equate to 500 retweets in 10 days.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Requirements for a Properly Experimental Framework</title>
      <p>A proper experimental framework is required to overcome propagation models’ limitations. Within
this empirical evaluation, it is important to recreate the scenarios of a news piece’s difusion on social
media. Datasets that contain the necessary information to evaluate the models are crucial. Below, we
explore the most relevant information required for this process.</p>
      <p>Information of the shared content (Content) and the users (User). The information shared is an
essential part of the difusion. This includes the initial post, external website links, or visual content.
In terms of the users, since they are the main focus of these models, it is important to have enough
information on user metrics and engagement to properly characterize them.</p>
      <p>Temporal information of when the texts are shared, by whom, and which users engage with it at
what given times (Temporal). Besides the texts, we need to know the timestamps of when those posts
are shared to determine the evolution of the news: whether more information is added or corrected, as
well as how many times it appears at diferent times. Within the simulation, it determines when users
are engaging, which is crucial for the evaluation.</p>
      <p>The social network (Network). This is an important element in the difusion of content online.
Although synthetic networks might reflect some properties of real social media networks, they pose a
significant limitation since difusion inherently depends on those connections. Users with millions of
followers will have higher chances of broadcasting information than new users.</p>
      <p>Posts labeled with their stance (Stance). This is a relevant measure to study and evaluate difusion in
terms of epidemiological-based models. Distinguishing between Infected and Vaccinated is essential,
equivalent to users’ stance towards a post (Support or Oppose).</p>
      <p>After establishing these requirements, we review available datasets to determine their suitability.
In Table 1, we include the most relevant ones we found and their relevant characteristics. We have
excluded datasets created ad-hoc since they are not publicly available and typically require retrieving
new data and those centered around topics unrelated to misinformation.</p>
      <p>As illustrated in Table 1, most datasets focus on the Text and Temporal aspects (the tweets and
timestamps), and the User information from the poster. Some datasets, such as MediaEval, anonymize
the tweets by removing the time when tweets were posted and removing the information from the users.
These features are essential to establish the difusion of information. Regarding this type of content,
the SNAP collection does not provide difusion information; it only shares the topologies from social
media networks. Although it is valuable information, the difusion that matches the network is deemed
necessary. Some other collections, such as PHEME-9, include information regarding the users’ state or
stance towards the information. This information is also essential to evaluate epidemiological-based
models.</p>
      <p>Only two of the listed datasets include Network information associated with the difusion: PHEME-9
and MediaEval. Medieval poses an additional problem due to its topology, created based on an interaction
network. It is also significantly filtered and skewed: 3,800 tweets are associated with a network of 1.7
million nodes and 270 million edges. Based on these available resources, we can see that most current
available datasets do not provide enough information for a proper evaluation. This is an important
limitation and highlights the need for more publicly available content for the community to further
research eforts into mitigating fake news.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions and Future Work</title>
      <p>Current misinformation-related tasks and approaches show a clear divide between the micro level, or
the content of the information, and the macro level, or the social network. There is a lack of holistic
integration between the diferent tools to address misinformation. Propagation models are one tool
that would allow a holistic approach by studying the difusion of online misinformation from local and
global perspectives.</p>
      <p>With this work, we have studied current approaches to propagation difusion models, from early
approaches with the SIR epidemiological model to non-epidemiological models, such as the Forest Fire
Model, and agent-based systems. From these approaches, we have appreciated some common limitations
that constrain the holistic view. Within these constraints, the most relevant one is disregarding the
information shared within the network, treated as a black box. To overcome these limitations, we
have determined the main requirements for a proper experimental framework that would allow us to
overcome them.</p>
      <p>In terms of future work, we believe it is paramount to focus on overcoming these limitations by
developing new models that consider the impact of the messages on the users. Additionally, posing
new evaluation frameworks that overcome the limitations of the users’ stances, such as focusing on the
messages, is another interesting research avenue. Lastly, developing new publicly available datasets
with the required information for these models is crucial for evaluating these models.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work has been partially funded by the Spanish Research Agency (Agencia Estatal de Investigación),
through the DeepInfo project PID2021-127777OB-C22 (MCIU/AEI/FEDER, UE) and the HOLISTIC
ANALYSIS OF ORGANISED MISINFORMATION ACTIVITY IN SOCIAL NETWORKS project
(PCI2022135026-2).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.</given-names>
            <surname>Martel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pennycook</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. G.</given-names>
            <surname>Rand</surname>
          </string-name>
          , Reliance on Emotion Promotes Belief in Fake News,
          <source>Cognitive Research: Principles and Implications</source>
          <volume>5</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          . doi:
          <volume>10</volume>
          .1186/s41235-020-00252-3.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Ferrara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chang</surname>
          </string-name>
          , E. Chen, G. Muric,
          <string-name>
            <given-names>J.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <article-title>Characterizing Social Media Manipulation in the 2020 U.S. Presidential</article-title>
          <string-name>
            <surname>Election</surname>
          </string-name>
          ,
          <source>First Monday</source>
          <volume>25</volume>
          (
          <year>2020</year>
          ). doi:
          <volume>10</volume>
          .5210/fm.v25i11.
          <fpage>11431</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Guess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Nyhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Reifler</surname>
          </string-name>
          , Selective Exposure to Misinformation:
          <article-title>Evidence from the Consumption of Fake News during the 2016 U.S. Presidential</article-title>
          <string-name>
            <surname>Campaign</surname>
          </string-name>
          ,
          <source>European Research Council</source>
          <volume>9</volume>
          (
          <year>2018</year>
          )
          <article-title>4</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Cuan-Baltazar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Muñoz-Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Robledo-Vega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Pérez-Zepeda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Soto-Vega</surname>
          </string-name>
          ,
          <source>Misinformation of COVID-19 on the Internet: Infodemiology Study, JMIR Public Health and Surveillance</source>
          <volume>6</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . doi:
          <volume>10</volume>
          .2196/18444.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Rashkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Jang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Volkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          , Truth of Varying Shades:
          <article-title>Analyzing Language in Fake News and Political Fact-Checking</article-title>
          ,
          <source>in: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Copenhagen, Denmark,
          <year>2017</year>
          , pp.
          <fpage>2931</fpage>
          -
          <lpage>2937</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D17</fpage>
          -1317.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Raza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <article-title>Fake News Detection Based on News Content and Social Contexts: A TransformerBased Approach</article-title>
          ,
          <source>International Journal of Data Science and Analytics</source>
          <volume>13</volume>
          (
          <year>2022</year>
          )
          <fpage>335</fpage>
          -
          <lpage>362</lpage>
          . doi:
          <volume>10</volume>
          . 1007/s41060-021-00302-z.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>C.</given-names>
            <surname>Kopp</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. B. Korb</surname>
            ,
            <given-names>B. I. Mills</given-names>
          </string-name>
          ,
          <article-title>Information-Theoretic Models of Deception: Modelling Cooperation and Difusion in Populations Exposed to "Fake News"</article-title>
          ,
          <source>PLOS ONE 13</source>
          (
          <year>2018</year>
          )
          <article-title>e0207383</article-title>
          . doi:
          <volume>10</volume>
          . 1371/journal.pone.
          <volume>0207383</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Qi</surname>
          </string-name>
          , Bad Actor, Good Advisor:
          <article-title>Exploring the Role of Large Language Models in Fake News Detection</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>38</volume>
          (
          <year>2024</year>
          )
          <fpage>22105</fpage>
          -
          <lpage>22113</lpage>
          . doi:
          <volume>10</volume>
          .1609/aaai.v38i20.
          <fpage>30214</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Buntain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Golbeck</surname>
          </string-name>
          ,
          <article-title>Automatically Identifying Fake News in Popular Twitter Threads</article-title>
          , in: 2017
          <source>IEEE International Conference on Smart Cloud (SmartCloud)</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>208</fpage>
          -
          <lpage>215</lpage>
          . doi:
          <volume>10</volume>
          .1109/ SmartCloud.
          <year>2017</year>
          .
          <volume>40</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bazmi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Asadpour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shakery</surname>
          </string-name>
          ,
          <string-name>
            <surname>Multi-View</surname>
          </string-name>
          Co
          <article-title>-Attention Network for Fake News Detection by Modeling Topic-Specific User and News Source Credibility</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>60</volume>
          (
          <year>2023</year>
          )
          <article-title>103146</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.ipm.
          <year>2022</year>
          .
          <volume>103146</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>K.</given-names>
            <surname>Pogorelov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. T.</given-names>
            <surname>Schroeder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Brenner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Maulana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Langguth</surname>
          </string-name>
          ,
          <article-title>Combining Tweets and Connections Graph for FakeNews Detection at MediaEval 2022</article-title>
          , in:
          <source>MediaEval</source>
          <year>2022</year>
          , volume
          <volume>3583</volume>
          ,
          <year>2022</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Caldarelli</surname>
          </string-name>
          , R. De Nicola,
          <string-name>
            <given-names>F.</given-names>
            <surname>Del Vigna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Petrocchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Saracco</surname>
          </string-name>
          ,
          <article-title>The Role of Bot Squads in the Political Propaganda on Twitter</article-title>
          ,
          <source>Communications Physics 3</source>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          . doi:
          <volume>10</volume>
          .1038/ s42005-020-0340-4.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
            <surname>Neha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chhatani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. B.</given-names>
            <surname>Buduru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumaraguru</surname>
          </string-name>
          ,
          <article-title>Understanding Coordinated Communities through the Lens of Protest-Centric Narratives: A Case Study on #CAA Protest</article-title>
          ,
          <source>in: Proceedings of the International AAAI Conference on Web and Social Media</source>
          , volume
          <volume>18</volume>
          ,
          <year>2024</year>
          , pp.
          <fpage>1123</fpage>
          -
          <lpage>1133</lpage>
          . doi:
          <volume>10</volume>
          .1609/icwsm.v18i1.
          <fpage>31377</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>K.</given-names>
            <surname>Shu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. R.</given-names>
            <surname>Bernard</surname>
          </string-name>
          , H. Liu,
          <source>Studying Fake News via Network Analysis: Detection and Mitigation</source>
          , Springer International Publishing, Cham,
          <year>2019</year>
          , pp.
          <fpage>43</fpage>
          -
          <lpage>65</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -94105-
          <issue>9</issue>
          _
          <fpage>3</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <article-title>Identifying Possible Rumor Spreaders on Twitter: A Weak Supervised Learning Approach</article-title>
          , in: 2021
          <source>International Joint Conference on Neural Networks (IJCNN)</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . doi:
          <volume>10</volume>
          .1109/ijcnn52387.
          <year>2021</year>
          .
          <volume>9534185</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Peñas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Deriu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sharma</surname>
          </string-name>
          , G. Valentin,
          <string-name>
            <given-names>J.</given-names>
            <surname>Reyes-Montesinos</surname>
          </string-name>
          ,
          <article-title>Holistic Analysis of Organised Misinformation Activity in Social Networks</article-title>
          , in: Disinformation in Open Online Media, Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>132</fpage>
          -
          <lpage>143</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -47896-3_
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>D.</given-names>
            <surname>Geschke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lorenz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Holtz</surname>
          </string-name>
          ,
          <article-title>The Triple-filter Bubble: Using Agent-based Modelling to Test a Meta-theoretical Framework for the Emergence of Filter Bubbles</article-title>
          and
          <string-name>
            <given-names>Echo</given-names>
            <surname>Chambers</surname>
          </string-name>
          ,
          <source>British Journal of Social Psychology</source>
          <volume>58</volume>
          (
          <year>2019</year>
          )
          <fpage>129</fpage>
          -
          <lpage>149</lpage>
          . doi:
          <volume>10</volume>
          .1111/bjso.12286.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Saini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Goel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Panda</surname>
          </string-name>
          ,
          <article-title>Modeling Information Difusion in Online Social Networks Using a Modified Forest-Fire Model</article-title>
          ,
          <source>Journal of Intelligent Information Systems</source>
          <volume>56</volume>
          (
          <year>2021</year>
          )
          <fpage>355</fpage>
          -
          <lpage>377</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10844-020-00623-8.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jin</surname>
          </string-name>
          , S. Cheng, T. Yang,
          <string-name>
            <surname>ESIS</surname>
          </string-name>
          :
          <article-title>Emotion-based Spreader-Ignorant-Stifler Model for Information Difusion, Knowledge-Based Systems 81 (</article-title>
          <year>2015</year>
          )
          <fpage>46</fpage>
          -
          <lpage>55</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.knosys.
          <year>2015</year>
          .
          <volume>02</volume>
          .006.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>L.</given-names>
            <surname>Milli</surname>
          </string-name>
          ,
          <source>Opinion Dynamic Modeling of News Perception, Applied Network Science</source>
          <volume>6</volume>
          (
          <year>2021</year>
          )
          <article-title>76</article-title>
          . doi:
          <volume>10</volume>
          .1007/s41109-021-00412-4.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Coates</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Muller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sirur</surname>
          </string-name>
          ,
          <article-title>Simulating the Impact of Personality on Fake News</article-title>
          , in: TRUST@ AAMAS,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Zehmakan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Out</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Hesamipour</given-names>
            <surname>Khelejan</surname>
          </string-name>
          ,
          <article-title>Why Rumors Spread Fast in Social Networks, and How to Stop It</article-title>
          , in: Proceedings of the Thirty-Second
          <source>International Joint Conference on Artificial Intelligence</source>
          ,
          <source>International Joint Conferences on Artificial Intelligence Organization</source>
          , Macau, SAR China,
          <year>2023</year>
          , pp.
          <fpage>234</fpage>
          -
          <lpage>242</lpage>
          . doi:
          <volume>10</volume>
          .24963/ijcai.
          <year>2023</year>
          /27.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Karnstedt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rowe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Alani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hayes</surname>
          </string-name>
          ,
          <article-title>The Efect of User Features on Churn in Social Networks</article-title>
          ,
          <source>in: Proceedings of the 3rd International Web Science Conference</source>
          , WebSci '11,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2011</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . doi:
          <volume>10</volume>
          .1145/2527031. 2527051.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>B.</given-names>
            <surname>Horne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Adali</surname>
          </string-name>
          , This Just In:
          <string-name>
            <surname>Fake News Packs A Lot In</surname>
            <given-names>Title</given-names>
          </string-name>
          , Uses Simpler, Repetitive Content in Text Body, More Similar To Satire Than Real News,
          <source>Proceedings of the International AAAI Conference on Web and Social Media</source>
          <volume>11</volume>
          (
          <year>2017</year>
          )
          <fpage>759</fpage>
          -
          <lpage>766</lpage>
          . doi:
          <volume>10</volume>
          .1609/icwsm.v11i1.
          <fpage>14976</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>S.</given-names>
            <surname>Vosoughi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Aral</surname>
          </string-name>
          ,
          <source>The Spread of True and False News Online, Science</source>
          <volume>359</volume>
          (
          <year>2018</year>
          )
          <fpage>1146</fpage>
          -
          <lpage>1151</lpage>
          . doi:
          <volume>10</volume>
          .1126/science.aap9559.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>W. O.</given-names>
            <surname>Kermack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. G.</given-names>
            <surname>McKendrick</surname>
          </string-name>
          , A Contribution to the
          <source>Mathematical Theory of Epidemics, Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character</source>
          <volume>115</volume>
          (
          <year>1927</year>
          )
          <fpage>700</fpage>
          -
          <lpage>721</lpage>
          . doi:
          <volume>10</volume>
          .1098/rspa.
          <year>1927</year>
          .
          <volume>0118</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>W.</given-names>
            <surname>Gofman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. A.</given-names>
            <surname>Newill</surname>
          </string-name>
          ,
          <article-title>Generalization of Epidemic Theory: An Application to the Transmission of Ideas</article-title>
          ,
          <source>Nature</source>
          <volume>204</volume>
          (
          <year>1964</year>
          )
          <fpage>225</fpage>
          -
          <lpage>228</lpage>
          . doi:
          <volume>10</volume>
          .1038/204225a0.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Daley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. G.</given-names>
            <surname>Kendall</surname>
          </string-name>
          , Epidemics and Rumours,
          <source>Nature</source>
          <volume>204</volume>
          (
          <year>1964</year>
          )
          <fpage>1118</fpage>
          -
          <lpage>1118</lpage>
          . doi:
          <volume>10</volume>
          .1038/ 2041118a0.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Maki</surname>
          </string-name>
          , M. Thompson,
          <source>Mathematical Models and Applications</source>
          , Prentice-Hall,
          <year>1973</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Daley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. G.</given-names>
            <surname>Kendall</surname>
          </string-name>
          , Stochastic Rumours,
          <source>IMA Journal of Applied Mathematics</source>
          <volume>1</volume>
          (
          <year>1965</year>
          )
          <fpage>42</fpage>
          -
          <lpage>55</lpage>
          . doi:
          <volume>10</volume>
          .1093/imamat/1.1.42.
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>T.</given-names>
            <surname>Britton</surname>
          </string-name>
          , Stochastic Epidemic Models: A Survey,
          <source>Mathematical Biosciences</source>
          <volume>225</volume>
          (
          <year>2010</year>
          )
          <fpage>24</fpage>
          -
          <lpage>35</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.mbs.
          <year>2010</year>
          .
          <volume>01</volume>
          .006.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>D.</given-names>
            <surname>Shah</surname>
          </string-name>
          , T. Zaman,
          <article-title>Rumors in a Network: Who's the Culprit?</article-title>
          ,
          <source>IEEE Transactions on Information Theory</source>
          <volume>57</volume>
          (
          <year>2011</year>
          )
          <fpage>5163</fpage>
          -
          <lpage>5181</lpage>
          . doi:
          <volume>10</volume>
          .1109/tit.
          <year>2011</year>
          .
          <volume>2158885</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kimura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Saito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Motoda</surname>
          </string-name>
          ,
          <article-title>Eficient Estimation of Influence Functions for SIS Model on Social Networks</article-title>
          ,
          <source>in: Proceedings of the 21st International Joint Conference on Artificial Intelligence</source>
          , IJCAI'
          <fpage>09</fpage>
          , Morgan Kaufmann Publishers Inc., San Francisco, CA, USA,
          <year>2009</year>
          , pp.
          <fpage>2046</fpage>
          -
          <lpage>2051</lpage>
          . doi:
          <volume>10</volume>
          .5555/1661445.1661772.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>R.</given-names>
            <surname>Escalante</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Odehnal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Deterministic</given-names>
            <surname>Mathematical</surname>
          </string-name>
          <article-title>Model for the Spread of Two Rumors</article-title>
          ,
          <source>Afrika Matematika</source>
          <volume>31</volume>
          (
          <year>2019</year>
          )
          <fpage>315</fpage>
          -
          <lpage>331</lpage>
          . doi:
          <volume>10</volume>
          .1007/s13370-019-00726-8.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nekovee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Moreno</surname>
          </string-name>
          , G. Bianconi,
          <string-name>
            <given-names>M.</given-names>
            <surname>Marsili</surname>
          </string-name>
          ,
          <article-title>Theory of Rumour Spreading in Complex Social Networks</article-title>
          ,
          <string-name>
            <surname>Physica</surname>
            <given-names>A</given-names>
          </string-name>
          :
          <string-name>
            <surname>Statistical</surname>
            <given-names>Mechanics</given-names>
          </string-name>
          <source>and its Applications</source>
          <volume>374</volume>
          (
          <year>2007</year>
          )
          <fpage>457</fpage>
          -
          <lpage>470</lpage>
          . doi:
          <volume>10</volume>
          .1016/ j.physa.
          <year>2006</year>
          .
          <volume>07</volume>
          .017.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>R.</given-names>
            <surname>Pastor-Satorras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vespignani</surname>
          </string-name>
          , Epidemic Spreading in Scale-Free
          <string-name>
            <surname>Networks</surname>
          </string-name>
          ,
          <source>Physical Review Letters</source>
          <volume>86</volume>
          (
          <year>2001</year>
          )
          <fpage>3200</fpage>
          -
          <lpage>3203</lpage>
          . doi:
          <volume>10</volume>
          .1103/PhysRevLett.86.3200.
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. Zhang,</surname>
          </string-name>
          <article-title>A SEIR-based Model for Virus Propagation on SNS</article-title>
          , in: 2013
          <source>Fourth International Conference on Emerging Intelligent Data and Web Technologies</source>
          , IEEE,
          <source>Xi'an</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>479</fpage>
          -
          <lpage>482</lpage>
          . doi:
          <volume>10</volume>
          .1109/EIDWT.
          <year>2013</year>
          .
          <volume>86</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>L.-L.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.-P.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-R.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <article-title>Rumor Spreading Model Considering Hesitating Mechanism in Complex Social Networks</article-title>
          ,
          <string-name>
            <surname>Physica</surname>
            <given-names>A</given-names>
          </string-name>
          :
          <string-name>
            <surname>Statistical</surname>
            <given-names>Mechanics</given-names>
          </string-name>
          <source>and its Applications</source>
          <volume>437</volume>
          (
          <year>2015</year>
          )
          <fpage>295</fpage>
          -
          <lpage>303</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.physa.
          <year>2015</year>
          .
          <volume>05</volume>
          .113.
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>F.</given-names>
            <surname>Jin</surname>
          </string-name>
          , E. Dougherty,
          <string-name>
            <given-names>P.</given-names>
            <surname>Saraf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ramakrishnan</surname>
          </string-name>
          ,
          <article-title>Epidemiological Modeling of News and Rumors on Twitter</article-title>
          ,
          <source>in: Proceedings of the 7th Workshop on Social Network Mining and Analysis</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , Chicago Illinois,
          <year>2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . doi:
          <volume>10</volume>
          .1145/2501025.2501027.
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>L. M. A.</given-names>
            <surname>Bettencourt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cintrón-Arias</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. I.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castillo-Chávez</surname>
          </string-name>
          ,
          <article-title>The Power of a Good Idea: Quantitative Modeling of the Spread of Ideas from Epidemiological Models, Physica A: Statistical Mechanics and its Applications 364 (</article-title>
          <year>2006</year>
          )
          <fpage>513</fpage>
          -
          <lpage>536</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.physa.
          <year>2005</year>
          .
          <volume>08</volume>
          .083.
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <source>Rumor Propagation Dynamic Model Based on Evolutionary Game and Anti-Rumor, Nonlinear Dynamics</source>
          <volume>95</volume>
          (
          <year>2019</year>
          )
          <fpage>523</fpage>
          -
          <lpage>539</lpage>
          . doi:
          <volume>10</volume>
          .1007/ s11071-018-4579-1.
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <article-title>A New Rumor Propagation Model and Control Strategy on Social Networks</article-title>
          ,
          <source>in: 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM</source>
          <year>2013</year>
          ),
          <year>2013</year>
          , pp.
          <fpage>1472</fpage>
          -
          <lpage>1473</lpage>
          . doi:
          <volume>10</volume>
          .1109/ASONAM.
          <year>2013</year>
          .
          <volume>6785909</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>W.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Novel</given-names>
            <surname>SCNDR Rumor Propagation</surname>
          </string-name>
          <article-title>Model on Online Social Networks</article-title>
          ,
          <source>in: 2015 IEEE International Conference on Consumer Electronics - Taiwan</source>
          , IEEE,
          <year>2015</year>
          , pp.
          <fpage>154</fpage>
          -
          <lpage>155</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICCE-TW.
          <year>2015</year>
          .
          <volume>7216829</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>N.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Dynamic 8-
          <string-name>
            <surname>State ICSAR Rumor Propagation Model Considering Oficial Rumor Refutation</surname>
          </string-name>
          ,
          <string-name>
            <surname>Physica</surname>
            <given-names>A</given-names>
          </string-name>
          :
          <string-name>
            <surname>Statistical</surname>
            <given-names>Mechanics</given-names>
          </string-name>
          <source>and its Applications</source>
          <volume>415</volume>
          (
          <year>2014</year>
          )
          <fpage>333</fpage>
          -
          <lpage>346</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.physa.
          <year>2014</year>
          .
          <volume>07</volume>
          .023.
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Weigang</surname>
          </string-name>
          , H. Liu,
          <article-title>Rumor and Authoritative Information Propagation Model Considering Super Spreading in Complex Social Networks</article-title>
          ,
          <string-name>
            <surname>Physica</surname>
            <given-names>A</given-names>
          </string-name>
          :
          <string-name>
            <surname>Statistical</surname>
            <given-names>Mechanics</given-names>
          </string-name>
          <source>and its Applications</source>
          <volume>506</volume>
          (
          <year>2018</year>
          )
          <fpage>395</fpage>
          -
          <lpage>411</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.physa.
          <year>2018</year>
          .
          <volume>04</volume>
          .082.
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kempe</surname>
          </string-name>
          , J. Kleinberg, É. Tardos,
          <article-title>Maximizing the Spread of Influence through a Social Network</article-title>
          ,
          <source>in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , ACM, Washington, D.C.,
          <year>2003</year>
          , pp.
          <fpage>137</fpage>
          -
          <lpage>146</lpage>
          . doi:
          <volume>10</volume>
          .1145/956750.956769.
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>N. P.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          , G. Yan,
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Thai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Eidenbenz</surname>
          </string-name>
          ,
          <article-title>Containment of Misinformation Spread in Online Social Networks</article-title>
          ,
          <source>in: Proceedings of the 4th Annual ACM Web Science Conference</source>
          , ACM, Evanston Illinois,
          <year>2012</year>
          , pp.
          <fpage>213</fpage>
          -
          <lpage>222</lpage>
          . doi:
          <volume>10</volume>
          .1145/2380718.2380746.
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [48]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kalogeratos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Scaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Corinzia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Vayatis</surname>
          </string-name>
          , Chapter 24 -
          <string-name>
            <given-names>Information</given-names>
            <surname>Difusion</surname>
          </string-name>
          and Rumor Spreading, in: Cooperative and Graph Signal Processing, Academic Press,
          <year>2018</year>
          , pp.
          <fpage>651</fpage>
          -
          <lpage>678</lpage>
          . doi:
          <volume>10</volume>
          .1016/B978-0
          <source>-12-813677-5</source>
          .
          <fpage>00024</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          [49]
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Backstrom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kleinberg</surname>
          </string-name>
          ,
          <article-title>Meme-Tracking and the Dynamics of the News Cycle</article-title>
          ,
          <source>in: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , KDD '09,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2009</year>
          , pp.
          <fpage>497</fpage>
          -
          <lpage>506</lpage>
          . doi:
          <volume>10</volume>
          .1145/1557019.1557077.
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          [50]
          <string-name>
            <given-names>W.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          , CT-IC:
          <article-title>Continuously Activated and Time-Restricted Independent Cascade Model for Viral Marketing</article-title>
          ,
          <source>in: 2012 IEEE 12th International Conference on Data Mining</source>
          , IEEE,
          <year>2012</year>
          , pp.
          <fpage>960</fpage>
          -
          <lpage>965</lpage>
          . doi:
          <volume>10</volume>
          .1109/icdm.
          <year>2012</year>
          .
          <volume>40</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          [51]
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Watts</surname>
          </string-name>
          ,
          <source>A Simple Model of Global Cascades on Random Networks, Proceedings of the National Academy of Sciences</source>
          <volume>99</volume>
          (
          <year>2002</year>
          )
          <fpage>5766</fpage>
          -
          <lpage>5771</lpage>
          . doi:
          <volume>10</volume>
          .1073/pnas.082090499.
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          [52]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Arenas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Yağan</surname>
          </string-name>
          ,
          <article-title>Clustering Determines the Dynamics of Complex Contagions in Multiplex Networks</article-title>
          ,
          <source>Physical Review E</source>
          <volume>95</volume>
          (
          <year>2017</year>
          )
          <article-title>012312</article-title>
          . doi:
          <volume>10</volume>
          .1103/PhysRevE.95.012312.
        </mixed-citation>
      </ref>
      <ref id="ref53">
        <mixed-citation>
          [53]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lagnier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Denoyer</surname>
          </string-name>
          , E. Gaussier,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gallinari</surname>
          </string-name>
          ,
          <article-title>Predicting Information Difusion in Social Networks Using Content and User's Profiles</article-title>
          , in: Advances in Information Retrieval, Springer, Berlin, Heidelberg,
          <year>2013</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>85</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -36973-
          <issue>5</issue>
          _
          <fpage>7</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref54">
        <mixed-citation>
          [54]
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Hawkes</surname>
          </string-name>
          ,
          <source>Spectra of Some Self-Exciting and Mutually Exciting Point Processes, Biometrika</source>
          <volume>58</volume>
          (
          <year>1971</year>
          )
          <fpage>83</fpage>
          -
          <lpage>90</lpage>
          . doi:
          <volume>10</volume>
          .2307/2334319.
        </mixed-citation>
      </ref>
      <ref id="ref55">
        <mixed-citation>
          [55]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Porter</surname>
          </string-name>
          ,
          <article-title>Simulating Fake News Dissemination on Twitter with Multivariate Hawkes Processes</article-title>
          , in: 2022
          <source>IEEE International Conference on Big Data (Big Data)</source>
          , IEEE, Osaka, Japan,
          <year>2022</year>
          , pp.
          <fpage>3597</fpage>
          -
          <lpage>3606</lpage>
          . doi:
          <volume>10</volume>
          .1109/BigData55660.
          <year>2022</year>
          .
          <volume>10020285</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref56">
        <mixed-citation>
          [56]
          <string-name>
            <given-names>M.</given-names>
            <surname>Farajtabar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Trivedi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Khalil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zha</surname>
          </string-name>
          ,
          <source>Fake News Mitigation via Point Process Based Intervention, in: Proceedings of the 34th International Conference on Machine Learning, PMLR</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>1097</fpage>
          -
          <lpage>1106</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref57">
        <mixed-citation>
          [57]
          <string-name>
            <given-names>M.</given-names>
            <surname>Caglar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ozkasap</surname>
          </string-name>
          ,
          <article-title>A Chain-Binomial Model for Pull and Push-Based Information Difusion</article-title>
          , in: 2006 IEEE International Conference on Communications, IEEE, Istanbul,
          <year>2006</year>
          , pp.
          <fpage>909</fpage>
          -
          <lpage>914</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICC.
          <year>2006</year>
          .
          <volume>254823</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref58">
        <mixed-citation>
          [58]
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Vega-Oliveros</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. d. F.</given-names>
            <surname>Costa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. A.</given-names>
            <surname>Rodrigues</surname>
          </string-name>
          ,
          <article-title>Rumor Propagation with Heterogeneous Transmission in Social Networks</article-title>
          ,
          <source>Journal of Statistical Mechanics: Theory and Experiment</source>
          <year>2017</year>
          (
          <year>2017</year>
          )
          <article-title>023401</article-title>
          . doi:
          <volume>10</volume>
          .1088/
          <fpage>1742</fpage>
          -5468/aa58ef.
        </mixed-citation>
      </ref>
      <ref id="ref59">
        <mixed-citation>
          [59]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Zhu, Maximizing the Spread of Influence Ranking in Social Networks</article-title>
          ,
          <source>Information Sciences 278</source>
          (
          <year>2014</year>
          )
          <fpage>535</fpage>
          -
          <lpage>544</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.ins.
          <year>2014</year>
          .
          <volume>03</volume>
          .070.
        </mixed-citation>
      </ref>
      <ref id="ref60">
        <mixed-citation>
          [60]
          <string-name>
            <given-names>S.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Ao</surname>
          </string-name>
          ,
          <article-title>Energy Model for Rumor Propagation on Social Networks, Physica A: Statistical Mechanics and its Applications 394 (</article-title>
          <year>2014</year>
          )
          <fpage>99</fpage>
          -
          <lpage>109</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.physa.
          <year>2013</year>
          .
          <volume>10</volume>
          .003.
        </mixed-citation>
      </ref>
      <ref id="ref61">
        <mixed-citation>
          [61]
          <string-name>
            <given-names>V.</given-names>
            <surname>Indu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Thampi</surname>
          </string-name>
          ,
          <article-title>A Nature - Inspired Approach Based on Forest Fire Model for Modeling Rumor Propagation in Social Networks</article-title>
          ,
          <source>Journal of Network and Computer Applications</source>
          <volume>125</volume>
          (
          <year>2019</year>
          )
          <fpage>28</fpage>
          -
          <lpage>41</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.jnca.
          <year>2018</year>
          .
          <volume>10</volume>
          .003.
        </mixed-citation>
      </ref>
      <ref id="ref62">
        <mixed-citation>
          [62]
          <string-name>
            <given-names>E.</given-names>
            <surname>Serrano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Iglesias</surname>
          </string-name>
          ,
          <source>Validating Viral Marketing Strategies in Twitter via Agent-Based Social Simulation, Expert Systems with Applications</source>
          <volume>50</volume>
          (
          <year>2016</year>
          )
          <fpage>140</fpage>
          -
          <lpage>150</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.eswa.
          <year>2015</year>
          .
          <volume>12</volume>
          .021.
        </mixed-citation>
      </ref>
      <ref id="ref63">
        <mixed-citation>
          [63]
          <string-name>
            <given-names>A.</given-names>
            <surname>Averza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Slhoub</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhattacharyya</surname>
          </string-name>
          ,
          <article-title>Evaluating the Influence of Twitter Bots via Agent-Based Social Simulation</article-title>
          ,
          <source>IEEE Access 10</source>
          (
          <year>2022</year>
          )
          <fpage>129394</fpage>
          -
          <lpage>129407</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2022</year>
          .
          <volume>3228258</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref64">
        <mixed-citation>
          [64]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gausen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Luk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Can We Stop Fake News? Using Agent-Based Modelling to Evaluate Countermeasures for Misinformation on Social Media</article-title>
          , in: ICWSM Workshops,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref65">
        <mixed-citation>
          [65]
          <string-name>
            <given-names>Q. F.</given-names>
            <surname>Lotito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zanella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Casari</surname>
          </string-name>
          ,
          <article-title>Realistic Aspects of Simulation Models for Fake News Epidemics over Social Networks</article-title>
          ,
          <source>Future Internet</source>
          <volume>13</volume>
          (
          <year>2021</year>
          )
          <article-title>76</article-title>
          . doi:
          <volume>10</volume>
          .3390/fi13030076.
        </mixed-citation>
      </ref>
      <ref id="ref66">
        <mixed-citation>
          [66]
          <string-name>
            <surname>J.-H. Cho</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Rager</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. O'Donovan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Adali</surname>
            ,
            <given-names>B. D.</given-names>
          </string-name>
          <string-name>
            <surname>Horne</surname>
          </string-name>
          ,
          <article-title>Uncertainty-Based False Information Propagation in Social Networks</article-title>
          ,
          <source>ACM Transactions on Social Computing</source>
          <volume>2</volume>
          (
          <year>2019</year>
          )
          <fpage>1</fpage>
          -
          <lpage>34</lpage>
          . doi:
          <volume>10</volume>
          . 1145/3311091.
        </mixed-citation>
      </ref>
      <ref id="ref67">
        <mixed-citation>
          [67]
          <string-name>
            <given-names>N.</given-names>
            <surname>Rabb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cowen</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. P. De Ruiter</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Scheutz</surname>
          </string-name>
          , Cognitive Cascades:
          <article-title>How to Model (and Potentially Counter) the Spread of Fake News</article-title>
          ,
          <source>PLOS ONE 17</source>
          (
          <year>2022</year>
          )
          <article-title>e0261811</article-title>
          . doi:
          <volume>10</volume>
          .1371/journal.pone.
          <volume>0261811</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref68">
        <mixed-citation>
          [68]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tambuscio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. F. M.</given-names>
            <surname>Oliveira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Ciampaglia</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Rufo, Network Segregation in a Model of Misinformation and Fact-Checking</article-title>
          ,
          <source>Journal of Computational Social Science</source>
          <volume>1</volume>
          (
          <year>2018</year>
          )
          <fpage>261</fpage>
          -
          <lpage>275</lpage>
          . doi:
          <volume>10</volume>
          .1007/s42001-018-0018-9.
        </mixed-citation>
      </ref>
      <ref id="ref69">
        <mixed-citation>
          [69]
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <article-title>A Multi-agent System for Modelling Preference-Based Complex Influence Difusion in Social Networks</article-title>
          ,
          <source>The Computer Journal</source>
          <volume>62</volume>
          (
          <year>2019</year>
          )
          <fpage>430</fpage>
          -
          <lpage>447</lpage>
          . doi:
          <volume>10</volume>
          .1093/comjnl/ bxy078.
        </mixed-citation>
      </ref>
      <ref id="ref70">
        <mixed-citation>
          [70]
          <string-name>
            <given-names>P.</given-names>
            <surname>Costa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. McCrae</given-names>
            , Personality in Adulthood: A
            <surname>Five-Factor Theory</surname>
          </string-name>
          <string-name>
            <surname>Perspective</surname>
          </string-name>
          ,
          <source>Management Information Systems Quarterly - MISQ</source>
          (
          <year>2002</year>
          ). doi:
          <volume>10</volume>
          .4324/9780203428412.
        </mixed-citation>
      </ref>
      <ref id="ref71">
        <mixed-citation>
          [71]
          <string-name>
            <given-names>R. F.</given-names>
            <surname>Muhammad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kasahara</surname>
          </string-name>
          ,
          <source>Agent-Based Simulation of Fake News Dissemination: The Role of Trust Assessment and Big Five Personality Traits on News Spreading, Social Network Analysis and Mining</source>
          <volume>14</volume>
          (
          <year>2024</year>
          )
          <article-title>75</article-title>
          . doi:
          <volume>10</volume>
          .1007/s13278-024-01235-8.
        </mixed-citation>
      </ref>
      <ref id="ref72">
        <mixed-citation>
          [72]
          <string-name>
            <given-names>S.-H.</given-names>
            <surname>Tseng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Son</surname>
          </string-name>
          <string-name>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <article-title>Agent-Based Modeling of Rumor Propagation Using Expected Integrated Mean Squared Error Optimal Design</article-title>
          ,
          <source>Applied System Innovation</source>
          <volume>3</volume>
          (
          <year>2020</year>
          )
          <article-title>48</article-title>
          . doi:
          <volume>10</volume>
          . 3390/asi3040048.
        </mixed-citation>
      </ref>
      <ref id="ref73">
        <mixed-citation>
          [73]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Zhang</surname>
          </string-name>
          , R. Yan, From Skepticism to Acceptance:
          <article-title>Simulating the Attitude Dynamics Toward Fake News, arXiv preprint (</article-title>
          <year>2024</year>
          ). ArXiv:
          <volume>2403</volume>
          .
          <fpage>09498</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref74">
        <mixed-citation>
          [74]
          <string-name>
            <given-names>J.</given-names>
            <surname>Pastor-Galindo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nespoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Ruipérez-Valiente</surname>
          </string-name>
          ,
          <article-title>Large-Language-Model-Powered AgentBased Framework for Misinformation and Disinformation Research: Opportunities and Open Challenges</article-title>
          ,
          <source>IEEE Security &amp; Privacy</source>
          <volume>22</volume>
          (
          <year>2024</year>
          )
          <fpage>24</fpage>
          -
          <lpage>36</lpage>
          . doi:
          <volume>10</volume>
          .1109/MSEC.
          <year>2024</year>
          .
          <volume>3380511</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref75">
        <mixed-citation>
          [75]
          <string-name>
            <given-names>J.</given-names>
            <surname>Brainard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. R.</given-names>
            <surname>Hunter</surname>
          </string-name>
          ,
          <article-title>Misinformation Making a Disease Outbreak Worse: Outcomes Compared for Influenza, Monkeypox, and Norovirus</article-title>
          , SIMULATION
          <volume>96</volume>
          (
          <year>2019</year>
          )
          <fpage>365</fpage>
          -
          <lpage>374</lpage>
          . doi:
          <volume>10</volume>
          .1177/ 0037549719885021.
        </mixed-citation>
      </ref>
      <ref id="ref76">
        <mixed-citation>
          [76]
          <string-name>
            <given-names>C.</given-names>
            <surname>Marshall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cruickshank</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>O'Riordan, Identifying Influential Nodes to Inhibit Bootstrap Percolation on Hyperbolic Networks</article-title>
          ,
          <source>in: 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)</source>
          , IEEE, Barcelona,
          <year>2018</year>
          , pp.
          <fpage>1266</fpage>
          -
          <lpage>1273</lpage>
          . doi:
          <volume>10</volume>
          . 1109/ASONAM.
          <year>2018</year>
          .
          <volume>8508248</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref77">
        <mixed-citation>
          [77]
          <string-name>
            <given-names>D.</given-names>
            <surname>Azucar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Marengo</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Settanni, Predicting the Big 5 Personality Traits from Digital Footprints on Social Media: A Meta-</article-title>
          <string-name>
            <surname>Analysis</surname>
          </string-name>
          ,
          <source>Personality and Individual Diferences</source>
          <volume>124</volume>
          (
          <year>2018</year>
          )
          <fpage>150</fpage>
          -
          <lpage>159</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.paid.
          <year>2017</year>
          .
          <volume>12</volume>
          .018.
        </mixed-citation>
      </ref>
      <ref id="ref78">
        <mixed-citation>
          [78]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dang</surname>
          </string-name>
          , Integrating Group Homophily and
          <article-title>Individual Personality of Topics Can Better Model Network Communities</article-title>
          , in: 2020
          <source>IEEE International Conference on Data Mining (ICDM)</source>
          , IEEE, Sorrento, Italy,
          <year>2020</year>
          , pp.
          <fpage>611</fpage>
          -
          <lpage>620</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICDM50108.
          <year>2020</year>
          .
          <volume>00070</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref79">
        <mixed-citation>
          [79]
          <string-name>
            <given-names>K.</given-names>
            <surname>Shu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mahudeswaran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lee</surname>
          </string-name>
          , H. Liu,
          <article-title>FakeNewsNet: A Data Repository with News Content, Social Context, and Spatiotemporal Information for Studying Fake News on Social Media, Big Data 8 (</article-title>
          <year>2020</year>
          )
          <fpage>171</fpage>
          -
          <lpage>188</lpage>
          . doi:
          <volume>10</volume>
          .1089/big.
          <year>2020</year>
          .
          <volume>0062</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref80">
        <mixed-citation>
          [80]
          <string-name>
            <given-names>V.</given-names>
            <surname>Qazvinian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rosengren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Radev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Mei</surname>
          </string-name>
          , Rumor Has It: Identifying Misinformation in Microblogs,
          <source>in: Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Edinburgh, Scotland, UK.,
          <year>2011</year>
          , pp.
          <fpage>1589</fpage>
          -
          <lpage>1599</lpage>
          . URL: https://aclanthology.org/D11-1147.
        </mixed-citation>
      </ref>
      <ref id="ref81">
        <mixed-citation>
          [81]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mulay</surname>
          </string-name>
          , E. Ferrara, R. Zafarani,
          <article-title>ReCOVery: A Multimodal Repository for COVID19 News Credibility Research</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>3205</fpage>
          -
          <lpage>3212</lpage>
          . doi:
          <volume>10</volume>
          .1145/3340531.3412880.
        </mixed-citation>
      </ref>
      <ref id="ref82">
        <mixed-citation>
          [82]
          <string-name>
            <given-names>L.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lee</surname>
          </string-name>
          , CoAID: COVID-19
          <string-name>
            <surname>Healthcare Misinformation</surname>
            <given-names>Dataset</given-names>
          </string-name>
          , arXiv preprint (
          <year>2020</year>
          ). doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>2006</year>
          .
          <volume>00885</volume>
          , arXiv:
          <year>2006</year>
          .00885.
        </mixed-citation>
      </ref>
      <ref id="ref83">
        <mixed-citation>
          [83]
          <string-name>
            <given-names>A.</given-names>
            <surname>Zubiaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Liakata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Procter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wong Sak Hoi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Tolmie</surname>
          </string-name>
          ,
          <article-title>Analysing How People Orient to and Spread Rumours in Social Media by Looking at Conversational Threads</article-title>
          ,
          <source>PLOS ONE 11</source>
          (
          <year>2016</year>
          )
          <article-title>e0150989</article-title>
          . doi:
          <volume>10</volume>
          .1371/journal.pone.
          <volume>0150989</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref84">
        <mixed-citation>
          [84]
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krevl</surname>
          </string-name>
          , SNAP Datasets:
          <article-title>Stanford Large Network Dataset Collection</article-title>
          , http://snap. stanford.edu/data,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>