<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Are Misinformation Propagation Models Holistic Enough? Identifying Gaps and Needs</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Raquel</forename><surname>Rodríguez-García</surname></persName>
							<affiliation key="aff0">
								<orgName type="laboratory">NLP &amp; IR Group</orgName>
								<orgName type="institution">Universidad Nacional de Educación a Distancia (UNED)</orgName>
								<address>
									<postCode>28040</postCode>
									<settlement>Madrid</settlement>
									<country key="ES">Spain</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Álvaro</forename><surname>Rodrigo</surname></persName>
							<email>rrodriguez@lsi.uned.es</email>
							<affiliation key="aff0">
								<orgName type="laboratory">NLP &amp; IR Group</orgName>
								<orgName type="institution">Universidad Nacional de Educación a Distancia (UNED)</orgName>
								<address>
									<postCode>28040</postCode>
									<settlement>Madrid</settlement>
									<country key="ES">Spain</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Roberto</forename><surname>Centeno</surname></persName>
							<email>rcenteno@lsi.uned.es</email>
							<affiliation key="aff0">
								<orgName type="laboratory">NLP &amp; IR Group</orgName>
								<orgName type="institution">Universidad Nacional de Educación a Distancia (UNED)</orgName>
								<address>
									<postCode>28040</postCode>
									<settlement>Madrid</settlement>
									<country key="ES">Spain</country>
								</address>
							</affiliation>
							<affiliation key="aff0">
								<orgName type="laboratory">NLP &amp; IR Group</orgName>
								<orgName type="institution">Universidad Nacional de Educación a Distancia (UNED)</orgName>
								<address>
									<postCode>28040</postCode>
									<settlement>Madrid</settlement>
									<country key="ES">Spain</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Are Misinformation Propagation Models Holistic Enough? Identifying Gaps and Needs</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">C26140B81D0E41B4B069B07B5ED434B4</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T18:21+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Rumor Propagation, Fake News, Multi-agent Systems, Epidemiological Models R. Centeno) 0009-0000-6964-5956 (R. Rodríguez-García)</term>
					<term>0000-0002-6331-4117 (Á. Rodrigo)</term>
					<term>0000-0001-9095-4665 (R. Centeno)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Misinformation has experienced increased online diffusion, mainly due to the low control of published content and low interest in fact-checking it from social media users. Many efforts 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></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Misinformation has proven to have a perverse effect by manipulating the public through different techniques, such as appealing to their emotions or fears to foster its believability <ref type="bibr" target="#b0">[1]</ref>. It has negatively affected democratic processes, such as the 2016 and 2020 US Elections <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3]</ref>, and spread potentially harmful content, such as the misinformation regarding the COVID-19 pandemic <ref type="bibr" target="#b3">[4]</ref>. Many efforts are underway to determine what distinguishes fake content from other information <ref type="bibr" target="#b4">[5]</ref>, to detect its presence <ref type="bibr" target="#b5">[6]</ref>, or what users are more susceptible <ref type="bibr" target="#b6">[7]</ref>. At the micro level, fake news detection is addressed by analyzing the information within a message. Recent efforts exploit Large Language Models (LLMs) <ref type="bibr" target="#b7">[8]</ref> for their enhanced performance. Other methods have explored the detection from a more rounded standpoint, exploiting characteristics from Twitter (now X) threads <ref type="bibr" target="#b8">[9]</ref>, such as the depth of the tree, or subjective metrics such as biases and credibility <ref type="bibr" target="#b9">[10]</ref>, outperforming state-of-the-art models.</p><p>At the macro or social network level, there have been efforts to detect profiles sharing misinformation <ref type="bibr" target="#b10">[11]</ref>, 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 <ref type="bibr" target="#b11">[12]</ref>, showing how bot formations foster high propagation rates. It has also been approached from the lens of the differing stances within communities <ref type="bibr" target="#b12">[13]</ref>. These features, from user characteristics to network topology, prove informative for these tasks <ref type="bibr" target="#b13">[14]</ref>.</p><p>From these efforts, we notice a general lack of holistic integration. Some approaches to detect spreaders have integrated information from different levels <ref type="bibr" target="#b14">[15]</ref>, such as shared information, user profiles, and ego networks. Nonetheless, most efforts focus on disjointed perspectives, either local <ref type="bibr" target="#b7">[8]</ref> or global <ref type="bibr" target="#b11">[12]</ref>. Holistic integration might limit the risk misinformation poses <ref type="bibr" target="#b15">[16]</ref>, 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 efforts toward modeling the users and their psychological capabilities or behaviors <ref type="bibr" target="#b16">[17,</ref><ref type="bibr" target="#b6">7]</ref>, although none includes the shared information. Some approaches have considered the topics of the messages, their emotion, or users' common interests <ref type="bibr" target="#b17">[18,</ref><ref type="bibr" target="#b18">19,</ref><ref type="bibr" target="#b19">20]</ref>, disregarding the value of the content by itself. Regarding the macro level, most efforts employ synthetic networks <ref type="bibr" target="#b20">[21]</ref>. Other approaches have used real topologies without the matching shared information <ref type="bibr" target="#b21">[22]</ref>, although it is crucial to the diffusion <ref type="bibr" target="#b22">[23]</ref>.</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 diffusion <ref type="bibr" target="#b23">[24]</ref>, differing from real information <ref type="bibr" target="#b24">[25]</ref>. Current efforts 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, affecting 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">State of the Art</head><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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">Early Approaches</head><p>Based on ordinary differential equations (ODEs), epidemiological models have been extensively employed to study the diffusion of a virus within a population <ref type="bibr" target="#b25">[26]</ref>. These models introduce one or several infected individuals into a population. The disease spreads amongst those susceptible until it has affected the whole group, or its diffusion 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 diffusion adapts this epidemiological model <ref type="bibr" target="#b26">[27]</ref> 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 <ref type="bibr" target="#b25">[26]</ref>, other variations were proposed, such as the Daley-Kendall (DK) or Ignorant-Spreader-Stifler (ISS) model <ref type="bibr" target="#b27">[28]</ref>, 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 <ref type="bibr" target="#b28">[29]</ref>, 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 differential 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 <ref type="bibr" target="#b29">[30]</ref> and not allowing for individual behavior or network heterogeneity. Stochastic models incorporate randomness and are also more realistic <ref type="bibr" target="#b30">[31]</ref>, at the cost of higher complexity <ref type="bibr" target="#b26">[27]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Extension of Epidemiological Models</head><p>Based on the previous models, a formal definition of information diffusion 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 62-73 𝐸 = {𝑒 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). Diffusion would be measured in users' internal stance (state) regarding the information per time unit.</p><p>Many other models inspired by epidemiological diffusion have been proposed since its early approximation, adapted to rumor diffusion, such as the Susceptible-Infected (SI) model <ref type="bibr" target="#b31">[32]</ref>, where users carry the information forever. The Susceptible-Infected-Susceptible (SIS) model <ref type="bibr" target="#b32">[33]</ref>, where the population would become Susceptible again, reflecting that users might forget the information. Lastly, the Susceptible-Infected-Recovered-Susceptible (SIRS) model <ref type="bibr" target="#b33">[34]</ref> 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 diffusion 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 <ref type="bibr" target="#b34">[35,</ref><ref type="bibr" target="#b35">36]</ref>. 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 <ref type="bibr" target="#b36">[37]</ref>, 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 <ref type="bibr" target="#b37">[38]</ref>, a Skeptic state where users never share the information received (SEIZ) <ref type="bibr" target="#b38">[39]</ref>, or a transition to a Recovered state (SEIZR) <ref type="bibr" target="#b39">[40]</ref>. The Susceptible-Known-Infected-Recovered (SKIR) model <ref type="bibr" target="#b40">[41]</ref> 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 <ref type="bibr" target="#b41">[42]</ref> includes two different stances towards the rumor: Positively or Negatively Infected. Regarding their emotion, the Emotionbased SIS model (ESIS) <ref type="bibr" target="#b18">[19]</ref> classifies the message into seven differently weighted classes, such as fear or happiness, thus rendering some emotions more effective for spreading.</p><p>Other more complex models consider more states, such as the SCNDR model <ref type="bibr" target="#b42">[43]</ref>, 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 <ref type="bibr" target="#b43">[44]</ref> 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 different 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 diffusion particularities, they still struggle to reflect intricate behavior. Dividing the population into compartments simplifies the problem, but it faces the difficulty of reflecting complex social behavior with a discrete label. As an example, in the <ref type="bibr" target="#b44">[45]</ref>, the difference 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><formula xml:id="formula_0">IS 1 S 2 C 1 C 2 R 1 R 2 model</formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">Non-Epidemiological Models</head><p>Although epidemiological models have been extensively used in information diffusion, 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 <ref type="bibr" target="#b45">[46]</ref>. 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 diffusion of information <ref type="bibr" target="#b46">[47]</ref>, showing that the dynamics can reflect those of social media <ref type="bibr" target="#b47">[48,</ref><ref type="bibr" target="#b48">49]</ref>. Other variations do not limit influence to a one-time-only event but a window <ref type="bibr" target="#b49">[50]</ref>.</p><p>The Linear Threshold model <ref type="bibr" target="#b50">[51]</ref> 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 <ref type="bibr" target="#b51">[52]</ref>. Further adaptations also introduce user information and the similarity between previously shared content <ref type="bibr" target="#b52">[53]</ref>.</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 <ref type="bibr" target="#b53">[54]</ref>. These models have been used for information diffusion on social media <ref type="bibr" target="#b54">[55]</ref> and to devise how to mitigate its effects <ref type="bibr" target="#b55">[56]</ref>.</p><p>There are other lesser-known models, such as Push-Pull <ref type="bibr" target="#b56">[57]</ref>, 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 <ref type="bibr" target="#b57">[58]</ref>, and continuous-time <ref type="bibr" target="#b58">[59]</ref>.</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 efforts towards its reduction and optimization <ref type="bibr" target="#b46">[47,</ref><ref type="bibr" target="#b49">50]</ref>, time complexity is high.</p><p>Beyond the epidemiological analogy, other models have been proposed inspired by different naturally occurring phenomena. Such is the case of the Energy Model <ref type="bibr" target="#b59">[60]</ref> and the Forest Fire Model <ref type="bibr" target="#b60">[61]</ref>. The Energy Model is based on the physical theory of heat energy. This model alters the traditional paradigm of a binary value for the diffusion, 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 <ref type="bibr" target="#b60">[61]</ref> is influenced by the process of fire spreading in a forest. Drawing inspiration from the diverse factors that affect 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 <ref type="bibr" target="#b17">[18]</ref>. 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.4.">Agent-Based Social Models</head><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 <ref type="bibr" target="#b29">[30]</ref>. ABSS also adopts compartmental epidemiological models while solving those issues.</p><p>The SIR epidemiological model has been adapted to ABSS technologies <ref type="bibr" target="#b61">[62]</ref>. 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 [63]. Similarly, it has been extended to account for bots and influencers with different behaviors <ref type="bibr" target="#b63">[64]</ref>, as well as time dynamics or trust measures between agents <ref type="bibr" target="#b64">[65]</ref>. These approaches face the problem of only focusing on user-specific characteristics.</p><p>Other efforts have modeled individual processes in users' perceptions, such as an uncertainty-based SIR model, where uncertainty is modeled through ambiguity and ignorance <ref type="bibr" target="#b65">[66]</ref>, or a cognitive-inspired model where belief is measured based on dissonance and exposure <ref type="bibr" target="#b66">[67]</ref>. Other common social effects and theories, such as homophily or social influence, have also been studied, such as a segregation between gullibles and skeptics within the population <ref type="bibr" target="#b67">[68]</ref>, aiding the spread of a rumor, or social context based o similarity and influence propagation <ref type="bibr" target="#b68">[69]</ref>.</p><p>Social sciences have been another interesting topic of research. The Big Five model <ref type="bibr" target="#b69">[70]</ref> has been estimated to explore user similarity <ref type="bibr" target="#b19">[20]</ref>, homophily regarding political views <ref type="bibr" target="#b20">[21]</ref>, or a trust model based on users' identity, behavior, and relationships <ref type="bibr" target="#b70">[71]</ref>. Game theory and decision theory have also been studied in the context of fake news <ref type="bibr" target="#b6">[7]</ref>, introducing common deception strategies to benefit from the uncertainty. Social Impact Theory has also been used for modeling rumors <ref type="bibr" target="#b71">[72]</ref> by introducing other components such as persuasiveness or environmental bias. Lastly, echo chambers are also explored from different levels <ref type="bibr" target="#b16">[17]</ref>: 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 <ref type="bibr" target="#b72">[73,</ref><ref type="bibr" target="#b73">74]</ref>. Each agent potentially has different 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 <ref type="bibr" target="#b74">[75]</ref> or real discussions between the agents. Although mathematical models have been used with centralized and decentralized measures <ref type="bibr" target="#b21">[22]</ref>, ABSS is more versatile and has been studied further in this context to identify influential nodes and delay the diffusion process <ref type="bibr" target="#b75">[76]</ref>, to study the simultaneous spread of a rumor and its counterinformation <ref type="bibr" target="#b74">[75]</ref>, and other measures based on user attention <ref type="bibr" target="#b63">[64]</ref>. 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Current Limitations</head><p>Propagation simulation models have some limitations, which affect 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 difficulty 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 <ref type="bibr" target="#b76">[77]</ref>; 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 <ref type="bibr" target="#b77">[78]</ref> or to establish user similarity based on posted content <ref type="bibr" target="#b17">[18]</ref>. As such, content within the diffusion 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 diffusion. 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 diffusion. 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 diffusion 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 <ref type="bibr">[63]</ref>, aggregating diffusion 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 diffusion 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 <ref type="bibr">[63]</ref>, which dismisses how relevancy works in social media: 500 retweets </p><formula xml:id="formula_1">✓ ✗ ✓ ✗ ✓ Conspiracies PHEME-9[83] ✓ ✓ ✓ ✓ ✓ General SNAP[84] ✗ ✗ ✓ ✗ ✗ -</formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 1</head><p>Available datasets for information propagation models and their main characteristics in 10 minutes do not equate to 500 retweets in 10 days.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Requirements for a Properly Experimental Framework</head><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 diffusion 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. Information of the shared content (Content) and the users (User). The information shared is an essential part of the diffusion. 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 different 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 diffusion of content online. Although synthetic networks might reflect some properties of real social media networks, they pose a significant limitation since diffusion 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 diffusion 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 <ref type="table">1</ref>, 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 <ref type="table">1</ref>, 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 diffusion of information. Regarding this type of content, the SNAP collection does not provide diffusion information; it only shares the topologies from social media networks. Although it is valuable information, the diffusion 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 diffusion: 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 efforts into mitigating fake news.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusions and Future Work</head><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 different tools to address misinformation. Propagation models are one tool that would allow a holistic approach by studying the diffusion of online misinformation from local and global perspectives.</p><p>With this work, we have studied current approaches to propagation diffusion 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></div>		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><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 (PCI2022-135026-2).</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Reliance on Emotion Promotes Belief in Fake News</title>
		<author>
			<persName><forename type="first">C</forename><surname>Martel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Pennycook</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">G</forename><surname>Rand</surname></persName>
		</author>
		<idno type="DOI">10.1186/s41235-020-00252-3</idno>
	</analytic>
	<monogr>
		<title level="j">Cognitive Research: Principles and Implications</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page" from="1" to="20" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Characterizing Social Media Manipulation in the 2020 U.S. Presidential Election</title>
		<author>
			<persName><forename type="first">E</forename><surname>Ferrara</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Chang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Muric</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Patel</surname></persName>
		</author>
		<idno type="DOI">10.5210/fm.v25i11.11431</idno>
	</analytic>
	<monogr>
		<title level="j">First Monday</title>
		<imprint>
			<biblScope unit="volume">25</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Selective Exposure to Misinformation: Evidence from the Consumption of Fake News during the 2016 U.S. Presidential Campaign</title>
		<author>
			<persName><forename type="first">A</forename><surname>Guess</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Nyhan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Reifler</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">European Research Council</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page">4</biblScope>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Misinformation of COVID-19 on the Internet: Infodemiology Study</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">Y</forename><surname>Cuan-Baltazar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">J</forename><surname>Muñoz-Perez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Robledo-Vega</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">F</forename><surname>Pérez-Zepeda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Soto-Vega</surname></persName>
		</author>
		<idno type="DOI">10.2196/18444</idno>
	</analytic>
	<monogr>
		<title level="j">JMIR Public Health and Surveillance</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="page" from="1" to="9" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Truth of Varying Shades: Analyzing Language in Fake News and Political Fact-Checking</title>
		<author>
			<persName><forename type="first">H</forename><surname>Rashkin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Choi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">Y</forename><surname>Jang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Volkova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Choi</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/D17-1317</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</title>
				<meeting>the 2017 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics<address><addrLine>Copenhagen, Denmark</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="2931" to="2937" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Fake News Detection Based on News Content and Social Contexts: A Transformer-Based Approach</title>
		<author>
			<persName><forename type="first">S</forename><surname>Raza</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Ding</surname></persName>
		</author>
		<idno type="DOI">10.1007/s41060-021-00302-z</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Data Science and Analytics</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page" from="335" to="362" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Information-Theoretic Models of Deception: Modelling Cooperation and Diffusion in Populations Exposed to &quot;Fake News</title>
		<author>
			<persName><forename type="first">C</forename><surname>Kopp</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">B</forename><surname>Korb</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">I</forename><surname>Mills</surname></persName>
		</author>
		<idno type="DOI">10.1371/journal.pone.0207383</idno>
	</analytic>
	<monogr>
		<title level="j">PLOS ONE</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page">e0207383</biblScope>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Bad Actor, Good Advisor: Exploring the Role of Large Language Models in Fake News Detection</title>
		<author>
			<persName><forename type="first">B</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Sheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Cao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Shi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Qi</surname></persName>
		</author>
		<idno type="DOI">10.1609/aaai.v38i20.30214</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the AAAI Conference on Artificial Intelligence</title>
				<meeting>the AAAI Conference on Artificial Intelligence</meeting>
		<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="volume">38</biblScope>
			<biblScope unit="page" from="22105" to="22113" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Automatically Identifying Fake News in Popular Twitter Threads</title>
		<author>
			<persName><forename type="first">C</forename><surname>Buntain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Golbeck</surname></persName>
		</author>
		<idno type="DOI">10.1109/SmartCloud.2017.40</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE International Conference on Smart Cloud (SmartCloud)</title>
				<imprint>
			<date type="published" when="2017">2017. 2017</date>
			<biblScope unit="page" from="208" to="215" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Multi-View Co-Attention Network for Fake News Detection by Modeling Topic-Specific User and News Source Credibility</title>
		<author>
			<persName><forename type="first">P</forename><surname>Bazmi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Asadpour</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Shakery</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ipm.2022.103146</idno>
	</analytic>
	<monogr>
		<title level="j">Information Processing &amp; Management</title>
		<imprint>
			<biblScope unit="volume">60</biblScope>
			<biblScope unit="page">103146</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Combining Tweets and Connections Graph for FakeNews Detection at MediaEval</title>
		<author>
			<persName><forename type="first">K</forename><surname>Pogorelov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">T</forename><surname>Schroeder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Brenner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Maulana</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Langguth</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">MediaEval</title>
		<imprint>
			<biblScope unit="volume">3583</biblScope>
			<biblScope unit="page" from="1" to="4" />
			<date type="published" when="2022">2022. 2022. 2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">The Role of Bot Squads in the Political Propaganda on Twitter</title>
		<author>
			<persName><forename type="first">G</forename><surname>Caldarelli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>De Nicola</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Del</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Vigna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Petrocchi</surname></persName>
		</author>
		<author>
			<persName><surname>Saracco</surname></persName>
		</author>
		<idno type="DOI">10.1038/s42005-020-0340-4</idno>
	</analytic>
	<monogr>
		<title level="j">Communications Physics</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="1" to="15" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Understanding Coordinated Communities through the Lens of Protest-Centric Narratives: A Case Study on #CAA Protest</title>
		<author>
			<persName><forename type="first">K</forename><surname>Neha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Agrawal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chhatani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Sharma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">B</forename><surname>Buduru</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Kumaraguru</surname></persName>
		</author>
		<idno type="DOI">10.1609/icwsm.v18i1.31377</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International AAAI Conference on Web and Social Media</title>
				<meeting>the International AAAI Conference on Web and Social Media</meeting>
		<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="page" from="1123" to="1133" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">Studying Fake News via Network Analysis: Detection and Mitigation</title>
		<author>
			<persName><forename type="first">K</forename><surname>Shu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">R</forename><surname>Bernard</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Liu</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-94105-9_3</idno>
		<imprint>
			<date type="published" when="2019">2019</date>
			<publisher>Springer International Publishing</publisher>
			<biblScope unit="page" from="43" to="65" />
			<pubPlace>Cham</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Identifying Possible Rumor Spreaders on Twitter: A Weak Supervised Learning Approach</title>
		<author>
			<persName><forename type="first">S</forename><surname>Sharma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Sharma</surname></persName>
		</author>
		<idno type="DOI">10.1109/ijcnn52387.2021.9534185</idno>
	</analytic>
	<monogr>
		<title level="m">2021 International Joint Conference on Neural Networks (IJCNN), IEEE</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="1" to="8" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Holistic Analysis of Organised Misinformation Activity in Social Networks</title>
		<author>
			<persName><forename type="first">A</forename><surname>Peñas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Deriu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Sharma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Valentin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Reyes-Montesinos</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-47896-3_10</idno>
	</analytic>
	<monogr>
		<title level="m">Disinformation in Open Online Media</title>
				<meeting><address><addrLine>Nature Switzerland; Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="132" to="143" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">The Triple-filter Bubble: Using Agent-based Modelling to Test a Meta-theoretical Framework for the Emergence of Filter Bubbles and Echo Chambers</title>
		<author>
			<persName><forename type="first">D</forename><surname>Geschke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Lorenz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Holtz</surname></persName>
		</author>
		<idno type="DOI">10.1111/bjso.12286</idno>
	</analytic>
	<monogr>
		<title level="j">British Journal of Social Psychology</title>
		<imprint>
			<biblScope unit="volume">58</biblScope>
			<biblScope unit="page" from="129" to="149" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Modeling Information Diffusion in Online Social Networks Using a Modified Forest-Fire Model</title>
		<author>
			<persName><forename type="first">S</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Saini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Goel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">S</forename><surname>Panda</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10844-020-00623-8</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Intelligent Information Systems</title>
		<imprint>
			<biblScope unit="volume">56</biblScope>
			<biblScope unit="page" from="355" to="377" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">ESIS: Emotion-based Spreader-Ignorant-Stifler Model for Information Diffusion</title>
		<author>
			<persName><forename type="first">Q</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Jin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Cheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Yang</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.knosys.2015.02.006</idno>
	</analytic>
	<monogr>
		<title level="j">Knowledge-Based Systems</title>
		<imprint>
			<biblScope unit="volume">81</biblScope>
			<biblScope unit="page" from="46" to="55" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Opinion Dynamic Modeling of News Perception</title>
		<author>
			<persName><forename type="first">L</forename><surname>Milli</surname></persName>
		</author>
		<idno type="DOI">10.1007/s41109-021-00412-4</idno>
	</analytic>
	<monogr>
		<title level="j">Applied Network Science</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="page">76</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Simulating the Impact of Personality on Fake News</title>
		<author>
			<persName><forename type="first">A</forename><surname>Coates</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Muller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sirur</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">TRUST@ AAMAS</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="1" to="12" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Why Rumors Spread Fast in Social Networks, and How to Stop It</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">N</forename><surname>Zehmakan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Out</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Hesamipour Khelejan</surname></persName>
		</author>
		<idno type="DOI">10.24963/ijcai.2023/27</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization</title>
				<meeting>the Thirty-Second International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization<address><addrLine>Macau, SAR China</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="234" to="242" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">The Effect of User Features on Churn in Social Networks</title>
		<author>
			<persName><forename type="first">M</forename><surname>Karnstedt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Rowe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Chan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Alani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Hayes</surname></persName>
		</author>
		<idno type="DOI">10.1145/2527031.2527051</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 3rd International Web Science Conference, WebSci &apos;11</title>
				<meeting>the 3rd International Web Science Conference, WebSci &apos;11<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="1" to="8" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">This Just In: Fake News Packs A Lot In Title, Uses Simpler, Repetitive Content in Text Body, More Similar To Satire Than Real News</title>
		<author>
			<persName><forename type="first">B</forename><surname>Horne</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Adali</surname></persName>
		</author>
		<idno type="DOI">10.1609/icwsm.v11i1.14976</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International AAAI Conference on Web and Social Media</title>
				<meeting>the International AAAI Conference on Web and Social Media</meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="volume">11</biblScope>
			<biblScope unit="page" from="759" to="766" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">The Spread of True and False News Online</title>
		<author>
			<persName><forename type="first">S</forename><surname>Vosoughi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Roy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename></persName>
		</author>
		<idno type="DOI">10.1126/science.aap9559</idno>
	</analytic>
	<monogr>
		<title level="j">Science</title>
		<imprint>
			<biblScope unit="volume">359</biblScope>
			<biblScope unit="page" from="1146" to="1151" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">A Contribution to the Mathematical Theory of Epidemics</title>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">O</forename><surname>Kermack</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Mckendrick</surname></persName>
		</author>
		<idno type="DOI">10.1098/rspa.1927.0118</idno>
	</analytic>
	<monogr>
		<title level="j">Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character</title>
		<imprint>
			<biblScope unit="volume">115</biblScope>
			<biblScope unit="page" from="700" to="721" />
			<date type="published" when="1927">1927</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Generalization of Epidemic Theory: An Application to the Transmission of Ideas</title>
		<author>
			<persName><forename type="first">W</forename><surname>Goffman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">A</forename><surname>Newill</surname></persName>
		</author>
		<idno type="DOI">10.1038/204225a0</idno>
	</analytic>
	<monogr>
		<title level="j">Nature</title>
		<imprint>
			<biblScope unit="volume">204</biblScope>
			<biblScope unit="page" from="225" to="228" />
			<date type="published" when="1964">1964</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Epidemics and Rumours</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Daley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">G</forename><surname>Kendall</surname></persName>
		</author>
		<idno type="DOI">10.1038/2041118a0</idno>
	</analytic>
	<monogr>
		<title level="j">Nature</title>
		<imprint>
			<biblScope unit="volume">204</biblScope>
			<biblScope unit="page" from="1118" to="1118" />
			<date type="published" when="1964">1964</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<monogr>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">P</forename><surname>Maki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Thompson</surname></persName>
		</author>
		<title level="m">Mathematical Models and Applications</title>
				<imprint>
			<publisher>Prentice-Hall</publisher>
			<date type="published" when="1973">1973</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Stochastic Rumours</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Daley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">G</forename><surname>Kendall</surname></persName>
		</author>
		<idno type="DOI">10.1093/imamat/1.1.42</idno>
	</analytic>
	<monogr>
		<title level="j">IMA Journal of Applied Mathematics</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="42" to="55" />
			<date type="published" when="1965">1965</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Stochastic Epidemic Models: A Survey</title>
		<author>
			<persName><forename type="first">T</forename><surname>Britton</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.mbs.2010.01.006</idno>
	</analytic>
	<monogr>
		<title level="j">Mathematical Biosciences</title>
		<imprint>
			<biblScope unit="volume">225</biblScope>
			<biblScope unit="page" from="24" to="35" />
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Rumors in a Network: Who&apos;s the Culprit?</title>
		<author>
			<persName><forename type="first">D</forename><surname>Shah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zaman</surname></persName>
		</author>
		<idno type="DOI">10.1109/tit.2011.2158885</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Information Theory</title>
		<imprint>
			<biblScope unit="volume">57</biblScope>
			<biblScope unit="page" from="5163" to="5181" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">Efficient Estimation of Influence Functions for SIS Model on Social Networks</title>
		<author>
			<persName><forename type="first">M</forename><surname>Kimura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Saito</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Motoda</surname></persName>
		</author>
		<idno type="DOI">10.5555/1661445.1661772</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI&apos;09</title>
				<meeting>the 21st International Joint Conference on Artificial Intelligence, IJCAI&apos;09<address><addrLine>San Francisco, CA, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Morgan Kaufmann Publishers Inc</publisher>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="2046" to="2051" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">A Deterministic Mathematical Model for the Spread of Two Rumors</title>
		<author>
			<persName><forename type="first">R</forename><surname>Escalante</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Odehnal</surname></persName>
		</author>
		<idno type="DOI">10.1007/s13370-019-00726-8</idno>
	</analytic>
	<monogr>
		<title level="j">Afrika Matematika</title>
		<imprint>
			<biblScope unit="volume">31</biblScope>
			<biblScope unit="page" from="315" to="331" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<analytic>
		<title level="a" type="main">Theory of Rumour Spreading in Complex Social Networks</title>
		<author>
			<persName><forename type="first">M</forename><surname>Nekovee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Moreno</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Bianconi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Marsili</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.physa.2006.07.017</idno>
	</analytic>
	<monogr>
		<title level="j">Physica A: Statistical Mechanics and its Applications</title>
		<imprint>
			<biblScope unit="volume">374</biblScope>
			<biblScope unit="page" from="457" to="470" />
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<analytic>
		<title level="a" type="main">Epidemic Spreading in Scale-Free Networks</title>
		<author>
			<persName><forename type="first">R</forename><surname>Pastor-Satorras</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Vespignani</surname></persName>
		</author>
		<idno type="DOI">10.1103/PhysRevLett.86.3200</idno>
	</analytic>
	<monogr>
		<title level="j">Physical Review Letters</title>
		<imprint>
			<biblScope unit="volume">86</biblScope>
			<biblScope unit="page" from="3200" to="3203" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">A SEIR-based Model for Virus Propagation on SNS</title>
		<author>
			<persName><forename type="first">C</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Zhang</surname></persName>
		</author>
		<idno type="DOI">10.1109/EIDWT.2013.86</idno>
	</analytic>
	<monogr>
		<title level="m">2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies, IEEE, Xi&apos;an</title>
				<imprint>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="479" to="482" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<analytic>
		<title level="a" type="main">Rumor Spreading Model Considering Hesitating Mechanism in Complex Social Networks</title>
		<author>
			<persName><forename type="first">L.-L</forename><surname>Xia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G.-P</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y.-R</forename><surname>Song</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.physa.2015.05.113</idno>
	</analytic>
	<monogr>
		<title level="j">Physica A: Statistical Mechanics and its Applications</title>
		<imprint>
			<biblScope unit="volume">437</biblScope>
			<biblScope unit="page" from="295" to="303" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<analytic>
		<title level="a" type="main">Epidemiological Modeling of News and Rumors on Twitter</title>
		<author>
			<persName><forename type="first">F</forename><surname>Jin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Dougherty</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Saraf</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Cao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ramakrishnan</surname></persName>
		</author>
		<idno type="DOI">10.1145/2501025.2501027</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 7th Workshop on Social Network Mining and Analysis</title>
				<meeting>the 7th Workshop on Social Network Mining and Analysis<address><addrLine>Chicago Illinois</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="1" to="9" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">The Power of a Good Idea: Quantitative Modeling of the Spread of Ideas from Epidemiological Models</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">M A</forename><surname>Bettencourt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Cintrón-Arias</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">I</forename><surname>Kaiser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Castillo-Chávez</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.physa.2005.08.083</idno>
	</analytic>
	<monogr>
		<title level="j">Physica A: Statistical Mechanics and its Applications</title>
		<imprint>
			<biblScope unit="volume">364</biblScope>
			<biblScope unit="page" from="513" to="536" />
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b40">
	<analytic>
		<title level="a" type="main">Rumor Propagation Dynamic Model Based on Evolutionary Game and Anti-Rumor</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Xiao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Xu</surname></persName>
		</author>
		<idno type="DOI">10.1007/s11071-018-4579-1</idno>
	</analytic>
	<monogr>
		<title level="j">Nonlinear Dynamics</title>
		<imprint>
			<biblScope unit="volume">95</biblScope>
			<biblScope unit="page" from="523" to="539" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b41">
	<analytic>
		<title level="a" type="main">A New Rumor Propagation Model and Control Strategy on Social Networks</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Bao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Yi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Xue</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Dong</surname></persName>
		</author>
		<idno type="DOI">10.1109/ASONAM.2013.6785909</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM</title>
				<imprint>
			<date type="published" when="2013">2013. 2013. 2013</date>
			<biblScope unit="page" from="1472" to="1473" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b42">
	<analytic>
		<title level="a" type="main">A Novel SCNDR Rumor Propagation Model on Online Social Networks</title>
		<author>
			<persName><forename type="first">W</forename><surname>Hong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Hao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Li</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICCE-TW.2015.7216829</idno>
	</analytic>
	<monogr>
		<title level="m">2015 IEEE International Conference on Consumer Electronics -Taiwan</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="154" to="155" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b43">
	<analytic>
		<title level="a" type="main">Dynamic 8-State ICSAR Rumor Propagation Model Considering Official Rumor Refutation</title>
		<author>
			<persName><forename type="first">N</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Su</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Zhang</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.physa.2014.07.023</idno>
	</analytic>
	<monogr>
		<title level="j">Physica A: Statistical Mechanics and its Applications</title>
		<imprint>
			<biblScope unit="volume">415</biblScope>
			<biblScope unit="page" from="333" to="346" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b44">
	<analytic>
		<title level="a" type="main">Rumor and Authoritative Information Propagation Model Considering Super Spreading in Complex Social Networks</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Su</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Weigang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Liu</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.physa.2018.04.082</idno>
	</analytic>
	<monogr>
		<title level="j">Physica A: Statistical Mechanics and its Applications</title>
		<imprint>
			<biblScope unit="volume">506</biblScope>
			<biblScope unit="page" from="395" to="411" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b45">
	<analytic>
		<title level="a" type="main">Maximizing the Spread of Influence through a Social Network</title>
		<author>
			<persName><forename type="first">D</forename><surname>Kempe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kleinberg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">É</forename><surname>Tardos</surname></persName>
		</author>
		<idno type="DOI">10.1145/956750.956769</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</title>
				<meeting>the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining<address><addrLine>Washington, D.C.</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2003">2003</date>
			<biblScope unit="page" from="137" to="146" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b46">
	<analytic>
		<title level="a" type="main">Containment of Misinformation Spread in Online Social Networks</title>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">P</forename><surname>Nguyen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Yan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">T</forename><surname>Thai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Eidenbenz</surname></persName>
		</author>
		<idno type="DOI">10.1145/2380718.2380746</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 4th Annual ACM Web Science Conference</title>
				<meeting>the 4th Annual ACM Web Science Conference<address><addrLine>Evanston Illinois</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2012">2012</date>
			<biblScope unit="page" from="213" to="222" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b47">
	<analytic>
		<title level="a" type="main">Chapter 24 -Information Diffusion and Rumor Spreading</title>
		<author>
			<persName><forename type="first">A</forename><surname>Kalogeratos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Scaman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Corinzia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Vayatis</surname></persName>
		</author>
		<idno type="DOI">10.1016/B978-0-12-813677-5.00024-9</idno>
	</analytic>
	<monogr>
		<title level="m">Cooperative and Graph Signal Processing</title>
				<imprint>
			<publisher>Academic Press</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="651" to="678" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b48">
	<analytic>
		<title level="a" type="main">Meme-Tracking and the Dynamics of the News Cycle</title>
		<author>
			<persName><forename type="first">J</forename><surname>Leskovec</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Backstrom</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kleinberg</surname></persName>
		</author>
		<idno type="DOI">10.1145/1557019.1557077</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD &apos;09</title>
				<meeting>the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD &apos;09<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="497" to="506" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b49">
	<analytic>
		<title level="a" type="main">CT-IC: Continuously Activated and Time-Restricted Independent Cascade Model for Viral Marketing</title>
		<author>
			<persName><forename type="first">W</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Yu</surname></persName>
		</author>
		<idno type="DOI">10.1109/icdm.2012.40</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE 12th International Conference on Data Mining</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2012">2012. 2012</date>
			<biblScope unit="page" from="960" to="965" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b50">
	<analytic>
		<title level="a" type="main">A Simple Model of Global Cascades on Random Networks</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Watts</surname></persName>
		</author>
		<idno type="DOI">10.1073/pnas.082090499</idno>
	</analytic>
	<monogr>
		<title level="j">Proceedings of the National Academy of Sciences</title>
		<imprint>
			<biblScope unit="volume">99</biblScope>
			<biblScope unit="page" from="5766" to="5771" />
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b51">
	<analytic>
		<title level="a" type="main">Clustering Determines the Dynamics of Complex Contagions in Multiplex Networks</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhuang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Arenas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Yağan</surname></persName>
		</author>
		<idno type="DOI">10.1103/PhysRevE.95.012312</idno>
	</analytic>
	<monogr>
		<title level="j">Physical Review E</title>
		<imprint>
			<biblScope unit="volume">95</biblScope>
			<biblScope unit="page">12312</biblScope>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b52">
	<analytic>
		<title level="a" type="main">Predicting Information Diffusion in Social Networks Using Content and User&apos;s Profiles</title>
		<author>
			<persName><forename type="first">C</forename><surname>Lagnier</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Denoyer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Gaussier</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Gallinari</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-642-36973-5_7</idno>
	</analytic>
	<monogr>
		<title level="m">Advances in Information Retrieval</title>
				<meeting><address><addrLine>Berlin, Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="74" to="85" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b53">
	<analytic>
		<title level="a" type="main">Spectra of Some Self-Exciting and Mutually Exciting Point Processes</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Hawkes</surname></persName>
		</author>
		<idno type="DOI">10.2307/2334319</idno>
	</analytic>
	<monogr>
		<title level="j">Biometrika</title>
		<imprint>
			<biblScope unit="volume">58</biblScope>
			<biblScope unit="page" from="83" to="90" />
			<date type="published" when="1971">1971</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b54">
	<analytic>
		<title level="a" type="main">Simulating Fake News Dissemination on Twitter with Multivariate Hawkes Processes</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">D</forename><surname>Porter</surname></persName>
		</author>
		<idno type="DOI">10.1109/BigData55660.2022.10020285</idno>
	</analytic>
	<monogr>
		<title level="m">2022 IEEE International Conference on Big Data (Big Data)</title>
				<meeting><address><addrLine>Osaka, Japan</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="3597" to="3606" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b55">
	<analytic>
		<title level="a" type="main">Fake News Mitigation via Point Process Based Intervention</title>
		<author>
			<persName><forename type="first">M</forename><surname>Farajtabar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Ye</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Trivedi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Khalil</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zha</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 34th International Conference on Machine Learning</title>
				<meeting>the 34th International Conference on Machine Learning<address><addrLine>PMLR</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="1097" to="1106" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b56">
	<analytic>
		<title level="a" type="main">A Chain-Binomial Model for Pull and Push-Based Information Diffusion</title>
		<author>
			<persName><forename type="first">M</forename><surname>Caglar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Ozkasap</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICC.2006.254823</idno>
	</analytic>
	<monogr>
		<title level="m">2006 IEEE International Conference on Communications</title>
				<meeting><address><addrLine>Istanbul</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2006">2006</date>
			<biblScope unit="page" from="909" to="914" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b57">
	<analytic>
		<title level="a" type="main">Rumor Propagation with Heterogeneous Transmission in Social Networks</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">A</forename><surname>Vega-Oliveros</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">D F</forename><surname>Costa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Rodrigues</surname></persName>
		</author>
		<idno type="DOI">10.1088/1742-5468/aa58ef</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Statistical Mechanics: Theory and Experiment</title>
		<imprint>
			<biblScope unit="volume">2017</biblScope>
			<biblScope unit="page">23401</biblScope>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b58">
	<analytic>
		<title level="a" type="main">Maximizing the Spread of Influence Ranking in Social Networks</title>
		<author>
			<persName><forename type="first">T</forename><surname>Zhu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Zhu</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ins.2014.03.070</idno>
	</analytic>
	<monogr>
		<title level="j">Information Sciences</title>
		<imprint>
			<biblScope unit="volume">278</biblScope>
			<biblScope unit="page" from="535" to="544" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b59">
	<analytic>
		<title level="a" type="main">Energy Model for Rumor Propagation on Social Networks</title>
		<author>
			<persName><forename type="first">S</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Zhuang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Shi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Ao</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.physa.2013.10.003</idno>
	</analytic>
	<monogr>
		<title level="j">Physica A: Statistical Mechanics and its Applications</title>
		<imprint>
			<biblScope unit="volume">394</biblScope>
			<biblScope unit="page" from="99" to="109" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b60">
	<analytic>
		<title level="a" type="main">A Nature -Inspired Approach Based on Forest Fire Model for Modeling Rumor Propagation in Social Networks</title>
		<author>
			<persName><forename type="first">V</forename><surname>Indu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Thampi</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jnca.2018.10.003</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Network and Computer Applications</title>
		<imprint>
			<biblScope unit="volume">125</biblScope>
			<biblScope unit="page" from="28" to="41" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b61">
	<analytic>
		<title level="a" type="main">Validating Viral Marketing Strategies in Twitter via Agent-Based Social Simulation</title>
		<author>
			<persName><forename type="first">E</forename><surname>Serrano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">A</forename><surname>Iglesias</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2015.12.021</idno>
	</analytic>
	<monogr>
		<title level="j">Expert Systems with Applications</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="page" from="140" to="150" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b62">
	<analytic>
		<title level="a" type="main">Evaluating the Influence of Twitter Bots via Agent-Based Social Simulation</title>
		<author>
			<persName><forename type="first">A</forename><surname>Averza</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Slhoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Bhattacharyya</surname></persName>
		</author>
		<idno type="DOI">10.1109/ACCESS.2022.3228258</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="page" from="129394" to="129407" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b63">
	<analytic>
		<title level="a" type="main">Can We Stop Fake News? Using Agent-Based Modelling to Evaluate Countermeasures for Misinformation on Social Media</title>
		<author>
			<persName><forename type="first">A</forename><surname>Gausen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Luk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Guo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">ICWSM Workshops</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b64">
	<analytic>
		<title level="a" type="main">Realistic Aspects of Simulation Models for Fake News Epidemics over Social Networks</title>
		<author>
			<persName><forename type="first">Q</forename><forename type="middle">F</forename><surname>Lotito</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zanella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Casari</surname></persName>
		</author>
		<idno type="DOI">10.3390/fi13030076</idno>
	</analytic>
	<monogr>
		<title level="j">Future Internet</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page">76</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b65">
	<analytic>
		<title level="a" type="main">Uncertainty-Based False Information Propagation in Social Networks</title>
		<author>
			<persName><forename type="first">J.-H</forename><surname>Cho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Rager</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>O'donovan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Adali</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">D</forename><surname>Horne</surname></persName>
		</author>
		<idno type="DOI">10.1145/3311091</idno>
	</analytic>
	<monogr>
		<title level="j">ACM Transactions on Social Computing</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="page" from="1" to="34" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b66">
	<analytic>
		<title level="a" type="main">Cognitive Cascades: How to Model (and Potentially Counter) the Spread of Fake News</title>
		<author>
			<persName><forename type="first">N</forename><surname>Rabb</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Cowen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">P</forename><surname>De Ruiter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Scheutz</surname></persName>
		</author>
		<idno type="DOI">10.1371/journal.pone.0261811</idno>
	</analytic>
	<monogr>
		<title level="j">PLOS ONE</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="page">e0261811</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b67">
	<analytic>
		<title level="a" type="main">Network Segregation in a Model of Misinformation and Fact-Checking</title>
		<author>
			<persName><forename type="first">M</forename><surname>Tambuscio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">F M</forename><surname>Oliveira</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">L</forename><surname>Ciampaglia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Ruffo</surname></persName>
		</author>
		<idno type="DOI">10.1007/s42001-018-0018-9</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Computational Social Science</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="261" to="275" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b68">
	<analytic>
		<title level="a" type="main">A Multi-agent System for Modelling Preference-Based Complex Influence Diffusion in Social Networks</title>
		<author>
			<persName><forename type="first">W</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Bai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Zhang</surname></persName>
		</author>
		<idno type="DOI">10.1093/comjnl/bxy078</idno>
	</analytic>
	<monogr>
		<title level="j">The Computer Journal</title>
		<imprint>
			<biblScope unit="volume">62</biblScope>
			<biblScope unit="page" from="430" to="447" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b69">
	<analytic>
		<title level="a" type="main">Personality in Adulthood: A Five-Factor Theory Perspective</title>
		<author>
			<persName><forename type="first">P</forename><surname>Costa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Mccrae</surname></persName>
		</author>
		<idno type="DOI">10.4324/9780203428412</idno>
	</analytic>
	<monogr>
		<title level="j">Management Information Systems Quarterly -MISQ</title>
		<imprint>
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b70">
	<analytic>
		<title level="a" type="main">Agent-Based Simulation of Fake News Dissemination: The Role of Trust Assessment and Big Five Personality Traits on News Spreading</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">F</forename><surname>Muhammad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kasahara</surname></persName>
		</author>
		<idno type="DOI">10.1007/s13278-024-01235-8</idno>
	</analytic>
	<monogr>
		<title level="j">Social Network Analysis and Mining</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="page">75</biblScope>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b71">
	<analytic>
		<title level="a" type="main">Agent-Based Modeling of Rumor Propagation Using Expected Integrated Mean Squared Error Optimal Design</title>
		<author>
			<persName><forename type="first">S.-H</forename><surname>Tseng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">Son</forename><surname>Nguyen</surname></persName>
		</author>
		<idno type="DOI">10.3390/asi3040048</idno>
	</analytic>
	<monogr>
		<title level="j">Applied System Innovation</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page">48</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b72">
	<monogr>
		<author>
			<persName><forename type="first">Y</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Yan</surname></persName>
		</author>
		<idno>ArXiv:2403.09498</idno>
		<title level="m">From Skepticism to Acceptance: Simulating the Attitude Dynamics Toward Fake News</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b73">
	<analytic>
		<title level="a" type="main">Large-Language-Model-Powered Agent-Based Framework for Misinformation and Disinformation Research: Opportunities and Open Challenges</title>
		<author>
			<persName><forename type="first">J</forename><surname>Pastor-Galindo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Nespoli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Ruipérez-Valiente</surname></persName>
		</author>
		<idno type="DOI">10.1109/MSEC.2024.3380511</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Security &amp; Privacy</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="24" to="36" />
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b74">
	<analytic>
		<title level="a" type="main">Misinformation Making a Disease Outbreak Worse: Outcomes Compared for Influenza, Monkeypox, and Norovirus</title>
		<author>
			<persName><forename type="first">J</forename><surname>Brainard</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">R</forename><surname>Hunter</surname></persName>
		</author>
		<idno type="DOI">10.1177/0037549719885021</idno>
	</analytic>
	<monogr>
		<title level="j">SIMULATION</title>
		<imprint>
			<biblScope unit="volume">96</biblScope>
			<biblScope unit="page" from="365" to="374" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b75">
	<analytic>
		<title level="a" type="main">Identifying Influential Nodes to Inhibit Bootstrap Percolation on Hyperbolic Networks</title>
		<author>
			<persName><forename type="first">C</forename><surname>Marshall</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Cruickshank</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>O'riordan</surname></persName>
		</author>
		<idno type="DOI">10.1109/ASONAM.2018.8508248</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)</title>
				<meeting><address><addrLine>Barcelona</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2018">2018. 2018</date>
			<biblScope unit="page" from="1266" to="1273" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b76">
	<analytic>
		<title level="a" type="main">Predicting the Big 5 Personality Traits from Digital Footprints on Social Media: A Meta-Analysis</title>
		<author>
			<persName><forename type="first">D</forename><surname>Azucar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Marengo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Settanni</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.paid.2017.12.018</idno>
	</analytic>
	<monogr>
		<title level="j">Personality and Individual Differences</title>
		<imprint>
			<biblScope unit="volume">124</biblScope>
			<biblScope unit="page" from="150" to="159" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b77">
	<analytic>
		<title level="a" type="main">Integrating Group Homophily and Individual Personality of Topics Can Better Model Network Communities</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Jin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Dang</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICDM50108.2020.00070</idno>
	</analytic>
	<monogr>
		<title level="m">2020 IEEE International Conference on Data Mining (ICDM)</title>
				<meeting><address><addrLine>Sorrento, Italy</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="611" to="620" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b78">
	<analytic>
		<title level="a" type="main">FakeNewsNet: A Data Repository with News Content, Social Context, and Spatiotemporal Information for Studying Fake News on Social Media</title>
		<author>
			<persName><forename type="first">K</forename><surname>Shu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Mahudeswaran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Liu</surname></persName>
		</author>
		<idno type="DOI">10.1089/big.2020.0062</idno>
	</analytic>
	<monogr>
		<title level="j">Big Data</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page" from="171" to="188" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b79">
	<analytic>
		<title level="a" type="main">Rumor Has It: Identifying Misinformation in Microblogs</title>
		<author>
			<persName><forename type="first">V</forename><surname>Qazvinian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Rosengren</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">R</forename><surname>Radev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Mei</surname></persName>
		</author>
		<ptr target="https://aclanthology.org/D11-1147" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</title>
				<meeting>the 2011 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics<address><addrLine>Edinburgh, Scotland, UK</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="1589" to="1599" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b80">
	<analytic>
		<title level="a" type="main">ReCOVery: A Multimodal Repository for COVID-19 News Credibility Research</title>
		<author>
			<persName><forename type="first">X</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mulay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Ferrara</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Zafarani</surname></persName>
		</author>
		<idno type="DOI">10.1145/3340531.3412880</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</title>
				<meeting>the 29th ACM International Conference on Information &amp; Knowledge Management</meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="3205" to="3212" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b81">
	<monogr>
		<author>
			<persName><forename type="first">L</forename><surname>Cui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Lee</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2006.00885</idno>
		<idno type="arXiv">arXiv:2006.00885</idno>
		<title level="m">CoAID: COVID-19 Healthcare Misinformation Dataset</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b82">
	<analytic>
		<title level="a" type="main">Analysing How People Orient to and Spread Rumours in Social Media by Looking at Conversational Threads</title>
		<author>
			<persName><forename type="first">A</forename><surname>Zubiaga</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Liakata</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Procter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Wong Sak Hoi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Tolmie</surname></persName>
		</author>
		<idno type="DOI">10.1371/journal.pone.0150989</idno>
	</analytic>
	<monogr>
		<title level="j">PLOS ONE</title>
		<imprint>
			<biblScope unit="volume">11</biblScope>
			<biblScope unit="page">e0150989</biblScope>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b83">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Leskovec</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Krevl</surname></persName>
		</author>
		<ptr target="http://snap.stanford.edu/data" />
		<title level="m">SNAP Datasets: Stanford Large Network Dataset Collection</title>
				<imprint>
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
