{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T22:18:44Z","timestamp":1783030724494,"version":"3.54.6"},"reference-count":54,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62273219"],"award-info":[{"award-number":["62273219"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61977044"],"award-info":[{"award-number":["61977044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62377031"],"award-info":[{"award-number":["62377031"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing & Management"],"published-print":{"date-parts":[[2027,1]]},"DOI":"10.1016\/j.ipm.2026.104982","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:09:59Z","timestamp":1781582999000},"page":"104982","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Multi-perspective knowledge-aware reinforcement learning framework for multi-hop reasoning with temporal constraints"],"prefix":"10.1016","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1575-5467","authenticated-orcid":false,"given":"Congcong","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9104-4540","authenticated-orcid":false,"given":"Jianrui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7735-6695","authenticated-orcid":false,"given":"Miao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Longjiang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ipm.2026.104982_b1","doi-asserted-by":"crossref","unstructured":"Arun, A., Kumar, S., Nayyeri, M., Xiong, B., Kumaraguru, P., Vergari, A., & Staab, S. (2025). SEMMA: A semantic aware knowledge graph foundation model. In Proceedings of the 2025 conference on empirical methods in natural language processing (pp. 31813\u201331836).","DOI":"10.18653\/v1\/2025.emnlp-main.1621"},{"key":"10.1016\/j.ipm.2026.104982_b2","doi-asserted-by":"crossref","unstructured":"Bai, Y., Lv, X., Li, J., Hou, L., Qu, Y., Dai, Z., & Xiong, F. (2022). SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph Reasoning. In Proceedings of the 2022 conference on empirical methods in natural language processing (pp. 1649\u20131662).","DOI":"10.18653\/v1\/2022.emnlp-main.107"},{"key":"10.1016\/j.ipm.2026.104982_b3","series-title":"The semantic web\u2013ISWC 2020: 19th international semantic web conference, athens, Greece, November 2\u20136, 2020, proceedings, part i 19","first-page":"39","article-title":"Explainable link prediction for emerging entities in knowledge graphs","author":"Bhowmik","year":"2020"},{"key":"10.1016\/j.ipm.2026.104982_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.127044","article-title":"Relphormer: Relational graph transformer for knowledge graph representations","volume":"566","author":"Bi","year":"2024","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ipm.2026.104982_b5","series-title":"2024 IEEE 40th international conference on data engineering","first-page":"733","article-title":"Local-global history-aware contrastive learning for temporal knowledge graph reasoning","author":"Chen","year":"2024"},{"issue":"1","key":"10.1016\/j.ipm.2026.104982_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104336","article-title":"Explainable prediction of knowledge recombination: A synergized method with heterogeneous hypergraph learning and large language models","volume":"63","author":"Chen","year":"2026","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104982_b7","series-title":"Intelligent systems conference","first-page":"729","article-title":"A simple but powerful graph encoder for temporal knowledge graph completion","author":"Ding","year":"2023"},{"key":"10.1016\/j.ipm.2026.104982_b8","series-title":"2018 41st international convention on information and communication technology, electronics and microelectronics","first-page":"0210","article-title":"Explainable artificial intelligence: A survey","author":"Do\u0161ilovi\u0107","year":"2018"},{"key":"10.1016\/j.ipm.2026.104982_b9","unstructured":"Drance, M., Mougin, F., Zemmari, A., & Diallo, G. (2023). Pre-Trained Embeddings for Enhancing Multi-Hop Reasoning. In International joint conference on artificial intelligence 2023 workshop on knowledge-based compositional generalization (pp. 1\u201310)."},{"key":"10.1016\/j.ipm.2026.104982_b10","series-title":"Proceedings of the sixth workshop on structured prediction for NLP","first-page":"22","article-title":"TempCaps: a capsule network-based embedding model for temporal knowledge graph completion","author":"Fu","year":"2022"},{"key":"10.1016\/j.ipm.2026.104982_b11","first-page":"1","article-title":"Causal inference in recommender systems: A survey and future directions","volume":"42","author":"Gao","year":"2024","journal-title":"ACM Transactions on Information Systems"},{"key":"10.1016\/j.ipm.2026.104982_b12","series-title":"2022 7th IEEE international conference on data science in cyberspace","first-page":"333","article-title":"Modeling unseen entities from a semantic evidence view in temporal knowledge graphs","author":"Guo","year":"2022"},{"key":"10.1016\/j.ipm.2026.104982_b13","doi-asserted-by":"crossref","unstructured":"Han, Z., Chen, P., Ma, Y., & Tresp, V. (2020). DyERNIE: Dynamic Evolution of Riemannian Manifold Embeddings for Temporal Knowledge Graph Completion. In Proceedings of the 2020 conference on empirical methods in natural language processing (pp. 7301\u20137316).","DOI":"10.18653\/v1\/2020.emnlp-main.593"},{"key":"10.1016\/j.ipm.2026.104982_b14","unstructured":"Han, Z., Chen, P., Ma, Y., & Tresp, V. (2021). Explainable subgraph reasoning for forecasting on temporal knowledge graphs. In International conference on learning representations (pp. 1\u201310)."},{"key":"10.1016\/j.ipm.2026.104982_b15","doi-asserted-by":"crossref","unstructured":"Han, Z., Ding, Z., Ma, Y., Gu, Y., & Tresp, V. (2021). Learning neural ordinary equations for forecasting future links on temporal knowledge graphs. In Proceedings of the 2021 conference on empirical methods in natural language processing (pp. 8352\u20138364).","DOI":"10.18653\/v1\/2021.emnlp-main.658"},{"key":"10.1016\/j.ipm.2026.104982_b16","series-title":"Graph hawkes neural network for forecasting on temporal knowledge graphs","author":"Han","year":"2020"},{"key":"10.1016\/j.ipm.2026.104982_b17","doi-asserted-by":"crossref","unstructured":"Han, Z., Zhang, G., Ma, Y., & Tresp, V. (2021). Time-dependent entity embedding is not all you need: A re-evaluation of temporal knowledge graph completion models under a unified framework. In Proceedings of the 2021 conference on empirical methods in natural language processing (pp. 8104\u20138118).","DOI":"10.18653\/v1\/2021.emnlp-main.639"},{"key":"10.1016\/j.ipm.2026.104982_b18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s12559-023-10179-8","article-title":"Interpreting Black-Box models: A review on explainable artificial intelligence","volume":"16","author":"Hassija","year":"2024","journal-title":"Cognitive Computation"},{"key":"10.1016\/j.ipm.2026.104982_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116466","article-title":"A contrastive learning framework of graph reconstruction and hypergraph learning for key node identification","volume":"197","author":"Huang","year":"2025","journal-title":"Chaos, Solitons & Fractals"},{"key":"10.1016\/j.ipm.2026.104982_b20","doi-asserted-by":"crossref","unstructured":"Jiang, C., Zhu, T., Zhou, H., Liu, C., Deng, T., Hu, C., & Li, J. (2023). Path spuriousness-aware reinforcement learning for multi-hop knowledge graph reasoning. In Proceedings of the 17th conference of the European chapter of the association for computational linguistics (pp. 3181\u20133192).","DOI":"10.18653\/v1\/2023.eacl-main.232"},{"key":"10.1016\/j.ipm.2026.104982_b21","doi-asserted-by":"crossref","unstructured":"Li, Z., Guan, S., Jin, X., Peng, W., Lyu, Y., Zhu, Y., Bai, L., Li, W., Guo, J., & Cheng, X. (2022). Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning. vol. 2, In Proceedings of the 60th annual meeting of the association for computational linguistics (pp. 290\u2013296).","DOI":"10.18653\/v1\/2022.acl-short.32"},{"key":"10.1016\/j.ipm.2026.104982_b22","series-title":"Findings of the association for computational linguistics: EMNLP 2022","first-page":"7328","article-title":"HiSMatch: Historical structure matching based temporal knowledge graph reasoning","author":"Li","year":"2022"},{"key":"10.1016\/j.ipm.2026.104982_b23","doi-asserted-by":"crossref","unstructured":"Li, Z., Jin, X., Li, W., Guan, S., Guo, J., Shen, H., Wang, Y., & Cheng, X. (2021). Temporal knowledge graph reasoning based on evolutional representation learning. In Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval (pp. 408\u2013417).","DOI":"10.1145\/3404835.3462963"},{"key":"10.1016\/j.ipm.2026.104982_b24","doi-asserted-by":"crossref","first-page":"9456","DOI":"10.1109\/TPAMI.2024.3417451","article-title":"A survey of knowledge graph reasoning on graph types: Static, dynamic, and multi-modal","volume":"46","author":"Liang","year":"2024","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/j.ipm.2026.104982_b25","series-title":"Findings of the association for computational linguistics: NAACL 2024","first-page":"4303","article-title":"GenTKG: Generative forecasting on temporal knowledge graph with large language models","author":"Liao","year":"2024"},{"key":"10.1016\/j.ipm.2026.104982_b26","doi-asserted-by":"crossref","unstructured":"Liu, X., Zhang, J., Ma, C., Liang, W., Xu, B., & Zong, L. (2024). Temporal Knowledge Graph Reasoning with Dynamic Hypergraph Embedding. In Proceedings of the 2024 joint international conference on computational linguistics, language resources and evaluation (LREC-cOLING 2024) (pp. 15742\u201315751).","DOI":"10.63317\/58bxwv56fpmt"},{"key":"10.1016\/j.ipm.2026.104982_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112164","article-title":"HierarT: Multi-hop temporal knowledge graph forecasting with hierarchical reinforcement learning","volume":"300","author":"Luo","year":"2024","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.ipm.2026.104982_b28","unstructured":"Ma, T., Tao, W., Li, M., Zhang, J., Pan, X., Wang, Y., Song, B., et al. (2025). Towards synergistic path-based explanations for knowledge graph completion: Exploration and evaluation. In The thirteenth international conference on learning representations (pp. 1\u201310)."},{"key":"10.1016\/j.ipm.2026.104982_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.websem.2018.12.008","article-title":"Embedding models for episodic knowledge graphs","volume":"59","author":"Ma","year":"2019","journal-title":"Journal of Web Semantics"},{"key":"10.1016\/j.ipm.2026.104982_b30","doi-asserted-by":"crossref","unstructured":"Meilicke, C., Chekol, M. W., Ruffinelli, D., & Stuckenschmidt, H. (2019). Anytime Bottom-Up Rule Learning for Knowledge Graph Completion. In Proceedings of the twenty-eighth international joint conference on artificial intelligence (pp. 3137\u20133143).","DOI":"10.24963\/ijcai.2019\/435"},{"issue":"2","key":"10.1016\/j.ipm.2026.104982_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2023.103605","article-title":"Multi-hop path reasoning over sparse temporal knowledge graphs based on path completion and reward shaping","volume":"61","author":"Meng","year":"2024","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104982_b32","doi-asserted-by":"crossref","unstructured":"Nathani, D., Chauhan, J., Sharma, C., & Kaul, M. (2019). Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs. In Proceedings of the 57th annual meeting of the association for computational linguistics (pp. 4710\u20134723).","DOI":"10.18653\/v1\/P19-1466"},{"key":"10.1016\/j.ipm.2026.104982_b33","series-title":"2025 28th international conference on computer supported cooperative work in design","first-page":"2310","article-title":"RLGNet: Repeating-Local-Global history network for temporal knowledge graph reasoning","author":"Ouyang","year":"2025"},{"issue":"7","key":"10.1016\/j.ipm.2026.104982_b34","doi-asserted-by":"crossref","first-page":"3580","DOI":"10.1109\/TKDE.2024.3352100","article-title":"Unifying large language models and knowledge graphs: A roadmap","volume":"36","author":"Pan","year":"2024","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104982_b35","doi-asserted-by":"crossref","unstructured":"Park, N., Liu, F., Mehta, P., Cristofor, D., Faloutsos, C., & Dong, Y. (2022). Evokg: Jointly modeling event time and network structure for reasoning over temporal knowledge graphs. In Proceedings of the fifteenth ACM international conference on web search and data mining (pp. 794\u2013803).","DOI":"10.1145\/3488560.3498451"},{"key":"10.1016\/j.ipm.2026.104982_b36","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0927-0507(05)80172-0","article-title":"Markov decision processes","volume":"2","author":"Puterman","year":"1990","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"10.1016\/j.ipm.2026.104982_b37","series-title":"2025 13th international electrical engineering congress","first-page":"1","article-title":"Semantic search engine, thai traditional medicine knowledge graph application","author":"Sakulpakdee","year":"2025"},{"key":"10.1016\/j.ipm.2026.104982_b38","article-title":"A systematic review of explainable artificial intelligence models and applications: Recent developments and future trends","volume":"7","author":"Saranya","year":"2023","journal-title":"Decision Analytics Journal"},{"key":"10.1016\/j.ipm.2026.104982_b39","series-title":"The semantic web: 15th international conference, ESWC 2018, heraklion, crete, Greece, June 3\u20137, 2018, proceedings 15","first-page":"593","article-title":"Modeling relational data with graph convolutional networks","author":"Schlichtkrull","year":"2018"},{"key":"10.1016\/j.ipm.2026.104982_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119787","article-title":"Attention-based exploitation and exploration strategy for multi-hop knowledge graph reasoning","volume":"653","author":"Shang","year":"2024","journal-title":"Information Sciences"},{"key":"10.1016\/j.ipm.2026.104982_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.126390","article-title":"Hierarchical graph attention network for temporal knowledge graph reasoning","volume":"550","author":"Shao","year":"2023","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ipm.2026.104982_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2025.107260","article-title":"Dual view graph transformer networks for multi-hop knowledge graph reasoning","volume":"186","author":"Sun","year":"2025","journal-title":"Neural Networks"},{"key":"10.1016\/j.ipm.2026.104982_b43","doi-asserted-by":"crossref","unstructured":"Sun, H., Geng, S., Zhong, J., Hu, H., & He, K. (2022). Graph hawkes transformer for extrapolated reasoning on temporal knowledge graphs. In Proceedings of the 2022 conference on empirical methods in natural language processing (pp. 7481\u20137493).","DOI":"10.18653\/v1\/2022.emnlp-main.507"},{"key":"10.1016\/j.ipm.2026.104982_b44","doi-asserted-by":"crossref","unstructured":"Sun, H., Zhong, J., Ma, Y., Han, Z., & He, K. (2021). TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting. In Proceedings of the 2021 conference on empirical methods in natural language processing (pp. 8306\u20138319).","DOI":"10.18653\/v1\/2021.emnlp-main.655"},{"key":"10.1016\/j.ipm.2026.104982_b45","series-title":"European semantic web conference","first-page":"202","article-title":"Embedding learning for declarative memories","author":"Tresp","year":"2017"},{"key":"10.1016\/j.ipm.2026.104982_b46","unstructured":"Vashishth, S., Sanyal, S., Nitin, V., & Talukdar, P. (2020). Composition-based multi-relational graph convolutional networks. In 8th international conference on learning representations (pp. 1\u201310)."},{"issue":"10","key":"10.1016\/j.ipm.2026.104982_b47","doi-asserted-by":"crossref","first-page":"14018","DOI":"10.1109\/TNNLS.2023.3274230","article-title":"QDN: A quadruplet distributor network for temporal knowledge graph completion","volume":"35","author":"Wang","year":"2023","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10.1016\/j.ipm.2026.104982_b48","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, D., Xu, C., He, X., Cao, Y., & Chua, T.-S. (2019). Explainable reasoning over knowledge graphs for recommendation. vol. 33, In Proceedings of the AAAI conference on artificial intelligence (pp. 5329\u20135336).","DOI":"10.1609\/aaai.v33i01.33015329"},{"key":"10.1016\/j.ipm.2026.104982_b49","doi-asserted-by":"crossref","unstructured":"Wu, J., Cao, M., Cheung, J. C. K., & Hamilton, W. L. (2020). TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion. In Proceedings of the 2020 conference on empirical methods in natural language processing (pp. 5730\u20135746).","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"issue":"1","key":"10.1016\/j.ipm.2026.104982_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2023.103543","article-title":"Multi-hop community question answering based on multi-aspect heterogeneous graph","volume":"61","author":"Wu","year":"2024","journal-title":"Information Processing & Management"},{"issue":"3","key":"10.1016\/j.ipm.2026.104982_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103648","article-title":"DT4KGR: Decision transformer for fast and effective multi-hop reasoning over knowledge graphs","volume":"61","author":"Xia","year":"2024","journal-title":"Information Processing & Management"},{"issue":"2","key":"10.1016\/j.ipm.2026.104982_b52","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2022.103207","article-title":"A question-guided multi-hop reasoning graph network for visual question answering","volume":"60","author":"Xu","year":"2023","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104982_b53","first-page":"1","article-title":"Gnnexplainer: Generating explanations for graph neural networks","volume":"32","author":"Ying","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/j.ipm.2026.104982_b54","series-title":"International conference on database systems for advanced applications","first-page":"706","article-title":"Block decomposition with multi-granularity embedding for temporal knowledge graph completion","author":"Yue","year":"2023"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326003730?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326003730?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T21:34:24Z","timestamp":1783028064000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306457326003730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2027,1]]}},"alternative-id":["S0306457326003730"],"URL":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104982","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multi-perspective knowledge-aware reinforcement learning framework for multi-hop reasoning with temporal constraints","name":"articletitle","label":"Article Title"},{"value":"Information Processing & Management","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104982","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104982"}}