<!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>ARDIAS: AI-Enhanced Research Management, Discovery, and Advisory System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Debayan Banerjee</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Seid Muhie Yimam</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sushil Awale</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chris Biemann</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>House of Computing and Data Science, Universität Hamburg</institution>
          ,
          <addr-line>Hamburg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>TIB-Leibniz Information Centre for Science and Technology</institution>
          ,
          <addr-line>Hannover</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this work, we present ARDIAS, a web-based application that aims to provide researchers with a full suite of discovery and collaboration tools. ARDIAS currently allows searching for authors and articles by name and gaining insights into the research topics of a particular researcher. With the aid of AI-based tools, ARDIAS aims to recommend potential collaborators and topics to researchers. In the near future, we aim to add tools that allow researchers to communicate with each other and start new projects.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;scholarly data</kwd>
        <kwd>scholarly community</kwd>
        <kwd>research recommendations</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>In spite of the existing tools available for the discovery of research work, a major gap remains in tools that allow collaboration. ARDIAS aims to enable the following workflow:</title>
        <p>
          Historically, scientific research has been performed in
closely-knit groups inside individual institutes or
corporations, with little to no collaboration across diferent
geographies [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. The usual mode of exchange of scien- • User visits ARDIAS (either logged in or as a guest)
tific findings used to be publishing articles in journals, • User discovers relevant research and authors
and more rarely, researchers used to meet each other in • User communicates with the relevant author of
person during scientific conferences. interest and starts a new research project on the
        </p>
        <p>With the advent of the Internet, it is finally possible platform
to follow current research topics and researchers more • The project members track experimental progress
closely online. Institutions host on their websites a col- and log results on the platform
lection of publications by their researchers, along with • The research article is drafted on ARDIAS and
some contact details. Moreover, conferences and journals submitted to a conference or journal
often publish their proceedings online for the public to
access. In the case of open-access publications, people
pmuabyliaccactieosnsst,huesdeorscummuesnttesitfhreeer opfaycoastf,eheoowrebveelro,nfogrtopaaind 2. Related Work
afiliated institute to access these articles. For the purpose of scholarly communication and its
meth</p>
        <p>
          To make such research even more accessible, in the ods, most solutions so far have emphasized on techniques
past decade, a number of aggregators of research arti- for linking metadata about articles, people, data and other
cles have appeared online. Some notable products and relevant concepts [
          <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
          ]. The common mode today is
projects in this area are DBLP1, OpenAlex2, Research to extend the representation to a document structure
Gate3, Microsoft Academic Network, Semantic Scholar4, [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Some other solutions propose more comprehensive
Google Scholar5 and ORKG6. conceptual models for scholarly knowledge that capture
The Third AAAI Workshop on Scientific Document Understanding 2023 problems, methods, theories, statements, concepts, and
$ debayan.banerjee@uni-hamburg.de (D. Banerjee); their relations [
          <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
          ]. Our focus is not to reinvent any of
seid.muhie.yimam@uni-hamburg.de (S. M. Yimam); these methods, but to use them as a baseline system for
(sCu.shBiile.amwaanlen@)tib.eu (S. Awale); chris.biemann@uni-hamburg.de our initial discovery phase within ARDIAS.
        </p>
        <p>
          © 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License The next step in ARDIAS is a recommendation
com1 hCPWrEooUrctkReshtdoinpgpssIhStpN:/c1e:6u1r3-w/-0s.o7r3g/dbAClttpEri.bUoutRriognW/4.0oInrtekrnsahtioonpal (PCCroBYce4.0e).dings (CEUR-WS.org) cphoinneenlte,awrnhiinchg rheasseasrecehn isniggneinficaenratl,acatnivditayls[o i7n]
tihnemfoa-2https://openalex.org/ cused area of scholarly research [
          <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
          ]. For the purpose of
34hhttttppss::////wwwwww..rseesmeaanrcthicgsactheo. nlaert./org/ recommending relevant future research topics, potential
5https://scholar.google.com/ co-authors, and relevant citations, one of the required
6https://orkg.org/ steps is to extract relevant information from a scientific
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. Architecture of the System</title>
      <p>
        manuscript and then process it. In this regard, there are
plenty of works, particularly in the area of information
extraction from scholarly documents [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Figure 2 shows the diferent components of ARDIAS. In
      </p>
      <p>
        The task of finding relevant people with a given ex- the back end, ARDIAS currently depends on the
Opepertise is called Expert Finding, and several works have nAlex API to fetch and update the latest research
artifocused on this problem [
        <xref ref-type="bibr" rid="ref11 ref12 ref13 ref14">11, 12, 13, 14</xref>
        ]. For this task cles and corresponding metadata. A local copy of the
certain datasets have been developed, for example, the OpenAlex data is stored in an Elasticsearch instance.
Adenriched version of DBLP 7 provided by the ArnetMiner ditionally, the OpenAlex data dump is converted into a
project [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], or the W3C Corpus 8 of TREC used by Balog Knowledge Graph (KG) and indexed into a graph database
et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. hosted in Neo4J locally. The front end currently
inter
      </p>
      <p>
        From a communication perspective, the internet has faces with 1) OpenAlex API 2) Elasticsearch and 3) Neo4J
provided several new avenues for interaction among re- to display relevant information to the user. A batch of
searchers. It has been shown that social media is an helper scripts downloads the latest OpenAlex updates
efective means of collaborative learning in new domains and updates the local Neo4J graph.
[
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Researchers are active on privately owned plat- At the moment we do not have a local database for
forms like Linkedin and Twitter, however, very recently storing user data, settings, or preferences. Hence the
there has been a migration of researchers from Twit- user experience is largely built for a user who has not
ter to Mastodon9. Mastodon is an open-source publish- registered or logged in. However, a login feature does
subscribe protocol-based broadcast platform that is dis- exist that stores login information in memory per session.
tributed and self-hosted in nature. Among the current In the near future, we plan to implement a more
comtop Mastodon servers for the specific category of AI re- prehensive login and registration system which verifies
searchers, sigmoid.social seems to be the most popular. users thoroughly before onboarding them to ARDIAS.
Hosting a Mastodon server, and an XMPP server to en- In the future, additional infrastructure for machine
able real-time collaboration is a possible future direction learning and big data ingestion shall be added to ARDIAS.
that ARDIAS may take to enable communication among
researchers. 4. Features of ARDIAS
      </p>
      <p>For collaboration, several products and projects exist
that allow tracking, collection, analysis, and visualization 4.1. Discovery
of scientific results. Some such platforms include
Overleaf, TensorBoard, Wandb, Trello, GitHub, and others. In
ARDIAS, it is our endeavor to select the best features
from existing products and implement an open-source
version for them.</p>
      <sec id="sec-2-1">
        <title>7https://aminer.org/lab-datasets/expertfinding/</title>
        <p>8https://tides.umiacs.umd.edu/webtrec/trecent/parsed_w3c_
corpus.html
9https://mastodon.social/explore</p>
      </sec>
      <sec id="sec-2-2">
        <title>The first stage of the workflow of ARDIAS is discovery.</title>
        <p>This begins with user login, where a first-time user is
presented with the view shown in Figure 4. The
OpenAlex data we consume may contain several authors of
the same name and several orphan nodes for the same
author. Hence, it is important to ask the authors to identify
themselves on the first login, and to solve this problem,
our login page produces a list of authors by text match
over name and afiliation. The user can then select the
correct author from the list and self-identify.
Additionally, it is also possible for a user to explore most features
of ARDIAS without logging in. Scholarly work discovery
begins with the discovery of one’s own work on the
platform. If the user is logged in, ARDIAS fetches the works
via an OpenAlex API call and populates the Works page.
If the user is not logged in, the user can search for himself
or herself using the prominently located search bar in the
UI. The search box allows a user to fetch relevant results
based on a handful of diferent criteria, namely 1) Works
2) Author 3) Institutions 4) Venues.
4.1.1. Works
Searching by works criterion displays a paginated results
page showing the relevant publications based on a text
search of the title. The page contains the title of the
paper, the list of authors, the publication year, and the
venue. A short abstract follows, and at the bottom, the
citation count is displayed. The author names and venue
names are hyperlinks that may be clicked, and they open
to the respective author and venue pages. On clicking
the title of the work itself, a dedicated publication page
is loaded which additionally displays DOI information,
OpenAlex and Microsoft Academic Graph (MAG) IDs,
and keywords for this work. A tab is also available to
view the citations of this work from where the citing
papers may also be visited. The next section of the page
displays similar papers to the current work. The last
section of the Work page contains a discussion section,
where logged-in users may add comments and start a
discussion on the paper topic.
4.1.2. Authors
As depicted in Figure 1, searching by author fetches a list
of authors matched by text search, with a short display of
their institute of afiliation, the number of publications,
citation counts, and OpenAlex and MAG IDs. Several
authors may share the same name, hence the institution
name is helpful in disambiguating the authors. On
clicking on an author’s name on this page, a more detailed
author page opens, which displays the published works
of the author in sorted order of citation counts. If a
publication in this list is Open Access, it is marked as so. The
results on this page may be further sorted based on title,
date, and citations. In a separate tab, one can see the
co-author network for the author, arranged in a
hot-spotstyled graphic. The subsequent tab displays the research
focus areas of the author in a similar style.
4.1.3. Institution
Searching by institution displays a paginated list of
institutes based on text search similarity of the institute
name. The title for each institute displays the name and
location, while the subsequent lines display the website
address, the sector of establishment, and the acronym
popularly used for the institute if any. This short
selection of information allows disambiguation of similarly
named institutes. On clicking on an institute, a dedicated
institute page opens, which on the right side displays
the institute logo, institute name, location, homepage,
Wikipedia links, publication, and citation counts. In the
central section of the page, a list of authors belonging to
this institute sorted by citation counts is displayed.
in the scholarly KG hosted in the graph database. This
allows author A to find common connections to author
B. This makes communication and collaboration stages
possible for author A.</p>
        <sec id="sec-2-2-1">
          <title>4.3. Communication</title>
        </sec>
        <sec id="sec-2-2-2">
          <title>4.2. Recommendation</title>
          <p>4.1.4. Venue</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Searching by venue displays a list of similarly named</title>
        <p>venues with corresponding historical publication and
citation counts. Clicking on a venue opens a new page that
lists the publications for the given venue in sorted order
based on citations. This sorting order can be changed to
be based on title and date.</p>
      </sec>
      <sec id="sec-2-4">
        <title>After the phases of discovery and recommendation, an</title>
        <p>author may want to get in touch with another author on
our platform. At the moment we have not implemented
any communication method explicitly, however, the
vision is to enable this kind of communication through an
open-source and well-established messaging platform.
Specific methods need to be developed to keep spam at
bay, and verification of users on our platform remains
vital. Some methods for logged-in user verification may
include making an institution or work e-mail mandatory
for sign-up, and also having to supply an ORCID or a
similar academic network ID.</p>
        <p>Recently there has been an exodus of academics
shifting from the social media site of Twitter to Mastodon.
Twitter is a privately held social media company that
allows micro-blogging, while Mastodon is a free and
opensource software that allows the hosting of independent
and federated nodes, each with its own set of policies.
ARDIAS may host a dedicated Mastodon node for
researchers to join and also allow communication across
other Mastodon nodes on our platform. From a
communications perspective, we additionally plan to explore the
XMPP protocol to allow chat between researchers who
already accept each other’s request to communicate.</p>
      </sec>
      <sec id="sec-2-5">
        <title>Users of ARDIAS also receive recommendations from the</title>
        <p>system on a number of diferent categories, both with
and without the aid of Machine Learning methods.</p>
        <p>Some basic non-ML recommendations are as follows: 1)
ARDIAS produces a list of researchers who work at the
same institute as the user 2) ARDIAS is able to show
the least number of hops between a user and another
researcher on the platform through work and author
nodes. 3) ARDIAS produces a list of related sub-topics
of interest that are currently popular in the research
community.</p>
        <p>Some ML-based recommendations we plan for ARDIAS
in the future include 1) a list of similar researchers based
on common interests. This would be achieved via
graphbased node embedding algorithms and nearest neighbor
computations of the embedding space 2) a list of similar 4.4. Collaboration
works based on common publications using similar node After researchers have discovered each other and decided
embedding methods 3) a list of potential and high-impact to collaborate on a project, ARDIAS aims to provide a
baresearch topics based on node prediction approaches in sic platform to start and manage a project. At the moment
graph-based ML. the components are still in the planning phase, however,
Apart from recommendations in the discovery process of some basic requirements for project collaboration are
research and authors, we see scope for recommendations clear. On the creation of a project on the platform, the
algorithms in the manuscript authoring phase as well. For collaborating researchers should gain access to an online
example, a beginner scholar may be making elementary document editing and storage platform, which allows not
formatting, grammar, spelling, or structural errors in just plain text documents, but also binary files, models,
the paper being authored. In some cases, a significant and archived logs. The project space should have an
issection like Related Work may be missing. In such cases, sue tracker so planning on individual components of the
AI-based technologies will be able to help the scholar project is possible and progress is trackable. It would also
with helpful suggestions on how to improve the draft. be desirable to provide an online platform that allows
Another area where AI-based recommendations may help various forms of visualization of results, and logging of
in the authoring process is the automatic suggestion of experimental data. Finally, it would be desirable to allow
citations for the given topic of the manuscript, providing editing of the research manuscript itself on the platform,
an easy selection between diferent formats of citations perhaps through a LaTeX editor.
within the Latex editor window, eg: BibTex, Crossref, etc.</p>
        <p>A special aspect of non-ML recommendation is depicted
in Figure 3. If author A wishes to work with author B,
ARDIAS fetches the shortest path between the two nodes</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>5. Use cases and applications</title>
      <p>Searching for research projects and collaborators:
ARDIAS shall store information about users and their
expertise, lists of tools and datasets, machine learning
models and their applications, detailed documentation of
projects, concept notes, as well as research publications.
Traditionally, one should look for a research collaborator
either by searching online profiles, seeking or
contacting the responsible ofice in the research institute, or
advertising a call for collaboration. ARDIAS can help by
automatically searching or recommending collaborators
using the knowledge stored in the repository. The
system ranks and recommends collaborators based on their
expertise and relevance.</p>
      <p>Research approach suggestion: Research on a
multidisciplinary project is challenging. Medical researchers
are aware of problems in their discipline but they might
lack the proper approaches to build an automated
system with a machine learning component. Similarly, in a
computational linguistic research project, experts from
diferent fields such as linguistics, mathematics,
statistics, and computer science work together. Employing
computational linguistics approaches for social science
projects needs a further understanding of diferent
research problems. Using an AI-enhanced system, where
prior multidisciplinary projects are indexed, can help in
suggesting research approaches for new research
problems.</p>
      <p>Virtual help-desk: In large research institutes or
companies, where there are several research projects, tools, and
research collaborators, it is dificult to provide accurate
information. A research knowledge management system
with interactive UI can help in finding requested services
that can be enhanced with faceted search functionality
to support help desk professionals.</p>
    </sec>
    <sec id="sec-4">
      <title>6. Conclusion</title>
      <sec id="sec-4-1">
        <title>In this work, we described ARDIAS, which is a web appli</title>
        <p>cation with a vision for researchers to discover,
communicate and collaborate on new research topics. The demo
is made available via a public URL10. The development is
currently at an initial phase, with basic features having
been implemented. We present our long-term goal for
ARDIAS as being a common platform for researchers
from all backgrounds and fields to discover each other
and collaborate.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>7. Acknowledgements</title>
      <sec id="sec-5-1">
        <title>ARDIAS is funded by the "Idea and Venture Fund" re</title>
        <p>search grant by Universität Hamburg, which is part of
10https://ardias.ltdemos.informatik.uni-hamburg.de/
the Excellence Strategy of the Federal and State
Governments.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Olson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zimmerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bos</surname>
          </string-name>
          ,
          <source>Scientific Collaboration on the Internet</source>
          , The MIT Press,
          <year>2008</year>
          . URL: https://dl.acm.org/doi/10.5555/1522423.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Aryani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Research Graph:
          <article-title>Building a Distributed Graph of Scholarly Works using Research Data Switchboard (</article-title>
          <year>2017</year>
          ). URL: https://bridges.monash.edu/articles/preprint/ Research_Graph_
          <article-title>Building_a_Distributed_Graph_ of_Scholarly_Works_using_Research_Data_ Switchboard/4742413.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Burton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Koers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Manghi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stocker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fenner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Aryani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. La</given-names>
            <surname>Bruzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Diepenbroek</surname>
          </string-name>
          , U. Schindler,
          <article-title>The scholix framework for interoperability in data-literature information exchange, D-Lib Magazine 23 (</article-title>
          <year>2017</year>
          ). URL: http://mirror.dlib. org/dlib/january17/burton/01burton.html.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Peroni</surname>
          </string-name>
          , Law, Governance and Technology Series,
          <volume>15</volume>
          ,
          <year>2014</year>
          . URL: https://link.springer.com/book/10. 1007/978-3-
          <fpage>319</fpage>
          -04777-5.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>B.</given-names>
            <surname>Brodaric</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Reitsma</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Qiang,</surname>
          </string-name>
          <article-title>SKIing with DOLCE: Toward an e-Science Knowledge Infrastructure</article-title>
          ,
          <source>in: Proceedings of the 2008 Conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS</source>
          <year>2008</year>
          ),
          <year>2008</year>
          , p.
          <fpage>208</fpage>
          -
          <lpage>219</lpage>
          . URL: https://dl.acm.org/ doi/10.5555/1563953.1563975.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. Y.</given-names>
            <surname>Jaradeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Oelen</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>
            <surname>J. D'Souza</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Kismihók</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Stocker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Auer</surname>
          </string-name>
          , Open Research Knowledge Graph:
          <article-title>Next Generation Infrastructure for Semantic Scholarly Knowledge</article-title>
          ,
          <source>in: Proceedings of the 10th International Conference on Knowledge Capture, K-CAP '19</source>
          , New York, NY, USA,
          <year>2019</year>
          , p.
          <fpage>243</fpage>
          -
          <lpage>246</lpage>
          . URL: https://doi.org/10.1145/ 3360901.3364435.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Isinkaye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Folajimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ojokoh</surname>
          </string-name>
          ,
          <article-title>Recommendation systems: Principles, methods and evaluation</article-title>
          ,
          <source>Egyptian Informatics Journal</source>
          <volume>16</volume>
          (
          <year>2015</year>
          )
          <fpage>261</fpage>
          -
          <lpage>273</lpage>
          . URL: https://www.sciencedirect.com/science/ article/pii/S1110866515000341.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          , H. Liu,
          <string-name>
            <given-names>I.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cao</surname>
          </string-name>
          , Scientific Article Recommendation:
          <article-title>Exploiting Common Author Relations and Historical Preferences</article-title>
          ,
          <source>IEEE Transactions on Big Data</source>
          <volume>2</volume>
          (
          <year>2016</year>
          )
          <fpage>101</fpage>
          -
          <lpage>112</lpage>
          . URL: https: //doi.org/10.1109%
          <fpage>2Ftbdata</fpage>
          .
          <year>2016</year>
          .
          <volume>2555318</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Färber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jatowt</surname>
          </string-name>
          , Citation Recommendation: Approaches and Datasets,
          <source>International Journal on Digital Libraries</source>
          <volume>21</volume>
          (
          <year>2020</year>
          )
          <fpage>375</fpage>
          -
          <lpage>405</lpage>
          . URL: https: //doi.org/10.1007%
          <fpage>2Fs00799</fpage>
          -
          <fpage>020</fpage>
          -00288-2.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Nasar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. W.</given-names>
            <surname>Jafry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. K.</given-names>
            <surname>Malik</surname>
          </string-name>
          ,
          <source>Information Extraction from Scientific Articles: A Survey, Scientometrics</source>
          <volume>117</volume>
          (
          <year>2018</year>
          )
          <fpage>1931</fpage>
          -
          <lpage>1990</lpage>
          . URL: https://doi.org/10.1007/s11192-018-2921-5.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>K.</given-names>
            <surname>Balog</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Azzopardi</surname>
          </string-name>
          , M. de Rijke,
          <article-title>Formal Models for Expert Finding in Enterprise Corpora</article-title>
          ,
          <source>in: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '06</source>
          ,
          <year>2006</year>
          , p.
          <fpage>43</fpage>
          -
          <lpage>50</lpage>
          . URL: https://doi.org/ 10.1145/1148170.1148181. doi:
          <volume>10</volume>
          .1145/1148170. 1148181.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>H.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          ,
          <article-title>Probabilistic Models for Expert Finding</article-title>
          , in: G. Amati,
          <string-name>
            <given-names>C.</given-names>
            <surname>Carpineto</surname>
          </string-name>
          , G. Romano (Eds.),
          <source>Advances in Information Retrieval</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>418</fpage>
          -
          <lpage>430</lpage>
          . URL: https://link.springer.com/chapter/10. 1007/978-3-
          <fpage>540</fpage>
          -71496-5_
          <fpage>38</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>P.</given-names>
            <surname>Serdyukov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Rode</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          ,
          <article-title>Modeling multi-step relevance propagation for expert finding</article-title>
          ,
          <source>in: Proceedings of the 17th ACM Conference on Information and Knowledge Management</source>
          ,
          <source>CIKM '08</source>
          ,
          <year>2008</year>
          , p.
          <fpage>1133</fpage>
          -
          <lpage>1142</lpage>
          . URL: https://doi.org/10.1145/ 1458082.1458232.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>T.</given-names>
            <surname>Fischer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Remus</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Biemann, LT expertfinder: An evaluation framework for expert finding methods, in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics (Demonstrations)</article-title>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>98</fpage>
          -
          <lpage>104</lpage>
          . URL: https://aclanthology.org/N19-4017.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , L. Yao,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Su</surname>
          </string-name>
          , ArnetMiner: Extraction and Mining of Academic Social Networks,
          <source>in: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , KDD '08,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery,
          <year>2008</year>
          , p.
          <fpage>990</fpage>
          -
          <lpage>998</lpage>
          . URL: https://doi.org/10.1145/1401890.1402008.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J. A. N.</given-names>
            <surname>Ansari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <article-title>Exploring the role of social media in collaborative learning the new domain of learning</article-title>
          ,
          <source>Smart Learning Environments</source>
          <volume>7</volume>
          (
          <year>2020</year>
          )
          <article-title>9</article-title>
          . URL: https://doi.org/10.1186/s40561-020-00118-7.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>