<!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>D. Buscaldi);</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Language Processing and Transformers</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Davide Buscaldi</string-name>
          <email>davide.buscaldi@lipn.univ-paris13.fr</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Danilo Dessí</string-name>
          <email>danilo.dessi@gesis.org</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Enrico Motta</string-name>
          <email>enrico.motta@open.ac.uk</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Murgia</string-name>
          <email>marco.murgia3@unica.it</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesco Osborne</string-name>
          <email>francesco.osborne@open.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Diego Reforgiato Recupero</string-name>
          <email>diego.reforgiato@unica.it</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Citation Prediction, Named Entity Recognition, Generative Approach, Natural Language Processing</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Business and Law, University of Milano Bicocca</institution>
          ,
          <addr-line>Milan</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>GESIS - Leibniz Institute for the Social Sciences</institution>
          ,
          <addr-line>Cologne</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Knowledge Media Institute, The Open University</institution>
          ,
          <addr-line>Walton Hall, Kents Hill, Milton Keynes, MK76AA</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Laboratoire d'Informatique de Paris Nord, Sorbonne Paris Nord University</institution>
          ,
          <addr-line>Paris</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Mathematics and Computer Science Department, University of Cagliari</institution>
          ,
          <addr-line>Cagliari</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1952</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>In scientific writing, references are crucial in supporting claims, spotlighting evidence, and highlighting research gaps. However, where to add a reference and which reference to cite are subjectively chosen by the papers' authors; thus the automation of the task is challenging and requires proper investigations. This paper focuses on the automatic placement of references, considering its diverse approaches depending on writing style and community norms, and investigates the use of transformers and Natural Language Processing heuristics to predict i) if a reference is needed in a scientific statement, and ii) where the reference should be placed within the statement. For this investigation, this paper investigates two techniques, namely Mask-filling (MF) and Named Entity Recognition (NER), and provides insights on how to solve this task.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>Citing research papers is common practice to provide evidence, build upon existing knowledge,
and substantiate findings. This activity relies on two main tasks: i) authors have to decide where
to place a citation based on the written statements, and ii) the cited papers should align with
the content of the factual information expressed in the sentences. The first task depends on the
author’s experience in adding references to support claims and does not need knowledge about
the state-of-the-art literature. The second task requires domain and state-of-the-art expertise
to refer to the best and most timely literature. Although these two tasks are related to each
other they can be studied independently; this paper focuses on the first task. In more detail,
this paper proposes:
• A model designed to solve a mask-filling problem using a generative approach.
• A Named Entity Recognition (NER) model designed to label tokens that should precede a
citation.</p>
      <p>We analysed both methods as well as their typical errors. We also introduced a few heuristics
that are able to solve some of the common issues and improve their performance. The proposed
models are investigated on a manually annotated gold standard. In summary, the contribution
of this paper is two-fold:
• An analysis of a mask-filling and NER approach for the reference placement problem.
• An error analysis and heuristics to solve the identified errors.</p>
      <p>We provide the code as well as the data used in our analysis through a GitHub repository1.</p>
      <p>The remainder of this paper is organized as follows. Section 2 presents the related work.
Section 3 describes the proposed models, their results, and an error analysis. Finally, Section 4
concludes the paper and outlook our future research towards a fully-fledged knowledge-aware
reference recommendation system</p>
    </sec>
    <sec id="sec-3">
      <title>2. Related Work</title>
      <p>
        The task of deciding which statements need a citation is relatively recent. To start with, there
exist resources that provide information about why a reference is cited within a sentence. For
example, CiTO [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] provides more than 20 citation types to describe the nature of cited references
in scholarly works. This resource is already leveraged in studies to automatically predict the
intent behind a citation. For example, in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] the applicability of Convolutional Neural Network
(CNN) as well as latent representation are examined to classify research intents. Another recent
study in this direction is [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] where a hybrid approach combining graph and textual embedding
features is proposed to classify citation intents into 6 diferent categories. Other works related
to our examination fall mostly under the umbrella of suggesting a potential suggestion; for
example, in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] the authors first identify paper topics using Restricted Boltzmann Machines, then
they adopted Kullback-Leibler distance to align the extracted topics with candidate references.
In literature is also possible to find tools implementing recommendation systems that use the
context given a reference placeholder to suggest the best references [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Recently, we saw a
proliferation of LLM-based services for supporting academic writing [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], some of which can
also suggest relevant citations (e.g., Textero.ai2, Jenni.ai3). Some other solutions make use of
conversational agents that can support researchers by retrieving and summarizing specific
papers [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. These systems often rely on scholarly knowledge graphs [
        <xref ref-type="bibr" rid="ref10 ref11 ref8 ref9">8, 9, 10, 11</xref>
        ] that describe
1https://github.com/Marcomurgia97/Citation-Prediction-by-Leveraging-Transformers-and-Natural-Language-Pro
cessing-Heuristics
2https://textero.ai/
3https://jenni.ai/
networks of papers according to a variety of metadata and can support advanced research
analysis [
        <xref ref-type="bibr" rid="ref12">12, 13</xref>
        ] as well as hypothesis generation [14].
      </p>
      <p>However, the task of determining whether a statement in a research paper needs a citation is
less explored and only recently has raised the interest of the community working on Artificial
Intelligence (AI) systems for the scholarly domain. For example, the problem is explored
in [15] where a multi-layer perceptron model is proposed to measure the citation worthiness of
scientific statements. Authors in [ 16] tackled the task with various scenarios, including sentence
classification with and without context representation, and sequence modeling using contextual
embeddings and BiLSTMs. While their results showed significant accuracy improvements
with context, their focus remained on deciding whether a citation is necessary, not its precise
placement within the text. Most recently, large language models have also been explored for
this task. For instance, Vajdecka et al. [17] operated a Large Language Model (LLM) to predict
whether a citation is needed in a sentence, achieving F1-scores between 75% and 89%. However,
their approach does not pinpoint the optimal placement of the citation within the sentence.
Additionally, LLMs can exhibit inherent instability even with clear instructions, making them
unsuitable for tasks demanding consistent performance.</p>
    </sec>
    <sec id="sec-4">
      <title>3. Reference Placement Analysis</title>
      <p>This section outlines the task investigated in our analysis, the proposed models, and the resulting
evaluation.</p>
      <sec id="sec-4-1">
        <title>3.1. Task Definition &amp; Approaches</title>
        <p>The tasks investigated in this paper are the Citation Required Task and Citation Placement Task.
Citation Required Task has the main goal of determining whether a sentence needs a citation. It
can be seen as a binary classification task that given a scientific statement as an input returns
1
if at least one citation is needed, 0 otherwise. Citation Placement Task has the main objective to
extend the Citation Required Task by correctly predicting the tokens that should be followed by
citations. The reader notices that our work does not include the classification of the citation
intents. These two tasks are addressed using mask-filling and NER approaches.
Mask-Filling Approach. The first solution is based on a mask-filling approach where certain
words on the original input are masked and the model has the assignment of predicting
appropriate words that can be used to replace the masked ones. To solve the above tasks with

this strategy, we adopted a generative approach. In more detail, given a sentence  , its tokens

 = { 0, … ,   }, and a mask MASK, the mask was moved over the tokens to feed the model. More
precisely, the model was iteratively presented with  tokens at each iteration where 2 &lt;  &lt;  .
For example, for a sentence 1 with tokens  1 = { 01 , … , 
31 }, the model is fed with  1
0
1
1
, 
,  
in the first iteration, 
1
0
1
1
, 
, 
1
2
,  
in the second iteration, and  1
0
, 
1
1
1
2
, 
, 
1
3
,  
in the
third iteration. When the model predicts a reference placeholder, this is recorded by our system
and the next iteration is investigated.</p>
        <p>NER Approach. The second approach investigated in this paper is a NER approach that
usually classifies entities, such as names of persons, organizations, locations, dates, numerical
values, and other relevant information, within a given text. In the context of citation placement
prediction, the NER model is set to classify each token of an input sentence into REGULAR and
CITATION tokens. The former indicates tokens that should not be followed by a citation. The
latter indicates tokens which should be followed by a citation.</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Transformers</title>
        <p>For our exploration, we focused on the following models:
• GPT-2. The generative methodology uses the text-generation capabilities inherent in
transformer models. Among these models, the Generative Pre-trained Transformer (GPT)
family by OpenAI stands out as one of the most widely employed. In our approach, we
specifically utilized the GPT-2 transformer [ 18]. GPT-2 is a generative language model
pre-trained on approximately 40 GB of unlabeled data. Its function is to predict the
subsequent token given an input phrase or word. Our choice fell on the variant of GPT-2
equipped with 117 million parameters and 12 layers. This selection was driven by GPT-2’s
accessibility, integration within popular deep-learning libraries, and the possibility of
running in low-setting machines.
• BERT [19]. BERT, short for Bidirectional Encoder Representations from Transformers,
is renowned for its encoder-only architecture, featuring stacked layers that refine text
representations. Our use of the BERT-base, comprising 12 layers and 110 million
parameters, underscores its usefulness in text classification tasks. BERT’s bidirectional
processing captures contextual information from surrounding words, enabling a nuanced
understanding of language.</p>
      </sec>
      <sec id="sec-4-3">
        <title>3.3. Experimental Setting &amp; Analysis</title>
        <p>This section describes the experimental setting, the evaluation of the models, and our
preprocessing steps to further enhance the overall results.</p>
        <sec id="sec-4-3-1">
          <title>3.3.1. Datasets &amp; Model Implementation</title>
          <p>To set the analysis of the models described above it is deemed to exploit models that have been
trained on scholarly data. For this reason, two strategies are possible: i) use an already trained
model, and ii) fine-tune a pretrained model on newly prepared data. For this, we referred to two
datasets. The first dataset on which our analysis is based is arXiv-80 a dataset consisting of plain
text containing citations from arXiv. A limitation of this dataset is that it contains citations in
diferent formats, a characteristic that might mislead models for the above-mentioned tasks.
Therefore, we also created a new dataset s2orc-9k, a dataset containing 9,000 papers about
Computer Science from s2orc where citations have a unique format. These datasets were used
to create and experiment with the following models:
• NER-s2orc, a BERT-based model that has been fine-tuned on the NER task.
• ArXiv-NLP GPT-24, a pretrained model on the arXiv-80 dataset with papers from the
computational linguistic field.
4https://huggingface.co/lysandre/arxiv-nlp</p>
          <p>Finally, we created a gold standard of 170 sentences from papers about Computer Science
from the year 2023 that were manually labeled by three senior researchers with more than 100
papers in Computer Science. The annotators were asked to label tokens which must be followed
by a citation. The computed inter-annotator agreement was 79.7%. This dataset serves for the
evaluation of the Citation Required Task as well as Citation Placement Task.
3.3.2. Results
We evaluated the models with precision, recall, and f1-score. While for the Citation Required
Task we used standard metrics, for the Citation Placement Task we defined true positives as
the correctly predicted tokens immediately preceding a citation, true negatives as the correctly
predicted tokens that do not precede a citation, false negatives tokens that precede a citation
but erroneously predicted and, finally, false positives as the erroneously predicted tokens that
do not actually precede a citation. The results of the three experimented models are reported in
Table 1 and Table 2 for the Citation Required Task and Citation Placement Task respectively. Both
tables show that the generative approach is more suitable for the proposed task of obtaining a
relatively high f1-score. In addition, both tables show that injecting well-formatted features
during the fine-tuning of the generative approach further improved the model performance.</p>
        </sec>
        <sec id="sec-4-3-2">
          <title>3.3.3. Post-processing Analysis</title>
          <p>In addition, to the evaluation above we performed a manual inspection of the predicted citation
placement from the various models. This revealed some error patterns that can be easily solved
by some natural language processing (NLP) heuristics that implement common practice in
governing paper citations. Here, the reader can find the kind of error and a description of the
heuristic to solve it:
• Citation placeholder between an acronym and its extended terms. The heuristic to solve
this error takes the citation placeholder predicted and moves it after the acronym.
• Citation placeholder after Table, Fig., Figure, etc . The heuristic simply removes the citation
placeholder appearing after these keywords.
• Citation placeholder after a verb . The heuristic labels the tokens of the input text with
part-of-speech tags, and removes the predicted citation placeholders appearing after</p>
          <p>These heuristics were applied to the results of the models above providing further
improvements in solving the Citation Required Task and Citation Placement Task as shown in Table 3
and Table 4. Interestingly, it revealed a downgrading of the performance of the NER approach
in terms of precision that nevertheless did not undermine the overall model, resulting in a
higher f1-score of 0.162 for the Citation Required Task, and of 0.07 for the Citation Placement
Task. For the generative approach, the heuristics increased the models’ performance in terms
of precision and recall. This demonstrates that including insights from citation placement
governance enhances the overall approach, leading to improved performance.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Conclusion and Outlook</title>
      <p>
        In this paper we have investigated two tasks for recognizing whether a scientific sentence
needs a citation, and if yes, after which token the citation should be placed. For this, we
have explored the NER and generative approaches obtaining promising results. We have also
provided some heuristics to better shape the output of the used models and incorporate common
practice in citation placement into our approach. However, our work needs to further develop
in a few directions. More precisely, we plan to complete our approach by investigating and
creating components to recommend potential papers that replace the citation placeholder. To
achieve our goal, we intend to utilize knowledge graphs [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] that describe and interlink scientific
literature and relevant concepts, such as the CS-KG [
        <xref ref-type="bibr" rid="ref9">9, 20</xref>
        ] and AIDA-KG [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Additionally, we
aim to assess the capability of large language models, potentially enhanced with knowledge
injection methods [21], in identifying the most relevant papers for citation. This will also
involve investigating citation intents [15] and exploring various scientific fields that may exhibit
unique citation behaviors.
[13] P. Manghi, A. Mannocci, F. Osborne, D. Sacharidis, A. Salatino, T. Vergoulis, New trends in
scientific knowledge graphs and research impact assessment, 2021.
[14] A. Borrego, D. Dessi, I. Hernández, F. Osborne, D. R. Recupero, D. Ruiz, D. Buscaldi,
E. Motta, Completing scientific facts in knowledge graphs of research concepts, IEEE
Access 10 (2022) 125867–125880.
[15] A. Cohan, W. Ammar, M. Van Zuylen, F. Cady, Structural scafolds for citation intent
classification in scientific publications, arXiv preprint arXiv:1904.01608 (2019).
[16] R. Gosangi, R. Arora, M. Gheisarieha, D. Mahata, H. Zhang, On the use of context for
predicting citation worthiness of sentences in scholarly articles, arXiv preprint arXiv:2104.08962
(2021).
[17] P. Vajdecka, E. Callegari, D. Xhura, A. S. Asmundsson, Predicting the presence of inline
citations in academic text using binary classification, in: The 24rd Nordic Conference on
Computational Linguistics, 2023.
[18] A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, I. Sutskever, et al., Language models are
unsupervised multitask learners, OpenAI blog 1 (2019) 9.
[19] J. Devlin, M.-W. Chang, K. Lee, K. Toutanova, Bert: Pre-training of deep bidirectional
transformers for language understanding, arXiv preprint arXiv:1810.04805 (2018).
[20] D. Dessí, F. Osborne, D. R. Recupero, D. Buscaldi, E. Motta, Scicero: A deep learning and
nlp approach for generating scientific knowledge graphs in the computer science domain,
Knowledge-Based Systems 258 (2022) 109945.
[21] A. Cadeddu, A. Chessa, V. De Leo, G. Fenu, E. Motta, F. Osborne, D. R. Recupero, A. Salatino,
L. Secchi, A comparative analysis of knowledge injection strategies for large language
models in the scholarly domain, Engineering Applications of Artificial Intelligence 133
(2024) 108166.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Shotton</surname>
          </string-name>
          ,
          <article-title>Cito, the citation typing ontology</article-title>
          ,
          <source>in: Journal of biomedical semantics</source>
          , volume
          <volume>1</volume>
          , Springer,
          <year>2010</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lauscher</surname>
          </string-name>
          , G. Glavaš,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Ponzetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Eckert</surname>
          </string-name>
          ,
          <article-title>Investigating convolutional networks and domain-specific embeddings for semantic classification of citations</article-title>
          ,
          <source>in: Proceedings of the 6th international workshop on mining scientific publications</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Berrebbi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Huynh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Balalau</surname>
          </string-name>
          , Graphcite:
          <article-title>Citation intent classification in scientific publications via graph embeddings</article-title>
          ,
          <source>in: Companion Proceedings of the Web Conference</source>
          <year>2022</year>
          ,
          <year>2022</year>
          , pp.
          <fpage>779</fpage>
          -
          <lpage>783</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Zhang,</surname>
          </string-name>
          <article-title>A discriminative approach to topic-based citation recommendation</article-title>
          ,
          <source>in: Pacific-Asia Conference on Knowledge Discovery and Data Mining</source>
          , Springer,
          <year>2009</year>
          , pp.
          <fpage>572</fpage>
          -
          <lpage>579</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Q.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kifer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mitra</surname>
          </string-name>
          , L. Giles,
          <article-title>Context-aware citation recommendation</article-title>
          ,
          <source>in: Proceedings of the 19th international conference on World wide web</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>421</fpage>
          -
          <lpage>430</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Bolanos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Salatino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          , E. Motta,
          <article-title>Artificial intelligence for literature reviews: Opportunities and challenges</article-title>
          ,
          <source>arXiv preprint arXiv:2402.08565</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Meloni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Angioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Salatino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Recupero</surname>
          </string-name>
          , E. Motta,
          <article-title>Integrating conversational agents and knowledge graphs within the scholarly domain</article-title>
          ,
          <source>Ieee Access</source>
          <volume>11</volume>
          (
          <year>2023</year>
          )
          <fpage>22468</fpage>
          -
          <lpage>22489</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>C.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Naseriparsa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          ,
          <article-title>Knowledge graphs: Opportunities and challenges</article-title>
          ,
          <source>Artificial Intelligence Review</source>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>32</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Dessì</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Recupero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Buscaldi</surname>
          </string-name>
          , E. Motta,
          <article-title>CS-KG: A large-scale knowledge graph of research entities and claims in computer science</article-title>
          ,
          <source>in: The Semantic Web - ISWC 2022 - 21st International Semantic Web Conference, Virtual Event, October 23-27</source>
          ,
          <year>2022</year>
          , Proceedings, volume
          <volume>13489</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2022</year>
          , pp.
          <fpage>678</fpage>
          -
          <lpage>696</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Angioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Salatino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Recupero</surname>
          </string-name>
          , E. Motta,
          <article-title>Aida: A knowledge graph about research dynamics in academia and industry</article-title>
          ,
          <source>Quantitative Science Studies</source>
          <volume>2</volume>
          (
          <year>2021</year>
          )
          <fpage>1356</fpage>
          -
          <lpage>1398</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Stocker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Oelen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Y.</given-names>
            <surname>Jaradeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Haris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. A.</given-names>
            <surname>Oghli</surname>
          </string-name>
          , G. Heidari,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hussein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.-L.</given-names>
            <surname>Lorenz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kabenamualu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. E.</given-names>
            <surname>Farfar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Prinz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Karras</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D'Souza</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Vogt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Auer</surname>
          </string-name>
          ,
          <article-title>Fair scientific information with the open research knowledge graph 1 (</article-title>
          <year>2023</year>
          )
          <fpage>19</fpage>
          -
          <lpage>21</lpage>
          . doi:
          <volume>10</volume>
          .323 3/FC- 221513.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Angioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Salatino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Birukou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Recupero</surname>
          </string-name>
          , E. Motta,
          <article-title>Leveraging knowledge graph technologies to assess journals and conferences at springer nature</article-title>
          , in: International Semantic Web Conference, Springer,
          <year>2022</year>
          , pp.
          <fpage>735</fpage>
          -
          <lpage>752</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>