{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T22:33:40Z","timestamp":1777242820834,"version":"3.51.4"},"reference-count":53,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing & Management"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.ipm.2026.104847","type":"journal-article","created":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T19:19:43Z","timestamp":1777231183000},"page":"104847","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Multiple minds are better than one: Enhancing temporal knowledge graph forecasting with mixture of diverse graph experts"],"prefix":"10.1016","volume":"63","author":[{"given":"Yichen","family":"Xin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6575-9383","authenticated-orcid":false,"given":"Hanting","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2024-4814","authenticated-orcid":false,"given":"Shichong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0097-3617","authenticated-orcid":false,"given":"Zhangtao","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5681-8464","authenticated-orcid":false,"given":"Xueting","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8038-8150","authenticated-orcid":false,"given":"Fan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ipm.2026.104847_b1","series-title":"Advances in neural information processing systems","first-page":"1877","article-title":"Language models are few-shot learners","volume":"vol. 33","author":"Brown","year":"2020"},{"issue":"3","key":"10.1016\/j.ipm.2026.104847_b2","doi-asserted-by":"crossref","first-page":"39:1","DOI":"10.1145\/3641289","article-title":"A survey on evaluation of large language models","volume":"15","author":"Chang","year":"2024","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"2","key":"10.1016\/j.ipm.2026.104847_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104472","article-title":"Unveiling cross-modal consistency: Taming inter-and intra-modal noise for robust multi-modal knowledge graph completion","volume":"63","author":"Chen","year":"2026","journal-title":"Information Processing & Management"},{"issue":"1","key":"10.1016\/j.ipm.2026.104847_b4","doi-asserted-by":"crossref","first-page":"621","DOI":"10.26599\/TST.2024.9010119","article-title":"Enhancing temporal knowledge graph for future event prediction with long-term dense graph","volume":"31","author":"Chen","year":"2026","journal-title":"Tsinghua Science and Technology"},{"key":"10.1016\/j.ipm.2026.104847_b5","doi-asserted-by":"crossref","unstructured":"Chen, W., Wu, Y., Wu, S., Zhang, Z., Liao, M., Lin, Y., & Wan, H. (2025). Cogntke: A cognitive temporal knowledge extrapolation framework. In AAAI conference on artificial intelligence (pp. 14815\u201314823).","DOI":"10.1609\/aaai.v39i14.33624"},{"key":"10.1016\/j.ipm.2026.104847_b6","article-title":"Semantic duality in hypergraphs: Uncertainty-aware bipolar evidence aggregation for temporal knowledge graph reasoning","author":"Chen","year":"2025","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ipm.2026.104847_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.114448","article-title":"Precision through progression: Empowering temporal knowledge graph reasoning with knowledge-guided chain of thought","author":"Cheng","year":"2025","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.ipm.2026.104847_b8","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2025.3568289","article-title":"Disentangling inter-and intra-cascades dynamics for information diffusion prediction","author":"Cheng","year":"2025","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104847_b9","unstructured":"Cheng, Z., Zheng, B., Zhong, T., & Zhou, F. (2026). Evidential Matching, Uncertainty Calibration: Towards Robust Composed Video Retrieval with Noisy Triplets. In Proceedings of the ACM web conference 2026 (pp. 2373\u20132383)."},{"issue":"12","key":"10.1016\/j.ipm.2026.104847_b10","doi-asserted-by":"crossref","first-page":"8541","DOI":"10.1109\/TKDE.2024.3465241","article-title":"Information cascade popularity prediction via probabilistic diffusion","volume":"36","author":"Cheng","year":"2024","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104847_b11","series-title":"Findings of the association for computational linguistics","first-page":"20553","article-title":"A multi-expert structural-semantic hybrid framework for unveiling historical patterns in temporal knowledge graphs","author":"Deng","year":"2025"},{"key":"10.1016\/j.ipm.2026.104847_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2024.104085","article-title":"Temporal inductive path neural network for temporal knowledge graph reasoning","volume":"329","author":"Dong","year":"2024","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/j.ipm.2026.104847_b13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1146\/annurev.psych.59.103006.093629","article-title":"Dual-processing accounts of reasoning, judgment, and social cognition","volume":"59","author":"Evans","year":"2008","journal-title":"Annual Review of Psychology"},{"issue":"120","key":"10.1016\/j.ipm.2026.104847_b14","first-page":"1","article-title":"Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity","volume":"23","author":"Fedus","year":"2022","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"10.1016\/j.ipm.2026.104847_b15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3309547","article-title":"Temporal relational ranking for stock prediction","volume":"37","author":"Feng","year":"2019","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"10.1016\/j.ipm.2026.104847_b16","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Dur\u00e1n, A., Dumancic, S., & Niepert, M. (2018). Learning Sequence Encoders for Temporal Knowledge Graph Completion. In Proceedings of the conference on empirical methods in natural language processing (pp. 4816\u20134821).","DOI":"10.18653\/v1\/D18-1516"},{"key":"10.1016\/j.ipm.2026.104847_b17","unstructured":"Han, Z., Chen, P., Ma, Y., & Tresp, V. (2020). Explainable subgraph reasoning for forecasting on temporal knowledge graphs. In International conference on learning representations."},{"key":"10.1016\/j.ipm.2026.104847_b18","doi-asserted-by":"crossref","unstructured":"Jin, W., Qu, M., Jin, X., & Ren, X. (2020). Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs. In Proceedings of the conference on empirical methods in natural language processing (pp. 6669\u20136683).","DOI":"10.18653\/v1\/2020.emnlp-main.541"},{"key":"10.1016\/j.ipm.2026.104847_b19","doi-asserted-by":"crossref","unstructured":"Leblay, J., & Chekol, M. W. (2018). Deriving validity time in knowledge graph. In Companion of the web conference (pp. 1771\u20131776).","DOI":"10.1145\/3184558.3191639"},{"key":"10.1016\/j.ipm.2026.104847_b20","doi-asserted-by":"crossref","unstructured":"Lee, D., Ahrabian, K., Jin, W., Morstatter, F., & Pujara, J. (2023). Temporal Knowledge Graph Forecasting Without Knowledge Using In-Context Learning. In Proceedings of the conference on empirical methods in natural language processing (pp. 544\u2013557).","DOI":"10.18653\/v1\/2023.emnlp-main.36"},{"key":"10.1016\/j.ipm.2026.104847_b21","series-title":"ISA annual convention","first-page":"1","article-title":"Gdelt: Global data on events, location, and tone, 1979\u20132012","volume":"vol. 2","author":"Leetaru","year":"2013"},{"key":"10.1016\/j.ipm.2026.104847_b22","unstructured":"Lepikhin, D., Lee, H., Xu, Y., Chen, D., Firat, O., Huang, Y., Krikun, M., Shazeer, N., & Chen, Z. (2021). Gshard: Scaling giant models with conditional computation and automatic sharding. In International conference on learning representations."},{"key":"10.1016\/j.ipm.2026.104847_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 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.104847_b24","doi-asserted-by":"crossref","unstructured":"Li, Y., Sun, S., & Zhao, J. (2022). Tirgn: Time-guided recurrent graph network with local-global historical patterns for temporal knowledge graph reasoning. In Proceedings of the international joint conference on artificial intelligence (pp. 2152\u20132158).","DOI":"10.24963\/ijcai.2022\/299"},{"issue":"1","key":"10.1016\/j.ipm.2026.104847_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103903","article-title":"Explainable reasoning over temporal knowledge graphs by pre-trained language model","volume":"62","author":"Li","year":"2025","journal-title":"Information Processing & Management"},{"issue":"12","key":"10.1016\/j.ipm.2026.104847_b26","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.104847_b27","doi-asserted-by":"crossref","unstructured":"Lin, Q., Liu, J., Mao, R., Xu, F., & Cambria, E. (2023). TECHS: Temporal logical graph networks for explainable extrapolation reasoning. In Proceedings of the annual meeting of the association for computational linguistics (pp. 1281\u20131293).","DOI":"10.18653\/v1\/2023.acl-long.71"},{"key":"10.1016\/j.ipm.2026.104847_b28","doi-asserted-by":"crossref","unstructured":"Lin, Q., Liu, J., Xu, F., Pan, Y., Zhu, Y., Zhang, L., & Zhao, T. (2022). Incorporating Context Graph with Logical Reasoning for Inductive Relation Prediction. In Proceedings of the international ACM SIGIR conference on research and development in information retrieval (pp. 893\u2013903).","DOI":"10.1145\/3477495.3531996"},{"key":"10.1016\/j.ipm.2026.104847_b29","doi-asserted-by":"crossref","unstructured":"Liu, K., Zhao, F., Xu, G., Wang, X., & Jin, H. (2023). RETIA: Relation-entity twin-interact aggregation for temporal knowledge graph extrapolation. In IEEE international conference on data engineering (pp. 1761\u20131774).","DOI":"10.1109\/ICDE55515.2023.00138"},{"key":"10.1016\/j.ipm.2026.104847_b30","series-title":"Cross-token modeling with conditional computation","author":"Lou","year":"2021"},{"key":"10.1016\/j.ipm.2026.104847_b31","unstructured":"Mahdisoltani, F., Biega, J., & Suchanek, F. M. (2013). Yago3: A knowledge base from multilingual wikipedias. In Biennial conference on innovative data systems research."},{"key":"10.1016\/j.ipm.2026.104847_b32","series-title":"Advances in neural information processing systems","first-page":"9564","article-title":"Multimodal contrastive learning with limoe: The language-image mixture of experts","volume":"vol. 35","author":"Mustafa","year":"2022"},{"key":"10.1016\/j.ipm.2026.104847_b33","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 ACM international conference on web search and data mining (pp. 794\u2013803).","DOI":"10.1145\/3488560.3498451"},{"key":"10.1016\/j.ipm.2026.104847_b34","series-title":"Moe-mamba: Efficient selective state space models with mixture of experts","author":"Pi\u00f3ro","year":"2024"},{"key":"10.1016\/j.ipm.2026.104847_b35","series-title":"Advances in neural information processing systems","first-page":"8583","article-title":"Scaling vision with sparse mixture of experts","volume":"vol. 34","author":"Riquelme","year":"2021"},{"key":"10.1016\/j.ipm.2026.104847_b36","doi-asserted-by":"crossref","unstructured":"Schlichtkrull, M., Kipf, T. N., Bloem, P., Van Den Berg, R., Titov, I., & Welling, M. (2018). Modeling relational data with graph convolutional networks. In European semantic web conference (pp. 593\u2013607).","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"10.1016\/j.ipm.2026.104847_b37","unstructured":"Shazeer, N., Mirhoseini, A., Maziarz, K., Davis, A., Le, Q. V., Hinton, G. E., & Dean, J. (2017). Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer. In International conference on learning representations."},{"key":"10.1016\/j.ipm.2026.104847_b38","series-title":"Findings of the association for computational linguistics","first-page":"11329","article-title":"Scaling vision-language models with sparse mixture of experts","author":"Shen","year":"2023"},{"issue":"5","key":"10.1016\/j.ipm.2026.104847_b39","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0019467","article-title":"The use of Twitter to track levels of disease activity and public concern in the US during the influenza a H1N1 pandemic","volume":"6","author":"Signorini","year":"2011","journal-title":"PLoS One"},{"key":"10.1016\/j.ipm.2026.104847_b40","first-page":"8384","article-title":"Large language models-guided dynamic adaptation for temporal knowledge graph reasoning","volume":"37","author":"Wang","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/j.ipm.2026.104847_b41","series-title":"Continual learning for large language models: A survey","author":"Wu","year":"2024"},{"issue":"5","key":"10.1016\/j.ipm.2026.104847_b42","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s11280-024-01291-2","article-title":"A survey on large language models for recommendation","volume":"27","author":"Wu","year":"2024","journal-title":"World Wide Web"},{"issue":"2","key":"10.1016\/j.ipm.2026.104847_b43","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TAI.2021.3076021","article-title":"Graph learning: A survey","volume":"2","author":"Xia","year":"2021","journal-title":"IEEE Transactions on Artificial Intelligence"},{"key":"10.1016\/j.ipm.2026.104847_b44","series-title":"Findings of the association for computational linguistics","first-page":"16144","article-title":"Chain-of-history reasoning for temporal knowledge graph forecasting","author":"Xia","year":"2024"},{"issue":"3","key":"10.1016\/j.ipm.2026.104847_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2023.103618","article-title":"Learning dual disentangled representation with self-supervision for temporal knowledge graph reasoning","volume":"61","author":"Xiao","year":"2024","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104847_b46","series-title":"Findings of the association for computational linguistics","first-page":"7790","article-title":"Pre-trained language model with prompts for temporal knowledge graph completion","author":"Xu","year":"2023"},{"issue":"3","key":"10.1016\/j.ipm.2026.104847_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.104047","article-title":"Historical facts learning from long-short terms with language model for temporal knowledge graph reasoning","volume":"62","author":"Xu","year":"2025","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104847_b48","doi-asserted-by":"crossref","unstructured":"Xu, Y., Ou, J., Xu, H., & Fu, L. (2023). Temporal knowledge graph reasoning with historical contrastive learning. vol. 37, In AAAI conference on artificial intelligence (pp. 4765\u20134773).","DOI":"10.1609\/aaai.v37i4.25601"},{"key":"10.1016\/j.ipm.2026.104847_b49","unstructured":"Xu, D., Ruan, C., K\u00f6rpeoglu, E., Kumar, S., & Achan, K. (2020). Inductive representation learning on temporal graphs. In International conference on learning representations."},{"issue":"1","key":"10.1016\/j.ipm.2026.104847_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104280","article-title":"Enhancing knowledge graph interactions: A comprehensive text-to-cypher pipeline with large language models","volume":"63","author":"Yang","year":"2026","journal-title":"Information Processing & Management"},{"issue":"9","key":"10.1016\/j.ipm.2026.104847_b51","doi-asserted-by":"crossref","first-page":"9656","DOI":"10.1109\/TKDE.2023.3246059","article-title":"Time-aware dynamic graph embedding for asynchronous structural evolution","volume":"35","author":"Yang","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"10.1016\/j.ipm.2026.104847_b52","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhang, X., Yu, J., Tang, J., Tang, J., Li, C., & Chen, H. (2022). Subgraph Retrieval Enhanced Model for Multi-hop Knowledge Base Question Answering. In Proceedings of the annual meeting of the association for computational linguistics (pp. 5773\u20135784).","DOI":"10.18653\/v1\/2022.acl-long.396"},{"key":"10.1016\/j.ipm.2026.104847_b53","doi-asserted-by":"crossref","unstructured":"Zhu, C., Chen, M., Fan, C., Cheng, G., & Zhang, Y. (2021). Learning from history: Modeling temporal knowledge graphs with sequential copy-generation networks. vol. 35, In AAAI conference on artificial intelligence (pp. 4732\u20134740).","DOI":"10.1609\/aaai.v35i5.16604"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326002384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326002384?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T21:51:19Z","timestamp":1777240279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306457326002384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":53,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,11]]}},"alternative-id":["S0306457326002384"],"URL":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104847","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multiple minds are better than one: Enhancing temporal knowledge graph forecasting with mixture of diverse graph experts","name":"articletitle","label":"Article Title"},{"value":"Information Processing & Management","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104847","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104847"}}