<!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>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute for Information Recording of National Academy of Sciences of Ukraine</institution>
          ,
          <addr-line>2, Mykoly Shpaka Street, Kyiv, 03113</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Nottingham, University Park</institution>
          ,
          <addr-line>Nottingham, NG7 2RD</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Warsaw University of Technology</institution>
          ,
          <addr-line>Koszykowa Street, 75, 00-662 Warsaw</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <fpage>163</fpage>
      <lpage>172</lpage>
      <abstract>
        <p>Keyword analysis is a widely used technique which includes statistical and co-word analysis that allows study of the development of research domains, identification of hot topics and new trends, prediction of knowledge evolution, and investigation of the interdisciplinary nature of science concepts. The main aim of the research presented in this paper is to better understand the mechanisms governing the popularity of specific topics and how they change over time. In the paper, the open-access databases ArXiv and DBLP, and the Stack Exchange Q&amp;A websites were compared using keyword analysis in the computer science area. The most popular topics in computer science were detected using time-series and co-word network. The behaviour of keywords and the mechanisms governing the popularity of specific topics were investigated.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;scientific databases</kwd>
        <kwd>DBLP</kwd>
        <kwd>ArXiv</kwd>
        <kwd>StackExchange</kwd>
        <kwd>bibliometrics</kwd>
        <kwd>keywords 1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Co-word network analysis is frequently used in bibliometrics because it provides a clear graphic
visualization, helps to describe the structure of the subject area, and highlights the main key elements
and groups of keywords to identify subtopics and interdisciplinarity in science. Moreover, this
perspective opens up many opportunities for additional analysis, e.g. with tools developed within a
theory of complex networks. Please note that a combination of co-author and co-word networks
allows the construction of a heterogeneous information network. In [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] a Meta Path Computed
Prediction (MPCP) algorithm for link prediction among scientists and publications was presented.
Authors of [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] used co-word network modularity analysis to identify primary research interests. The
development of scientific areas also includes the comparison analysis of domains: Khajavi et al. in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]
proposed to measure a fuzzy distance between two domains using the three indicators of frequency,
development, and investment appeal.
      </p>
      <p>
        Keyword analysis helps to observe the rise and fall of scientific concepts; for example, in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] it was
shown that fields consistently follow a rise and fall pattern captured by two parameters of right-tailed
Gumbel temporal distribution. Keyness analysis is used to identify significant keywords in different
time periods by comparing the difference between the observed frequencies and the expected
frequencies [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        A keyword analysis is used for identifying hot topics using the most frequent terms in a particular
domain. Hot topics refer to “issues and topics that are discussed by a relatively large number of
scholars within a certain period’ [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. For instance, Park et al. in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] proposed a keyword-scoring metric
to measure the degree of the emergence of a word compared to the terms in a particular domain. The
same principles are included for new and emergent trend detection. By analyzing time series
keywords frequency on time intervals, it is possible to detect new or emerging topics [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In some
cases, additional evidence, such as investment, could support co-word network analysis to provide an
evaluation of research topics. Authors of [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] suggested the use of a keyword co-occurrence network
together with investment, measured by the number of sponsors associated with each keyword.
      </p>
      <p>
        Co-word network analysis is the most frequently used instrument in bibliometric analysis because
it provides a clear graphic visualization, helps to describe the structure of the subject area highlights
the main key elements and groups of keywords to identify subtopics and interdisciplinarity in science,
opens up many opportunities for additional analysis according to the developed theory of complex
networks, and provides opportunities for new applications of already existing methods. For instance,
Lande et al in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] conducted keyword analysis using a co-occurrence network of categories of subject
domains and their density, to identify related topics in scientific research, detect trends in research,
search for interdisciplinary terminology and correct usage of terms, and describe science structure.
      </p>
      <p>The main aim of the research presented in this paper is to better understand the mechanisms
governing the popularity of specific topics and how they change over time. The investigation carried
out in this paper includes a comparison of selected open-source bibliometric databases, i.e., DBLP
database and ArXiv e-print database and Stack Exchange Q&amp;A websites, in terms of keyword
behaviour. We are interested in similarities and differences between these data sources as well as the
information concerning relationships between topics and their evolution, interdisciplinarity and
possible predictions for the future that can be formulated based on them. In the example of the
computer science category/research field of study, various modelling techniques are considered, from
quantitative analysis to keyword co-occurrence network modelling.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Scientometric databases</title>
      <p>In this section databases, namely DBLP, ArXiv, and Stack Exchange, will be described and
compared. We focused on open sources that allow bibliometric information to be gathered and
analyzed freely.</p>
      <p>
        Many studies have been conducted on the qualitative and quantitative comparison of several
scientific databases [
        <xref ref-type="bibr" rid="ref11 ref12">11,12</xref>
        ]. But the lifecycle of technology in applied sciences includes also
development and usage in real life. We assume that the analysis and comparison of academic and
non-academic databases allow us to find the main trends in applied sciences.
      </p>
      <p>
        The DBLP database is a widely known computer science abstract database, which indexes
approximately 7M publications, over 3M authors, over 6K conferences, and approximately 2K
journals. Initially, DBLP started as a database systems and logic programming (DBLP) research group
at the University of Trier in Germany, and since 2018 it has been operated and maintained by Schloss
Dagstuhl [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. DBLP is an open-access source of data, that provides data and a clear description of the
form of storing data and updating processes.
      </p>
      <p>
        The open-access and Rosenfeld et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] found an ‘over-indexing‘ of Computer Science
publications in DBLP, but the number of such records was not significant and the difficulty of
establishing boundaries for Computer Science in interdisciplinary research should be taken into
account. The DBLP creators define their database as not complete but the processes of adding and
improving it are ongoing [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The DBLP is recognized as a reliable database in Computer Science.
However, today there is no abstract resource that would provide a complete reflection of at least one
scientific field.
      </p>
      <p>
        ArXiv is a free distribution service and an open-access archive with 2,166,249 scholarly articles in
the fields of physics, mathematics, computer science, quantitative biology, quantitative finance,
statistics, electrical engineering and systems science, and economics. Even though that ArXive’s
articles are not peer-reviewed a lot of scientometric research for scoping review in different areas
relies on this database in the same range as well-known Scientific databases. In the [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] authors
estimated the interdisciplinarity of concepts in data science, in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] authors studied security
development patterns in computer science, and in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] the scientometric analysis of papers in physics,
astronomy and particle physics was presented. The greatest advantage of ArXiv is the fast publishing
process, allowing scientists to increase the speed of research exchange, which was critically apparent
during the COVID-19 pandemic. Scientometric analysis of papers from ArXiv and a gathered dataset
from several resources regarding COVID-19 revealed the most active researchers, institutions and
most common topic of research in this area in papers [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ].
      </p>
      <p>
        StackExchange is a popular example of a Q&amp;A website. Q&amp;A websites are technical discussion
forums on social media that serve as a platform for users to interact mainly via questions and answers
and have become a necessary part of professional practice. Thus, the content of such websites mostly
consists of current practice topics in different areas. Stack Exchange is a large community run by
professionals and enthusiasts and comprises 173 Q&amp;A communities, including Stack Overflow. Over
100 million people visit every month to ask questions, learn, and share technical knowledge in
different areas [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. There are a lot of research issues that were solved using the StackExchange data
in recent years. Authors of papers [
        <xref ref-type="bibr" rid="ref20 ref21">20, 21</xref>
        ] proposed solutions for improving education through the
usage of the StackExchange. In the paper [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], online leadership through the linguistic perspective.
Similar to scientometric research mining of Q&amp;A websites can discover main communities and
change in time of topics of discussion [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. Q&amp;A websites as sources gave no fewer fruits of research
for discovering the area’s development than scientific databases. However, the question of combining
the mining of scientific and Q&amp;A resources to obtain the full picture of area development is still open.
      </p>
      <p>
        All three databases play an important role in the communication process in science and areas of
expertise and spreading knowledge. The open policy of the resources makes them more available for
uploading information, usage, scientometric and data analysis [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Empirical analysis</title>
      <p>Computer science topics were analyzed and key-words networks were compared based on
different resources. Note that in the case of Stack Exchange forums, we decided to include both
Computer Science and Math forums. Table 1 presents the summarization of data that were included
in each of the databases.</p>
      <p>
        For analyzing the DBLP database the v13 dataset was chosen which was released in May 2021 and
consists of 5354309 papers and related keywords [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Instead of keywords in the databases, ArXiv
and StackEchange categories of records were selected, thus the biggest number of keywords were
obtained using dataset DBLP-V13.
      </p>
      <p>Next an analysis of the time series of the posts and keywords was performed and co-word
networks were built fig.2. For both papers (DBLP-v13 and ArXiv databases) and posts (Stack Exchange
forums) keyword / tags were mainly used. However, some additional information was also included
(e.g. publication date, authors). The usage of keyword fuzzy is presented on fig. 3 as an example. A
decline in the number of times this specific keyword was used may be observed. This may indicate
for example that the keyword fuzzy was replaced by more specialized and detailed expressions
representing this domain.</p>
      <p>The keyword networks were built using the frequency of keywords. The presence of
keywords/tags in one publication (paper or post) represents the link between nodes in the network.
For example, for the Stack Exchange forum, the co-occurrence of tags is presented with the network
which consists of 664 nodes and 21735 edges, and the network diameter is equal to 4. The nodes with
the highest centrality have the most number of connections or are involved in the most number of
topics (fig.2). The main keywords for all the data are presented in Table 2.</p>
      <p>
        For the Arxiv database, the categories presented on the table 2 have the highest centrality
measure [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. These categories in ArXiv represent high publication activity in physics,
interdisciplinarity, and a strong connection between computer science and physics.
      </p>
      <p>Description
Theoretical particle physics and its interrelation with
experiment. Prediction of particle physics observables: models,
effective field theories, calculation techniques. Particle physics:
analysis of theory through experimental results
Formal aspects of quantum field theory. String theory,
supersymmetry and supergravity
No description in Arxiv
Papers on all aspects of machine learning including also
robustness, explanation, fairness, and methodology
Includes astro-ph.CO(Cosmology and Nongalactic
Astrophysics), astro-ph.EP (Earth and Planetary Astrophysics),
astro-ph.GA (Astrophysics of Galaxies), astro-ph.HE (High
Energy Astrophysical Phenomena), and others
cs
algorithms
complexity-theory
graphs
formal-languages
time-complexity
arxiv
hep-ph
hep-th
quant-ph
cs.LG
astro-ph</p>
      <p>
        Moreover, the concept with the highest centrality was used as a keyword for searching and
gathering the ArXiv data. For gathering data from ArXiv and SteckExchange databases, the Science
Metric library was used, which was developed by the scientists of the Institute for Information
Recording of the National Academy of Sciences of Ukraine [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. The Science metric library
automatically processes the data from several databases such as Arxiv, SteckExchange, Ukrainian and
Chinese abstract databases. The system allows searching by keywords and gives the reports with the
time series by the year, most popular keywords in titles and abstracts, and authors forming co-word
and co-author networks which could be further analyzed with visualizing software [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ].
      </p>
      <p>
        Networks of concepts related to the selected tags were built using ArXiv and Stack Exchange and
the main characteristics of the networks were calculated. Selected concepts were compared by
betweenness centrality measures. Betweenness centrality allows the detection of nodes - connectors
of parts of the network, so it is possible to detect the most interdisciplinary keywords. Selected
keywords reflect the difference in purpose and usage of the databases [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ].
      </p>
      <p>For instance, a search was done for the keyword ‘optimization’ in Stack Exchange and Arxiv. Fig.
4 shows the co-word network for the dataset obtained by searching words using the keyword
‘optimization’ in the Science Metric library in the Stack Exchange dataset. The dataset of records from
Stack Exchange in Computer Science was limited to 2794 records where the word optimization was
mentioned. The degree centrality of nodes, which is the number of connections with other keywords,
was used to reflect the size of nodes and define the most common keywords. For this network, the
keywords with higher degree of centrality were defined such as optimization,
constrainedoptimization, linear algebra, algorithms, python, convex-optimization, non-linear programming,
Matlab, matrix, iterative method, finite-element, quadratic-programming and others. Such keywords
reflect the application of optimization in real cases which were discussed in the forum. The clusters
of the network were defined using modularity, which measures the strength of divisions. Three
clusters were detected, the largest cluster containing most of the keywords with a higher degree of
centrality.</p>
      <p>By the same request, Arxiv data were analysed and 174167 records were found. The network
obtained for the keyword ‘optimization’ with Arxiv is shown in fig. 5. This network was not divided
into clusters because it consists of one large cluster with the keywords: optimization and control,
machine learning, systems and control, numerical analysis, probability, artificial intelligence,
learning, neural and evolution, data structures and information theory. This time, the network more
precisely describes the connection between fundamental concepts.</p>
      <p>The comparison of keywords using betweenness centrality is shown in Table 4.</p>
      <p>Using keyword and co-word network analysis, the Arxiv database and SteckExchange were
compared by categories and by the chosen keywords. This allowed us to analyze the datasets on the
different levels.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions</title>
      <p>By analysing the DBLP database, the ArXiv e-print database and the Stack Exchange Q&amp;A websites,
the behaviour of keywords and the mechanisms governing the popularity of specific topics were
investigated. The most popular research trends in computer science were detected and analysed using
co-word network and time series analysis with discrete generalised distribution. The comparative
analysis of the four open-access databases was presented in the study and the main differences in
usage were highlighted.</p>
      <p>The importance of open-access resources in communication in science and areas of expertise was
shown, and the scientometric analysis presented examples of using datasets. Comparative analysis of
keywords from the co-word network using the databases presented the difference between the same
concepts in academic and expert areas. The analysis of the Arxiv database highlighted the
predominance of physics and the connection between computer science and physics.</p>
      <p>Keyword and co-word network analysis were carried out for Arxiv and StackExchange and for
specific keywords . Keywords with the highest centrality and betweenness centrality measures reflect
the main concepts. The difference in the concept usage in academic and expert contexts was shown
with the example of the topic optimization.</p>
      <p>The methods and tools presented in the paper could be applied to any area of research and other
databases, which allows the development of the area through the academic and expertise perspective
to be described, and main concepts and the most important topics to be defined.
The findings were obtained in cooperation with prof. Dmytro Lande (NTUU KPI), PhD Barbara
Żogała-Siudem (SRI PAS), PhD Grzegorz Siudem (WUT), prof. Marek Gągolewski (SRI PAS, WUT).</p>
      <p>Iryna Balagura acknowledges support from the British Academy through the Researchers at Risk
Fellowships Programme (Grant RaR\100215).</p>
    </sec>
    <sec id="sec-5">
      <title>References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.Balagura</surname>
          </string-name>
          , I. Gorbov,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Link prediction of scientific collaboration networks based on information retrieval</article-title>
          ,
          <source>World Wide Web: Internet and Web Information Systems23</source>
          (
          <year>2020</year>
          )
          <fpage>2239</fpage>
          -
          <lpage>2257</lpage>
          .doi:
          <volume>10</volume>
          .1007/s11280-019-00768-9.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Wei-Min</surname>
            <given-names>Fan</given-names>
          </string-name>
          , Wei Jeng,
          <string-name>
            <surname>Muh-Chyun Tang</surname>
          </string-name>
          First published: 06 June 2022 https://doi.org/10.1002/asi.24688
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Khajavi</surname>
            <given-names>R.</given-names>
          </string-name>
          , Arastoopoor S.
          <article-title>Semantic domain comparison of research keywords by indicatorbased fuzzy distances: A new prospect (2023) Information Processing</article-title>
          and Management,
          <volume>60</volume>
          (
          <issue>5</issue>
          ), DOI: 10.1016/j.ipm.
          <year>2023</year>
          .103468
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Singh</surname>
            <given-names>CK</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barme</surname>
            <given-names>E</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ward</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tupikina</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santolini</surname>
            <given-names>M</given-names>
          </string-name>
          (
          <year>2022</year>
          )
          <article-title>Quantifying the rise and fall of scientific fields</article-title>
          .
          <source>PLoS ONE</source>
          <volume>17</volume>
          (
          <article-title>6): e0270131</article-title>
          .https://doi.org/10.1371/journal.pone.0270131
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Gabrielatos</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Keyness Analysis: nature, metrics and techniques</article-title>
          . In Taylor, C. &amp;
          <string-name>
            <surname>Marchi</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . (eds.) Corpus Approaches to Discourse:
          <article-title>A critical review</article-title>
          .
          <source>Oxford: Routledge</source>
          .
          <fpage>225</fpage>
          -
          <lpage>258</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Computerized Corpus Keyword Approaches to Evaluation: A Case Study of Evaluative Attitudes of “the Belt and Road” Reports in Mainstream Media of China and America</article-title>
          .
          <source>International Journal of Electrical Engineering Education</source>
          . https://doi.org/10.1177/0020720920923303
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Jihye</given-names>
            <surname>Park</surname>
          </string-name>
          , Hye Jin Lee, Sungzoon Cho,
          <article-title>Hot topic detection in central bankers' speeches, Expert Systems with Applications</article-title>
          , Volume
          <volume>230</volume>
          ,
          <year>2023</year>
          , 120563, ISSN 0957-4174, https://doi.org/10.1016/j.eswa.
          <year>2023</year>
          .
          <volume>120563</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Shou</surname>
          </string-name>
          , Xintian, Wang, Yumeng, Duan, Chenglin, Yuan, Guozhen, Wei, Namin, Yang, Yihan; Hu,
          <article-title>Yuanhui Knowledge Domain and Emerging Trends of Glucagon-Like Peptide 1 Receptor Agonists in Cardiovascular Research: A Bibliometric Analysis (</article-title>
          <year>2023</year>
          ) Current Problems in Cardiology,
          <volume>48</volume>
          (
          <issue>8</issue>
          ), art. no.
          <issue>101194 DOI:</issue>
          10.1016/j.cpcardiol.
          <year>2022</year>
          .101194
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Masoumi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khajavi</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <article-title>A fuzzy classifier for evaluation of research topics by using keyword co-occurrence network and sponsors information</article-title>
          .
          <source>Scientometrics</source>
          <volume>128</volume>
          ,
          <fpage>1485</fpage>
          -
          <lpage>1512</lpage>
          (
          <year>2023</year>
          ). https://doi.org/10.1007/s11192-022-04618-w
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Andrushchenko</surname>
          </string-name>
          and
          <string-name>
            <surname>I. Balagura</surname>
          </string-name>
          ,
          <article-title>"Data Science in Open-Access Research on-Line Resources,"</article-title>
          <source>2018 IEEE Second International Conference on Data Stream Mining &amp; Processing (DSMP)</source>
          , Lviv, Ukraine,
          <year>2018</year>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>20</lpage>
          , doi: 10.1109/DSMP.
          <year>2018</year>
          .
          <volume>8478565</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>AlRyalat</surname>
            ,
            <given-names>S. A. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malkawi</surname>
            ,
            <given-names>L. W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Momani</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>Comparing Bibliometric Analysis Using</surname>
            <given-names>PubMed</given-names>
          </string-name>
          , Scopus, and Web of Science Databases.
          <source>J. Vis. Exp. (152)</source>
          , e58494, doi:10.3791/58494 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Fiorenzo</surname>
            <given-names>Franceschini</given-names>
          </string-name>
          , Domenico Maisano, Luca Mastrogiacomo,
          <article-title>Empirical analysis and classification of database errors in Scopus and Web of Science</article-title>
          ,
          <source>Journal of Informetrics</source>
          , Volume
          <volume>10</volume>
          ,
          <string-name>
            <surname>Issue</surname>
            <given-names>4</given-names>
          </string-name>
          ,
          <year>2016</year>
          , Pages
          <fpage>933</fpage>
          -
          <lpage>953</lpage>
          , ISSN 1751-1577, https://doi.org/10.1016/j.joi.
          <year>2016</year>
          .
          <volume>07</volume>
          .003.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>DBLP</surname>
          </string-name>
          , URL https://dblp.org/ computer science bibliography
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Ariel</given-names>
            <surname>Rosenfeld</surname>
          </string-name>
          .
          <year>2023</year>
          .
          <source>Is DBLP a Good Computer Science Journals Database? Computer</source>
          <volume>56</volume>
          , 3 (March
          <year>2023</year>
          ),
          <fpage>101</fpage>
          -
          <lpage>108</lpage>
          . https://doi.org/10.1109/
          <string-name>
            <surname>MC</surname>
          </string-name>
          .
          <year>2022</year>
          .3181977
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>David</surname>
            ,
            <given-names>Dimitri</given-names>
          </string-name>
          <string-name>
            <surname>Percia</surname>
          </string-name>
          , et al.
          <article-title>"Measuring security development in information technologies: A scientometric framework using arXiv e-prints."</article-title>
          <source>Technological Forecasting and Social Change</source>
          <volume>188</volume>
          (
          <year>2023</year>
          ):
          <fpage>122316</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Bonilla</surname>
          </string-name>
          ,
          <article-title>Ana Isabel and Hernández, Tony and Gómez, Isabel Scientometric analysis on a sample of scientists in astronomy</article-title>
          ,
          <source>particles physics and multidisciplinary physics in arXiv.org (1996- 2006)</source>
          ,
          <year>2007</year>
          ,
          <source>Proceedings of ISSI 2007 - 11th International Conference of the International Society for Scientometrics and Informetrics</source>
          ,
          <volume>830</volume>
          -
          <fpage>831</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>Breno</given-names>
          </string-name>
          <string-name>
            <surname>Santana</surname>
          </string-name>
          , et al.
          <article-title>"COVID-19: A scholarly production dataset report for research analysis." Data in Brief 32 (</article-title>
          <year>2020</year>
          ):
          <fpage>106178</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>Breno</given-names>
          </string-name>
          <string-name>
            <surname>Santana</surname>
          </string-name>
          , et al.
          <article-title>"Discovering temporal scientometric knowledge in COVID-19 scholarly production</article-title>
          .
          <source>" Scientometrics 127.3</source>
          (
          <year>2022</year>
          ):
          <fpage>1609</fpage>
          -
          <lpage>1642</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>[19] https://stackexchange.com/about</mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Lal</surname>
          </string-name>
          , Sangeeta, and Rahul Mourya.
          <article-title>“For CS Educators, by CS Educators: An Exploratory Analysis of Issues and Recommendations for Online Teaching in Computer Science</article-title>
          .”
          <string-name>
            <surname>Societies</surname>
          </string-name>
          (Basel, Switzerland)
          <volume>12</volume>
          .4 (
          <year>2022</year>
          ):
          <fpage>116</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Karbasian</surname>
          </string-name>
          , Habib, and Aditya Johri. “
          <article-title>Insights for Curriculum Development: Identifying Emerging Data Science Topics through Analysis of Q and A Communities.</article-title>
          ”
          <source>SIGCSE 2020 - Proceedings of the 51st ACM Technical Symposium on Computer Science Education. N</source>
          .p.,
          <year>2020</year>
          .
          <fpage>192</fpage>
          -
          <lpage>198</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Lu</surname>
          </string-name>
          , Xuecong et al. “
          <article-title>The Impact of Linguistic Complexity on Leadership in Online Q&amp;A Communities: Comparing Knowledge Shaping and Knowledge Adding</article-title>
          .
          <source>” Information &amp; Management 59.6</source>
          (
          <year>2022</year>
          ):
          <fpage>103675</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Sinha</surname>
          </string-name>
          , Priyanka et al. “
          <article-title>A Hierarchical Clustering Algorithm for Characterizing Social Media Users</article-title>
          .”
          <source>The Web Conference 2020 - Companion of the World Wide Web Conference</source>
          ,
          <string-name>
            <surname>WWW</surname>
          </string-name>
          <year>2020</year>
          . NEW YORK: Assoc Computing Machinery,
          <year>2020</year>
          .
          <fpage>353</fpage>
          -
          <lpage>362</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Xuemei</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Mike</given-names>
            <surname>Thelwall</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Kayvan</given-names>
            <surname>Kousha</surname>
          </string-name>
          .
          <article-title>"The role of arXiv, RePEc, SSRN and PMC in formal scholarly communication."</article-title>
          <source>Aslib journal of information management 67.6</source>
          (
          <year>2015</year>
          ):
          <fpage>614</fpage>
          -
          <lpage>635</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Andrushchenko</surname>
            ,
            <given-names>V. B.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>I. V.</given-names>
            <surname>Balagura</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Lande</surname>
          </string-name>
          .
          <article-title>"Information resources for scientific information access and exchange, identification of scientists-Opportunities, disadvantages</article-title>
          ,
          <source>benefits." CEUR Workshop Proceedings</source>
          .
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Arxiv</surname>
            <given-names>URL</given-names>
          </string-name>
          https://arxiv.org/category_taxonomy
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Lande</surname>
            <given-names>D.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kryuchyn</surname>
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dobrovska</surname>
            <given-names>S.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balagura</surname>
            <given-names>I.V.</given-names>
          </string-name>
          <article-title>Use of the «Library of Science Metrics» system for conducting science metric research</article-title>
          .
          <source>Data Rec., Storage &amp; Processing</source>
          .
          <year>2023</year>
          . Vol.
          <volume>25</volume>
          ,
          <string-name>
            <surname>Nо</surname>
          </string-name>
          . 1. P.
          <volume>32</volume>
          -
          <fpage>42</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Lande</surname>
            ,
            <given-names>Dmytro V.</given-names>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Snarskii</surname>
          </string-name>
          .
          <article-title>"Compactified Horizontal Visibility Graph for the Language Network."</article-title>
          <source>arXiv preprint arXiv:1302.4619</source>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kadenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Andriichuk</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Gorbov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>Defining Potential Academic Expert Groups based on Joint Authorship Networks Using Decision Support Tools</article-title>
          .
          <source>In CEUR Workshop Proceedings</source>
          . pp.
          <fpage>222</fpage>
          -
          <lpage>233</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>