<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>ES-VRAI at CheckThat! 2023: Leveraging Bio and Lists Information for Enhanced Rumor Verification in Twitter</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hamza Tarik Sadouk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Faouzi Sebbak</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hussem Eddine Zekiri</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ecole Militaire Polytechnique</institution>
          ,
          <addr-line>PO Box 17, 16111 Bordj El Bahri, Algiers</addr-line>
          ,
          <country country="DZ">Algeria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents our participation in the CLEF2023 CheckThat! Lab [1], focusing on Task 5, which addresses Authority Finding in Twitter [2]. This study addresses the gap in rumor verification by exploring the use of Bio and Lists information from trusted authorities' bios as evidence sources in social media. A Twitter Bio is a brief description or introduction about oneself or an organization displayed on a user's profile, providing a snapshot of their identity, interests, or purpose. Twitter Lists are curated groups of Twitter accounts created by users to organize and categorize specific individuals or topics for easy viewing and engagement. Previous research has primarily focused on propagation networks and user-generated content. The findings highlight the potential of incorporating Bio and Lists information to enhance existing rumor verification systems. Additionally, the study evaluates diferent retrieval approaches, showing that combining Bio and Lists information leads to efective lexical retrieval. A hybrid approach combining lexical and semantic retrieval further improves performance. These findings contribute to advancing rumor verification methods in social media.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Rumor verification</kwd>
        <kwd>Authority finding</kwd>
        <kwd>Lexical retrieval</kwd>
        <kwd>Semantic retrieval</kwd>
        <kwd>Hybrid approach</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Previous research on rumor verification in social media has primarily focused on using
propagation networks as a source of evidence, examining reply stances [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], reply structures [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and
retweeters profile features [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. However, according to [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], where they constructed a dataset for
the purpose, no prior studies have explored the use of evidence from the timelines of trusted
authorities, defined as ” entities with the actual knowledge or power to confirm or refute a particular
rumor, for rumor verification in social media ”[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Identifying the stance of relevant authorities
regarding rumors can significantly enhance the evidence sources used by current rumor
verification systems. Additionally, it can be a useful tool for fact-checkers to automate the process of
examining authority tweets for rumor verification. It’s important to note that while the stance
of authorities can be a valuable source of evidence, it should complement other sources and
may not always be entirely reliable for determining the truthfulness of rumors on its own.
      </p>
      <p>
        The task of expert finding, which aims to identify individuals with relevant expertise in a
particular domain, has gained significant attention in recent years [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        Previous research in this area has often focused on incorporating spatial information to
address the expert-finding problem. For example, McDonald et al.[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] conducted a study in
a medium-sized software company to develop a system that cataloged people’s expertise,
aiming to facilitate the process of locating experts. In a similar vein, Dom et al.[10] proposed a
graph-based ranking algorithm for expert finding by analyzing email communications. Their
approach incorporated link analysis techniques, assigning each email owner a node with a
score derived from PageRank and HITS algorithms. Campbell et al.[11] compared two methods
for identifying expertise within email communities. The first method focused solely on email
text content, while the second method utilized a graph-based ranking algorithm considering
both text and communication patterns. The expert search task was introduced in TREC 2005
Enterprise track[12], with the top-performing approach, THUENT0505, utilizing all W3C web
part information, email Lists, and in-link anchor text of related files, then restructuring text
content to form description files for each potential expert.
      </p>
      <p>Pal and Counts [13] proposed a probabilistic clustering framework that utilized nodal and
topical features to identify authoritative experts in a given topic. Ghosh et al.[14] developed
the Cognos system, which utilized Twitter Lists to determine user expertise and demonstrated
comparable performance to Twitter’s oficial system in identifying top users for specific topics.
Additionally, Wei et al.[15] investigated the use of multiple types of relationships on Twitter
to identify experts associated with a particular topic. Studies, such as the one referenced in
[16], integrate user-related Twitter data to improve expert finding outcomes. They employ a
semi-supervised graph ranking technique to rank expertise levels.</p>
      <p>The subsequent sections of this paper are structured as follows: Section 2 provides an overview
of the data employed in this study, Section 3 elucidates the ranking metrics to enhance the
understanding of the results, Section 4 presents the proposed methodology, Section 5 ofers the
experimental results and in-depth discussions, and finally, Section 6 concludes the study.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Data overview</title>
      <p>
        In this section, we present the Authority Finder in Twitter dataset provided as part of the
CheckThat! 2023 competition [
        <xref ref-type="bibr" rid="ref2 ref7">7, 2</xref>
        ].
      </p>
      <p>Given a tweet stating a rumor, we retrieve a ranked list of authorities that may help verify
the rumor. The dataset is available in Arabic only, and it’s composed of the following:
• Rumors: The data is in a JSON format. It contains JSON objects representing rumors.</p>
      <p>Figure 1 illustrates the diferent entries for each rumor.
• Relevance Judgments (Qrels): The file is a TAB-separated file in TREC format. Each rumor
ID is associated with user IDs of the authorities. The file is in the following format:
– rumor_id: Unique ID for the given rumor
– 0: Literally 0 (this column is needed to comply with the TREC format).</p>
      <p>– user_id: Unique ID for the given authority.
– relevance: 2 if the authority is highly relevant to the rumor (has higher priority to
be contacted); 1 if it is relevant; 0 is assumed for all pairs not appearing in the qrels
ifle.
• Users Metadata: It has a collection of 1000 JSON files. Figure 2 represents the format of
each file.
• Twitter Lists Metadata: a collection of 1000 JSON files with Twitter Lists information (see</p>
      <p>Figure 3 for the format)</p>
    </sec>
    <sec id="sec-3">
      <title>3. Ranking metrics</title>
      <p>P@1[17], P@5[18] and nDCG@5[19] are evaluation metrics commonly used in information
retrieval and recommendation systems to measure the quality and relevance of ranked Lists.
The oficial evaluation measure is P@5 to evaluate how systems are able to retrieve authorities
at the top of a short retrieved list.</p>
      <p>• Precision at K (P@K): Precision at K measures the proportion of relevant items among
the top K items in a ranked list.</p>
      <p>– TP (True Positives): The number of relevant items in the top K items.</p>
      <p>– K: The value of K for which you want to calculate precision.
• Normalized Discounted Cumulative Gain at K (nDCG@K): nDCG is a measure that
considers both the relevance and the position of items in a ranked list. It gives higher
scores to relevant items that appear at the top of the list.</p>
      <p>Where:
Where:
(1)
(2)
(3)
 



 = ∑︁</p>
      <p>=1 log2( + 1)
– DCG (Discounted Cumulative Gain): The sum of the relevance scores of the top K
items, with decreasing weights, calculated as follows.
– IDCG (Ideal Discounted Cumulative Gain): The maximum achievable DCG for the
given list.</p>
      <p>– K: The value of K for which you want to calculate nDCG.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Proposed method</title>
      <p>Our methodology consists of several steps inspired by [20], including preprocessing, creating
user documents, indexing and retrieval, and incorporating lexical and semantic scoring for
ranking users. Below is a description of each step in the process:</p>
      <sec id="sec-4-1">
        <title>4.1. Indexing and Retrieval</title>
        <p>We used Pyserini1, a Python toolkit for information retrieval, to index our user collection for
lexical retrieval. We experimented using diferent values of BM25 [21] parameters. We set the
language to Arabic and performed normalization on both documents and queries. The Lucene
Arabic analyzer was employed for stemming and removing stop words. As our queries (rumors)
are expressed in tweets, we preprocessed the data by discarding URLs, emojis, and non-Arabic
characters. We considered three types of user representation indexes:
• Bio_index: each user is represented by their translated Twitter profile name and
description.
• Lists_index: each user is represented by concatenating their translated Twitter list names
and descriptions.
• Bio_lists_index: each user is represented by concatenating their translated Twitter profile
name and description with their translated Twitter Lists.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Lexical Retrieval</title>
        <p>We employed the BM25 [21] retrieval model to compute the lexical score  for a candidate user
 given a rumor , considering only the textual representation of users. The BM25 algorithm
calculates a term-weighted score for a given document-query pair as follows:
 25(, ) =
∑︁  () ·</p>
        <p>(1 + 1) ·  (, )
1 · ((1 − ) +  · || ) +  (, )
∈∩
where  and  are the textual representations of the user  and rumor , respectively,
 (, ) is the frequency of term  in the user document , || is the length of the user
document,  is the average document length in the collection, and  () is the inverse
document frequency of term . The parameters 1 and  control the term frequency saturation
and field-length normalization, respectively.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Initial Retrieval</title>
        <p>Assuming authoritative users have more followers and are involved in more Twitter Lists than
regular users. We computed the initial score (, ) by incorporating the number of Twitter
Lists, followers, and users as follows:
(, ) = (, ) × 2[( + 2)(  + 2)]

1https://github.com/castorini/pyserini
(4)
(5)
where  is the number of Twitter Lists the candidate is a member of,  is the number of
followers the candidate has, and  is the number of users the candidate is following. We added
2 when computing the logarithm of both factors for smoothing in case  or  is zero. In any
of those cases, the initial score will fall back to the lexical score.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Semantic Reranking</title>
        <p>Contextualized transformer-based models such as BERT that are pre-trained on large corpora
have shown superiority in document reranking. Given that, we also employed a semantic
reranking approach based on BERT to re-rank the initial retrieved users, using the same
technique as [20] for the generation of input data. Practically we used three pretrained Arabic
models:
• AraBERT [22], a BERT-based language model, is optimized for Arabic NLP tasks,
demonstrating efectiveness in sentiment analysis, and text classification.
• ArBERT [23] is a large-scale pre-trained masked language model for Modern Standard</p>
        <p>Arabic, based on BERT-base architecture, with 163 million parameters.
• MARBERT [23] is an Arabic language model pre-trained on a diverse Twitter dataset
specifically designed to handle Arabic dialect variations.</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Hybrid Reranking</title>
        <p>
          As the initial score incorporates user profile features like the count of Twitter Lists, followers,
and followees, which are crucial in measuring user popularity, we adopted an existing hybrid
approach [20], that combines both the initial and semantic scores to compute a final score of
candidate users as follows:
ℎ(, ) =  × ˆ(, ) + (1 −  ) × (, ),
(6)
where  ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] is a weight that indicates the relative importance of each score, and ˆ(, )
is the normalized initial score using min-max normalization per rumor. This hybrid approach
allows us to leverage both lexical and semantic information along with user profile features to
better identify authoritative users for Arabic rumors. Figure 4 shows the whole process.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results and discussion</title>
      <p>The results presented in this study were obtained using the Development Dataset prior to the
release of the Test dataset, with the objective of identifying the most appropriate configuration
to be employed during the evaluation phase. This pre-release assessment aimed to discern the
optimal setup for subsequent evaluations and ensure the reliability and validity of the findings.</p>
      <p>The following tables (2 3 4 5) show the results of the diferent previously mentioned steps of
ranking.</p>
      <p>
        Table 2 (Lexical Retrieval): The table compares the performance of three diferent index
approaches (Bio Index, Lists Index, and Bio Lists Index) using various combinations of the
parameters k1 and b. We used Gready-Search to evaluate the optimal configuration of BM25,
where k1 ∈ [
        <xref ref-type="bibr" rid="ref1 ref4">1, 4</xref>
        ] with a step of 0.1, and b ∈ [0.1, 0.4] with a step of 0.1. The best-performing
lexical model was the one utilizing the Bio Lists index and setting the BM25 parameters k1
and b to 3 and 0.1, respectively, resulting in P@1=0.2750, P@5=0.1383, and nDCG@5=0.1865.
This indicates that combining the Bio and Lists information led to the most efective retrieval
strategy. It is important to note that the results for parameter values of  = 0.3 and  = 0.4,
including the default parameters for Pyserini with 1 = 0.9 and  = 0.4, were not reported in
this study due to their relatively moderate performance.
      </p>
      <p>In Table 3, we present the results of the initial retrieval using the Lists and Bio Lists indexes,
where we adopted the optimal BM25 parameter settings (k1=3 and b=0.1). The Bio Lists
Index yielded better results, with P@1=0.3500, P@5=0.1667, and nDCG@5=0.2345, further
demonstrating the benefit of combining Bio and Lists information and it shows the importance
of using user network features.</p>
      <p>In Table 4, we present the semantic reranking results using three Arabic-language BERT
models (AraBERT, ArBERT, and MARBERT) with the initial retrieval results from Table 2. The
initial retrieval outperformed all the semantic models in terms of P@1, P@5, and nDCG@5,
suggesting that the lexical approach is more efective than the semantic approach in this case.</p>
      <p>The hybrid retrieval results of reranking the top 100 candidate users from the initial
retrieval (Bio+Lists) by interpolating initial and semantic scores are presented in Table 5.
MARBERT performed the best among the semantic models, with P@1=0.3445, P@5=0.1835, and
nDCG@5=0.2427, demonstrating that the hybrid approach combining lexical and semantic
retrieval can lead to better performance than using either method alone.</p>
      <p>During the evaluation cycle, an attempt was made to employ Hybrid reranking with
MARBERT. However, the limited availability of computational resources hindered the production of
the necessary results within the specified evaluation cycle deadline. As a result, the submission
solely consisted of the results obtained using Initial Retrieval with the optimal configuration of
BM25.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>This study evaluates diferent retrieval approaches for authority finding, where each user is
represented by their translated Twitter profile name and description (Bio index) or by the
translated Twitter list names and descriptions (Lists index) or combined (Bio-Lists index).
The findings indicate combining Bio and Lists information leads to the most efective lexical
retrieval strategy. The initial retrieval process demonstrates the superiority of the Bio Lists Index
over the Lists Index, emphasizing the importance of incorporating Bio and Lists information.
Moreover, the results showed that both lexical and initial retrieval models outperformed all
the semantic retrieval models. However, a hybrid approach combining lexical and semantic
retrieval, particularly using the MARBERT model, shows improved performance. These results
highlight the benefits of combining diferent retrieval methods to achieve optimal information
retrieval outcomes.
Proceedings of the 1998 ACM conference on Computer supported cooperative work, 1998,
pp. 315–324.
[10] B. Dom, I. Eiron, A. Cozzi, Y. Zhang, Graph-based ranking algorithms for e-mail expertise
analysis, in: Proceedings of the 8th ACM SIGMOD workshop on Research issues in data
mining and knowledge discovery, 2003, pp. 42–48.
[11] C. S. Campbell, P. P. Maglio, A. Cozzi, B. Dom, Expertise identification using email
communications, in: Proceedings of the twelfth international conference on Information
and knowledge management, 2003, pp. 528–531.
[12] N. Craswell, A. P. De Vries, I. Soborof, Overview of the trec 2005 enterprise track., in:</p>
      <p>Trec, volume 5, 2005, pp. 1–7.
[13] A. Pal, S. Counts, Identifying topical authorities in microblogs, in: Proceedings of the
fourth ACM international conference on Web search and data mining, 2011, pp. 45–54.
[14] S. Ghosh, N. Sharma, F. Benevenuto, N. Ganguly, K. Gummadi, Cognos: crowdsourcing
search for topic experts in microblogs, in: Proceedings of the 35th international ACM
SIGIR conference on Research and development in information retrieval, 2012, pp. 575–590.
[15] W. Wei, G. Cong, C. Miao, F. Zhu, G. Li, Learning to find topic experts in twitter via
diferent relations, IEEE Transactions on Knowledge and Data Engineering 28 (2016)
1764–1778.
[16] Z. Cheng, J. Caverlee, H. Barthwal, V. Bachani, Finding local experts on twitter, in:</p>
      <p>Proceedings of the 23rd International Conference on World Wide Web, 2014, pp. 241–242.
[17] E. Yilmaz, J. A. Aslam, Estimating average precision with incomplete and imperfect
judgments, in: Proceedings of the 15th ACM international conference on Information and
knowledge management, 2006, pp. 102–111.
[18] E. M. Voorhees, The trec question answering track, Natural Language Engineering 7 (2001)
361–378.
[19] K. Järvelin, J. Kekäläinen, Ir evaluation methods for retrieving highly relevant documents,
in: ACM SIGIR Forum, volume 51, ACM New York, NY, USA, 2017, pp. 243–250.
[20] F. Haouari, T. Elsayed, W. Mansour, Who can verify this? finding authorities for rumor
verification in twitter, Information Processing &amp; Management 60 (2023) 103366.
[21] S. E. Robertson, S. Walker, S. Jones, M. M. Hancock-Beaulieu, M. Gatford, et al., Okapi at
trec-3, Nist Special Publication Sp 109 (1995) 109.
[22] W. Antoun, F. Baly, H. Hajj, AraBERT: Transformer-based model for Arabic language
understanding, in: Proceedings of the 4th Workshop on Open-Source Arabic Corpora and
Processing Tools, with a Shared Task on Ofensive Language Detection, European Language
Resource Association, Marseille, France, 2020, pp. 9–15. URL: https://aclanthology.org/
2020.osact-1.2.
[23] M. Abdul-Mageed, A. Elmadany, E. M. B. Nagoudi, ARBERT &amp; MARBERT: Deep
bidirectional transformers for Arabic, in: Proceedings of the 59th Annual Meeting of the
Association for Computational Linguistics and the 11th International Joint Conference on
Natural Language Processing (Volume 1: Long Papers), Association for Computational
Linguistics, Online, 2021, pp. 7088–7105. URL: https://aclanthology.org/2021.acl-long.551.
doi:10.18653/v1/2021.acl-long.551.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galassi</surname>
          </string-name>
          , G. Da San Martino, P. Nakov, ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Elsayed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Azizov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Caselli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cheema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasanain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kutlu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ruggeri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Struß</surname>
          </string-name>
          , W. Zaghouani,
          <article-title>Overview of the CLEF-2023 CheckThat! Lab checkworthiness, subjectivity, political bias, factuality, and authority of news articles and their source</article-title>
          , in: A.
          <string-name>
            <surname>Arampatzis</surname>
            , E. Kanoulas,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Tsikrika</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Vrochidis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Giachanou</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Aliannejadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Vlachos</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Fourteenth International Conference of the CLEF Association (CLEF</source>
          <year>2023</year>
          ),
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. Sheikh</given-names>
            <surname>Ali</surname>
          </string-name>
          , T. Elsayed,
          <article-title>Overview of the CLEF-2023 CheckThat! lab task 5 on authority finding in twitter</article-title>
          , in: Working Notes of CLEF 2023-
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , CLEF '
          <year>2023</year>
          , Thessaloniki, Greece,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. M. Carley</surname>
          </string-name>
          ,
          <article-title>Tree lstms with convolution units to predict stance and rumor veracity in social media conversations, in: Proceedings of the 57th annual meeting of the association for computational linguistics</article-title>
          ,
          <year>2019</year>
          , pp.
          <fpage>5047</fpage>
          -
          <lpage>5058</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Byun</surname>
          </string-name>
          , C.
          <article-title>-</article-title>
          k. Kim,
          <article-title>Dynamic graph convolutional networks with attention mechanism for rumor detection on social media</article-title>
          ,
          <source>Plos one 16</source>
          (
          <year>2021</year>
          )
          <article-title>e0256039</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>Early detection of fake news on social media through propagation path classification with recurrent and convolutional networks</article-title>
          ,
          <source>in: Proceedings of the AAAI conference on artificial intelligence</source>
          , volume
          <volume>32</volume>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          , T. Elsayed,
          <article-title>Detecting stance of authorities towards rumors in arabic tweets: a preliminary study</article-title>
          ,
          <source>in: European Conference on Information Retrieval</source>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>430</fpage>
          -
          <lpage>438</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Caselli</surname>
          </string-name>
          , G. Da San Martino, T. Elsayed,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ruggeri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Struß</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. N.</given-names>
            <surname>Nandi</surname>
          </string-name>
          , et al.,
          <article-title>Clef-2023 checkthat! lab: Checkworthiness, subjectivity, political bias, factuality, and authority</article-title>
          ,
          <source>in: Advances in Information Retrieval: 45th European Conference on Information Retrieval</source>
          ,
          <string-name>
            <surname>ECIR</surname>
          </string-name>
          <year>2023</year>
          , Dublin, Ireland, April 2-
          <issue>6</issue>
          ,
          <year>2023</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>III</given-names>
          </string-name>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>506</fpage>
          -
          <lpage>517</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <article-title>Who knows? searching for expertise on the social web: Technical perspective</article-title>
          ,
          <source>Communications of the ACM</source>
          <volume>55</volume>
          (
          <year>2012</year>
          )
          <fpage>110</fpage>
          -
          <lpage>110</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D. W.</given-names>
            <surname>McDonald</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Ackerman</surname>
          </string-name>
          ,
          <article-title>Just talk to me: a field study of expertise location</article-title>
          , in:
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>