The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Towards knowledge graph reasoning for supply chain risk management using graph neural networks
Open accessAbstract
Modern supply chains are complex, interconnected systems that contain emergent, invisible dependencies. Lack of visibility often hinders effective risk planning and results in delayed discovery of supply chain problems, with examples ranging from product contamination, unsustainable production practices, or exposure to suppliers clustered in geographical areas prone to natural or man-made disasters. Initiatives that rely on manual collection of data often fail due to supply chain complexity and unwillingness of suppliers to share data. In this paper, we propose a neurosymbolic machine learning technique to proactively uncover hidden risks in supply chains and discover new information. Our method uses a combination of graph neural networks and knowledge graph reasoning. Unlike existing research our model is able to infer multiple types of hidden relationship risks, presenting a step change in automated supply chain surveillance. The approach has been tested on two empirical datasets from the automotive and energy industries, illustrating that it can provide inference in multiple types of links such as companies, products, production capabilities, certifications; thereby facilitating complex queries that go beyond who-supplies-whom. As such, additional risk insights can emerge from graph structure, providing practitioners with new knowledge.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171 · cited 1×
“An example of such algorithm is hierarchical random graph model proposed by Clauset, Moore, and Newman (2008).”
MethodQuery2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings
Ren, H., Hu, W., & Leskovec, J. (2020) · arXiv · doi:10.48550/arxiv.2002.05969 · Cited by 135
Metadata
- Authors
- Kosasih, E. E., Margaroli, F., Gelli, S., Aziz, A., Wildgoose, N., & Brintrup, A.
- Venue
- International Journal of Production Research
- Publisher
- Informa UK Limited
- Published
- 2022-07-18
- Volume
- 62
- Issue
- 15
- Pages
- 5596-5612
- ISSN
- 0020-7543 (ISSN-L)
- 1366-588X
- OpenAlex
- W4285730848
- Cited by
- 158
- References
- 4
- FWCI
- 20.14
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards knowledge graph reasoning for supply chain risk management using graph neural networks. https://app.cochat.ai/papers/10.1080/00207543.2022.2100841
- The paper
- Kosasih, E. E., Margaroli, F., Gelli, S., Aziz, A., Wildgoose, N., & Brintrup, A. (2024). Towards knowledge graph reasoning for supply chain risk management using graph neural networks. International Journal of Production Research. https://doi.org/10.1080/00207543.2022.2100841
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.