<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>JOURNAL OF APPLIED</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Identifying Potential Sleeping Beauties Based Warping Algorithm</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zewen Hu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yu Chen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jingjing Cui</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Management Science and Engineering, Nanjing University of Information Science and Technology</institution>
          ,
          <addr-line>219 Ningliu Road, Pukou District, Nanjing 210044, Jiangsu Province</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>2014</volume>
      <fpage>467</fpage>
      <lpage>472</lpage>
      <abstract>
        <p>Sleeping beauty is recognized as delayed highly-cited or high-impact literature. Precise and efficient identification of potential sleeping beauties from massive literature can maximize their value in science and technology development. Therefore, in this study, a new time series similarity method, named dynamic time warping (DTW) algorithm, is designed to precisely and efficiently identify sleeping beauties from massive literature. First, top 1% of the highly cited papers (5425 articles) between 1990 and 2010 in the field of artificial intelligence were identified based on data collected from the Web of Science database. Then, the DTW algorithm was designed and implemented to identify potential sleeping beauties based on the citation curve of a classic sleeping beauty. Among the findings: (1) The DTW algorithm can quickly and effectively identify potential sleeping beauties with help from the citation trajectory of benchmark sleeping beauties, thereby matching the high recognition accuracy of curve fitting and high recognition efficiency of the objective indicator method. (2) The DTW method displayed strong robustness, automatically and accurately identifying different kinds of highly influential publications including sleeping beauties, Nobel Prize papers, highly-cited papers, and hot papers, based on publication citation trajectories. Sleeping beauty, Citation curve, Identification and prediction, Dynamic time warping algorithm, Quadratic function fitting</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>In the science world, scientific and technical manuscripts have a
finite lifetime after their publication, Although some publications
are widely cited and reach a citation peak during an initial short
citation window after publication, the rate and number of citations
dwindle to an extremely low level after a certain period [1].
Considering the enormous number of publications from different
disciplines, most manuscripts ate either uncited or citation level is
low after a long citation window following publication [2, 3, 4].
Undeniably, there have also been a few popular or high-quality
publications that steadily accumulate citations during a long
citation lifetime and finally become highly cited papers [5].
Except for the common low-citation, non-citation, and
highcitation phenomena, some scholars also found another kind of
sleeping beauty phenomenon that merges low- and high-citation
patterns. A sleeping beauty (SB) in science refers to a publication,
the importance and relevance of which have not been recognized,
whereby the manuscript does not receive much attention during
the initial citation window following its publication, and
unexpectedly starts being frequently cited followed by a sudden
spike of popularity [1, 6]. Depending on the rate and number of
citations since publication, scientific and technical manuscripts
can be classified into three: publications with low-citation or
noncitation, highly-cited or hot publications, and sleeping beauties
which refer to publications from the 1960s receiving delayed
recognition. Barber discovered the phenomenon of delayed
recognition upon noticing that some major scientific discoveries
in the scientific community were not widely used and cited when
they were first published [7]. However, many years after their
publication, their scientific value and significance began to attract
the attention of researchers, whereupon they were widely utilized
and cited. In 1980, Garfield introduced the theory of “delayed
recognition,” which refers to manuscripts lacking attention at the
time of publication, suddenly being highly cited after a certain
period of time [8]. Some classical sleeping beauties include the
Einstein, Podolsky, and Rosen “paradox” paper which was used
as the primary sleeping beauty in this study.</p>
      <p>Identifying "sleeping beauties" from a massive number of
papers and recommending them to the scientific world would
enable their full recognition in terms of scientific and
technological value, thereby driving the development of science
and technology [9]. Considering the delayed recognition
phenomenon of "sleeping beauties," the rapid and efficient
identification of SBs through various methods and models has
become more significant in ensuring their full utilization potential.
Most academic databases or platforms such as Web of Science
and Scopus, have implemented the recommendation function of
highly cited or hot papers. However, a recommendation function
has not been designed for sleeping beauties or other outstanding
publications. Therefore, highly efficient methods or algorithms for
identifying and recommending "sleeping beauties" would have
significant application value.</p>
      <p>Since Van Raan proposed the concept of sleeping beauty
[6], a series of quantitative studies on the identification and
application of sleeping beauties were implemented and published
[10, 11, 12, 13]. These quantitative studies can be categorized into
two types; sleeping beauty identification based on curve fitting
methods and those based on indicators.</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Identifying sleeping beauties through curve fitting. The
curve fitting method entails the selection of the appropriate curve
type, use of a mathematical expression or model to fit the annual
citation frequency of each document, and classification of the
manuscript type based on the document’s citation curve. Curve
fitting provides the advantages of simple operation, intuitive
results, and easy analysis. However, when the number of
documents is too large, the fitting efficiency is extremely low.
      </p>
      <p>
        (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Identifying sleeping beauties by indicator-based methods.
Including subjective indicators and objective indicators. The
subjective indicator method can also be referred to as artificial
parameter setting. Van Raan [6] first proposed a definition for
sleeping beauty and three subjective indicators to identify SBs.
The three indicators used to characterize sleeping beauties were: a
sleeping period of greater than or equal to five years, a sleeping
period of less than or equal to two years, and a state of awakening
of greater than 20 years. However, up to now, there has been no
unified standard on the setting of values of subjective indicators
including the length and depth of sleeping and awakening
intensity, which is variable and greatly influenced by interference
factors and subjective perception of scholars.
      </p>
      <p>The objective indicator method is different from artificial
parameter setting. In 2015, Ke et al. [1] designed a no-parameter
indicator “Beauty Coefficient (B)” based on the citation frequency
of the literature to identify sleeping beauties and quantitatively
analyze the distribution of the number of SBs in different
disciplines. A sleeping beauty can be quickly identified through
the Beauty Coefficient, which does not reflect citation after the
citation peak. Ye and Bornmann improved the Beauty Coefficient
by introducing a dynamic citation angle β to quantitatively
identify sleeping beauties [14]. Li improved the Gini index in the
field of economics to identify sleeping beauties [15]. But, the
objective indicator method has the problem of ignoring the
specific citation curve of sleeping beauties and may be influenced
by parameters such as the length and depth of sleeping and length
of citation period.</p>
      <p>In this study, we designed and implemented the dynamic
time warping (DTW) algorithm, which is a much more robust
distance measure for time series, allowing similar shapes to match
even if they are out of phase along the temporal axis. Because of
this flexibility, DTW is widely used in science, medicine, industry,
and finance [16, 17, 18, 19]. In bioinformatics and chemical
engineering, DTW algorithms have been successfully applied to
RNA expression data, synchronization, and monitoring of batch
processes in polymerization [20, 21]. The DTW algorithm is
different from the traditional sleeping beauty identification
method in that it measures the distance between time series curves
[22], to identify documents with similar citation trajectories in the
same or different citation periods. This method not only considers
the citation curve of a document’s entire lifetime, but also
measures a specific DTW-value, and combines the advantages of
the curve fitting and objective indicator methods, thereby
displaying high robustness. This method can identify potential
sleeping beauty citation curves exhibiting slow citation rate with
flat to fast growth, as well as those with large annual citation
frequency fluctuations. “benchmarking sleeping beauty” refers to
a standardized sleeping beauty satisfying the three aforementioned
indicators proposed by van Raan [6].</p>
      <p>The innovations of this study are primarily reflected in the
following aspects. First, the DTW algorithm was applied to
identify potential sleeping beauties based on any given
benchmarking sleeping beauty citation curve. Second, the
accuracy of the DTW algorithm was improved by combining it
with the three indicators proposed by Van Raan [6] to identify
sleeping beauties with a standardized sleeping period and not
some highly cited papers. Finally, the identification results of
DTW method were compared with those of the quadratic function
fitting methods.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Materials and Methods 2.1 Data</title>
      <p>The research uses papers and citation data from the
“Computer Science, Artificial Intelligence” categories in Web of
Science as research samples to evaluate the performance and
application value of the DTW algorithm. The data from the Web
of Science were restricted to three document types: articles,
proceeding papers, and reviews. We set the publication period
from 1990 to 2010 and the citation period from1990 to 2019,
making the shortest and longest citation periods 10 and 30 years,
respectively. A total of 524,599 papers with corresponding
citation and bibliometric data were collected. By selecting
different lengths of citation periods, the effect of the length of
citation period on the identification of sleeping beauties can be
verified using the DTW algorithm, to further suggest robust DTW
algorithms.</p>
      <p>Although sleeping beauty combines low and high citation,
SBs belong to highly cited publications to some extent as there is
a higher percentage of sleeping beauties among highly cited
publications. The top 1% is a commonly used criterion for
identifying highly cited publications, as defined by Essential
Science Indicators from Clarivate Analytics. Therefore, the top 1%
highly cited articles were selected as samples to identify potential
sleeping beauties. Table 1 shows the number of highly cited as
well as total number of papers in the field of artificial intelligence
during the indicated 21 years.</p>
    </sec>
    <sec id="sec-3">
      <title>2.2. Methodology</title>
      <p>Dynamic time warping (DTW) is a dynamic programming
method that combines time warping with distance measurement.
The basic idea is to find the smallest alignment matching path to
minimize the distance between two sequences. The DTW
algorithm can calculate the distance between sequences of
different lengths and thus is not sensitive to time series offset.
Therefore, the DTW algorithm can quickly identify potential
sleeping beauty documents that conform to the “benchmarking
sleeping beauty” citation curves from massive documents.</p>
      <p>Given two time series of citations for two papers: Q and C,
with series length n and m, respectively, where</p>
      <p>
        Q=q1, q2, ..., qi, ..., qn (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
C=c1, c2, ..., cj, ..., cm (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
an n*m matrix is constructed to align the two sequences, whereby
the (ith, jth) element of the matrix contains the distance between
the two points qi and cj.  × = ((  ,   ))× denotes the
distance matrix of Q and C; d(qi, cj) = (qi − cj)2 represents the
distance between the corresponding points of the two sequences,
This paper considers the Euclidean distance as an example.
      </p>
      <p>Let W be a contiguous set of matrix elements defining a
mapping between Q and C, then we have</p>
      <p>
        W = ω1, ω2, . . . , ωk, . . . , wK max(n, m) ≤ K &lt; n + m −
1 (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
  = ((  ,   )) is the kth element of the path, and the path
needs to fulfill the following conditions:
      </p>
      <p>
        ① Boundary:  1 = (
        <xref ref-type="bibr" rid="ref1 ref1">1,1</xref>
        ),   = (, ) .This constrains the
starting and finishing points in diagonally opposite corner cells of
the matrix.
      </p>
      <p>② Continuity: Given   = (, ) ,  −1 = ( ′,  ′) , where
a − a′ ≤ 1 and b − b′ ≤ 1. This restricts the allowable steps in
the warping path to adjacent cells (including diagonally adjacent
cells).</p>
      <p>③ Monotonicity: Given  = (, ),  −1 = ( ′,  ′), where
a − a′ &gt; 0 and b − b′ &gt;0. This forces the points in W to be
monotonic in time.</p>
      <p>
        There are many wrapping paths that satisfy the above
conditions. Among all paths, the path that minimizes the value of
formula (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) is called the optimal path, and the corresponding
distance is the dynamic time-bending distance, DTW (Q, C).
      </p>
      <p>
        DTW(Q, C) = min {√∑kK=1 WK
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <p>The calculation of DTW is a dynamic programming process,
where γ(i , j) denotes the cumulative distance defined as the sum
of distance in the current state (qi, cj) and the minimum value of
the current cumulative distance.</p>
      <p>
        γ(i, j) = d(qi, cj) + min{γ(i − 1, j − 1), γ(i − 1, j), γ(i, j −
1)} (
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
The algorithmic complexity of DTW is O(nm)
      </p>
      <p>Considering some standardized sleeping beauties as samples,
we tested and evaluated the applicability of the DTW algorithm.
Li identified 10 sleeping beauties that met Raan 's criteria from
21,438 papers published by Nobel Laureates in chemistry, physics,
physiology, and medicine, and the publication window was
19012012 [23]. We retrieved these 10 sleeping beauties through Web
of Science, normalized the annual citation frequency, and
formulated them as time series of annual citation points, S1 to
S10. These 10 sleeping beauties were then used in preliminary
tests to explore the potential of the DTW algorithm in identifying
potential sleeping beauties.</p>
      <p>First, we chose the time series of the second sleeping beauty
(document 2) as the benchmarking standard because it is
characterized by a short citation time and a sharp increase in the
citation curve. Then, we calculated the DTW-value between the
11702 217 2004 39395 373
14515 232 2005 46030 385
11200 218 2006 61109 315
16734 281 2007 51350 337
22083 307 2008 49142 333
33277 320 2009 53259 414
34465 374 2010 36644 398
second benchmarking sleeping beauty and the other nine sleeping
beauties.</p>
      <p>The smaller the DTW-value between the citation frequency
distribution (referred to as citation time series) of the two
documents, the higher is the similarity between the citation curves
of the two documents. Table 2 presents the DTW-value between
the second benchmarking sleeping beauty and the others
(abbreviated as DTW-value 1). In Table 2, the citation time series
of documents 1, 2, and 3 are the closest, and the DTW distance is
less than 0.19. The distances between the cited sequences of the
sleeping beauty documents 4-10 and 2 are between 0.28 and 0.56.
To verify the effectiveness of using DTW-value to identify
potential sleeping beauties, we also established a comparative
baseline by selecting top 5 highly cited papers that were not
sleeping beauties in the AI field, to calculate the average of
DTWvalues (abbreviated as DTW-value 2) between each of the five
highly cited papers and 10 sleeping beauties, as shown in Table 2.
An obvious fact is that DTW-value 2 of 10 sleeping beauties is far
higher than DTW-value 1, suggesting the effectiveness of DTW
methods in identifying potential sleeping beauties based on the
benchmarking sleeping beauty.</p>
      <p>publication
year</p>
    </sec>
    <sec id="sec-4">
      <title>4. Verification of DTW method in identifying potential sleeping beauties</title>
      <p>A sleeping beauty comprises two different citation periods:
sleep and awakening. Therefore, its citation curve has a standard
citation distribution and is thus affected less by disciplinary factors,
that is, the citation curves of sleeping beauties from different
disciplines display a high similarity. Research has shown that the
citation characteristics in the field of computer science conform to
the first sleep phase and then suddenly enter the awakening phase,
which is consistent with the citation curves of most existing
research in the field of physics [5]. Therefore, we chose a
benchmarking sleeping beauty with the oldest publication year, the
longest citation period, and slower citation rate [15]. Subsequently,
we measured the DTW-value between the “benchmarking sleeping
beauty” and 5245 highly cited papers in the field of artificial
intelligence from 1990 to 2010 after normalizing the annual
citation frequency curves of all the papers. The seminal study on
Brownian motion published by Einstein in 1905 presents a
standardized sleeping beauty citation distribution curve with a
lengthy sleeping period and a long citation burst after awakening.
As shown in Figure 1, this paper is gradually attracting attention
after 65 years of publication, and the citation frequency only
exceeded 20 in the 66th year after publication. As of 2020, the
citation curve of this article had not yet reached its citation peak.
1939 2843 0.408 0.584
1935 2164 0.416 0.523
1963 1990 0.523 0.543
1919 1483 0.562 0.664
and presented the descriptive statistics of the DTW-value of the
documents in each publication year. For recent publications, the
citation period is shorter; the various statistics of the DTW-value
are smaller, such as the average DTW distance of 0.64 in 2010,
whereas it was 0.97 in 2001 and 1.35 in 1991. Documents
published in 1990 had a long citation duration of 30 years.
However, sleeping beauty documents with lower average
DTWvalue in Table 3 correspond to manuscripts published between
2002 and 2010 with shorter citation durations. This suggests that
in identifying sleeping beauties, the DTW-value may be affected
by the length of the citation period. Furthermore, the threshold
values of TOP 1% and TOP 5% DTW- values of the 5245 highly
cited documents in different publication years, were extremely
small numbers varying between 0.21 and 0.38. The 80% threshold
values of TOP 1% DTW- values published in 21 different years
varied between 0.21 and 0.29. This suggests that 1% or 5% of the
highly-cited documents in the AI field are extremely close in
distance to the “benchmarking sleeping beauty” written by
Einstein in 1905.</p>
      <p>Table 3
Descriptive statistics of the DTW- value of 5245 highly-cited
documents
publication mean- minimum
year value value
threshold
value of
TOP 1%
threshold
value of
TOP 5%
1990</p>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion and Conclusion</title>
      <p>The DTW method can identify potentially high-value papers
that are very similar to the selected benchmark and closest to
highvalue citation curves such as sleeping beauties or “highly cited
papers.” The rapid identification and extensive recommendation of
such high-value papers can maximize their scientific and
application value. Based on the citation time series of a sleeping
beauty published by Einstein in 1905, we measured the
DTWvalue between 5245 highly cited papers in the field of artificial
intelligence, published from 1990-2010. From the empirical
results, we can see that the DTW method is very robust, and it can
identify potential sleeping beauties with similar citation curves
and distance closest to that of the “benchmarking sleeping beauty.”
Although this study used a sleeping beauty authored by Einstein in
1905, 52 sleeping beauties in the top 1% and 262 sleeping beauties
in the top 5% of DTW-values were identified from 5245 highly
cited papers.</p>
      <p>
        Many deficiencies remain in this research: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) We only used the
sleeping beauty published by Einstein in 1905 as the
“benchmarking sleeping beauty,” which is a subjective choice
displaying “slow growth in the early stage, and fast growth in the
later stage”; (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) The DTW method may not be affected by the
length of citation time. The identified sleeping beauties displayed
an annual deviation and were mainly distributed after 2000. Some
identified sleeping beauties had a short sleep duration, leading to
the misidentification of highly-cited papers
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Acknowledgments</title>
      <p>This study was supported by Jiangsu Provincial Social Science
Foundation of China (Grant No. 19TQC004) “Research on the
stratification and recognition mechanism of literature value in the
field of social science”; and supported by sponsored by Qing Lan
Project.</p>
    </sec>
    <sec id="sec-7">
      <title>7. References</title>
      <p>0.784
0.732
0.689
0.637</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Ke</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferrara</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Radicchi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Flammini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <year>2015</year>
          .
          <article-title>Defining and identifying sleeping beauties in science</article-title>
          .
          <source>Proceedings of the National Academy of Sciences</source>
          ,
          <volume>112</volume>
          (
          <issue>24</issue>
          ),
          <fpage>7426</fpage>
          -
          <lpage>7431</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <year>2014</year>
          .
          <article-title>Regularity in the time-dependent distribution of the percentage of never-cited papers: An empirical pilot study based on the six journals</article-title>
          .
          <source>Journal of informetrics</source>
          ,
          <volume>8</volume>
          (
          <issue>1</issue>
          ),
          <fpage>136</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <year>2018</year>
          .
          <article-title>A quantitative analysis of determinants of non-citation using a panel data model</article-title>
          .
          <source>Scientometrics</source>
          ,
          <volume>116</volume>
          (
          <issue>2</issue>
          ),
          <fpage>843</fpage>
          -
          <lpage>861</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Rousseau</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <year>2019</year>
          .
          <article-title>Do citation chimeras exist? The case of under-cited influential articles suffering delayed recognition</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          ,
          <volume>70</volume>
          (
          <issue>5</issue>
          ),
          <fpage>499</fpage>
          -
          <lpage>508</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Dey</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chakraborty</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Ghosh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <year>2017</year>
          .
          <article-title>Sleeping beauties in Computer Science: characterization and early identification</article-title>
          .
          <source>Scientometrics</source>
          ,
          <volume>113</volume>
          (
          <issue>3</issue>
          ),
          <fpage>1645</fpage>
          -
          <lpage>1663</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>