{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T09:07:37Z","timestamp":1772096857991,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:00:00Z","timestamp":1772064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:00:00Z","timestamp":1772064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Shandong Province Science and Technology Project","award":["2023TSGC0509"],"award-info":[{"award-number":["2023TSGC0509"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08342-7","type":"journal-article","created":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T08:19:19Z","timestamp":1772093959000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Supply chain disruption risk prediction based on hypergraph representation and dynamic relational-attentive"],"prefix":"10.1007","volume":"82","author":[{"given":"Jinlong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qixin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingmin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,26]]},"reference":[{"key":"8342_CR1","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1108\/BIJ-09-2020-0507","volume":"29","author":"N Agarwal","year":"2022","unstructured":"Agarwal N, Seth N, Agarwal A (2022) Evaluation of supply chain resilience index: a graph theory based approach. BIJ 29:735\u2013766. https:\/\/doi.org\/10.1108\/BIJ-09-2020-0507","journal-title":"BIJ"},{"key":"8342_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.113760","volume":"400","author":"Q Gao","year":"2022","unstructured":"Gao Q, Xu H, Li A (2022) The analysis of commodity demand predication in supply chain network based on particle swarm optimization algorithm J. Comput Appl Math 400:113760. https:\/\/doi.org\/10.1016\/j.cam.2021.113760","journal-title":"Comput Appl Math"},{"key":"8342_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10878-023-01004-x","volume":"45","author":"J-B Liu","year":"2023","unstructured":"Liu J-B, Peng X-B, Zhao J (2023) Analyzing the spatial association of household consumption carbon emission structure based on social network. J Comb Optim 45:79. https:\/\/doi.org\/10.1007\/s10878-023-01004-x","journal-title":"J Comb Optim"},{"key":"8342_CR4","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9104387","volume":"2018","author":"A Brintrup","year":"2018","unstructured":"Brintrup A, Wichmann P, Woodall P et al (2018) Predicting hidden links in supply networks. Complexity 2018:9104387. https:\/\/doi.org\/10.1155\/2018\/9104387","journal-title":"Complexity"},{"key":"8342_CR5","doi-asserted-by":"publisher","first-page":"5380","DOI":"10.1080\/00207543.2021.1956697","volume":"60","author":"EE Kosasih","year":"2022","unstructured":"Kosasih EE, Brintrup A (2022) A machine learning approach for predicting hidden links in supply chain with graph neural networks. Int J Prod Res 60:5380\u20135393. https:\/\/doi.org\/10.1080\/00207543.2021.1956697","journal-title":"Int J Prod Res"},{"key":"8342_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eneco.2022.106271","volume":"114","author":"F Wu","year":"2022","unstructured":"Wu F, Xiao X, Zhou X et al (2022) Complex risk contagions among large international energy firms: a multi-layer network analysis. Energy Econ 114:106271. https:\/\/doi.org\/10.1016\/j.eneco.2022.106271","journal-title":"Energy Econ"},{"key":"8342_CR7","unstructured":"Zhang Z, Ji Y, Shen J et al (2022) Heterogeneous information network based default analysis on banking micro and small enterprise users"},{"key":"8342_CR8","doi-asserted-by":"crossref","unstructured":"Kui Z, Yu X, Wei WP, Gang YC (2022) A method of Evaluation for Small and Medium-sized Enterprises. In: Proceedings of the 2022 14th International Conference on Machine Learning and Computing. Association for Computing Machinery, New York, NY, USA, pp 358\u2013367","DOI":"10.1145\/3529836.3529901"},{"key":"8342_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109118","volume":"178","author":"J Li","year":"2023","unstructured":"Li J, Chang Y, Wang Y, Zhu X (2023) Tracking down financial statement fraud by analyzing the supplier-customer relationship network. Comput Ind Eng 178:109118. https:\/\/doi.org\/10.1016\/j.cie.2023.109118","journal-title":"Comput Ind Eng"},{"key":"8342_CR10","unstructured":"Brody S, Alon U, Yahav E (2022) How attentive are graph attention networks?"},{"key":"8342_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1080\/13675567.2020.1763935","volume":"24","author":"M Shekarian","year":"2021","unstructured":"Shekarian M, Mellat Parast M (2021) An integrative approach to supply chain disruption risk and resilience management: a literature review. Int J Logist Res Appl 24:427\u2013455. https:\/\/doi.org\/10.1080\/13675567.2020.1763935","journal-title":"Int J Logist Res Appl"},{"key":"8342_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2024.116197","volume":"454","author":"L Hou","year":"2025","unstructured":"Hou L, Bi G, Guo Q (2025) An improved sparrow search algorithm optimized LightGBM approach for credit risk prediction of SMEs in supply chain finance. J Comput Appl Math 454:116197. https:\/\/doi.org\/10.1016\/j.cam.2024.116197","journal-title":"J Comput Appl Math"},{"key":"8342_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-022-04518-5","volume":"331","author":"L Wang","year":"2023","unstructured":"Wang L, Jia F, Chen L, Xu Q (2023) Forecasting SMEs\u2019 credit risk in supply chain finance with a sampling strategy based on machine learning techniques. Ann Oper Res 331:1\u201333. https:\/\/doi.org\/10.1007\/s10479-022-04518-5","journal-title":"Ann Oper Res"},{"key":"8342_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2025.111515","volume":"210","author":"A Suryadi","year":"2025","unstructured":"Suryadi A, Rau H (2025) Considering risk tolerances for improving supply chain resilience with hybrid mitigation strategies under regional disruption probabilities. Comput Ind Eng 210:111515. https:\/\/doi.org\/10.1016\/j.cie.2025.111515","journal-title":"Comput Ind Eng"},{"key":"8342_CR15","doi-asserted-by":"publisher","first-page":"13101","DOI":"10.1109\/ACCESS.2025.3528373","volume":"13","author":"KF Mojdehi","year":"2025","unstructured":"Mojdehi KF, Amiri B, Haddadi A (2025) A novel hybrid model for credit risk assessment of supply chain finance based on topological data analysis and graph neural network. IEEE Access 13:13101\u201313127. https:\/\/doi.org\/10.1109\/ACCESS.2025.3528373","journal-title":"IEEE Access"},{"key":"8342_CR16","doi-asserted-by":"publisher","first-page":"5535","DOI":"10.1080\/00207543.2022.2063089","volume":"62","author":"L-W Wong","year":"2024","unstructured":"Wong L-W, Tan GW-H, Ooi K-B et al (2024) Artificial intelligence-driven risk management for enhancing supply chain agility: a deep-learning-based dual-stage PLS-SEM-ANN analysis. Int J Prod Res 62:5535\u20135555. https:\/\/doi.org\/10.1080\/00207543.2022.2063089","journal-title":"Int J Prod Res"},{"key":"8342_CR17","doi-asserted-by":"publisher","first-page":"5629","DOI":"10.1080\/00207543.2025.2458121","volume":"63","author":"M Wyrembek","year":"2025","unstructured":"Wyrembek M, Baryannis G, Brintrup A (2025) Causal machine learning for supply chain risk prediction and intervention planning. Int J Prod Res 63:5629\u20135648. https:\/\/doi.org\/10.1080\/00207543.2025.2458121","journal-title":"Int J Prod Res"},{"key":"8342_CR18","doi-asserted-by":"publisher","first-page":"14239","DOI":"10.1109\/ACCESS.2025.3530433","volume":"13","author":"G Zhou","year":"2025","unstructured":"Zhou G, Wang S (2025) Enhancing credit risk decision-making in supply chain finance with interpretable machine learning model. IEEE Access 13:14239\u201314251. https:\/\/doi.org\/10.1109\/ACCESS.2025.3530433","journal-title":"IEEE Access"},{"key":"8342_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2025.129874","volume":"298","author":"Y Zhang","year":"2026","unstructured":"Zhang Y, Zhao Y, Lian W, Jia B (2026) RAFN: a risk-aware feature network for identifying risk factors in supply chain finance. Expert Syst Appl 298:129874. https:\/\/doi.org\/10.1016\/j.eswa.2025.129874","journal-title":"Expert Syst Appl"},{"key":"8342_CR20","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks"},{"key":"8342_CR21","unstructured":"Li Y, Vinyals O, Dyer C et al (2018) learning deep generative models of graphs"},{"key":"8342_CR22","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A et al (2018) Graph attention networks"},{"key":"8342_CR23","doi-asserted-by":"crossref","unstructured":"Yu B, Yin H, Zhu Z (2018) Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecasting. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. pp 3634\u20133640","DOI":"10.24963\/ijcai.2018\/505"},{"key":"8342_CR24","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1109\/TKDE.2020.3028705","volume":"34","author":"Q Guo","year":"2022","unstructured":"Guo Q, Zhuang F, Qin C et al (2022) A survey on knowledge graph-based recommender systems. IEEE Trans Knowl Data Eng 34:3549\u20133568. https:\/\/doi.org\/10.1109\/TKDE.2020.3028705","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8342_CR25","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1109\/TNNLS.2021.3070843","volume":"33","author":"S Ji","year":"2022","unstructured":"Ji S, Pan S, Cambria E et al (2022) A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans Neural Netw Learn Syst 33:494\u2013514. https:\/\/doi.org\/10.1109\/TNNLS.2021.3070843","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"8342_CR26","doi-asserted-by":"publisher","first-page":"5596","DOI":"10.1080\/00207543.2022.2100841","volume":"62","author":"EE Kosasih","year":"2024","unstructured":"Kosasih EE, Margaroli F, Gelli S et al (2024) Towards knowledge graph reasoning for supply chain risk management using graph neural networks. Int J Prod Res 62:5596\u20135612. https:\/\/doi.org\/10.1080\/00207543.2022.2100841","journal-title":"Int J Prod Res"},{"key":"8342_CR27","doi-asserted-by":"crossref","unstructured":"Geng S, Fu Z, Tan J et al (2022) Path Language Modeling over Knowledge Graphsfor Explainable Recommendation. In: Proceedings of the ACM Web Conference 2022. Association for Computing Machinery, New York, NY, USA, pp 946\u2013955","DOI":"10.1145\/3485447.3511937"},{"key":"8342_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2022.107666","volume":"159","author":"PA Tominac","year":"2022","unstructured":"Tominac PA, Zhang W, Zavala VM (2022) Spatio-temporal economic properties of multi-product supply chains. Comput Chem Eng 159:107666. https:\/\/doi.org\/10.1016\/j.compchemeng.2022.107666","journal-title":"Comput Chem Eng"},{"key":"8342_CR29","doi-asserted-by":"crossref","unstructured":"Zhang C, Chen J, Shu T, Tan J (2022) Enterprise Event Risk Detection Based on Supply Chain Contagion. In: 2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA). pp 1\u201310","DOI":"10.1109\/DSAA54385.2022.10032453"},{"key":"8342_CR30","doi-asserted-by":"crossref","unstructured":"Kim H, Choi J, Whang JJ (2023) Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection. In: 2023 IEEE International Conference on Data Mining Workshops (ICDMW). pp 1092\u20131096","DOI":"10.1109\/ICDMW60847.2023.00143"},{"key":"8342_CR31","doi-asserted-by":"publisher","first-page":"4273","DOI":"10.1080\/00207543.2023.2257807","volume":"62","author":"R Mitra","year":"2024","unstructured":"Mitra R, Dongre A, Dangare P et al (2024) Knowledge graph driven credit risk assessment for micro, small and medium-sized enterprises. Int J Prod Res 62:4273\u20134289. https:\/\/doi.org\/10.1080\/00207543.2023.2257807","journal-title":"Int J Prod Res"},{"key":"8342_CR32","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10551-020-04438-z","volume":"171","author":"G Gong","year":"2021","unstructured":"Gong G, Huang X, Wu S et al (2021) Punishment by securities regulators, corporate social responsibility and the cost of debt. J Bus Ethics 171:337\u2013356. https:\/\/doi.org\/10.1007\/s10551-020-04438-z","journal-title":"J Bus Ethics"},{"key":"8342_CR33","doi-asserted-by":"publisher","DOI":"10.3390\/su15010105","volume":"15","author":"Y Chen","year":"2023","unstructured":"Chen Y, Wu Z (2023) Financial fraud detection of listed companies in China: a machine learning approach. Sustainability 15:105. https:\/\/doi.org\/10.3390\/su15010105","journal-title":"Sustainability"},{"key":"8342_CR34","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/6542652","volume":"2022","author":"H Xu","year":"2022","unstructured":"Xu H, Fan G, Song Y (2022) Novel key indicators selection method of financial fraud prediction model based on machine learning hybrid mode. Mob Inf Syst 2022:6542652. https:\/\/doi.org\/10.1155\/2022\/6542652","journal-title":"Mob Inf Syst"},{"key":"8342_CR35","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/cyto.a.20896","volume":"77A","author":"J Adler","year":"2010","unstructured":"Adler J, Parmryd I (2010) Quantifying colocalization by correlation: the Pearson correlation coefficient is superior to the Mander\u2019s overlap coefficient. Cytometry A 77A:733\u2013742. https:\/\/doi.org\/10.1002\/cyto.a.20896","journal-title":"Cytometry A"},{"key":"8342_CR36","doi-asserted-by":"publisher","first-page":"2548","DOI":"10.1109\/TPAMI.2020.3039374","volume":"44","author":"Y Gao","year":"2022","unstructured":"Gao Y, Zhang Z, Lin H et al (2022) Hypergraph learning: methods and practices. IEEE Trans Pattern Anal Mach Intell 44:2548\u20132566. https:\/\/doi.org\/10.1109\/TPAMI.2020.3039374","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"8342_CR37","doi-asserted-by":"publisher","first-page":"3558","DOI":"10.1609\/aaai.v33i01.33013558","volume":"33","author":"Y Feng","year":"2019","unstructured":"Feng Y, You H, Zhang Z et al (2019) Hypergraph Neural Networks. Proceedings of the AAAI Conference on Artificial Intelligence 33:3558\u20133565. https:\/\/doi.org\/10.1609\/aaai.v33i01.33013558","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"8342_CR38","doi-asserted-by":"crossref","unstructured":"Misra D (2020) Mish: a self regularized non-monotonic activation function","DOI":"10.5244\/C.34.191"},{"key":"8342_CR39","unstructured":"Shang W, Sohn K, Almeida D, Lee H (2016) Understanding and Improving Convolutional Neural Networks via Concatenated Rectified Linear Units. In: Proceedings of The 33rd International Conference on Machine Learning. PMLR, pp 2217\u20132225"},{"key":"8342_CR40","unstructured":"Applied logistic regression"},{"key":"8342_CR41","unstructured":"Ke G, Meng Q, Finley T et al (2017) LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In: Advances in Neural Information Processing Systems. Curran Associates, Inc."},{"key":"8342_CR42","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-030-29551-6_59","volume-title":"Knowledge science, engineering and management","author":"J Chen","year":"2019","unstructured":"Chen J, Hou H, Gao J et al (2019) RGCN: recurrent graph convolutional networks for target-dependent sentiment analysis. In: Douligeris C, Karagiannis D, Apostolou D (eds) Knowledge science, engineering and management. Springer International Publishing, Cham, pp 667\u2013675"},{"key":"8342_CR43","doi-asserted-by":"crossref","unstructured":"Ishiwatari T, Yasuda Y, Miyazaki T, Goto J (2020) Relation-aware Graph Attention Networks with Relational Position Encodings for Emotion Recognition in Conversations. In: Webber B, Cohn T, He Y, Liu Y (eds) Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). Association for Computational Linguistics, Online, pp 7360\u20137370","DOI":"10.18653\/v1\/2020.emnlp-main.597"},{"key":"8342_CR44","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1109\/TKDE.2021.3101356","volume":"35","author":"Y Yang","year":"2023","unstructured":"Yang Y, Guan Z, Li J et al (2023) Interpretable and efficient heterogeneous graph convolutional network. IEEE Trans Knowl Data Eng 35:1637\u20131650. https:\/\/doi.org\/10.1109\/TKDE.2021.3101356","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08342-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08342-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08342-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T08:19:25Z","timestamp":1772093965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08342-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,26]]},"references-count":44,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["8342"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08342-7","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,26]]},"assertion":[{"value":"7 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"203"}}