<!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>Combining Knowledge Graphs and Large Language Models to Ease Knowledge Access in Software Architecture Research</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Angelika Kaplan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jan Keim</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Schneider</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anne Koziolek</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ralf Reussner</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Karlsruhe Institute of Technology (KIT)</institution>
          ,
          <addr-line>Karlsruhe</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Science enables progress. Software engineering research and its sub-research fields like software architecture have high economic relevance (cf. "software is eating the world") and serve as an enabler for technical innovations in other research fields as well. The ever-increasing amount of research results and insights creates the need for eficient knowledge documentation and search functions to access relevant information. Till now, scientific papers have been published digitally as PDF documents. Researchers and practitioners can access these documents via digital libraries and scientific search engines mostly with a simple keyword-based search. Literature studies in software engineering show that this procedure (a) requires enhanced information literacy skills even for domain experts and (b) is very time-consuming for aggregating evidence in written PDF articles to a specific field of interest. Consequently, we can derive a need for speeding up the information-finding process and efective knowledge representation as well as aggregation for evidence-based literature studies. As a result, we present our approach idea for efective knowledge access and discovery in software architecture research by combining knowledge graphs and large language models, using the complementary advantages of both concepts.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Knowledge Graphs</kwd>
        <kwd>Large Language Models</kwd>
        <kwd>Scientific Knowledge Access</kwd>
        <kwd>Software Architecture Research</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In the rapidly evolving field of software engineering (SE) and software architecture (SWA), researchers
and practitioners alike are confronted with the task of navigating an ever-expanding universe of
knowledge and the immense growth of the SE literature (cf. Figure 3 in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]). As there is no dedicated
database for scientific software architecture knowledge, one has to use academic search engines to
access relevant information while struggling with bugs (i.e., faults in the search engines) and usability
issues [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. It is a challenging and time-consuming task to find the required information for each unique
inquiry. There are ways, however, to speed up the information-finding process. Traditional methods of
information retrieval are heavily reliant on keyword-based searches that also require manual sifting
through matching documents. Additionally, this method is reliant on exact keyword matches as it
lacks the sophistication needed to understand the context of queries, overall leading to time-consuming
searches and incomplete or irrelevant results.
      </p>
      <p>
        In this context, knowledge graphs (KGs) represent a leap forward in the way we manage and retrieve
information [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. By structuring data in an interconnected network of entities and their relationships,
KGs can ofer a context-aware system that can help leverage the limitations of traditional keyword-based
searches. The key strength of KGs lies in their ability to semantically connect information, which means
they can set the context and relationships between diferent pieces of data. This semantic understanding
enables more accurate and relevant search results, as the system can interpret the intent behind a query
rather than merely matching keywords. In the domain of software engineering research, KGs can
streamline the process of literature reviews and state-of-the-art surveys (cf. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]). With the connections
presented by the KG, researchers can quickly identify influential works, related research topics, and the
development trajectory of specific technologies or methodologies. This is made possible by analyzing
      </p>
      <sec id="sec-1-1">
        <title>Cons</title>
      </sec>
      <sec id="sec-1-2">
        <title>Pros</title>
        <sec id="sec-1-2-1">
          <title>Large Language Models (LLMs)</title>
        </sec>
        <sec id="sec-1-2-2">
          <title>Knowledge Graphs (KGs)</title>
          <p>• General Knowledge
• Language Processing
• Generalizability</p>
        </sec>
      </sec>
      <sec id="sec-1-3">
        <title>Pros</title>
      </sec>
      <sec id="sec-1-4">
        <title>Cons</title>
        <p>• Structural Knowledge
• Accuracy
• Decisiveness
• Interpretability
• Domain-specific and</p>
        <p>Evolving Knowledge
• Incompleteness
• Lacking Language</p>
        <p>
          Understanding
• Unseen Facts
the connections between research papers, authors, and their afiliations, thereby uncovering the network
of knowledge that shapes the field. One example of such a KG is the knowledge management system
Open Research Knowledge Graph (ORKG). The ORKG ofers diferent views and management options
to extract and organize scientific knowledge from published papers. For this, the ORKG relies on users
who (manually) add papers to the system. As a core object, ORKG uses a domain model that specifies a
Research Contribution [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. A Research Contribution is linked to a Research Problem, a Research Method, a
Research Result and to Research Material. To create domain-specific descriptions of publications in a
dedicated research field, users of ORKG can use templates. Users can then perform subsequent tasks
like comparisons and (literature) reviews. However, these tasks are manual.
        </p>
        <p>
          With the uprising of Large Language Models (LLMs), another transformative tool is being integrated
into the knowledge retrieval process [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. LLMs provide an advanced capacity for natural language
understanding and generation, which complements the structured, semantic connections provided by
KGs. LLMs excel in the interpretation of nuances of natural language queries. This allows the user
to ask complex questions in their own words rather than relying on specific keywords. This ability
reduces the barriers to accessing information and, thus, speeds up research tasks. However, LLMs
tend to hallucinate and fabricate information in their responses, making them less reliable. This is also
reflected in current state-of-practice tools (i.e., closed source with unknown database) like Elicit [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ],
SciSpace [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ], and Consensus [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] that lack of transparency due to the black-box nature. They sufer
from the aforementioned limitations, as summarized by Pan et al. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>Our idea is to combine the capabilities of LLMs with the structured data of KGs and, thus, use the
complementary advantages of each concept (as depicted in Figure 1). Combined, LLMs will be able to use
the semantic networks to provide informed, more precise and contextually relevant responses to queries.
Furthermore, we can cross-check and verify responses with the data of the KGs, reducing well-known
negative behaviors of LLMs like hallucinating. This synergy enhances the way information is processed,
understood, and retrieved by leveraging the search for information to a semantic, context-aware level.</p>
        <p>Consequently, we address the research question (RQ): How to construct an approach that combines
the advantages of knowledge graphs and large language models to ease knowledge access (in software
architecture research)?</p>
        <p>The paper is structured as follows. Section 2 introduces example use cases where we plan to use the
approach and where it can be beneficial. In Section 3, we detail the approach by answering our RQ and
outlining preliminary work and results. Related work is discussed in Section 4. Lastly, we conclude the
paper in Section 5.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Example Use Cases</title>
      <p>In this section, we present example use cases for our approach, where we think it can be beneficial.
1. Use Case (Find Papers by Topic): The user is interested in topic  and wishes to find a list of
papers to read about it.</p>
      <p>Prompt/Natural language query: Please find papers that are about topic  .</p>
      <p>Expectation: The system generates a list of papers including persistence identifier (DOI) that are
related to the specified topic  . The list is sorted by their relevance to topic  .
2. Use Case (Find Papers by quoted Sentence): The user recalls reading a particular sentence in a
paper but cannot remember which paper it was. They can only memorize it semantically and cannot
reproduce the full sentence.</p>
      <p>Prompt/Natural language query: Please find papers that are related to the following sentence  .
Expectation: The system generates a list of papers containing related sentences, sorted by relevance.
3. Use Case (Paper Summarization): The user has a lot of papers they need to read through and
would like to receive help to capture the essence of each paper quickly.</p>
      <p>Prompt/Natural language query: Please summarize the key points of the paper with title  .
Expectation: The system generates a structured summary with the key aspects of the paper titled  .
4. Use Case (Search for Methods used in Topic): The user wants to do research for topic  . They
would like to find out about state-of-the-art methodologies that are applied in this topic.
Prompt/Natural language query: Tell me more about methodologies that are used for topic  .
Expectation: The system returns a structured answer that lists and explains each methodology.
5. Use Case (Search for Benchmarks / Datasets for Topic): The user searches for benchmarks,
datasets, or input tools for topic  . They would like to find external resources and artifacts to evaluate
the new solution approach.</p>
      <p>Prompt/Natural language query: Which replication artifacts are commonly used for topic  .
Expectation: The system returns a structured answer that lists and explains each kind of used artifact.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Approach</title>
      <p>
        In this section, we present our idea and architecture to combine KGs and LLMs to enhance and ease
scientific knowledge access in software architecture research for researchers and practitioners by
answering our research question (cf. Section 1). The process is shown in Figure 2. There are two
main parts of the approach: (1) Knowledge graph generation and population, and (2) knowledge
retrieval. We call this approach Knowledge Augmented Retrieval And Generation ENgine (KARAGEN).
The corresponding open-source repository [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] comprises artifacts and projects related to our approach.
3.1. Architecture
First, we plan to support generating and populating KGs like ORKG by aiding the users with the help
of LLM-based classification. In this semi-automated process, when users add papers to the KG, the
classification approach recommends the required information to add research works and publications to
the KG. For example for ORKG, this process includes filling out the respective template or data schema.
We describe a preliminary example for this in Section 3.2.
      </p>
      <p>Second, KARAGEN supports knowledge retrieval by querying and processing the information from the
KGs using LLMs. Users can state their query in natural language. An LLM-based component processes
the query. The processing can include several processing steps (e.g., Named Entity Recognition) as
well as generating queries to the KG to retrieve the relevant data. For each of the retrieved dates, a
knowledge enhancement component can (optionally) further use LLMs to transform and generate
information. For example, the component can summarize research content, classify it or use similar
enhancement strategies. Finally, KARAGEN uses all this information to generate an output for the
Knowledge Graph</p>
      <p>Generation (ORKG)
For each date:</p>
      <p>Knowledge Graph
(retrieval)
getPaper()
Processing Paper
(Classification,
Summarization etc.)</p>
      <p>User
Interface</p>
      <p>SWA</p>
      <p>Paper
Question / Statement
in Natural Language</p>
      <p>Community-driven Process</p>
      <p>LLM-based Classification</p>
      <p>(semi-automated)
Large Language Model</p>
      <p>(LLM)
Named Entity Recognition</p>
      <p>QueryGen</p>
      <p>Meta-Data
ReplicationArtifact 0.1 Paper11..** 0.* ThreatstoValidity</p>
      <p>ERvael0sue.aa*tricohnOMbejtehcotd 0P.r*operty «implicit»</p>
      <p>SPARQL query
Natural Language</p>
      <p>Output</p>
      <p>Large Language Model
(Stuffing, Output)
LLM
Legend:
provides input to
optional or alternatives
colored boxes denote modules
users, ranking data initially based on information from the KG and later including feedback from the
LLM. KARAGEN can also add sources to the generated output as the origin of the data is known.</p>
      <p>
        While the approach has similarities to existing retrieval augmented generation (RAG) approaches,
there are notable diferences. RAG approaches use vector stores that contain natural language texts
together with their embeddings. These embeddings are used to retrieve entries with similar embeddings
to a given query. We implemented such an approach in a prototype that is briefly introduced in
Section 3.3. We plan to enhance the prototype by adding information retrieval from the KG. The approach
can then enhance this information and, thus, potentially increase the usefulness and correctness of the
outputs as depicted in Figure 2. Adding KG into the process allows us to employ error detection strategies
and proof-checking of results before returning them to the users to strengthen correctness. These
strategies include cross-checking LLM-generated results with the KG, where possible. Additionally,
confidence scores, calculated from the confidence of the LLM and/or KG towards some data, allow us to
iflter low-confidence results based on an individual threshold that can be set by the user.
3.2. Data Schema for Software Architecture Research
Konersmann, Kaplan, and Kühn et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] introduced a data schema for the description of SWA research.
They provide a compact description and characterization of this research field and give an overview
of the evaluation and replicability of SWA research objects. In a community efort, they labeled 153
papers in SWA research according to the data schema depicted in Figure 3. This schema ofers a
description approach for a paper’s content as well as the respective meta-data such as bibliographic
information. Central is the Research Object under investigation w.r.t. a certain Property, evaluated with
an Evaluation Method. This schema fosters knowledge description and representation in SWA research
and contributes to an ORKG template (cf. Section 1) in this research field to support the corresponding
ORKG observatory1. We already constructed a prototype for semi-automatic classification as depicted
in Figure 2 (green box). For this, we implemented a classification framework based on a blackboard
pattern (cf. Schmidt et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) supporting (i) prompting techniques and (ii) fine-tuning language models
with hyperparameter searches. This approach is universal by flexibly allowing various input data and
1https://orkg.org/observatory/Software_Architecture_Research [Last accessed on 2024-03-18]
      </p>
      <p>Replication Artifact 0..1
0..*</p>
      <p>Threats to Validity</p>
      <p>1..*
Paper</p>
      <p>1..*
0..*</p>
      <p>Research Object
Evaluation Method</p>
      <p>
        Property
0..*
«implicit»
schemas, so it enables handling evolutionary changes and extensions in the data schema. Moreover, we
can specify variations points (w.r.t. among others data split and data augmentation techniques as well
as the aforementioned classification paradigms) in the experimental setup with focus on open-source
language models like Llama2, Mistral, and Mixtral. Initial experiments with small datasets (based
on [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]) show promising results, but we require further experiments with more data for reliable results
and conclusive statements.
3.3. Software Architecture Research Discovery Engine
The Software Architecture Research Discovery Engine project is aimed at enhancing the capabilities
of an LLM through a modular functional approach (cf. parts of the yellow box as depicted in Figure 2).
In this project, we want to leverage LLMs for a variety of tasks, such as summarizing papers, locating
specific information, and conducting semantic searches within scientific literature (cf. example use cases
in Section 2). The project is currently a work in progress and is in an experimental stage. The prototype
uses papers from the European Conference on Software Architecture (ECSA)2. This enables us to explore
the capabilities of synergy between the LLM and its connection to a scientific data source. Although this
initial dataset does not constitute a KG, we will include a structured KG in the future. Furthermore, the
modular functional approach, facilitated by LangChain [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], enables the creation of an agent equipped
with a diverse toolkit, overseen by an LLM. This LLM is tasked with evaluating the toolkit and selecting
the most appropriate tool based on the given prompt’s intention. Our implementation leverages this
framework to ofer varied functionalities that address the mentioned use cases in Section 2. This design
philosophy ensures that, as new use cases emerge, the system can be seamlessly expanded. We plan
to further enhance the agent’s capabilities by integrating a KG, thereby broadening the scope of its
functionality and improving its efectiveness in navigating and processing scientific literature.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Related Work</title>
      <p>
        In the following, we identify and present three main research areas related to our work.
Scientific Knowledge Graphs in Related Research Fields. First, we regard an approach that
builds upon the ORKG in the research field of requirements engineering (RE) as a related field to SWA.
Karras et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] investigate this KG as a technical infrastructure by building, publishing, and evaluating
an initial KG for empirical research in RE – the so-called KG-EmpiRE. For this, they collected papers
from the research track of the IEEE International Requirements Engineering Conference and extracted
2https://link.springer.com/conference/ecsa [Last accessed on 2024-03-18]
data from 570 papers that report on empirical research. Derived from this, they build and publish the
initial KG-EmpiRE that the research community can constantly maintain, (re-)use, update, and expand.
Structured Forms and Description Approaches for Scientific Knowledge Representation
in Software Architecture. Second, we consider structured forms and description approaches for
software architecture research and its superordinate research field software engineering. In this context,
we refer to the data schema for software architecture research of Konersmann, Kaplan, and Kühn et
al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. The authors made a first attempt to describe this research field. Based on the labeling in a
community efort, there are already limitations of the schema identified. However, there is existing work
by Kaplan et al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] to overcome these limitations and holistically evolve the initial aforementioned
schema by enhancing the respective entities and relations to enrich the corresponding KG.
Access to Software Architecture Knowledge. Lastly, we present state-of-the-art/state-of-practice
access approaches to software architecture knowledge. In this context, we diferentiate between two
main knowledge sources: (1) scientific, i.e., evidence-based knowledge and (2) practical knowledge in
an industrial context. For the first knowledge source, we refer to the serverless pipeline that is based
on the replication package [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] of the work of Konersmann, Kaplan, and Kühn et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. The authors
provide – based on the specification of the data schema – a React webpage Visulite (Visualization of
Literature) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] to enable researchers to have a better overview by browsing scientific SWA literature
in a graphical presentation and interactive analysis of the data. In addition, we regard tools based
on retrieval augmented generation (RAG) like Elicit [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], SciSpace [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ], and Consensus [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] as related
(cf. Section 1). However, these tools are closed source, only rely on open-use language models (like
GPT from OpenAI), and lack domain-specific knowledge (i.e., the underlying database is unknown and
the range of the literature corpus in SWA is vague). For the second knowledge source, we refer to the
work of Soliman et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The authors introduced a new approach for improving knowledge access
and search functions for architecturally relevant information in online developer communities. They
implemented their approach as a web-based search engine. For this, the authors used a combination of
keyword-based search and a specification of the current step in the software architecture to present
better results to the user. As an underlying technology, they used the index-based search engine Apache
Lucene. The data and information that is used to present new architecture knowledge is based on the
content of Stack Overflow, i.e., not considering scientific software architecture knowledge.
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>In this paper, we outlined our approach idea KARAGEN, the Knowledge Augmented Retrieval And
Generation ENgine, that combines knowledge graphs (e.g., ORKG) and LLMs to ease knowledge access,
e.g., in the research field of software architecture. We expect to combine the benefits of knowledge
graphs and LLMs to improve the overall usefulness and correctness of the answers to user queries in
comparison to current state-of-practice tools. From LLMs, we expect to benefit from their capabilities
to understand and interpret nuances of natural language queries as well as generate coherent natural
language output. From KGs, we expect to benefit from the curated and structured knowledge within
the KGs to retrieve and check information. In the next steps, we plan to integrate a prototype into our
existing work. We then will evaluate the prototype. While we expect the approach, in general, to work
for any research area, we will initially limit the study to software architecture research.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was created as part of the NFDI consortium NFDIxCS (nfdixcs.org). This work is funded
by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under the National
Research Data Infrastructure – NFDI 52/1 – project number 501930651 and supported by funding from
the pilot program Core Informatics at KIT (KiKIT) of the Helmholtz Association (HGF).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>V.</given-names>
            <surname>Garousi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <article-title>Highly-cited papers in software engineering:</article-title>
          <source>The top-100, Information and Software Technology</source>
          <volume>71</volume>
          (
          <year>2016</year>
          )
          <fpage>108</fpage>
          -
          <lpage>128</lpage>
          . doi:
          <volume>10</volume>
          .1016/J.INFSOF.
          <year>2015</year>
          .
          <volume>11</volume>
          .003.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rainer</surname>
          </string-name>
          ,
          <article-title>Academic search engines: constraints, bugs, and recommendations</article-title>
          , in: Á.
          <string-name>
            <surname>Kiss</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Marín</surname>
          </string-name>
          , M. Saadatmand (Eds.),
          <source>Proceedings of the 13th International Workshop on Automating Test Case Design, Selection</source>
          and Evaluation,
          <string-name>
            <surname>A-TEST</surname>
          </string-name>
          <year>2022</year>
          , Singapore, Singapore,
          <source>November 17-18</source>
          ,
          <year>2022</year>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>25</fpage>
          -
          <lpage>32</lpage>
          . doi:
          <volume>10</volume>
          .1145/3548659.3561310.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>Unifying large language models and knowledge graphs: A roadmap (</article-title>
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .48550/ARXIV.2306.08302. arXiv:
          <volume>2306</volume>
          .
          <fpage>08302</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>O.</given-names>
            <surname>Karras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wernlein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Klünder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <article-title>Divide and conquer the empire: A communitymaintainable knowledge graph of empirical research in requirements engineering</article-title>
          ,
          <source>in: ACM/IEEE ESEM</source>
          <year>2023</year>
          , IEEE,
          <year>2023</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          . doi:
          <volume>10</volume>
          .1109/ESEM56168.
          <year>2023</year>
          .
          <volume>10304795</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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, in: 10th K-CAP</article-title>
          , ACM,
          <year>2019</year>
          , pp.
          <fpage>243</fpage>
          -
          <lpage>246</lpage>
          . doi:
          <volume>10</volume>
          .1145/3360901.3364435.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Byun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stuhlmüller</surname>
          </string-name>
          ,
          <article-title>Elicit: Language models as research tools</article-title>
          , OECD Publishing, Paris,
          <year>2023</year>
          . doi:https://doi.org/10.1787/174aee8f-en.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Raghuvanshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jain</surname>
          </string-name>
          , G. Vignesh,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shinde</surname>
          </string-name>
          , R. Tondulkar, SciSpace Copilot:
          <article-title>Empowering Researchers through Intelligent Reading Assistance</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>38</volume>
          (
          <year>2024</year>
          )
          <fpage>23826</fpage>
          -
          <lpage>23828</lpage>
          . URL: https://ojs.aaai.org/index.php/ AAAI/article/view/30578. doi:
          <volume>10</volume>
          .1609/aaai.v38i21.
          <fpage>30578</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shinde</surname>
          </string-name>
          , G. Vignesh, R. Tondulkar, SciSpace Literature Review:
          <article-title>Harnessing AI for Efortless Scientific Discovery</article-title>
          , in: N.
          <string-name>
            <surname>Goharian</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Tonellotto</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>He</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Lipani</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>McDonald</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Macdonald</surname>
          </string-name>
          , I. Ounis (Eds.),
          <source>Advances in Information Retrieval</source>
          , Springer Nature Switzerland, Cham,
          <year>2024</year>
          , pp.
          <fpage>256</fpage>
          -
          <lpage>260</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9] Consensus:
          <article-title>AI search engine for research, 2024</article-title>
          . URL: https://consensus.app/.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Knowledge</given-names>
            <surname>Augmented Retrieval And Generation ENgine (KARAGEN)</surname>
          </string-name>
          ,
          <year>2024</year>
          . URL: https://gitlab. com/software-engineering-meta-research/karagen.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Konersmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kühn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Heinrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Koziolek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. H.</given-names>
            <surname>Reussner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jürjens</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>al-</article-title>
          <string-name>
            <surname>Doori</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Boltz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ehl</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Fuchß</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Großer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Hahner</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Keim</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Lohr</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Saglam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Schulz</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Töberg</surname>
          </string-name>
          ,
          <article-title>Evaluation methods and replicability of software architecture research objects</article-title>
          ,
          <source>in: 19th IEEE ICSA</source>
          <year>2022</year>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>157</fpage>
          -
          <lpage>168</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICSA53651.
          <year>2022</year>
          .
          <volume>00023</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Schmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Rohnert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Buschmann</surname>
          </string-name>
          ,
          <article-title>Pattern-oriented software architecture</article-title>
          , volume
          <volume>1</volume>
          :
          <article-title>a system of patterns</article-title>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Konersmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kühn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Heinrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Koziolek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. H.</given-names>
            <surname>Reussner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jürjens</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>al-</article-title>
          <string-name>
            <surname>Doori</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Boltz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ehl</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Fuchß</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Großer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Hahner</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Keim</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Lohr</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Saglam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Schulz</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Töberg</surname>
          </string-name>
          ,
          <article-title>Replication package of "evaluation methods and replicability of software architecture research objects"</article-title>
          ,
          <source>in: IEEE 19th ICSA</source>
          <year>2022</year>
          , IEEE,
          <year>2022</year>
          , p.
          <fpage>58</fpage>
          . doi:
          <volume>10</volume>
          .1109/ICSA-C54293.
          <year>2022</year>
          .
          <volume>00021</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>LangChain</surname>
          </string-name>
          ,
          <year>2024</year>
          . URL: https://langchain.com/.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kühn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. H.</given-names>
            <surname>Reussner</surname>
          </string-name>
          ,
          <article-title>Unifying classification schemes for software engineering meta-research</article-title>
          ,
          <source>CoRR abs/2209</source>
          .10491 (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .48550/ARXIV.2209.10491. arXiv:
          <volume>2209</volume>
          .
          <fpage>10491</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Visulite</surname>
          </string-name>
          (visualization
          <source>of literature) based on data schema of 10.1109/ICSA53651</source>
          .
          <year>2022</year>
          .
          <volume>00023</volume>
          ,
          <year>2023</year>
          . URL: https://softwarearchitectureresearch.github.io/visulite/.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Soliman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Rekaby</given-names>
            <surname>Salama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Galster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Zimmermann</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Riebisch, Improving the Search for Architecture Knowledge in Online Developer Communities</article-title>
          , in: Proceedings - 2018
          <source>IEEE 15th International Conference on Software Architecture, ICSA</source>
          <year>2018</year>
          ,
          <article-title>Institute of Electrical and Electronics Engineers Inc</article-title>
          .,
          <year>2018</year>
          , pp.
          <fpage>186</fpage>
          -
          <lpage>195</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICSA.
          <year>2018</year>
          .
          <volume>00028</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>