<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<?covid-19-tdm?>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Phys.</journal-id>
<journal-title>Frontiers in Physics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Phys.</abbrev-journal-title>
<issn pub-type="epub">2296-424X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">763081</article-id>
<article-id pub-id-type="doi">10.3389/fphy.2021.763081</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Physics</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>COVID-19 Rumor Detection on Social Networks Based on Content Information and User Response</article-title>
<alt-title alt-title-type="left-running-head">Yang and Pan</alt-title>
<alt-title alt-title-type="right-running-head">COVID-19 Rumor Detection</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Yang</surname>
<given-names>Jianliang</given-names>
</name>
<uri xlink:href="https://loop.frontiersin.org/people/1451989/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Pan</surname>
<given-names>Yuchen</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1472903/overview"/>
</contrib>
</contrib-group>
<aff>School of Information Resource Management, Renmin University of China, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/101109/overview">Chengyi Xia</ext-link>, Tianjin University of Technology, China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/144972/overview">Zhan Bu</ext-link>, Nanjing University of Finance and Economics, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1455901/overview">Yuan Bian</ext-link>, University of Chinese Academy of Sciences, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Yuchen Pan, <email>panyuchen@ruc.edu.cn</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Social Physics, a section of the journal Frontiers in Physics</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>28</day>
<month>09</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>9</volume>
<elocation-id>763081</elocation-id>
<history>
<date date-type="received">
<day>23</day>
<month>08</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>15</day>
<month>09</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2021 Yang and Pan.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Yang and Pan</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these&#x20;terms.</p>
</license>
</permissions>
<abstract>
<p>The outbreak of COVID-19 has caused a huge shock for human society. As people experience the attack of the COVID-19 virus, they also are experiencing an information epidemic at the same time. Rumors about COVID-19 have caused severe panic and anxiety. Misinformation has even undermined epidemic prevention to some extent and exacerbated the epidemic. Social networks have allowed COVID-19 rumors to spread unchecked. Removing rumors could protect people&#x2019;s health by reducing people&#x2019;s anxiety and wrong behavior caused by the misinformation. Therefore, it is necessary to research COVID-19 rumor detection on social networks. Due to the development of deep learning, existing studies have proposed rumor detection methods from different perspectives. However, not all of these approaches could address COVID-19 rumor detection. COVID-19 rumors are more severe and profoundly influenced, and there are stricter time constraints on COVID-19 rumor detection. Therefore, this study proposed and verified the rumor detection method based on the content and user responses in limited time CR-LSTM-BE. The experimental results show that the performance of our approach is significantly improved compared with the existing baseline methods. User response information can effectively enhance COVID-19 rumor detection.</p>
</abstract>
<kwd-group>
<kwd>rumor detection</kwd>
<kwd>COVID-19</kwd>
<kwd>social networks</kwd>
<kwd>social physics</kwd>
<kwd>user responses</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>Introduction</title>
<p>Nowadays, the social network has become an indispensable tool in people&#x2019;s daily life. People carry out activities such as social communication, obtaining information, and expressing opinions on social network platforms. In the above activities, securing information and expressing opinions are particularly frequent on social networks. However, most of the content on social networks is user-generated content (UGC), and the veracity of UGC is challenging to be guaranteed. The net structure of a social network is convenient for the viral dissemination of information, which makes it easy to generate rumors in a social network, and rumors are easier to spread on a large scale. Rumors in social networks are particularly rampant when public incidents occur. During the COVID-19 epidemic outbreak in 2020, a large number of rumors spread widely on social platforms such as Twitter and Weibo, which aggravated people&#x2019;s fear and anxiety about the epidemic, and made people experience an &#x201c;information epidemic&#x201d; in the virtual space [<xref ref-type="bibr" rid="B1">1</xref>]. Rumor governance on social networks is essential and necessary&#x20;work.</p>
<p>For social network users, removing rumors on social networks could effectively reduce people&#x2019;s anxiety and stress during COVID-19 and help people reduce wrong behavior (such as refusing vaccines) caused by misinformation, thus protecting their health. For social network platforms, removing rumors could reduce the spread of false information and improve the platforms&#x2019; environment and user experience. For public health departments, removing rumors could reduce the cost of responding to the epidemic by allowing truthful and correct policies and guidelines to be disseminated effectively. The effective detection of rumors is the key to rumor governance. If false rumors or fake news on social networks can be detected sooner, relevant measures (e.g., rumor refutation and timely disclosure of information) will be taken more timely.</p>
<p>For the detection of rumors, existing studies proposed methods from various perspectives. Most methods for rumor detection are based on rumor content information, rumor source, and propagation path. Rumor detection methods based on content information focuses on language style, emotional polarity, text and picture content features [<xref ref-type="bibr" rid="B1">1</xref>]. Rumor detection methods based on rumor source focuses on web address (e.g., the source URLs of rumors), website credit, and webpage metadata [<xref ref-type="bibr" rid="B2">2</xref>]. Rumor detection methods based on propagation focus on the propagation structural features during rumor propagation, such as the retweeting and commenting behavior by social platform users [<xref ref-type="bibr" rid="B3">3</xref>]. With the development of artificial intelligence, deep learning methods make a significant contribution to various tasks. Some studies had adopted artificial intelligence based methods in rumor detection and achieved decent performance [<xref ref-type="bibr" rid="B4">4</xref>]. With the advent of language models based on transfer learning like BERT [<xref ref-type="bibr" rid="B5">5</xref>] and GPT3 [<xref ref-type="bibr" rid="B6">6</xref>], the analysis ability of deep learning models for natural language is further improved, which indicates us to utilize the language models based on transfer learning on rumor detection.</p>
<p>Time constraints are an essential factor that needs to be taken into consideration. The timelier we detect the fake news on a social network, the less harm it will cause. Public health emergencies like COVID-19 epidemic-related information are radically concerned and could profoundly affect psychology and behavior. There is a stricter time constraint on COVID-19 rumor detection. With the time constraints, methods based on propagation path are not applicative. It takes time to form the propagation path of a rumor. This indicates that we pay more attention to the content of rumors and user comments, and retweets. Because the users of a social network can comment and retweet on a rumor, known as user responses, the user responses usually contain information on the rumor&#x2019;s veracity. However, most of the existing studies did not take the content of user responses. The responses from users can be considered as discussions or arguments around the rumor. By extracting user response features, we may be able to implement rumor detection better. Facing rumor detection on COVID-19 on social networks, this study proposes a novel deep learning method based on rumor content and user responses. Our method has the following contributions:<list list-type="simple">
<list-item>
<p>1. Our method incorporates user response sequence into the rumor detection system. On the one hand, the information contained in user responses is fully utilized; on the other hand, the sequence of user responses also contains a part of the features of the rumor propagation&#x20;path.</p>
</list-item>
<list-item>
<p>2. Time limit is added in our study. Only user responses within 24&#xa0;h of rumor release are used as model input for detection.</p>
</list-item>
<list-item>
<p>3. Our method is based on the language model with transfer learning to obtain content features. Moreover, to capture richer information about COVID-19 in the social context, we use post-training mechanism to post train BERT on the corpus of COVID-19 related posts on Twitter and Weibo.</p>
</list-item>
</list>
</p>
<p>The structure of this paper is as follows: <italic>Related Work</italic> introduces the research progress on this topic, especially the progress in methods development. <italic>Methods</italic> introduces the&#x20;problem statement of COVID-19 rumor detection and the methods proposed in this study. <italic>Experiments</italic> introduces the&#x20;experimental dataset, baselines, evaluation methods, experiment settings, and experimental results. In <italic>Discussion</italic>, the experimental results are deeply analyzed and discussed. <italic>Conclusion</italic> summarizes the research findings of our work and points out some future directions.</p>
</sec>
<sec id="s2">
<title>Related Work</title>
<p>With the development of intelligent devices and mobile internet, human beings are experiencing an era of information explosion. At present, countless information is flooded in our lives. However, not all of this information is true, and even in the outbreak of a major public health crisis such as the COVID-19 epidemic, much of the information we have obtained is false rumors. Generally speaking, a rumor refers to a statement whose value can be true, false, or uncertain. Rumor is also called fake news [<xref ref-type="bibr" rid="B7">7</xref>]. Rumor detection means to determine whether a statement or a Twitter post is a rumor or non-rumor. The task of determining whether a statement or a Twitter post is a rumor or non-rumor is also called rumor verification [<xref ref-type="bibr" rid="B8">8</xref>]. According to recent studies, rumor detection refers to the veracity value of a rumor. Therefore, rumor detection is equivalent to rumor verification&#x20;[<xref ref-type="bibr" rid="B9">9</xref>].</p>
<p>Since information is easier to spread on social networks, rumor detection on social networks is more complex than general fake news detection. For detecting fake news, text features, source URL, and source website credit can be considered [<xref ref-type="bibr" rid="B2">2</xref>]. The source of information is more complex on the social network, and information spreading is much faster and wider. Rumor detection on social media is critical. Existing studies show that rumor detection on social networks is often based on text content features, user features, rumor propagation path features. Among them, the text content features and rumor propagation path features are significant for rumor detection.</p>
<p>For rumor detection methods based on text content features, writing style and topic features are an essential basis for determining whether rumors are true or not [<xref ref-type="bibr" rid="B10">10</xref>]. In addition to the text content, postag, sentiment, and specific hashtags such as &#x201c;&#x23;COVID19&#x201d; and &#x201c;&#x23;Vaccine&#x201d; are also important content features [<xref ref-type="bibr" rid="B11">11</xref>]. Chua et&#x20;al. summarized six features, including comprehensiveness, sentence, time orientation, quantitative details, writing style, and topic [<xref ref-type="bibr" rid="B12">12</xref>]. With the development of deep learning and artificial intelligence, deep learning models such as CNN have been used to extract the text features of rumors and combined with word embedding generation algorithms such as Word2vec, GloVe. Deep learning models can automatically extract the features related to rumors detection through representation learning and have achieved decent performance in the rumor detection task. Using CNN to extract the features of rumor content has a good effect on limited data and early detection of rumors [<xref ref-type="bibr" rid="B13">13</xref>]. CNN is also applied to feature extraction of text content in multimodal fake news detection&#x20;[<xref ref-type="bibr" rid="B4">4</xref>].</p>
<p>Rumor propagation path is another common and essential feature of rumor detection. Real stories or news often have a single prominent spike, while rumors often have multiple prominent spikes in the process of spreading. Rumors spread farther, faster, and more widely on social networks than real stories or news [<xref ref-type="bibr" rid="B14">14</xref>]. Focusing on the rumor recognition path, Kochkina et&#x20;al. proposed the branch-LSTM algorithm, which uses LSTM to transform propagation path into a sequence, combines text features and propagation path features and conducts rumor verification through a multi-task mechanism [<xref ref-type="bibr" rid="B8">8</xref>]. Liu et&#x20;al. regarded the rumor propagation path as a sequence and utilized RNN to extract propagation path information [<xref ref-type="bibr" rid="B15">15</xref>]. Kwon et&#x20;al. combined text features, user network features, and temporal propagation paths to determine rumors [<xref ref-type="bibr" rid="B16">16</xref>]. Bian et&#x20;al. transformed rumor detection into a graph classification problem and constructed the Bi-GCN from Top-Down and Bottom-Up two directions to extract the propagation features on social networks&#x20;[<xref ref-type="bibr" rid="B3">3</xref>].</p>
<p>Because rumor detection needs a high-quality dataset as support, few studies are focusing on COVID-19 rumor detection. Glazkova et&#x20;al. proposed the CT-BERT model, paying attention to the content features, and fine-tuned the BERT model based on other news and Twitter posts related to COVID-19 [<xref ref-type="bibr" rid="B17">17</xref>]. For the datasets, Yang et&#x20;al. [<xref ref-type="bibr" rid="B18">18</xref>] and Patwa et&#x20;al. [<xref ref-type="bibr" rid="B19">19</xref>] provided rumor datasets on COVID-19, which are mainly based on social network platforms such as Twitter, Facebook, and Weibo, and news websites such as PolitiFact.</p>
<p>Compared to routine rumor detection, COVID-19 rumor detection has a strict time constraint, especially during the outbreak stage of the epidemic. Once the rumor detection is not timely enough, the negative impact brought by rumor propagation is enormous. The damage caused by COVID-19 rumors can increase rapidly over time and have an even more significant and broader impact than other rumors. Therefore, early rumor detection on COVID-19 needs to be considered, and early detection and action should be taken. Most of the existing studies focus on the features of rumor content and propagation path but pay insufficient attention to user responses and rumor detection within a limited time. User responses to a rumor often include stance and sentiment toward the rumor. Particularly for false rumors, user responses are often more controversial&#x20;[<xref ref-type="bibr" rid="B20">20</xref>].</p>
<p>In the existing studies, some suggested that user response can better assist systems in detecting rumors [<xref ref-type="bibr" rid="B9">9</xref>, <xref ref-type="bibr" rid="B20">20</xref>]. However, more studies use user response to determine user stance and regard user stance classification as a separate task. User stance refers to users&#x2019; attitudes toward rumors. Similar to sentiment polarity classification, user stance is generally a value of [&#x2212;1,1], where one indicates full support for the rumor to be true, 0 indicates neutrality, and &#x2212;1 indicates no support for the rumor to be true at all [<xref ref-type="bibr" rid="B21">21</xref>]. There are studies on implementing rumor verification and user stance simultaneously through a multi-task mechanism [<xref ref-type="bibr" rid="B8">8</xref>]. However, there are very few studies that directly use user responses to enhance rumor detection. Given the shortcomings of existing studies, this study proposes a rumor detection method based on rumor content and user response sequence in a limited time and uses the language model based on transfer learning to extract the features of rumor&#x20;text.</p>
</sec>
<sec sec-type="methods" id="s3">
<title>Methods</title>
<p>This section introduced the method based on rumor content and the user response sequence proposed in our study. <italic>Problem Statement</italic> presents the problem statement of rumor detection. <italic>Rumor Content Feature Extractor</italic> introduces the feature extracting method for the COVID-19 rumor content. User <italic>Response Feature Extractor</italic> introduces the feature extracting method for the user response of the COVID-19 rumor content.</p>
<sec id="s3-1">
<title>Problem Statement</title>
<p>The problem of rumor detection on COVID19 on social networks can be defined as: for a rumor detection dataset<inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>R</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the i-th rumor event, and <italic>n</italic> is the number of rumors in the rumor dataset. <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula id="inf4">
<mml:math id="m4">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the source post of rumor event <inline-formula id="inf5">
<mml:math id="m5">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf6">
<mml:math id="m6">
<mml:mrow>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the response to the post<inline-formula id="inf7">
<mml:math id="m7">
<mml:mrow>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> from other users within a certain period of time. Specifically, user responses <inline-formula id="inf8">
<mml:math id="m8">
<mml:mrow>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> to the post <inline-formula id="inf9">
<mml:math id="m9">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> can be defined as a sequence. For each rumor events <inline-formula id="inf10">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is associated with a ground-truth label <inline-formula id="inf11">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mtext>F</mml:mtext>
<mml:mo>,</mml:mo>
<mml:mtext>T</mml:mtext>
<mml:mo>,</mml:mo>
<mml:mtext>U</mml:mtext>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> corresponding to False Rumor, True Rumor and Unverified Rumor. Given a rumor dataset on COVID-19, the goal of rumor detection is to construct a classification system <inline-formula id="inf12">
<mml:math id="m12">
<mml:mi>f</mml:mi>
</mml:math>
</inline-formula>, that for any <inline-formula id="inf13">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, its label <inline-formula id="inf14">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> can be determined. In many studies, this definition is the same as rumor veracity classification task [<xref ref-type="bibr" rid="B9">9</xref>,&#x20;<xref ref-type="bibr" rid="B22">22</xref>].</p>
</sec>
<sec id="s3-2">
<title>Rumor Content Feature Extractor</title>
<p>In this study, we implemented a deep learning model based on content features and user responses for COVID-19 rumor detection in limited time. Therefore, content features are an important basis for rumor detection. We need to extract the features for the rumor content and map the rumor content to embedding in a vector space. In the common representation learning process, for a rumor text <inline-formula id="inf15">
<mml:math id="m15">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, pre-training models such as Word2vec or GloVe are generally transform the words {<inline-formula id="inf16">
<mml:math id="m16">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>} composed of rumor text <inline-formula id="inf17">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> into word embedding, and then deep learning models such as RNN and CNN are used to extract features related to rumor detection and form rumor content feature <inline-formula id="inf18">
<mml:math id="m18">
<mml:mi>C</mml:mi>
</mml:math>
</inline-formula>. For example, the last step <inline-formula id="inf19">
<mml:math id="m19">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of RNN or the vector <inline-formula id="inf20">
<mml:math id="m20">
<mml:mi>C</mml:mi>
</mml:math>
</inline-formula> from CNN pooling layer is normally used to represent the content feature of the whole rumor text&#x20;<inline-formula id="inf21">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>Along with the development of natural language processing technology, language models based on transfer learning, such as ELMo [<xref ref-type="bibr" rid="B23">23</xref>], BERT [<xref ref-type="bibr" rid="B5">5</xref>], and XLNet [<xref ref-type="bibr" rid="B24">24</xref>], have achieved excellent performance in text feature extraction. Benefit from the transfer learning mechanism, language models like BERT significantly improved backend tasks, including text classification, machine translation, named entity recognition, reading comprehension, and automatic question answering tasks. Since language models based on transfer training have better performance in natural language processing tasks, this study will use such models to extract the features of rumor content. Specifically, this study uses the post-trained BERT model to extract features from COVID-19 rumor post&#x20;texts.</p>
<p>BERT is short for Bidirectional Encoder Representations from Transformers proposed by Jacob et&#x20;al. (2018). Through the mechanism of the transformer network and the transfer learning mechanism, BERT contains vibrant text lexicon information and semantic information. BERT model has been trained on more than 110M corpus and can be directly loaded and used. It is pre-trained by MLM (Masked Language Model) and NSP (Next Sentence Prediction) task. The basic architecture of BERT is shown in <xref ref-type="fig" rid="F1">Figure&#x20;1</xref>. Rumor text first goes through the BERT tokenizer and creates token embedding, segment embedding, and position embedding in the BERT model. Then the embedding of the text enters the encoder of BERT. The encoder is composed of multi-head attention layers and a feed-forward neural network. After six layers of encoding, the encoded text is embedded into the decoder, composed of a multi-head attention layer and feed-forward neural network. After six layers of decoding, the feature of rumor content is extracted. The multi-head attention mechanism is the critical process to extract text features. It can be formulated as:<disp-formula id="equ1">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>Q</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>K</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>V</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>V</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ2">
<mml:math id="m23">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msubsup>
<mml:mi>K</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>T</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>K</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ3">
<mml:math id="m24">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>H</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>K</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>H</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>H</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>H</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>where <inline-formula id="inf22">
<mml:math id="m25">
<mml:mi>Q</mml:mi>
</mml:math>
</inline-formula> represents the input of the decoder in a step, the <inline-formula id="inf23">
<mml:math id="m26">
<mml:mi>K</mml:mi>
</mml:math>
</inline-formula> and&#x20;<inline-formula id="inf24">
<mml:math id="m27">
<mml:mi>V</mml:mi>
</mml:math>
</inline-formula> represent the rumor text embedding. <inline-formula id="inf25">
<mml:math id="m28">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf26">
<mml:math id="m29">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf27">
<mml:math id="m30">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>V</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the weight parameters of <inline-formula id="inf28">
<mml:math id="m31">
<mml:mi>Q</mml:mi>
</mml:math>
</inline-formula>, <inline-formula id="inf29">
<mml:math id="m32">
<mml:mi>K</mml:mi>
</mml:math>
</inline-formula>, and <inline-formula id="inf30">
<mml:math id="m33">
<mml:mi>V</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf31">
<mml:math id="m34">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>K</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the number of dimensions in K to scale the dot product of <inline-formula id="inf32">
<mml:math id="m35">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf33">
<mml:math id="m36">
<mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. <inline-formula id="inf34">
<mml:math id="m37">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the output of the&#x20;<italic>i</italic>-th attention head layer. <inline-formula id="inf35">
<mml:math id="m38">
<mml:mrow>
<mml:msup>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is&#x20;the&#x20;weight parameters for concatenated outputs. <inline-formula id="inf36">
<mml:math id="m39">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>H</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>K</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the final output of the multi-head attention&#x20;layer.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>The architecture of BERT.<xref ref-type="fn" rid="fn1">
<sup>1</sup>
</xref>
</p>
</caption>
<graphic xlink:href="fphy-09-763081-g001.tif"/>
</fig>
<p>Existing studies have shown that post-train on BERT by domain-specific corpus can significantly improve the performance on the natural language processing task in specific domains [<xref ref-type="bibr" rid="B25">25</xref>]. In combination with the COVID nine rumor detection task, post-training on BERT was carried out through a COVID 19 Twitter dataset [<xref ref-type="bibr" rid="B26">26</xref>] and a COVID19 Weibo dataset [<xref ref-type="bibr" rid="B27">27</xref>], respectively. Specifically, we use the MLM task to post-train BERT so that our BERT model contains more semantic and contextual information on COVID 19-related posts from social networks. This study uses BERT and Chinese BERT in the PyTorch version released by Huggingface<xref ref-type="fn" rid="fn2">
<sup>2</sup>
</xref> as our primary model. After the pre-training of 20 epochs on the COVID-19 dataset, we post-trained the original BERT and original Chinese BERT to the COVID-19 Social Network BERT (CSN-BERT)&#x20;model.</p>
</sec>
<sec id="s3-3">
<title>User Response Feature Extractor</title>
<p>Users on social networks would reply or forward a Twitter, whether it is a true rumor or a false rumor. These responses and retweets contain users&#x2019; views. Some of these views are to the rumor, and others are to other users&#x2019; responses or retweets. The user responses and retweets can be considered as discussions or arguments around the rumor. An example of a Twitter post&#x2019;s user responses is shown below. Typically, the responses and retweets can be seen as a tree structure. Rumors and their responses and retweets are called conversational threads. Many studies focused on the tree structure consisting of user responses and retweets and determine rumor veracity based on its structure known as propagation path. However, they do not pay much attention to the content of user responses. Because COVID-19 rumors are more likely to cause panic, there are stricter time constraints for discovering these rumors. In limited time, the structure of responses and retweets, the propagation path, may not be comprehensive enough to determine the veracity of rumors. This indicates that we need to dig into the user responses for essential features on rumor detection.<boxed-text id="dBox1">
<p>An Example of a Rumor Post and Its User Responses:</p>
<p>
<bold>Twitter Post:</bold>
</p>
<p>&#x201c;CDC is preparing for the &#x2018;likely&#x2019; spread of coronavirus in the US, officials say <ext-link ext-link-type="uri" xlink:href="https://t.co/cm9pRyVTcU">https://t.co/cm9pRyVTcU</ext-link> Do we have anyone left in the CDC who knows what the fuck they are doing,&#x201d; Mon Feb 24,&#x20;2020.</p>
<p>
<bold>User Responses:</bold>
<list list-type="simple">
<list-item>
<p>&#x2013; &#x201c;Georgia Doctor Appointed Head Of The CDC: Health News Dr. Brenda Fitzgerald, who leads the Georgia Department of Public Health, has been appointed CDC director. She&#x2019;ll take over as the Trump administration seeks big cuts to the CDC&#x2019;s budget.&#x201d; Mon Feb 24&#x20;10:40:44 &#x2b; 0000&#x20;2020, 0, 1, 1, 49:33.4.</p>
</list-item>
<list-item>
<p>&#x2013; &#x201c;@NikitaKitty @PerfumeFlogger We used to. This a travesty.&#x201d;, Mon Feb 24&#x20;10:47:35 &#x2b; 0000&#x20;2020, 1, 0, 0, 49:33.4.</p>
</list-item>
<list-item>
<p>&#x2013;&#x201c;As we&#x2019;ve reported, that would include a $186 million cut to programs at the CDC&#x2019;s center on HIV/AIDS, hepatitis and other sexually transmitted diseases.&#x201d;, Mon Feb 24&#x20;10:43:18 &#x2b; 0000&#x20;2020, 1, 2, 2, 49:33.4.</p>
</list-item>
<list-item>
<p>&#x2013; &#x201c;The CDC&#x2019;s chronic disease prevention programs, such as those for diabetes, heart disease, stroke and obesity, would be cut by $222 million. What will she do stave the fucking virus?", Mon Feb 24&#x20;10:43:18 &#x2b; 0000&#x20;2020, 1, 4, 4, 49:33.4.</p>
</list-item>
</list>
</p>
</boxed-text>
</p>
<p>In this study, we focus on the opinions expressed from user responses. We think of user responses as a sequence, <inline-formula id="inf37">
<mml:math id="m40">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>{</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>}. The sequence is arranged by response time. To be sure, the original rumor post is not recorded in the sequence. This responses sequence is constructed with time limits. We start with the time of the first responses or retweets and only record responses within 24&#xa0;h. For the response sequence <inline-formula id="inf38">
<mml:math id="m41">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, we need to extract features from the user response sequence <inline-formula id="inf39">
<mml:math id="m42">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> for rumor detection. In order to extract features from the user response sequence, we proposed COVID-19 Response-LSTM (CR-LSTM) to learn about the user response sequences. We implemented the post-trained BERT model (CSN-BERT) mentioned in <italic>Rumor Content Feature Extractor</italic> and a textCNN extractor to learn the sentence embedding of each user response. To be specific, BERT&#x2019;s [CLS] vector is used to represent the feature of user responses. The structure of the entire model is shown in <xref ref-type="fig" rid="F2">Figure&#x20;2</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>The architecture of CR-LSTM</p>
</caption>
<graphic xlink:href="fphy-09-763081-g002.tif"/>
</fig>
<p>For a user response, its sentence embedding firstly generated through the CSN-BERT. Then, the sentence embedding enters a bidirectional LSTM layer in the order of release time. Each hidden layer in the LSTM layer corresponds to a response, denoted as <inline-formula id="inf40">
<mml:math id="m43">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>. After encoding by two LSTM layers, the vector is weighted by an attention layer. We use the multi-head self-attention mechanism to find the responses that have more influence on the results. This process can be represented as:<disp-formula id="equ4">
<mml:math id="m44">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>T</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ5">
<mml:math id="m45">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>T</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ6">
<mml:math id="m46">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:msubsup>
<mml:mi>t</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover>
<mml:mi>h</mml:mi>
<mml:mo>&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>K</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>where <inline-formula id="inf41">
<mml:math id="m47">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>T</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mo stretchy="true">&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> indicates the encoding operation in the forward direction, and <inline-formula id="inf42">
<mml:math id="m48">
<mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>T</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="true">&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> in the backward direction. <inline-formula id="inf43">
<mml:math id="m49">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> represents the forward hidden state of the <italic>t</italic>-th embedding in <inline-formula id="inf44">
<mml:math id="m50">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, also corresponding to word <inline-formula id="inf45">
<mml:math id="m51">
<mml:mrow>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> in <inline-formula id="inf46">
<mml:math id="m52">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, which is calculated by its previous hidden state <inline-formula id="inf47">
<mml:math id="m53">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and current post sentence embedding <inline-formula id="inf48">
<mml:math id="m54">
<mml:mrow>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>. <inline-formula id="inf49">
<mml:math id="m55">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover>
<mml:mi>h</mml:mi>
<mml:mo>&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> represents the backward hidden state of the <italic>t</italic>-th embedding in <inline-formula id="inf50">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. The hidden state of the <italic>t</italic>-th embedding is obtained by concatenating <inline-formula id="inf51">
<mml:math id="m57">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf52">
<mml:math id="m58">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover>
<mml:mi>h</mml:mi>
<mml:mo>&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, denoted by <inline-formula id="inf53">
<mml:math id="m59">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>[</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover>
<mml:mi>h</mml:mi>
<mml:mo>&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>]. <inline-formula id="inf54">
<mml:math id="m60">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the final embedding of the CR-LSTM. <inline-formula id="inf55">
<mml:math id="m61">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:msubsup>
<mml:mi>t</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>h</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover>
<mml:mi>h</mml:mi>
<mml:mo>&#x2190;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>K</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> indicates the multi-head self-attention.</p>
</sec>
<sec id="s3-4">
<title>The Full View</title>
<p>Combining the rumor content feature extractor and the user response feature extractor, we can extract the integrated rumor feature. For a rumor <inline-formula id="inf56">
<mml:math id="m62">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> in a rumor dataset <inline-formula id="inf57">
<mml:math id="m63">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, the rumor content feature extractor (CSN-BERT) can extract the rumor content feature <inline-formula id="inf58">
<mml:math id="m64">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> from <inline-formula id="inf59">
<mml:math id="m65">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. The user response feature extractor (CR-LSTM) can extract the user response feature <inline-formula id="inf60">
<mml:math id="m66">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> from <inline-formula id="inf61">
<mml:math id="m67">
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>We concatenate the user response feature <inline-formula id="inf62">
<mml:math id="m68">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> extracted by CR-LSTM with the rumor content feature <inline-formula id="inf63">
<mml:math id="m69">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> extracted by CSN-BERT into the integrated rumor feature. The rumor detection feature then goes through a fully-connected layer dimension, activated by Relu function, and at last output the probability distribution of rumor detection by a Softmax function. The total model is called CR-LSTM-BE (COVID-19 Response LSTM with BERT Embedding). The full view of our model is shown in <xref ref-type="fig" rid="F3">Figure&#x20;3</xref>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>The full view of CR-LSTM-BE.</p>
</caption>
<graphic xlink:href="fphy-09-763081-g003.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<title>Experiments</title>
<p>In this section, we introduced the experimental preparation and the experimental results. <italic>Dataset</italic> introduces the two datasets for the COVID-19 rumor detection task used in our experiments. <italic>Evaluation Metrics</italic> introduces the evaluation metrics with the computing methods. <italic>Experiment Settings</italic> introduces the experiment settings, especially the hyperparameters selected in the experiments. <italic>Results</italic> presents the experimental results and compares and analyzes the results with baseline methods.</p>
<sec id="s4-1">
<title>Dataset</title>
<p>To confirm the performance of the CR-LSTM-BE model proposed by us on the COVID-19 rumor detection task. Since there are not many datasets for COVID-19 rumors and considering the data requirements, this study conducted experiments on two datasets. The datasets selected to conduct experiments are the COVID-19 rumor dataset and the CHECKED dataset. The experimental results and related indicators tested the performance of the CR-LSTM-BE&#x20;model.</p>
<p>The COVID-19 rumor dataset is provided by Cheng et&#x20;al. [<xref ref-type="bibr" rid="B28">28</xref>] and consists of rumors from two types of sources. One is news from various news sites, and the other is from Twitter. There are 4,129 news and 2,705 Twitter posts in this dataset. This study focuses on COVID-19 rumor detection on the social network, so only the Twitter post part of the dataset is selected as the experimental data. The Twitter part of the dataset contains rumor Twitter post id (Hashed), Twitter post content, rumor label (True, False or Unverified), number of likes, number of retweets, number of comments, user responses over a while, user response time and stance of user response. This study mainly used the Twitter post content in the dataset and the user responses of each Twitter post within 24&#xa0;h to conduct experiments.</p>
<p>The CHECKED data set was provided by Yang et&#x20;al. [<xref ref-type="bibr" rid="B18">18</xref>], and the data came from the Chinese Weibo social network. This dataset contained 2,104 tweets. The dataset contains the rumor microblog&#x2019;s post id (hashed), microblog&#x2019;s post id content, rumor label (True or False), user id (hashed), the time the microblog was posted, number of likes, number of retweets, number of comments, user responses over some time, user retweet over some time, user response time, and user retweet time. This study mainly used the contents of the rumor microblog and the responses and retweets of each microblog within 24&#xa0;h to conduct experiments. Statistics of the relevant data are shown in <xref ref-type="table" rid="T1">Table&#x20;1</xref>. We randomly split the two datasets into the training set, validation set, and testing set with the proportion of 70, 10, and 10%, respectively.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Statistics of the datasets.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left"/>
<th align="center">COVID-19-rumor dataset</th>
<th align="center">CHECKED dataset</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Sentence per tweets</td>
<td align="char" char=".">1.39</td>
<td align="char" char=".">4.76</td>
</tr>
<tr>
<td align="left">Words per sentence</td>
<td align="char" char=".">11.4</td>
<td align="char" char=".">25.96</td>
</tr>
<tr>
<td align="left">Words per tweets</td>
<td align="char" char=".">15.87</td>
<td align="char" char=".">123.67</td>
</tr>
<tr>
<td align="left">Total words</td>
<td align="char" char=".">42,939</td>
<td align="char" char=".">260,197</td>
</tr>
<tr>
<td align="left">Total tweets</td>
<td align="char" char=".">2,705</td>
<td align="char" char=".">2,104</td>
</tr>
<tr>
<td align="left">Total responses</td>
<td align="char" char=".">34,963</td>
<td align="char" char=".">2997063</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Due to the uncontrollable quality of user response data, we performed resample on the data while preprocessing the user response data. Specifically, we removed user responses that are very concise (less than three words), contain more emoji (over 80%), and have only one hyperlink without other information.</p>
</sec>
<sec id="s4-2">
<title>Evaluation Metrics</title>
<p>The evaluation metric followed most of the existing studies, which regards rumor detection as a classification task. We used the Macro F1, precision score, recall score, and accuracy to evaluate the performance of our model. Macro F1 is used because the labels of rumor posts are imbalanced, which means the distribution is skewed. Marco F1 allows us to evaluate the classifier from a more comprehensive perspective. The precision and recall score in our evaluation is also macro. The definitions of precision, recall, Marco F1, and accuracy are shown below:<disp-formula id="equ7">
<mml:math id="m70">
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mfrac>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ8">
<mml:math id="m71">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mfrac>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ9">
<mml:math id="m72">
<mml:mrow>
<mml:mtext>F</mml:mtext>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mfrac>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mtext>&#x2217;</mml:mtext>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mtext>&#x2217;</mml:mtext>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ10">
<mml:math id="m73">
<mml:mrow>
<mml:mtext>Marco&#xa0;F</mml:mtext>
<mml:mn>1</mml:mn>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:mtext>F</mml:mtext>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>/</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="equ11">
<mml:math id="m74">
<mml:mrow>
<mml:mtext>Accuracy</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mfrac>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>where c is the label of a rumor, which could be True, False, or Unverified. <inline-formula id="inf64">
<mml:math id="m75">
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> stands for the true positives of rumor label c, which means that the actual label of this rumor is c, and the predicted label is also c. <inline-formula id="inf65">
<mml:math id="m76">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> stands for the false positives, which means that the actual label of this rumor is not c, but the predicted one is c. <inline-formula id="inf66">
<mml:math id="m77">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> stands for false negatives, which means that the actual label c, but the predicted label is not c. Macro F1 was used to integrate all&#x20;<inline-formula id="inf67">
<mml:math id="m78">
<mml:mrow>
<mml:mtext>F</mml:mtext>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s4-3">
<title>Experiment Settings</title>
<p>In our experiments, we fine-tuned the CSN-BERT on rumor veracity classification task. To prevent overfitting, we disabled backpropagation of CSN-BERT while training the CR-LSTM-BE model. We implemented our model by Pytorch, and the bias was initialized to 0. We used the dropout mechanism to prevent the model from quickly overfitting, the dropout rate was set to 0.5. Random Search method [<xref ref-type="bibr" rid="B29">29</xref>] was used to find the optimum hyperparameters. For post training the BERT model and fine-tuning the CSN-BERT, AdamW optimizer [<xref ref-type="bibr" rid="B30">30</xref>] was applied with an initial learning rate 1e-5 for model updating, and a mini-size batch of 16 was set. Early stopping is used, and the patience was set to five epochs. In the CR-LSTM-BE model, the optimum number of RNN layers is one and the optimum hidden size is 512. the one optimum number of attention head is 8, and the optimum attention size is 512. We used the Word2vec [<xref ref-type="bibr" rid="B31">31</xref>] embedding to initialize word embedding vectors in the textCNN part of the CR-LSTM-BE model, the word embedding vectors were pretrained on English corpus provided by Google. The dimension of word embedding vector was set to 300. For training the CR-LSTM-BE model, Adam optimizer [<xref ref-type="bibr" rid="B32">32</xref>] was applied with an initial learning rate 1e-3 for model updating, and a mini-size batch of 16 was set. Early stopping is used, and the patience was set to 15 epochs. All the experiments were done on a GeForce TITAN&#x20;X.</p>
</sec>
</sec>
<sec sec-type="results" id="s5">
<title>Results</title>
<p>The datasets adopted in this study do not provide detailed rumor detection results based on different methods. The COVID-19 rumor dataset provides rumor detection results for all data, including news and Twitter data. However, only the Twitter dataset was used in this study. The CHECKED dataset includes benchmark results of FastText, TextCNN, TextRNN, Att-TextRNN, and Transformer methods, but the test only gives Macro F1 score, which lacks more specific indicators such as accuracy and F1 scores on different labels. In order to compare and analyze the performance of our model. We set up several baseline methods based on rumor content features. Referring to related studies and the CHECKED dataset, baseline methods in this study include SVM classifier with word bags, textCNN with word2vec embedding, TextRNN with word2vec embedding, AttnRNN with word2vec embedding, Transformer with word2vec embedding, and BERT-base. We used the Word2Vec embedding pretrained on the English corpus published by Google and the Word2Vec embedding pretrained on the Chinese corpus published by Sogou.</p>
<p>We repeatedly conducted experiments with each method ten times in our study. With the results of the ten experiments, the median of Macro F1 in each group was selected as the experimental results for comparison. We conducted the t-test to confirm if the proposed model performed significantly differently from the baseline methods. The results of the t-test show a significant improvement (<italic>p-</italic>value&#x3c;0.05) between CSN-BERT and the baseline methods, CR-LSTM-BE and the baseline methods, and CR-LSTM-BE and CSN-BERT. The experimental results of this study in the COVID-19 rumor dataset are shown in <xref ref-type="table" rid="T2">Table&#x20;2</xref>. According to the experimental results, the best-performed method in the baselines is the BERT-base, of which the precision, recall, Marco F1, and accuracy score achieved 55.22, 55.53, 55.34, and 55.42, respectively. In our methods, the post-trained CSN-BERT model showed significant improvement on the data set. Its precision, recall, Marco F1, and accuracy score achieved 58.47, 58.64, 58.55, and 58.87, respectively. Compared to the best-performed baseline, the CSN-BERT showed a 5.8% improvement on Macro F1. The CR-LSTM-BE method based on rumor content feature and user responses proposed in this study has achieved the best performance in the COVID-19 rumor dataset. The precision, recall, Marco F1, and accuracy score of the CR-LSTM-BE achieved 63.15, 64.39, 63.64, and 63.42, respectively. Compared to the best-performed baseline, the CR-LSTM-BE improves 15.0% on Macro F1. Compared to the post-trained CSR-BERT method, this is an 8.7% improvement on Macro&#x20;F1.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Performance on the COVID-19 rumor twitter dataset.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Methods</th>
<th align="center">Precision</th>
<th align="center">Recall</th>
<th align="center">Macro F1</th>
<th align="center">Accuracy</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">WB-SVM</td>
<td align="char" char=".">43.20</td>
<td align="char" char=".">43.50</td>
<td align="char" char=".">43.33</td>
<td align="char" char=".">43.35</td>
</tr>
<tr>
<td align="left">textCNN</td>
<td align="char" char=".">52.87</td>
<td align="char" char=".">52.82</td>
<td align="char" char=".">52.80</td>
<td align="char" char=".">53.45</td>
</tr>
<tr>
<td align="left">textRNN</td>
<td align="char" char=".">51.18</td>
<td align="char" char=".">51.83</td>
<td align="char" char=".">51.45</td>
<td align="char" char=".">51.35</td>
</tr>
<tr>
<td align="left">attnRNN</td>
<td align="char" char=".">51.79</td>
<td align="char" char=".">53.04</td>
<td align="char" char=".">52.23</td>
<td align="char" char=".">51.97</td>
</tr>
<tr>
<td align="left">Transformer</td>
<td align="char" char=".">52.85</td>
<td align="char" char=".">52.63</td>
<td align="char" char=".">52.72</td>
<td align="char" char=".">52.22</td>
</tr>
<tr>
<td align="left">BERT-base</td>
<td align="char" char=".">55.22</td>
<td align="char" char=".">55.53</td>
<td align="char" char=".">55.34</td>
<td align="char" char=".">55.42</td>
</tr>
<tr>
<td align="left">CSN-BERT</td>
<td align="char" char=".">58.47</td>
<td align="char" char=".">58.64</td>
<td align="char" char=".">58.55</td>
<td align="char" char=".">58.87</td>
</tr>
<tr>
<td align="left">CR-LSTM-BE</td>
<td align="char" char=".">63.15</td>
<td align="char" char=".">64.39</td>
<td align="char" char=".">63.64</td>
<td align="char" char=".">63.42</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The experimental results of this study on the CHECKED dataset are shown in <xref ref-type="table" rid="T3">Table&#x20;3</xref>. According to the experimental results, the best-performed method in the baselines is the BERT-base, of which the precision, recall, Marco F1, and accuracy score achieved 95.74, 98.16, 96.89, and 98.10, respectively. In our methods, the precision, recall, Marco F1, and accuracy score of the post-trained CSN-BERT model achieved 97.13, 99.32,98.18, and 98.89, respectively. Compared to the best-performed baseline, the CSN-BERT slightly improved Macro F1 (1.3%). The CR-LSTM-BE method based on rumor content feature and user responses proposed in this study has achieved the best performance in the CHECKED dataset. The precision, Recall, Marco F1, and accuracy score of the CR-LSTM-BE all achieved 100. Compared to the best-performed baseline, the CR-LSTM-BE improves 3.2% on Macro F1. Compared to the post-trained CSN-BERT method, this is a 1.9% improvement on Macro&#x20;F1.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Performance on the CHECKED dataset.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Methods</th>
<th align="center">Precision</th>
<th align="center">Recall</th>
<th align="center">Macro F1</th>
<th align="center">Accuracy</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">WB-SVM</td>
<td align="char" char=".">62.35</td>
<td align="char" char=".">69.21</td>
<td align="char" char=".">62.33</td>
<td align="char" char=".">70.09</td>
</tr>
<tr>
<td align="left">textCNN</td>
<td align="char" char=".">81.99</td>
<td align="char" char=".">89.08</td>
<td align="char" char=".">84.76</td>
<td align="char" char=".">89.87</td>
</tr>
<tr>
<td align="left">textRNN</td>
<td align="char" char=".">71.57</td>
<td align="char" char=".">81.00</td>
<td align="char" char=".">73.77</td>
<td align="char" char=".">80.54</td>
</tr>
<tr>
<td align="left">attnRNN</td>
<td align="char" char=".">81.98</td>
<td align="char" char=".">91.44</td>
<td align="char" char=".">85.32</td>
<td align="char" char=".">89.87</td>
</tr>
<tr>
<td align="left">Transformer</td>
<td align="char" char=".">84.84</td>
<td align="char" char=".">92.36</td>
<td align="char" char=".">87.82</td>
<td align="char" char=".">91.93</td>
</tr>
<tr>
<td align="left">BERT-base</td>
<td align="char" char=".">95.74</td>
<td align="char" char=".">98.16</td>
<td align="char" char=".">96.89</td>
<td align="char" char=".">98.10</td>
</tr>
<tr>
<td align="left">CSN-BERT</td>
<td align="char" char=".">97.13</td>
<td align="char" char=".">99.32</td>
<td align="char" char=".">98.18</td>
<td align="char" char=".">98.89</td>
</tr>
<tr>
<td align="left">CR-LSTM-BE</td>
<td align="char" char=".">100.00</td>
<td align="char" char=".">100.00</td>
<td align="char" char=".">100.00</td>
<td align="char" char=".">100.00</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec sec-type="discussion" id="s6">
<title>Discussion</title>
<p>In this section, we discussed the performance and the characters of our proposed models. <italic>Improvement Analysis</italic> analyzes the improvements of CSN-BERT and CR-LSTM-BE compared with the baseline methods. Number of Responses Analysis analyzes the effect of the number of responses to rumor detection.</p>
<sec id="s6-1">
<title>Improvement Analysis</title>
<p>Among the methods experimented in this study, CSN-BERT has a particular improvement than the baseline methods according to the experimental results, which indicates CSN-BERT has a better performance in the feature representation of rumor content by post-training COVID-19 twitter dataset than the original BERT (BERT-base). Compared with general deep learning models (such as textCNN and LSTM), it is not surprising that the BERT model, which is based on transfer learning, performs better in the problem of rumor detection because the model is based on transfer training has more contextual semantic information&#x2014;continuing with the idea of allowing the model to acquire more contextual semantic information, CSN-BERT allowing the BERT model to learn more information on COVID-19 discussed by users in the social network in advance. Compared with the original BERT, BERT after post-training is more suitable for COVID-19 rumor detection.</p>
<p>The CR-LSTM-BE proposed in this study adds user responses information into the deep learning model and encodes user responses through the LSTM network with multi-head attention. Use responses contains much information to the original twitter post [<xref ref-type="bibr" rid="B33">33</xref>]. In our hypothesis, adding user responses into the model can provide richer information standing for user feedback for the learning process and enable the model to determine the veracity of rumors based on user feedback. The experimental results show that CR-LSTM-BE achieves the best results on both datasets. The experimental results confirmed our hypothesis. In <xref ref-type="fig" rid="F4">Figure&#x20;4</xref>, we compare the F1 scores of all methods on the various rumor labels (F: False, T: True, U: Unverified). The legend &#x201c;A&#x201d; in <xref ref-type="fig" rid="F4">Figure&#x20;4</xref> is the accuracy, and legend &#x201c;F1&#x201d; is the Macro F1. It can be seen that the F1 score on each rumor label of CR-LSTM-BE is better than other methods. In addition, this method can still get a more balanced classification result from unbalanced training&#x20;data.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>The performance of methods on different rumor labels (F: False, T: True, U: Unverified, A: Accuracy, F1: Macro F1).</p>
</caption>
<graphic xlink:href="fphy-09-763081-g004.tif"/>
</fig>
</sec>
<sec id="s6-2">
<title>Number of Responses Analysis</title>
<p>Interactions on social networks could help better represent user profiles. More user responses can be seen as connections on social network and will provide richer information to describing an event from a more abundant perspective [<xref ref-type="bibr" rid="B34">34</xref>&#x2013;<xref ref-type="bibr" rid="B39">39</xref>]. To further understand the effect of user responses on rumor detection, we compared the accuracy of a different group of Twitter and microblog posts with various responses within 24&#xa0;h. <xref ref-type="fig" rid="F5">Figure&#x20;5</xref> shows the rumor detection accuracy improvements of a different group of Twitter and microblog posts with various responses tested on CR-LSTM-BE and CSN-BERT. While the number of user responses is 0, CR-LSTM-BE will degenerate into CSN-BERT, and the accuracy will not be improved. As shown in <xref ref-type="fig" rid="F5">Figure&#x20;5</xref>, while the number of user responses is 1&#x2013;5, the accuracy of rumor detection increased by 5.34%. While the number of user responses is 6&#x2013;10, the accuracy of rumor detection increased by 6.19%. While the number of user responses is more than 11, the accuracy improvement of rumor detection is stabilized at about 10%. This indicates that we should consider including more than 11 user responses for COVID-19 rumor detection on Twitter. For Weibo, due to a large number of retweets and responses, we use another category scheme in the division of the number of user responses. As can be seen from <xref ref-type="fig" rid="F6">Figure&#x20;6</xref>, the curve of accuracy promotion is similar to that of Twitter (<xref ref-type="fig" rid="F5">Figure&#x20;5</xref>). While the number of user responses is more than 41, the improvement of rumor detection accuracy tends to be stable. This suggests that we should consider including more than 41 user responses for COVID-19 rumor detection on Weibo.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>The accuracy increasement of twitter post with various number of responses.</p>
</caption>
<graphic xlink:href="fphy-09-763081-g005.tif"/>
</fig>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>The accuracy increasement of microblog post with various number of responses.</p>
</caption>
<graphic xlink:href="fphy-09-763081-g006.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="conclusion" id="s7">
<title>Conclusion</title>
<p>In this study, we proposed rumor detection methods based on the features of rumor content and user responses because of the rapid propagation and prominent domain characteristics of COVID-19 rumor detection on social networks. In order to better capture and extract rumor content features, we combined the language model based on transfer learning with a post-training mechanism to construct CSN-BERT based on COVID-19 user posts on social networks. In order to make better use of the information in user responses, we further proposed CR-LSTM-BE, which incorporated the information of user responses into the learning process through LSTM. The experimental results show that the post-trained CSN-BERT model can better extract the content features of COVID-19 rumors on social networks than other deep learning models. The CR-LSTM-BE model that integrates user responses achieves the best performance on both datasets. In addition, we found that more user responses can help the CR-LSTM-BE model to achieve better results. On the Twitter network, more than 11 user responses can help to achieve the best performance. On the Weibo network, more than 41 user responses can help to achieve the best performance.</p>
<p>This study focuses on exploring the enhancement of user responses information on rumor detection. Limited by the experimental data, this study did not consider the structural features of user responses and retweets, known as propagation path. Future research will focus on the structural features of user&#x20;response and retweets and implementing deep learning methods to implement rumor detection better. One direction is to utilize the GCN or hierarchical attention model to incorporate and extract structural and user response features simultaneously.</p>
</sec>
</body>
<back>
<sec id="s8">
<title>Data Availability Statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found here: DATASET1: <ext-link ext-link-type="uri" xlink:href="https://github.com/MickeysClubhouse/COVID-19-rumor-dataset">https://github.com/MickeysClubhouse/COVID-19-rumor-dataset</ext-link> DATASET2: <ext-link ext-link-type="uri" xlink:href="https://github.com/cyang03/CHECKED">https://github.com/cyang03/CHECKED</ext-link>
</p>
</sec>
<sec id="s9">
<title>Author Contributions</title>
<p>JY and YP conceived and designed the study. JY and YP conducted the experiments. YP reviewed and edited the manuscript. All authors read and approved the final manuscript.</p>
</sec>
<sec sec-type="COI-statement" id="s10">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<fn-group>
<fn id="fn1">
<label>1</label>
<p>The figure is modified based on: Vaswani, Ashish, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, &#x141;ukasz Kaiser, and Illia Polosukhin &#x201c;Attention is all you need.&#x201d; In Advances in neural information processing systems, pp. 5998&#x2013;6008.&#x20;2017.</p>
</fn>
<fn id="fn2">
<label>2</label>
<p>
<ext-link ext-link-type="uri" xlink:href="https://github.com/huggingface/pytorch-transformers">https://github.com/huggingface/pytorch-transformers</ext-link>
</p>
</fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1">
<label>1.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cinelli</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Quattrociocchi</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Galeazzi</surname>
<given-names>A</given-names>
</name>
<name>
<surname>Valensise</surname>
<given-names>CM</given-names>
</name>
<name>
<surname>Brugnoli</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Schmidt</surname>
<given-names>AL</given-names>
</name>
<etal/>
</person-group> <article-title>The COVID-19 social media infodemic</article-title>. <source>Sci Rep</source> (<year>2020</year>) <volume>10</volume>(<issue>1</issue>):<fpage>16598</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1038/s41598-020-73510-5</pub-id> </citation>
</ref>
<ref id="B2">
<label>2.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mazzeo</surname>
<given-names>V</given-names>
</name>
<name>
<surname>Rapisarda</surname>
<given-names>A</given-names>
</name>
<name>
<surname>Giuffrida</surname>
<given-names>G</given-names>
</name>
</person-group>. <article-title>Detection of Fake News on COVID-19 on Web Search Engines</article-title>. <source>Front Phys</source> (<year>2021</year>) <volume>9</volume>:<fpage>685730</fpage>. <pub-id pub-id-type="doi">10.3389/fphy.2021.685730</pub-id> </citation>
</ref>
<ref id="B3">
<label>3.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bian</surname>
<given-names>T</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>T</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>P</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Rong</surname>
<given-names>Y</given-names>
</name>
<etal/>
</person-group> <article-title>Rumor detection on social media with bi-directional graph convolutional networks</article-title>. <source>Aaai</source> (<year>2020</year>) <volume>34</volume>(<issue>01</issue>):<fpage>549</fpage>&#x2013;<lpage>56</lpage>. <pub-id pub-id-type="doi">10.1609/aaai.v34i01.5393</pub-id> </citation>
</ref>
<ref id="B4">
<label>4.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Xun</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Jha</surname>
<given-names>K</given-names>
</name>
<etal/>
</person-group> <article-title>Eann: Event adversarial neural networks for multi-modal fake news detection</article-title>. In: <source>Proceedings of the 24th acm sigkdd international conference on knowledge discovery &#x26; data mining</source>. <publisher-loc>Stroudsburg</publisher-loc>: <publisher-name>ACL Press</publisher-name> (<year>2018</year>). p. <fpage>849</fpage>&#x2013;<lpage>57</lpage>. </citation>
</ref>
<ref id="B5">
<label>5.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Devlin</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Chang</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Kenton</surname>
<given-names>L</given-names>
</name>
<name>
<surname>Kristina</surname>
<given-names>T</given-names>
</name>
</person-group>, <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>. In: <source>Proceedings of NAACL-HTL</source>. <publisher-loc>Stroudsburg</publisher-loc>: <publisher-name>ACL Press</publisher-name> (<year>2019</year>). p. <fpage>4171</fpage>&#x2013;<lpage>86</lpage>. </citation>
</ref>
<ref id="B6">
<label>6.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brown</surname>
<given-names>TB.</given-names>
</name>
<name>
<surname>Mann</surname>
<given-names>B</given-names>
</name>
<name>
<surname>Ryder</surname>
<given-names>N</given-names>
</name>
<name>
<surname>Subbiah</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Kaplan</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Dhariwal</surname>
<given-names>P</given-names>
</name>
<etal/>
</person-group> "<article-title>Language models are few-shot learners</article-title>." <comment>arXiv [Preprint]</comment>.<fpage>14165</fpage> (<year>2020</year>). <comment>Available at <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2005.14165">https://arxiv.org/abs/2005.14165</ext-link>
</comment> (<comment>Accessed September 20, 2021</comment>). </citation>
</ref>
<ref id="B7">
<label>7.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Qazvinian</surname>
<given-names>V</given-names>
</name>
<name>
<surname>Rosengren</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Radev</surname>
<given-names>D</given-names>
</name>
<name>
<surname>Mei</surname>
<given-names>Q</given-names>
</name>
</person-group>. <article-title>Rumor has it: Identifying misinformation in microblogs</article-title>. In: <source>Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing</source>, <publisher-loc>Stroudsburg</publisher-loc>: <publisher-name>ACL</publisher-name> (<year>2011</year>). p. <fpage>1589</fpage>&#x2013;<lpage>99</lpage>. </citation>
</ref>
<ref id="B8">
<label>8.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kochkina</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Liakata</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Zubiaga</surname>
<given-names>A</given-names>
</name>
</person-group>. "<article-title>All-in-one: Multi-task learning for rumour verification</article-title>." <comment>arXiv preprint arXiv:1806.03713</comment> (<year>2018</year>). </citation>
</ref>
<ref id="B9">
<label>9.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cao</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J</given-names>
</name>
</person-group>. "<article-title>Automatic rumor detection on microblogs: A survey</article-title>." <comment>arXiv [Preprint]</comment> (<year>2018</year>). <comment>Available at <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/1807.03505">https://arxiv.org/abs/1807.03505</ext-link>
</comment> (<comment>Accessed September 20, 2021</comment>). </citation>
</ref>
<ref id="B10">
<label>10.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Wong</surname>
<given-names>K</given-names>
</name>
</person-group>. <article-title>Detect Rumors in Microblog Posts Using Propagation Structure via Kernel Learning</article-title>. <source>Proc 55th Annu Meet Assoc Comput Linguistics</source> (<year>2017</year>) <volume>Vol. 1</volume>:<fpage>708</fpage>&#x2013;<lpage>17</lpage>.<comment>Long Papers)</comment> </citation>
</ref>
<ref id="B11">
<label>11.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Castillo</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Mendoza</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Poblete</surname>
<given-names>B</given-names>
</name>
</person-group>. <article-title>Information credibility on twitter</article-title>. <source>Proc 20th Int Conf World wide web</source> (<year>2011</year>) <fpage>675</fpage>&#x2013;<lpage>84</lpage>. <pub-id pub-id-type="doi">10.1145/1963405.1963500</pub-id> </citation>
</ref>
<ref id="B12">
<label>12.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chua</surname>
<given-names>AYK</given-names>
</name>
<name>
<surname>Banerjee</surname>
<given-names>S</given-names>
</name>
</person-group>. <article-title>Linguistic predictors of rumor veracity on the internet</article-title>. <source>Proc Int MultiConference Eng Comp Scientists</source> (<year>2016</year>) <volume>1</volume>:<fpage>387</fpage>&#x2013;<lpage>91</lpage>. </citation>
</ref>
<ref id="B13">
<label>13.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yu</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Q</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>T</given-names>
</name>
</person-group>. <article-title>A Convolutional Approach for Misinformation Identification</article-title>. <source>IJCAI</source> (<year>2017</year>) <fpage>3901</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.24963/ijcai.2017/545</pub-id> </citation>
</ref>
<ref id="B14">
<label>14.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Vosoughi</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Mohsenvand</surname>
<given-names>MN</given-names>
</name>
<name>
<surname>Roy</surname>
<given-names>D</given-names>
</name>
</person-group>. <article-title>Rumor Gauge</article-title>. <source>ACM Trans Knowl Discov Data</source> (<year>2017</year>) <volume>11</volume>:<fpage>1</fpage>&#x2013;<lpage>36</lpage>. <pub-id pub-id-type="doi">10.1145/3070644</pub-id> </citation>
</ref>
<ref id="B15">
<label>15.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>FangWu</surname>
<given-names>YB</given-names>
</name>
</person-group>. <article-title>Early detection of fake news on social media through propagation path classification with recurrent and convolutional networks</article-title>. In: <source>32nd AAAI Conference on Artificial Intelligence</source>. <publisher-loc>California</publisher-loc>: <publisher-name>AAAI press</publisher-name> (<year>2018</year>). p. <fpage>354</fpage>&#x2013;<lpage>61</lpage>. </citation>
</ref>
<ref id="B16">
<label>16.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kwon</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Cha</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Jung</surname>
<given-names>K</given-names>
</name>
</person-group>. <article-title>Rumor Detection over Varying Time Windows</article-title>. <source>PloS one</source> (<year>2017</year>) <volume>12</volume>:<fpage>e0168344</fpage>&#x2013;<lpage>1</lpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0168344</pub-id> </citation>
</ref>
<ref id="B17">
<label>17.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Glazkova</surname>
<given-names>A</given-names>
</name>
<name>
<surname>Glazkov</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Trifonov</surname>
<given-names>T</given-names>
</name>
</person-group>. <article-title>g2tmn at Constraint@AAAI2021: Exploiting CT-BERT and Ensembling Learning for COVID-19 Fake News Detection</article-title>. <source>Commun Comput Info Sci</source> (<year>2021</year>) <fpage>116</fpage>&#x2013;<lpage>27</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-73696-5_12</pub-id> </citation>
</ref>
<ref id="B18">
<label>18.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Zafarani</surname>
<given-names>R</given-names>
</name>
</person-group>. <article-title>CHECKED: Chinese COVID-19 fake news dataset</article-title>. <source>Soc Netw Anal Min</source> (<year>2021</year>) <volume>11</volume>:<fpage>58</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1007/s13278-021-00766-8</pub-id> </citation>
</ref>
<ref id="B19">
<label>19.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Patwa</surname>
<given-names>P</given-names>
</name>
<name>
<surname>Sharma</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Pykl</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Guptha</surname>
<given-names>V</given-names>
</name>
<name>
<surname>Kumari</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Akhtar</surname>
<given-names>MS</given-names>
</name>
<etal/>
</person-group> <article-title>Fighting an infodemic: COVID-19 fake news dataset</article-title>. In: <source>International Workshop on Combating Online Hostile Posts in Regional Languages during Emergency Situation</source>. <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name> (<year>2021</year>) p. <fpage>21</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-73696-5_3</pub-id> </citation>
</ref>
<ref id="B20">
<label>20.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Q</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Q</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y</given-names>
</name>
</person-group>. <article-title>Rumor Detection on Social Media: Datasets, Methods and Opportunities</article-title>. In: <source>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom: Censorship</source>. <publisher-loc>Snyder</publisher-loc>: <publisher-name>Disinformation, and Propaganda</publisher-name> (<year>2019</year>) p. <fpage>66</fpage>&#x2013;<lpage>75</lpage>. <pub-id pub-id-type="doi">10.18653/v1/d19-5008</pub-id> </citation>
</ref>
<ref id="B21">
<label>21.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zubiaga</surname>
<given-names>A</given-names>
</name>
<name>
<surname>Kochkina</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Liakata</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Procter</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Lukasik</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Bontcheva</surname>
<given-names>K</given-names>
</name>
<etal/>
</person-group> <article-title>Discourse-aware rumour stance classification in social media using sequential classifiers</article-title>. <source>Inf Process Manag</source> (<year>2018</year>) <volume>54</volume>(<issue>2</issue>):<fpage>273</fpage>&#x2013;<lpage>90</lpage>. <pub-id pub-id-type="doi">10.1016/j.ipm.2017.11.009</pub-id> </citation>
</ref>
<ref id="B22">
<label>22.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Zafarani</surname>
<given-names>R</given-names>
</name>
</person-group>. "<article-title>Fake news: A survey of research, detection methods, and opportunities</article-title>." <comment>arXiv [Preprint]</comment> (<year>2018</year>). <comment>Available at <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/1812.00315v2">https://arxiv.org/abs/1812.00315v2</ext-link>
</comment> (<comment>Accessed September 20, 2021</comment>). </citation>
</ref>
<ref id="B23">
<label>23.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Peters</surname>
<given-names>ME</given-names>
</name>
<name>
<surname>Neumann</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Iyyer</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Gardner</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Clark</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>K</given-names>
</name>
<etal/>
</person-group> <article-title>Deep contextualized word representations</article-title>. <source>Proc NAACL-HLT</source> (<year>2018</year>) <fpage>2227</fpage>&#x2013;<lpage>37</lpage>. <pub-id pub-id-type="doi">10.18653/v1/n18-1202</pub-id> </citation>
</ref>
<ref id="B24">
<label>24.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Dai</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Carbonell</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Salakhutdinov</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Quoc</surname>
<given-names>V</given-names>
</name>
</person-group>. <article-title>XLNet: Generalized Autoregressive Pretraining for Language Understanding</article-title>. <source>Adv Neural Inf Process Syst</source> (<year>2019</year>) <volume>32</volume>:<fpage>5753</fpage>&#x2013;<lpage>63</lpage>. </citation>
</ref>
<ref id="B25">
<label>25.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lee</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Yoon</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>D</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>S</given-names>
</name>
<name>
<surname>So</surname>
<given-names>CH</given-names>
</name>
<etal/>
</person-group> <article-title>BioBERT: a pre-trained biomedical language representation model for biomedical text mining</article-title>. <source>Bioinformatics</source> (<year>2020</year>) <volume>36</volume>(<issue>4</issue>):<fpage>1234</fpage>&#x2013;<lpage>40</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btz682</pub-id> </citation>
</ref>
<ref id="B26">
<label>26.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lamsal</surname>
<given-names>R</given-names>
</name>
</person-group>. <article-title>Design and analysis of a large-scale COVID-19 tweets dataset</article-title>. <source>Appl Intell</source> (<year>2021</year>) <volume>51</volume>(<issue>5</issue>):<fpage>2790</fpage>&#x2013;<lpage>804</lpage>. <pub-id pub-id-type="doi">10.1007/s10489-020-02029-z</pub-id> </citation>
</ref>
<ref id="B27">
<label>27.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Leng</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Zhai</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>Y</given-names>
</name>
<name>
<surname>Selzer</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Strover</surname>
<given-names>S</given-names>
</name>
<etal/>
</person-group> <article-title>Misinformation during the COVID-19 outbreak in China: Cultural, social and political entanglements</article-title>. <source>IEEE Trans Big Data</source> (<year>2021</year>) <volume>7</volume>(<issue>1</issue>):<fpage>69</fpage>&#x2013;<lpage>80</lpage>. <pub-id pub-id-type="doi">10.1109/tbdata.2021.3055758</pub-id> </citation>
</ref>
<ref id="B28">
<label>28.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Yan</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>T</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>W</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>Z</given-names>
</name>
<etal/>
</person-group> <article-title>A COVID-19 Rumor Dataset</article-title>. <source>Front Psychol</source> (<year>2021</year>) <volume>12</volume>(<issue>2021</issue>):<fpage>644801</fpage>. <pub-id pub-id-type="doi">10.3389/fpsyg.2021.644801</pub-id> </citation>
</ref>
<ref id="B29">
<label>29.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bergstra</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Bengio</surname>
<given-names>Y</given-names>
</name>
</person-group>. <article-title>Random Search for Hyper-Parameter Optimization</article-title>. <source>J&#x20;Machine Learn Res</source> (<year>2012</year>) <volume>13</volume>:<fpage>281</fpage>&#x2013;<lpage>305</lpage>. </citation>
</ref>
<ref id="B30">
<label>30.</label>
<citation citation-type="other">
<person-group person-group-type="author">
<name>
<surname>Loshchilov</surname>
<given-names>I</given-names>
</name>
<name>
<surname>Hutter</surname>
<given-names>F</given-names>
</name>
</person-group>. <source>Fixing weight decay regularization in adam</source>. <comment>arXiv [Preprint]</comment> (<year>2012</year>). <comment>Available at <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/1711.05101">https://arxiv.org/abs/1711.05101</ext-link>
</comment> (<comment>Accessed September 20, 2021</comment>).</citation>
</ref>
<ref id="B31">
<label>31.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Mikolov</surname>
<given-names>T</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>K</given-names>
</name>
<name>
<surname>Corrado</surname>
<given-names>G</given-names>
</name>
<name>
<surname>Dean</surname>
<given-names>J</given-names>
</name>
</person-group>. <source>Efficient estimation of word representations in vector space</source> (<year>2013</year>). <comment>arXiv preprint arXiv:1301.3781</comment>.</citation>
</ref>
<ref id="B32">
<label>32.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kingma</surname>
<given-names>DP</given-names>
</name>
<name>
<surname>Jimmy</surname>
<given-names>B.</given-names>
</name>
</person-group> <source>Adam: A method for stochastic optimization</source> (<year>2014</year>). <comment>arXiv preprint arXiv:1412.6980</comment>.</citation>
</ref>
<ref id="B33">
<label>33.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tuz&#xf3;n</surname>
<given-names>P</given-names>
</name>
<name>
<surname>Fern&#xe1;ndez-Gracia</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Egu&#xed;luz</surname>
<given-names>VM</given-names>
</name>
</person-group>. <article-title>From Continuous to Discontinuous Transitions in Social Diffusion</article-title>. <source>Front Phys</source> (<year>2018</year>) <volume>6</volume>:<fpage>21</fpage>. <pub-id pub-id-type="doi">10.3389/fphy.2018.00021</pub-id> </citation>
</ref>
<ref id="B34">
<label>34.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Omodei</surname>
<given-names>E</given-names>
</name>
<name>
<surname>De Domenico</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Arenas</surname>
<given-names>A</given-names>
</name>
</person-group>. <article-title>Characterizing interactions in online social networks during exceptional events</article-title>. <source>Front Phys</source> (<year>2015</year>) <volume>3</volume>:<fpage>59</fpage>. <pub-id pub-id-type="doi">10.3389/fphy.2015.00059</pub-id> </citation>
</ref>
<ref id="B35">
<label>35.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bellingeri</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Bevacqua</surname>
<given-names>D</given-names>
</name>
<name>
<surname>Scotognella</surname>
<given-names>F</given-names>
</name>
<name>
<surname>Alfieri</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Nguyen</surname>
<given-names>Q</given-names>
</name>
<name>
<surname>Montepietra</surname>
<given-names>D</given-names>
</name>
<etal/>
</person-group> <article-title>Link and Node Removal in Real Social Networks: A Review</article-title>. <source>Front Phys</source> (<year>2020</year>) <volume>8</volume>:<fpage>228</fpage>. <pub-id pub-id-type="doi">10.3389/fphy.2020.00228</pub-id> </citation>
</ref>
<ref id="B36">
<label>36.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lou</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Zuo</surname>
<given-names>D</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Ye</surname>
<given-names>L</given-names>
</name>
</person-group>. <article-title>Audio Information Camouflage Detection for Social Networks</article-title>. <source>Front Phys</source> (<year>2021</year>) <volume>9</volume>:<fpage>715465</fpage>. <pub-id pub-id-type="doi">10.3389/fphy.2021.715465</pub-id> </citation>
</ref>
<ref id="B37">
<label>37.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bu</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>A</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>Y</given-names>
</name>
</person-group>. <article-title>Graph K-means based on leader identification, dynamic game, and opinion dynamics</article-title>. <source>IEEE Trans Knowledge Data Eng</source> (<year>2019</year>) <volume>32</volume>(<issue>7</issue>):<fpage>1348</fpage>&#x2013;<lpage>61</lpage>. </citation>
</ref>
<ref id="B38">
<label>38.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>G</given-names>
</name>
</person-group>. <article-title>Epidemic Propagation with Positive and Negative Preventive Information in Multiplex Networks</article-title>. <source>IEEE Trans Cybern</source> (<year>2020</year>) <volume>51</volume> (<issue>3</issue>):<fpage>1454</fpage>&#x2013;<lpage>62</lpage>. <pub-id pub-id-type="doi">10.1109/TCYB.2019.2960605</pub-id> </citation>
</ref>
<ref id="B39">
<label>39.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>Co-evolution Spreading of Multiple Information and Epidemics on Two-layered Networks Under the Influence of Mass Media</article-title>. <source>Nonlinear Dyn</source> (<year>2020</year>) <volume>102</volume>:<fpage>3039</fpage>&#x2013;<lpage>52</lpage>. <pub-id pub-id-type="doi">10.1007/s11071-020-06021-7</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>