<!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>Entity Alignment for Knowledge Graphs in the Context of Supply Chain Risk Management</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rebeka Gadzo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yushan Liu</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Humboldt University</institution>
          ,
          <addr-line>Unter den Linden 6, 10117 Berlin</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Siemens AG</institution>
          ,
          <addr-line>Otto-Hahn-Ring 6, 81739 Munich</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Supply chain risk management has become increasingly important during challenging times characterized by various economic, health, and political crises. To address risk mitigation issues, it is required to lay the groundwork for future risk prediction algorithms. This paper focuses on utilizing knowledge graphs, given their efectiveness in capturing and organizing complex supply chain information. The main objective is to investigate methodologies for aligning two separate knowledge graphs, where one represents supply chain data and the other external macroeconomic data. Expansion of the supply chain graph with pertinent macroeconomic information enables a better assessment and prediction of risks. The main outcome of this research work is to develop a framework based on a real-world scenario applicable to diferent use cases.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Knowledge Graph</kwd>
        <kwd>Entity Alignment</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Supply Chain Risk Management</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Supply chain risk management (SCRM) addresses strategies and their implementation for
managing various risks along the supply chain based on their continuous assessment. Ensuring
the highest possible extent of continuity of a supply chain and reducing its vulnerability are
two of SCRM’s primary goals [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Exogenous supply chain risks occur outside the ecosystems of companies and suppliers. They
can, therefore, only be influenced by these ecosystems to a limited extent [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Recent notable
examples are the pandemic-related efects of COVID-19 and the political and military conflict
in the Ukraine. In addition, this risk type also includes legal risks, environmental and natural
disasters, as well as market risks in individual regions. Exogenous risks could thus be identified
through macroeconomic data such as economic facts, trends, and cause-efect relationships. The
identification of these risks becomes more efective through the integration of macroeconomic
knowledge into a company’s supply chain data. Entity alignment between diferent data sources
can facilitate this integration.
      </p>
      <p>
        Knowledge graphs (KGs) have gained significant importance in recent years by enabling
integration, management, and value extraction from diverse sources of data at large scale
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Additionally, they have been proven as a suitable data source for the purposes of entity
alignment [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and therefore adequate for the given problem statement.
      </p>
      <p>
        This paper utilizes the three following techniques for entity aligning between two knowledge
graphs: Dedupe [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], Ditto [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], and GPT-3 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. A case study on a Siemens supply chain
management (SCM) KG is performed. The overall objective is to devise a general framework that
can extend the Siemens SCM KG by linking it to an external macroeconomic KG. This research
conducts an in-depth examination of supply chain and macroeconomic data, aiming to identify
shared attributes that facilitate the dataset merging process, and assesses the performance of
the three graph integration approaches.
      </p>
      <p>In the introduction, the significance of entity alignment for mitigating supply chain risks is
emphasized, setting the stage for the research theme. Section 2 provides an overview of existing
literature in the field of entity alignment between KGs and the importance of KGs in the context
of SCRM. It encompasses previous research eforts and their motivations. Section 3 describes
three algorithms utilized for entity alignment between KGs, outlining their functionalities and
methodologies. Section 4 focuses on the two primary data sources: the CoyPu KG1 and Siemens’
supply chain data, with an emphasis on suppliers from Germany, the USA, and China, and
compares the schemas of both graphs. Section 5 details the experimental process, including the
steps involved in entity alignment, and presents the research results. The conclusion summarizes
the findings, discusses implications for SCRM, and outlines potential future research in the field
of entity alignment between KGs in the context of SCRM.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>While research on entity alignment across KGs exists, there is a noticeable gap in studies
specifically addressing entity alignment between KGs within SCM and SCRM contexts.</p>
      <p>
        Liu et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] utilized a KG to represent supply chain information from Siemens. By employing
advanced KG completion techniques, the authors predicted missing connections within the graph
and computed importance scores for suppliers through graph analysis algorithms. Brockmann
et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] focused on augmenting a supply chain KG by available web data using graph neural
network models for predicting possible missing links in the created graph. Karam et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
implemented Bayesian networks to propose their approach called Resilience of Supply Chain
Analyzer (ReSCA), which should enable an early identification of bottlenecks in supply chains
and a timely prediction of the consequences. Li et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] presented the construction of a
supply chain KG by performing data cleaning, desensitization, categorization, and storage of
information obtained from various data sources related to the rail transportation industry’s
supply chain. CoyPu2, a knowledge graph project within the resilience domain, operates as a
semantic data platform for crisis management and supply chain data exploration. It enables
      </p>
      <sec id="sec-2-1">
        <title>1https://coypu.org/ergebnisse/knowledge-graph 2https://coypu.org</title>
        <p>
          users to analyze complex data, make informed decisions, and contribute to economic resilience
by integrating, structuring, and evaluating heterogeneous data from various sources [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
        <p>
          Entity alignment is an active research area with a wide range of techniques proposed in
the literature. Similarity-based methods [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], machine learning techniques [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], and deep
learning models [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] have been applied to tackle entity alignment-related challenges. In recent
years, the utilization of deep learning models in entity alignment tasks has become increasingly
popular due to their capability to learn complex representations from data [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Convolutional
neural networks (CNNs) [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], recurrent neural networks (RNNs) [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], and transformer-based
models, such as BERT [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] and GPT-3 [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], have been employed for entity alignment tasks to
capture intricate patterns in entity attributes. Ditto [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] is also considered a powerful and flexible
framework for entity alignment that can be used in a wide range of applications, according to
Barlaug and Gulla [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. These deep learning models have demonstrated promising outcomes in
achieving high alignment performance and robustness to noisy or incomplete data [21]. Further
research is needed to develop more robust and scalable entity alignment methods to enable
accurate and eficient data integration in various domains [22].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Algorithms</title>
      <p>
        In this section, we will describe the three selected algorithms applied for the entity alignment
purpose: Dedupe [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] as an unsupervised method, Ditto [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] for leveraging pre-trained language
models, and GPT-3 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] as a representative of large language models. This selection enhanced
our research approach with each algorithm’s distinctive strengths.
      </p>
      <sec id="sec-3-1">
        <title>3.1. Dedupe</title>
        <p>
          The Dedupe algorithm [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] employs a range of distinctive comparison methodologies. The
primary technique involves utilizing the afine gap string metric to assess the similarity between
diverse records. Additionally, Dedupe employs both the Levenshtein text distance and the
term frequency-inverse document frequency (TF-IDF) tokens. To accurately determine field
importance, the algorithm adopts regularized logistic regression. The field importance ranking
process is enhanced through active learning, wherein manual input is used to improve the
weight settings.
        </p>
        <p>Blocking refers to the process of narrowing down candidate matches. In the case of Dedupe,
it encompasses predicate blocking, which employs specific predicates, and index blocking,
leveraging an inverted index for eficiency.</p>
        <p>For grouping duplicate records, Dedupe relies on hierarchical clustering with centroid linkage.
Random samples are compared against expected precision and recall metrics to set a similarity
threshold for the linking process.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Ditto - Deep Entity Matching with Pre-Trained Language Models</title>
        <p>
          Ditto [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] is a deep entity matching framework that leverages pre-trained language models to
perform entity alignment of large datasets. The framework is built on top of PyTorch3 and the
Hugging Face transformers library4. It supports both exact matching and fuzzy matching using
a variety of pre-trained language models, such as BERT, RoBERTa, and DistilBERT.
        </p>
        <p>Ditto uses a pre-trained language model to encode the input records into fixed-length vector
representations. These vectors capture the semantic and contextual information. Consequently,
the vectors are compared using a similarity function to compute a similarity score. The similarity
function is based on various metrics, such as the cosine similarity. The similarity score is then
thresholded to determine whether the input records are matches.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. GPT-3 - Third-Generation Generative Pre-Trained Transformer</title>
        <p>
          The davinci variant of the autoregressive language model GPT-3 [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] includes 175 billion
parameters and demonstrates exceptional performance across various natural language processing
(NLP) tasks, even competing with state-of-the-art fine-tuned systems. Notably, the model excels
at tasks such as content generation, code writing, and translation, showcasing its potential for
solving arbitrarily defined tasks and thereby establishing its utility in various NLP applications.
While the architecture of the model remains similar to that of GPT-2 [23], the transformer
layers display unique patterns, with the most advanced GPT-2 model having a comparatively
low 1.5 billion parameters [24]. The GPT-3 model was primarily trained on English data (93%),
with additional mixed-language training data. The quality of input prompts directly afects
GPT-3 performance [25]. Notably, the GPT-3 model can provide a rather high confidence in its
generated answers and a verbalized explanation for decision uncertainties [26].
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Knowledge Graph Datasets</title>
      <p>In this section, we will represent the two knowledge graph datasets used for the performed case
study analysis.</p>
      <sec id="sec-4-1">
        <title>4.1. Supply Chain Data</title>
        <p>We use supply chain data from Siemens, which is stored in the form of a labeled property
graph (LPG). Table 1 depicts some of the graph metadata, including the number of node types,
relationship types, and the graph’s size. This graph incorporates data pertaining to Siemens’
suppliers, branches, and business scopes and represents a snapshot of Siemens’s supply chain
graph from July 2023. This KG additionally encompasses comprehensive product information,
including products details, together with manufacturing and smelter information.</p>
        <p>Siemens’ supply chain boasts 61.234 suppliers in total with the most represented ones being
located in Germany (6.83%), the USA (6.24%), and China (5.51%). Notably, the three mentioned
countries account for approximately one fifth of the overall number of suppliers. The subsequent
analysis will concentrate exclusively on the mentioned countries to facilitate more targeted
model training.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Macroeconomic Data</title>
        <p>CoyPu5 (Cognitive Economy Intelligence Platform for the Resilience of Economic Ecosystems) is
a project that aims to create a macroeconomic model of the global economy in the form of a KG.
It encompasses countries, industrial sectors, critical infrastructure, recent events, and further
associated entities6. This macroeconomic data is stored as a Resource Description Framework
(RDF) graph, and it is a product of several combined ontologies and data sources. The ontology
can be obtained from the CoyPu project’s website7. Table 1 shows some of the key facts about
this KG.</p>
        <p>Among other relevant knowledge in this graph, we will emphasize the most important data
such as disaster events and company properties. Alongside, there is information about natural
disasters, political disasters, strikes, violence, attacks, and demonstrations. These disaster events
mostly have a risk score assigned along with an alert score, which reflects the degree of their
influence on a supply chain. Moreover, detailed company information can also be extracted
from the KG, including company names, locations, branches, company size, and products. The
KG also incorporates geographical and infrastructure information, including details such as
continent, country, or city along with coordinates and the nearest ports, airports, and rivers.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Methodology</title>
      <p>Entity alignment in the context of knowledge graphs entails the process of matching equivalent
entities across diferent graphs to establish connections and integrate information efectively.
This section covers the entity alignment approach between the two given data sources (see
Section 4).</p>
      <sec id="sec-5-1">
        <title>5https://coypu.org 6https://docs.coypu.org 7https://schema.coypu.org/global/2.3</title>
        <sec id="sec-5-1-1">
          <title>5.1. Schema Comparison</title>
          <p>The crucial information for entity alignment between KGs revolves around identifying
identical real-world objects across two data sources. Between the macroeconomic and the supply
chain data, there is a limited overlap. The chosen approach for aligning the two provided
graphs involves consolidating their respective company entities. The suppliers associated with
Siemens ought to be aligned with their corresponding counterparts in the CoyPu graph, thus
incorporating macroeconomic details concerning these entities, including their geographical
locations and potential risk associations. The country information in both graphs includes the
same ISO code format, serving as an unique identifier for country matching. On the other side,
some industry-related entities exhibit varying granularity levels despite representing identical
information, rendering these features hardly comparable.</p>
        </sec>
        <sec id="sec-5-1-2">
          <title>5.2. Framework for KGs Entity Alignment</title>
          <p>For the purpose of entity alignment of the two data sources, three diferent algorithms have been
applied and evaluated. Figure 1 shows the solution framework and each of the process steps.
The extracted supplier lists are the starting point and serve as input data for the three selected
algorithms. The results are analyzed to identify the best approach and to finally perform the
envisioned entity alignment between the KGs.</p>
        </sec>
        <sec id="sec-5-1-3">
          <title>5.3. Data Preparation</title>
          <p>For supplier matching, only the essential information describing suppliers was extracted from
the initial graphs. This information, including company names, country locations, and, if
available, city locations, was organized into a tabular format to facilitate the linkage process
using the selected algorithms. The given data was divided into smaller units by each country to
avoid memory issues, allow for country-specific data preparation and evaluation, and accelerate
the speed of algorithm execution. This also resulted in a significant reduction of possible
false-positive matches.</p>
          <p>To enable the linking process, several pre-processing techniques were applied to simplify
and standardize the data. Data properties were parsed, cleaned, and translated if necessary,
especially to handle language or character diferences. Since Chinese company names in CoyPu
are in Chinese language, while SCM companies from China are already in English, the Google
Translate API8 was employed to overcome language barriers. Notably, the company’s legal form
was determined based on common descriptors in company names, streamlining the alignment
8https://cloud.google.com/translate/
process by removing these descriptors from the names. Lastly, the geolocation was extracted
through the external Nominatim API9 using city names to identify the geographical location of a
majority of the listed companies. Figure 2 shows the input and output of data preparation for an
exemplary Chinese company. For entity alignment purposes, anything enclosed within brackets,
aside from company names, legal forms, and locations, is regarded as irregular. Geographical
entities not enclosed within brackets are also identified as irregularities (see Figure 2).</p>
          <p>The training process of the Ditto model requires labeled training data. The number of
possible matches between the two datasets is relatively low compared to the total number
of candidate pairs. Possible matches account for the number of SCM suppliers as a smaller
dataset with an approximate count of 11.000 out of more than 5 billion possible candidate
pairs. Manually creating viable training sets was infeasible due to the large number of possible
matches. Therefore, we used the output of Dedupe to create labeled datasets for training. The
proposed matches from this matching approach were additionally manually labeled.</p>
          <p>Additionally, we have omitted the legal form from the input data of GPT-3, as previous tests
have shown improved results through this approach.</p>
        </sec>
        <sec id="sec-5-1-4">
          <title>5.4. Entity Alignment Implementation</title>
          <p>The source code repository is available on Github10. It was necessary to start with the execution
of the unsupervised approach Dedupe to find positive matches for data labeling. Negative
matches were generated randomly and additionally labeled manually. This data has been used
to provide the training set for the supervised method Ditto.</p>
          <p>The Ditto algorithm was applied next. For each of the three countries, a corresponding model
has been trained. The initial step was to generate the blocking data for matching purposes,
which was done using the pre-trained model distilbert-base-uncased-finetuned-sst-2-english for
US and Chinese companies, which were previously translated to English. In the case of German
companies, bert-based-german-cased was used. These pre-trained models have been utilised
from the Hugging Face transformers library. The blocking process was performed separately
for each country.</p>
          <p>The gpt-3.5-turbo API provided by OpenAI11, in the following referred to as GPT-3, has
also been applied for the company alignment. System messages are used to configure GPT-3
to function as a company matching service, while user messages have been utilized to send
candidates pairs. The model returns a binary match value, indicating whether the two companies
are a match. Alongside, the match confidence is indicated by a decimal value ranging from 0 to
1, with 1 representing full confidence in the model’s decision. The model is capable of matching</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>9https://nominatim.org/</title>
        <p>10https://github.com/RebekaGadzo/graph_alignment
11https://openai.com/
with or without specified company’s coordinates. It uses a single model for all countries, which
is distinct from the other two solutions.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Results</title>
      <p>This section encompasses results’ discussion based on diferent evaluation metrics along with
the final entity alignment of the given data sets.</p>
      <sec id="sec-6-1">
        <title>6.1. Results Evaluation</title>
        <p>The test set contains 750 entries across the countries, having 231 German companies, 252
Chinese companies, and 267 US companies. It is based on a random sample of positive matches
from Dedupe’s outputs, which are manually labeled for the purpose of evaluation. Negative
matches were generated using random pairs from the datasets which are manually labeled.</p>
        <p>The models exhibited varying degrees of performance regarding false-positive and
falsenegative values across all three countries (see Table 4). We hypothesize that the inflated number
of false-positives overall in Table 2 was due to the company name convention irregularities
observed in China (see Figure 2 and Table 4). Specifically, the Ditto model matching results
contained an increased number of false-positive matches, whereas the remaining two models have
faced challenges with false-negative matches. This is evident from the contrasting diferences
in precision and recall scores of these models (see Table 2).</p>
        <p>The GPT-3 model exhibited consistent performance across all countries as measured by the
F1-score. Its application was found to have superior performance, but due to its high usage
expenses, it is impractical for the application. As a result, the Dedupe method emerged as the
most suitable for aligning the two given graphs based on its favorable balance between recall
and accuracy scores.</p>
      </sec>
      <sec id="sec-6-2">
        <title>6.2. Knowledge Graph Entity Alignment</title>
        <p>The KG entity alignment includes two steps: the suppliers’ property expansion and risk events
addition (see Figure 3).
We have introduced four properties to the SCM KG: CoyPu link as ID reference of the respective
company in the CoyPu KG, legal entity identifier (LEI), city name of the company’s location,
and latitude and longitude of the company’s location.</p>
        <p>It should be noted that although the CoyPu ontology includes many company properties,
many values are still missing. These additional properties could be easily introduced to the SCM
graph as the CoyPu graph completion progresses, based on the newly introduced CoyPu link.
We have also established relations in the graph between events and companies that are
geographically close based on leveraged coordinate information from both companies and events.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>Siemens and CoyPu supplier entity alignment was conducted utilizing a set of three distinct
methods. A KG entity alignment framework was developed and applied. The initial identification
of matches was accomplished through the application of Dedupe, which was crucial for providing
training data that could not have been feasibly generated manually.</p>
      <p>Although GPT-3 was the most reliable method, its API cost rendered it impractical for the
given problem statement. However, as large language models advance, this concern may
diminish. Dedupe exhibited commendable matching capabilities with the second-best performance,
demonstrating a balanced performance and practicality. Notably, the success rate of the models
varied across diferent countries, with China posing the most problematic alignment scenario.</p>
      <p>The outcome of the entity alignment process resulted in the Siemens supply chain graph not
only containing references to the corresponding companies within the CoyPu graph but also
incorporating relevant risk events associated with these companies. Future expansions may
incorporate additional CoyPu graph data to enhance supply chain reliability. Our framework can
be further applied to other graphs and extended by the application of risk prediction algorithms.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgements</title>
      <p>This work has been supported by the German Federal Ministry for Economic Afairs and Climate
Action (BMWK) as part of the project CoyPu under grant number 01MK21007K.
on Knowledge Discovery from Data (TKDD) 15 (2021) 1–37.
[21] K. Zeng, C. Li, L. Hou, J. Li, L. Feng, A comprehensive survey of entity alignment for
knowledge graphs, AI Open 2 (2021) 1–13.
[22] Q. Zhu, H. Wei, B. Sisman, D. Zheng, C. Faloutsos, X. L. Dong, J. Han, Collective knowledge
graph multi-type entity alignment, in: The Web Conference 2020, 2020.
[23] A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, I. Sutskever, et al., Language models are
unsupervised multitask learners, OpenAI Blog (2019).
[24] I. Solaiman, M. Brundage, J. Clark, A. Askell, A. Herbert-Voss, J. Wu, A. Radford, G. Krueger,
J. W. Kim, S. Kreps, M. McCain, A. Newhouse, J. Blazakis, K. McGufie, J. Wang, Release
strategies and the social impacts of language models (2019). arXiv:1908.09203.
[25] M. Bavarian, H. Jun, N. Tezak, J. Schulman, C. McLeavey, J. Tworek, M. Chen, Eficient
training of language models to fill in the middle (2022). arXiv:2207.14255.
[26] S. Lin, J. Hilton, O. Evans, Teaching models to express their uncertainty in words (2022).
arXiv:2205.14334.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Adhitya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Srinivasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. A.</given-names>
            <surname>Karimi</surname>
          </string-name>
          ,
          <article-title>Supply chain risk identification using a HAZOPbased approach</article-title>
          ,
          <source>AIChE Journal</source>
          <volume>55</volume>
          (
          <year>2009</year>
          )
          <fpage>1447</fpage>
          -
          <lpage>1463</lpage>
          . doi:
          <volume>10</volume>
          .1002/aic.11764.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>DuHadway</surname>
          </string-name>
          , S. Carnovale,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hazen</surname>
          </string-name>
          ,
          <article-title>Understanding risk management for intentional supply chain disruptions: Risk detection, risk mitigation, and risk recovery</article-title>
          ,
          <source>Annals of Operations Research</source>
          <volume>283</volume>
          (
          <year>2019</year>
          )
          <fpage>179</fpage>
          -
          <lpage>198</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hogan</surname>
          </string-name>
          , E. Blomqvist,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cochez</surname>
          </string-name>
          , C. d'Amato,
          <string-name>
            <given-names>G. D.</given-names>
            <surname>Melo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gutierrez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kirrane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. E. L.</given-names>
            <surname>Gayo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Navigli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Neumaier</surname>
          </string-name>
          , et al.,
          <string-name>
            <surname>Knowledge</surname>
            <given-names>graphs</given-names>
          </string-name>
          ,
          <source>ACM Computing Surveys (CSUR) 54</source>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>37</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Trisedy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <article-title>A benchmark and comprehensive survey on knowledge graph entity alignment via representation learning</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2103</volume>
          .
          <fpage>15059</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Gregg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Eder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Cushman</surname>
          </string-name>
          ,
          <article-title>Entity resolution with machine learning: Dedupe.io's scalable foundation for data quality</article-title>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Suhara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Doan</surname>
          </string-name>
          , W.-C. Tan,
          <article-title>Deep entity matching with pre-trained language models</article-title>
          , arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>00584</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>T. B. Brown</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Mann</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ryder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Subbiah</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kaplan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Dhariwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Neelakantan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Shyam</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Sastry</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Askell</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Herbert-Voss</surname>
            , G. Krueger,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Henighan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Child</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ramesh</surname>
            ,
            <given-names>D. M.</given-names>
          </string-name>
          <string-name>
            <surname>Ziegler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Winter</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Hesse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            , E. Sigler,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Litwin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chess</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Berner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>McCandlish</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners (</article-title>
          <year>2020</year>
          ). arXiv:
          <year>2005</year>
          .14165.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hildebrandt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Buchner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Inzko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wernert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Weigel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Beyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Berbalk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tresp</surname>
          </string-name>
          ,
          <article-title>A knowledge graph perspective on supply chain resilience</article-title>
          ,
          <source>in: The 2nd International Workshop on Linked Data-Driven Resilience Research</source>
          , Extended Semantic Web Conference,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>N.</given-names>
            <surname>Brockmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. Elson</given-names>
            <surname>Kosasih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Brintrup</surname>
          </string-name>
          ,
          <article-title>Supply chain link prediction on uncertain knowledge graph</article-title>
          ,
          <source>ACM SIGKDD Explorations Newsletter</source>
          <volume>24</volume>
          (
          <year>2022</year>
          )
          <fpage>124</fpage>
          -
          <lpage>130</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Karam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Matini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Laas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hoppe</surname>
          </string-name>
          ,
          <article-title>A hybrid knowledge graph and bayesian network approach for analyzing supply chain resilience</article-title>
          ,
          <source>in: European Semantic Web Conference</source>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>27</fpage>
          -
          <lpage>31</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          , W. Cai,
          <article-title>Building and using a supply chain knowledge graph applied to the rail transit industry</article-title>
          ,
          <source>in: 2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>742</fpage>
          -
          <lpage>746</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACAIT53529.
          <year>2021</year>
          .
          <volume>9731237</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Stadler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Radtke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Junghanns</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gründer-Fahrer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <article-title>Base platform for knowledge graphs with free software (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>O.</given-names>
            <surname>Lauzanne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-S.</given-names>
            <surname>Frenel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Baziz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Campone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Raimbourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bocquet</surname>
          </string-name>
          ,
          <article-title>Optimizing the retrieval of the vital status of cancer patients for health data warehouses by using open government data in france</article-title>
          ,
          <source>International Journal of Environmental Research and Public Health</source>
          <volume>19</volume>
          (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .3390/ijerph19074272.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Paganelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. D.</given-names>
            <surname>Buono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pevarello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guerra</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. Vincini,</surname>
          </string-name>
          <article-title>Automated machine learning for entity matching tasks</article-title>
          ,
          <source>in: International Conference on Extending Database Technology</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sohn</surname>
          </string-name>
          , G. Park,
          <article-title>Deep model-based security-aware entity alignment method for edge-specific knowledge graphs</article-title>
          ,
          <source>Sustainability</source>
          <volume>14</volume>
          (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .3390/ su14148877.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Tam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. T.</given-names>
            <surname>Trung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Vinh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sakong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. Q. V.</given-names>
            <surname>Hung</surname>
          </string-name>
          <article-title>, Multi-order graph convolutional networks for knowledge graph alignment</article-title>
          ,
          <source>in: 37th IEEE international conference on data engineering</source>
          , Chania, Greece,
          <year>2021</year>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>Learning to exploit long-term relational dependencies in knowledge graphs (</article-title>
          <year>2019</year>
          ). arXiv:
          <year>1905</year>
          .04914.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Paganelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. D.</given-names>
            <surname>Buono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Baraldi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guerra</surname>
          </string-name>
          ,
          <article-title>Analyzing how BERT performs entity matching</article-title>
          ,
          <source>Proc. VLDB Endow</source>
          .
          <volume>15</volume>
          (
          <year>2022</year>
          )
          <fpage>1726</fpage>
          -
          <lpage>1738</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zuo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Madden</surname>
          </string-name>
          ,
          <article-title>Generic entity resolution models</article-title>
          ,
          <source>in: NeurIPS 2022 First Table Representation Workshop</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>N.</given-names>
            <surname>Barlaug</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Gulla</surname>
          </string-name>
          ,
          <article-title>Neural networks for entity matching: A survey</article-title>
          , ACM Transactions
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>