<!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>Learning Contextual Representations of Citations via Graph Transformer ⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hyeon-Ju Jeon</string-name>
          <email>hjjeon@kiaps.org</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gyu-Sik Choi</string-name>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Se-Young Cho</string-name>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hanbin Lee</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hee Yeon Ko</string-name>
          <email>hyeonju@cau.ac.kr</email>
          <email>myeongyeon.yi@navercorp.com</email>
          <xref ref-type="aff" rid="aff6">6</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jason J. Jung</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>O-Joun Lee</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Myeong-Yeon Yi</string-name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Catholic University of Korea</institution>
          ,
          <addr-line>Bucheon-si, Gyeonggi-do</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Chung-Ang University</institution>
          ,
          <addr-line>Dongjak-gu, Seoul</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Incheon National University</institution>
          ,
          <addr-line>Yeonsu-gu, Incheon</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Korea Institute of Atmospheric Prediction Systems</institution>
          ,
          <addr-line>Dongjak-gu, Seoul</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>NAVER Corp.</institution>
          ,
          <addr-line>Seongnam-si, Gyeonggi-do</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff5">
          <label>5</label>
          <institution>Sogang University</institution>
          ,
          <addr-line>Mapo-gu, Seoul</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff6">
          <label>6</label>
          <institution>Soongsil University</institution>
          ,
          <addr-line>Dongjak-gu, Seoul</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
      </contrib-group>
      <fpage>150</fpage>
      <lpage>158</lpage>
      <abstract>
        <p>This study aims at representing the citation based on the citation context extracted from the citation network. Researchers cite papers for various purposes to describe their arguments in a logical structure. Thus, citations have diferent roles depending on what structure they are cited in the paper. In this paper, we first present a definition of the citation context and initialize the embedding vector based on the citation order and location. Then, based on the graph transformer model, we learn contextual citation embeddings. To represent citation context, we consider the following three parts: (i) textual features of paper, (ii) positional features of the citation context, and (iii) structural features of the citation network by applying the self-attention mechanism.</p>
      </abstract>
      <kwd-group>
        <kwd>Citation Context • Citation Network • Graph Transformer</kwd>
        <kwd>• Network Embedding • Positional Embedding</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The exponentially increment academic papers cause various services (e.g.,
citation recommendation [
        <xref ref-type="bibr" rid="ref13 ref3 ref7">3, 7, 13</xref>
        ], bibliographical retrieval [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], and so on). Such
services need exquisite analysis of the scientific impact and content of papers [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        There have been various studies [
        <xref ref-type="bibr" rid="ref14 ref16">14, 16</xref>
        ] on citation analysis to assess the
quality of the paper and understand the context. These studies have mostly
applied citation frequency-based and content-based approaches. The
frequencybased approaches was only given the same weight regardless of the purposes of
citation. As shown in Fig. 1, when two papers p1 and p2 are cited by pi, suppose
that p1 is located in introduction section, and p2 is located in evaluation section.
In this case, p1 and p2 are cited for diferent purposes, and their importance is
also diferent.
      </p>
      <p>
        To solve this problem, it is necessary to understand the overall context of
the citation in the paper. The content-based approaches [
        <xref ref-type="bibr" rid="ref19 ref6">6, 19</xref>
        ] attempted to
learn the contextual features of the paper using a language model based on
RNN/LSTM. Nevertheless, these studies only concentrated on not discovering
a citation context or their roles but measuring contents similarity between two
papers.
      </p>
      <p>
        Thereby, in this paper, we define and extract the citation context in citation
networks. First of all, we assume that the cited papers compose the contents of
the citing paper, and the order and location of the cited papers reflect the role of
each paper in the citing paper. To represent citations, we propose an embedding
method considering (i) textual features of paper, (ii) positional features of the
citation context, and (iii) structural features of the citation network by applying
the self-attention mechanism [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The proposed method can represent global
citation features using fewer layers than the convectional GCN model. It is also
eficient to learn the context of long papers.
      </p>
      <p>
        Finally, based on the graph-transformer [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], the proposed method generates
pre-training citation vectors considering the influence and correlation between
citation papers. This result can be used in various tasks such as citation
classiifcation, research topic discovery, and paper evaluation in the future.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related work</title>
      <p>This section introduces the existing methods for analyzing the citation
relationship in the citation network. To deal with the large citation network, various
studies investigated the co-citation frequency.</p>
      <p>
        Boyack and Klavans [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] focused on the network theory which can measure
node importance and weight to analyze co-citation relationship and bibliographic
coupling. Although this approach reflects the feature of network structure level,
it is dificult to say that the diferent roles of citations are considered. To solve
this problem, Habib and Afzal [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] exploited the distribution of citations in
sections to capture the citation context. Nevertheless, it is necessary to analyze
the distinguishing characteristics of co-citation papers at the content level. The
proximity based methods [
        <xref ref-type="bibr" rid="ref12 ref4">4, 12</xref>
        ] was proposed for weighting edges of the
cocitation network by using contexts. The edge weight was based on the strength
of co-citation context in the sentence level. Also, Ahmad and Afzal [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] showed
that traditional co-citation analysis can produce better results when combined
with metadata information of the paper (e.g., author, afiliation, venue, and so
on.)
      </p>
      <p>
        The above approaches focused on comparing content-based similarities in
consideration of the relationship between cited papers. While these are efective
for application to specific tasks such as citation recommendations and searches,
it is dificult to generate widely used representation by unsupervised learning.
Thereby, a few studies conducted network representation learning [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] for
embedding the paper node based on the citation context in network structure level.
VOPRec [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] learned vector representation of paper by combining text
information with structural identity in the citation network. DocCit2Vec [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] which
represents paper based on the citation context at the document level is used for
the recommendation system by applying the attention mechanism.
      </p>
      <p>However, it is dificult to consider the contextual features reflected in the
structure of papers. From this perspectives, we extract the context of a
citation through citation networks constructed according to the citation section.
After that, initial embedding is performed considering the network structure
and textual features so that the transformer model can learn various features of
citations.
In this section, we will introduce the detailed approach about the contextual
citation embedding model. As illustrated in Fig. 2, the model composes three
components: (1) extracting citation context, (2) initializing the citation
embedding, (3) graph-transformer based encoder. Therefore, the graph transformer
model learns a representation a target citation by fusing the input initial
embedding vectors. To extract the context of the citation in the first component,
we define our citation network as follows.</p>
      <p>Definition 1 (Citation Network). The citation networks (N ) contains paper
node (P). There are citation relationship (C ∈ R|P|×| P|) between paper nodes.
When paper pi cites paper pj in the nth section, the citation relationship has
weights (w ∈ {0, · · · , n, · · · , N }). This can be formulated as follows:
N = ⟨P, C, w, t⟩ ,
(1)
where t refers to a textual feature vector of P.</p>
      <p>To consider the diferent compositions of the sections of the paper, we
rearrange the paper into four sections from 0 to 3: 0 represents an introduction, 1
represents a related task, 2 represents a methodology, and 3 represents a result.
In this case, the maximum section number is 3. Also, for the text features of
each paper pi, diferent word embedding models can be used.
3.1</p>
      <sec id="sec-2-1">
        <title>Extracting citation context</title>
        <p>Instead of working on the entire citation network N , we extract the citation
context from the citation network. The existing network embedding method
uses a node sampling approach that is weighted according to the importance of
the node. However, since the importance of cited papers is determined by the
purpose of citations, analysis of the purpose and characteristics of each cited
paper is necessary.</p>
        <p>As stated in Sect. 1, we assume that the citation order and location of the
paper relates to the purpose of the citation paper. Thus, we extract various
subgraphs for the target paper by sampling the cited paper for each section
rather than sampling the entire citation paper. In this section, we define the
subgraphs as citation context;
Definition 2 (Citation Context). Given an input citation network N , for
paper pi in the network, citation context is a set of sampled paper at each section
n ∈ [0, N ] This can be formulated as follows:
Γ (pi) = ⟨Γ (pi,0), · · · , Γ (pi,N )⟩ ,
(2)
where Γ (pi,n) represents the contextual citation in section n. This can be
formulated as follows:
Γ (pi,n) = {pj |pj ∈ P∖ {pi} ∧ w(i, j) = n}.
(3)</p>
        <p>To eficiently extract citation context for a batch of papers during the
training of the embedding model, we extend a node sampling algorithm to enable
node sampling for each section. The sampling method iteratively samples a list
of papers for a target paper pi using adaptive sampling depth Kn by section. Let
Spkin− 1 refer to the bag of papers sampled at the (k − 1)th step in nth section. For
each paper node pi in Spkin− 1, we randomly sample cited papers in citation
network with replacement from pi’s one-hop neighbors at the kth step. Through this
process, the papers in pi’s citation context Γ (pi) can cover both local neighbors
of pi and papers far away.
3.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Initializing the citation embedding</title>
        <p>Based on the citation context concept, we obtain the set of sampled subgraph
batches for all the nodes as get G = {g1, g2, · · · , g|P|}, where gi represents the
subgraph sampled for target paper pi. Diferent from general graph in which
the nodes are orderless, in the paper, cited papers are logically constructed, so
the order of citations is meaningful. Therefore, the citation context is serialized
in the order cited in the paper. Formally, we concatenate the target paper pi
and its ordered contextual citation g1, denoted by Ipi = [pi, pi,1, pi,2, · · · , pi,S ],
where pi,j is the jth node in gj , and 1 ≤ j ≤ S. In this section, we define paper
embeddings along the citation order quoted in a paper. The paper embeddings
will be the input to the graph-transformer model.</p>
        <p>For textual embedding, we can embed textual feature vector tj into a shared
feature space for each paper pj ∈ I(pi) in the citation context gi. Simple fully
connected layers can be used for the textual input. This can be formulated as
follows:
xtext(pj ) = Embedding(tj ) ∈ Rd,
(4)
xpos(pj ) = Embedding[p(j)] ∈ Rd,
where p(j) indicates the position-id of paper pj in Ii.</p>
        <p>
          Our main objective is to obtain the representation of the target paper pi
based on the structural roles. To identify the role of each paper, we use the
embedding method based on Weisfeiler-Lehman (WL) algorithm [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. This can
be formulated as follows:
        </p>
        <p>xrole(pj ) = Embedding[r(j)] ∈ Rd,
where r(t) refers to the role label.</p>
        <p>After computing the three terms of embedding, we aggregate them to be the
initial input paper embedding of the graph transformer model. The embedding
fusion is formalized as follows:
where d indicates dimension of the shared feature space.</p>
        <p>The position of a paper in the citation context Ipi reflects the purpose and
characteristic of the citation to the target paper pi. Thus, we suggest that the
order of papers in Ipi is significant in learning citation representations. The
following position-id embedding is used to identify the cited paper order
information of an input list,
(5)
(6)
(7)
(9)
x(pj ) = xtext(pj ) + xpos(pj ) + xrole(pj ) ∈ Rd.</p>
        <p>We define the embedding fusion function as the summation of three embedding
terms.</p>
        <p>Finally, given a target paper pi, we obtain the initial paper embedding of
each paper in its substructure cited paper set. The initial paper embedding for
the paper in the citation context Ipi can be stacked to a embedding matrix. The
embedding matrix is represented by X(pi) = [x(p1), x(p2), · · · , x(pS )] ∈ RS× d.
3.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Graph-transformer based encoder</title>
        <p>The target of the graph-transformer model is to aggregate the initial embedding
of each paper and generate a low-dimensional embedding vector for each of
paper. A numbers of attention layers are stacked to compose the transformer
module. A single layer can be formulated as:</p>
        <p>H(l) = attention H(l− 1) = sof tmax</p>
        <p>Q(l)K(l)⊤
√d</p>
        <p>V(l),
(8)
where H(l) and H(l− 1) denote the output embedding of the l and (l − 1) layer,
Q(l), K(l), and V(l) are the query matrix, key matrix, and value matrix
respectively, and d is the dimension of paper embedding. Specicfially, Q(l), K(l), and
V(l) are calculated as follows:
Q(l) = H(l− 1)WQ(l),

K(l) = H(l− 1)WK(l),
V(l) = H(l− 1)WV(l),
where WQ(l), WK(l), and WV(l) are the weight matrices of the lth attention layer.</p>
        <p>The input of the graph-transformer model H(0) is denoted as the embedding
matrix of the target paper X(pi). The output of the last attention layer H(L) is
defined as the output paper embedding matrix Z of the transformer model.
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Conclusion and future work</title>
      <p>In this paper, we have proposed the learning representation of contextual citation
network. We have defined the citation context by sampling a diferent number of
papers per section. Using a graph transformer model, paper vectors were output
based on salient citations within the citation context. According to our initial
assumption, the results of the embedding model can reflect the role of each
citations in the paper.</p>
      <p>
        The citation purpose of a paper can change dynamically [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. As future work,
we can represent the paper with the meaning of citations that change over time.
In addition, various bibliographic entities such as high reputed journals and
authors afect the citation. If the graph transformer model is extended to
heterogeneous networks in the future, rich interactions between bibliographic information
are able to analyze. Finally, we intend to examine the proposed embedding model
in a large contextual citation network.
      </p>
      <p>Acknowledgements This work was supported by Korea Foundation for Women
In Science, Engineering and Technology (WISET) grant funded by the Ministry
of Science and ICT(MSIT) under the team research program for female
engineering students. (WISET Contract No. 2021-178)</p>
      <p>Jeon et al.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ahmad</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Afzal</surname>
          </string-name>
          , M.T.:
          <article-title>Combining co-citation and metadata for recommending more related papers</article-title>
          .
          <source>In: 2017 International Conference on Frontiers of Information Technology (FIT</source>
          <year>2017</year>
          ). pp.
          <fpage>218</fpage>
          -
          <lpage>222</lpage>
          . IEEE (dec
          <year>2017</year>
          ). https://doi.org/10.1109/fit.
          <year>2017</year>
          .00046
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Boyack</surname>
            ,
            <given-names>K.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klavans</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>Co-citation analysis, bibliographic coupling, and direct citation: Which citation approach represents the research front most accurately</article-title>
          ?
          <source>Journal of the American Society for Information Science and Technology</source>
          <volume>61</volume>
          (
          <issue>12</issue>
          ),
          <fpage>2389</fpage>
          -
          <lpage>2404</lpage>
          (dec
          <year>2010</year>
          ). https://doi.org/10.1002/asi.21419
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cai</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dai</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Bibliographic network representation based personalized citation recommendation</article-title>
          .
          <source>IEEE Access 7</source>
          ,
          <fpage>457</fpage>
          -
          <lpage>467</lpage>
          (
          <year>Dec 2019</year>
          ). https://doi.org/10.1109/access.
          <year>2018</year>
          .2885507
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Eto</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Extended co-citation search: Graph-based document retrieval on a cocitation network containing citation context information</article-title>
          .
          <source>Information Processing &amp; Management</source>
          <volume>56</volume>
          (
          <issue>6</issue>
          ),
          <volume>102046</volume>
          (nov
          <year>2019</year>
          ). https://doi.org/10.1016/j.ipm.
          <year>2019</year>
          .
          <volume>05</volume>
          .007
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Habib</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Afzal</surname>
          </string-name>
          , M.T.:
          <article-title>Sections-based bibliographic coupling for research paper recommendation</article-title>
          .
          <source>Scientometrics</source>
          <volume>119</volume>
          (
          <issue>2</issue>
          ),
          <fpage>643</fpage>
          -
          <lpage>656</lpage>
          (mar
          <year>2019</year>
          ). https://doi.org/10.1007/s11192-019-03053-8
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kataria</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Caragea</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitra</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>C.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rokach</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Recommending citations: translating papers into references</article-title>
          . In: Chen,
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Lebanon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Zaki</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.J</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM</source>
          <year>2012</year>
          ). pp.
          <fpage>1910</fpage>
          -
          <lpage>1914</lpage>
          . ACM Press, Maui,
          <string-name>
            <surname>HI</surname>
          </string-name>
          , USA (Oct
          <year>2012</year>
          ). https://doi.org/10.1145/2396761.2398542
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitra</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>C.L.</given-names>
          </string-name>
          :
          <article-title>A neural probabilistic model for context based citation recommendation</article-title>
          . In: Bonet,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Koenig</surname>
          </string-name>
          , S. (eds.)
          <source>Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI</source>
          <year>2015</year>
          ). pp.
          <fpage>2404</fpage>
          -
          <lpage>2410</lpage>
          . AAAI Press, Austin, Texas, USA (Jan
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Jeon</surname>
            ,
            <given-names>H.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jung</surname>
            ,
            <given-names>J.J.:</given-names>
          </string-name>
          <article-title>Discovering the role model of authors by embedding research history</article-title>
          .
          <source>Journal of Information Science</source>
          <volume>0</volume>
          (
          <issue>0</issue>
          ),
          <volume>01655515211034407</volume>
          (
          <year>2021</year>
          ). https://doi.org/10.1177/01655515211034407
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Jeon</surname>
            ,
            <given-names>H.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>O.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jung</surname>
            ,
            <given-names>J.J.:</given-names>
          </string-name>
          <article-title>Is performance of scholars correlated to their research collaboration patterns?</article-title>
          <source>Frontiers in Big Data</source>
          <volume>2</volume>
          (
          <issue>39</issue>
          ) (
          <year>Nov 2019</year>
          ). https://doi.org/10.3389/fdata.
          <year>2019</year>
          .00039
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kong</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.</surname>
          </string-name>
          :
          <article-title>VOPRec: Vector representation learning of papers with text information and structural identity for recommendation</article-title>
          .
          <source>IEEE Transactions on Emerging Topics in Computing</source>
          <volume>9</volume>
          (
          <issue>1</issue>
          ),
          <fpage>226</fpage>
          -
          <lpage>237</lpage>
          (jan
          <year>2021</year>
          ). https://doi.org/10.1109/tetc.
          <year>2018</year>
          .2830698
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>O.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jeon</surname>
            ,
            <given-names>H.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jung</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          :
          <article-title>Learning multi-resolution representations of research patterns in bibliographic networks</article-title>
          .
          <source>Journal of Informetrics</source>
          <volume>15</volume>
          (
          <issue>1</issue>
          ),
          <volume>101126</volume>
          (Feb
          <year>2021</year>
          ). https://doi.org/10.1016/j.joi.
          <year>2020</year>
          .101126
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>The proximity of co-citation</article-title>
          .
          <source>Scientometrics</source>
          <volume>91</volume>
          (
          <issue>2</issue>
          ),
          <fpage>495</fpage>
          -
          <lpage>511</lpage>
          (dec
          <year>2011</year>
          ). https://doi.org/10.1007/s11192-011-0575-7
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Ma</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.:</surname>
          </string-name>
          <article-title>A review of citation recommendation: from textual content to enriched context</article-title>
          .
          <source>Scientometrics</source>
          <volume>122</volume>
          (
          <issue>3</issue>
          ),
          <fpage>1445</fpage>
          -
          <lpage>1472</lpage>
          (jan
          <year>2020</year>
          ). https://doi.org/10.1007/s11192-019-03336-0
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>MacRoberts</surname>
          </string-name>
          , M.H.,
          <string-name>
            <surname>MacRoberts</surname>
            ,
            <given-names>B.R.:</given-names>
          </string-name>
          <article-title>The mismeasure of science: Citation analysis</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          <volume>69</volume>
          (
          <issue>3</issue>
          ),
          <fpage>474</fpage>
          -
          <lpage>482</lpage>
          (nov
          <year>2017</year>
          ). https://doi.org/10.1002/asi.23970
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Raamkumar</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Foo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pang</surname>
          </string-name>
          , N.:
          <article-title>Using author-specified keywords in building an initial reading list of research papers in scientific paper retrieval and recommender systems</article-title>
          .
          <source>Information Processing &amp; Management</source>
          <volume>53</volume>
          (
          <issue>3</issue>
          ),
          <fpage>577</fpage>
          -
          <lpage>594</lpage>
          (May
          <year>2017</year>
          ). https://doi.org/10.1016/j.ipm.
          <year>2016</year>
          .
          <volume>12</volume>
          .006
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Roman</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shahid</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uddin</surname>
            ,
            <given-names>M.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hua</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maqsood</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Exploiting contextual word embedding of authorship and title of articles for discovering citation intent classification</article-title>
          .
          <source>Complexity</source>
          <year>2021</year>
          ,
          <volume>5554874</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>5554874</lpage>
          :13 (apr
          <year>2021</year>
          ). https://doi.org/10.1155/
          <year>2021</year>
          /5554874
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Shervashidze</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schweitzer</surname>
          </string-name>
          , P.,
          <string-name>
            <surname>van Leeuwen</surname>
            ,
            <given-names>E.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehlhorn</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borgwardt</surname>
            ,
            <given-names>K.M.</given-names>
          </string-name>
          :
          <article-title>Weisfeiler-lehman graph kernels</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          ,
          <fpage>2539</fpage>
          -
          <lpage>2561</lpage>
          (
          <year>Sep 2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Vaswani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shazeer</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parmar</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uszkoreit</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez</surname>
            ,
            <given-names>A.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polosukhin</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Attention is all you need</article-title>
          . In: Guyon,
          <string-name>
            <surname>I.</surname>
          </string-name>
          , von Luxburg,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.M.</given-names>
            ,
            <surname>Fergus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Vishwanathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.V.N.</given-names>
            ,
            <surname>Garnett</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.)
          <source>Advances in Neural Information Processing Systems 30th Annual Conference on Neural Information Processing Systems (NIPS</source>
          <year>2017</year>
          ). pp.
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          . Long Beach, CA, USA (Dec
          <year>2017</year>
          ), https://proceedings.neurips.cc/paper/2017/hash/3f5ee243547dee91fbd053c1c4a845aaAbstract.html
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dai</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Deep memory network with bi-LSTM for personalized context-aware citation recommendation</article-title>
          .
          <source>Neurocomputing</source>
          <volume>410</volume>
          ,
          <fpage>103</fpage>
          -
          <lpage>113</lpage>
          (oct
          <year>2020</year>
          ). https://doi.org/10.1016/j.neucom.
          <year>2020</year>
          .
          <volume>05</volume>
          .047
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , J., Zhang, H.,
          <string-name>
            <surname>Xia</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Graph-bert: Only attention is needed for learning graph representations (</article-title>
          <year>2020</year>
          ), https://arxiv.org/abs/
          <year>2001</year>
          .05140, abs/
          <year>2001</year>
          .05140
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ma</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>Citation recommendations considering content and structural context embedding</article-title>
          . In: Lee,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Moon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Bourgeois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Bennis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Ha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Kwon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Cuzzocrea</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>2020 IEEE International Conference on Big Data and Smart Computing (BigComp</source>
          <year>2020</year>
          ). pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          . IEEE, Busan, Korea (South) (
          <year>Feb 2020</year>
          ). https://doi.org/10.1109/bigcomp48618.
          <year>2020</year>
          .0-
          <fpage>109</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>