{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:28:26Z","timestamp":1771025306598,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022ZD0160300"],"award-info":[{"award-number":["2022ZD0160300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014219","name":"National Science Fund for Distinguished Young Scholars","doi-asserted-by":"publisher","award":["62025602"],"award-info":[{"award-number":["62025602"]}],"id":[{"id":"10.13039\/501100014219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2036"],"award-info":[{"award-number":["U22B2036"]}],"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":["62203363"],"award-info":[{"award-number":["62203363"]}],"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":["11931015"],"award-info":[{"award-number":["11931015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Technology Innovation Leading Program of Shaanxi","award":["2023GXLH-086"],"award-info":[{"award-number":["2023GXLH-086"]}]},{"DOI":"10.13039\/501100004806","name":"Fok Ying Tong Education Foundation","doi-asserted-by":"publisher","award":["171105"],"award-info":[{"award-number":["171105"]}],"id":[{"id":"10.13039\/501100004806","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["D5000230366"],"award-info":[{"award-number":["D5000230366"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Tencent Foundation and Xplorer Prize"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tnnls.2024.3406869","type":"journal-article","created":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T13:40:46Z","timestamp":1720791646000},"page":"7487-7499","source":"Crossref","is-referenced-by-count":7,"title":["Flow to Candidate: Temporal Knowledge Graph Reasoning With Candidate-Oriented Relational Graph"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1654-3400","authenticated-orcid":false,"given":"Shiqi","family":"Fan","sequence":"first","affiliation":[{"name":"School of Cybersecurity and the School of Artificial Intelligence, Optics and Electronics, Northwestern Polytechnical University, Xi’an, China"}]},{"given":"Guoxi","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering and the School of Artificial Intelligence, Optics and Electronics, Northwestern Polytechnical University, Xi’an, China"}]},{"given":"Hongyi","family":"Nie","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering and the School of Artificial Intelligence, Optics and Electronics, Northwestern Polytechnical University, Xi’an, China"}]},{"given":"Quanming","family":"Yao","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7604-8279","authenticated-orcid":false,"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Optics and Electronics, Northwestern Polytechnical University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2924-946X","authenticated-orcid":false,"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Artificial Intelligence (TeleAI), China Telecom, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8182-2852","authenticated-orcid":false,"given":"Zhen","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cybersecurity and the School of Artificial Intelligence, Optics and Electronics, Northwestern Polytechnical University, Xi’an, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3070843"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2023.3265851"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3282989"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3113026"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2402162"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3355151"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3171677"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-1133"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/s43856-024-00486-y"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3027314"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-023-00558-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCPEIC.2018.8525181"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3017635"},{"issue":"9","key":"ref15","first-page":"10645","article-title":"MINES: Message intercommunication for inductive relation reasoning over neighbor-enhanced subgraphs","volume-title":"Proc. AAAI Conf. Artif. Intell.","volume":"38","author":"Liang"},{"key":"ref16","article-title":"A survey of knowledge graph reasoning on graph types: Static, dynamic, and multimodal","author":"Liang","year":"2022","journal-title":"arXiv:2212. 05767"},{"key":"ref17","first-page":"8306","article-title":"TimeTraveler: Reinforcement learning for temporal knowledge graph forecasting","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Sun"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/DSC55868.2022.00052"},{"key":"ref19","first-page":"4732","article-title":"Search from history and reason for future: Two-stage reasoning on temporal knowledge graphs","volume-title":"Proc. 59th Annu. Meeting Assoc. Comput. Linguistics, 11th Int. Joint Conf. Natural Lang. Process.","author":"Li"},{"issue":"5","key":"ref20","first-page":"4732","article-title":"Learning from history: Modeling temporal knowledge graphs with sequential copy-generation networks","volume-title":"Proc. AAAI Conf. Artif. Intell.","volume":"35","author":"Zhu"},{"key":"ref21","first-page":"290","article-title":"Complex evolutional pattern learning for temporal knowledge graph reasoning","volume-title":"Proc. 60th Annu. Meeting Assoc. Comput. Linguistics","author":"Li"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467447"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482454"},{"key":"ref24","first-page":"6669","article-title":"Recurrent event network: Autoregressive structure inferenceover temporal knowledge graphs","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process. (EMNLP)","author":"Jin"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1406.1078"},{"key":"ref27","article-title":"T-GAP: Learning to walk across time for temporal knowledge graph completion","author":"Jung","year":"2020","journal-title":"arXiv: 2012.10595"},{"key":"ref28","first-page":"1","article-title":"Explainable subgraph reasoning for forecasting on temporal knowledge graphs","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Han"},{"key":"ref29","first-page":"1","article-title":"Inductive relation prediction by subgraph reasoning","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Teru"},{"key":"ref30","first-page":"29476","article-title":"Neural bellman-ford networks: A general graph neural network framework for link prediction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Zhu"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512008"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3104310"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3236776"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00127"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3136287"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-emnlp.458"},{"key":"ref37","article-title":"Translating embeddings for modeling multi-relational data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Bordes"},{"key":"ref38","first-page":"2071","article-title":"Complex embeddings for simple link prediction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Trouillon"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191639"},{"key":"ref40","first-page":"1","article-title":"Tensor decompositions for temporal knowledge base completion","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Lacroix"},{"key":"ref41","first-page":"2569","article-title":"Temporal knowledge graph completion using a linear temporal regularizer and multivector embeddings","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics, Human Lang. Technol.","author":"Xu"},{"issue":"7","key":"ref42","first-page":"6471","article-title":"ChronoR: Rotation based temporal knowledge graph embedding","volume-title":"Proc. AAAI Conf. Artif. Intell.","volume":"35","author":"Sadeghian"},{"key":"ref43","first-page":"8352","article-title":"Learning neural ordinary equations for forecasting future links on temporal knowledge graphs","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Han"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3274230"},{"key":"ref45","first-page":"564","article-title":"DeepPath: A reinforcement learning method for knowledge graph reasoning","volume-title":"Proc. Conf. Empir. Methods Natural Lang. Process.","author":"Xiong"},{"key":"ref46","first-page":"1","article-title":"Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Das"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3083259"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186116"},{"key":"ref49","first-page":"1","article-title":"Composition-based multi-relational graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Vashishth"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3264519"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/264"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3295592"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3149997"},{"key":"ref54","first-page":"1","article-title":"Inductive representation learning on temporal graphs","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref55","first-page":"1","article-title":"YAGO3: A knowledge base from multilingual wikipedias","volume-title":"Proc. 7th Biennial Conf. Innov. Data Syst. Res.","author":"Mahdisoltani"},{"key":"ref56","article-title":"ICEWS coded event data","author":"Boschee","year":"2015"},{"key":"ref57","article-title":"Graph Hawkes neural network for future prediction on temporal knowledge graphs","author":"Han","year":"2020","journal-title":"arXiv:2003.13432"},{"key":"ref58","article-title":"Embedding entities and relations for learning and inference in knowledge bases","author":"Yang","year":"2014","journal-title":"arXiv:1412.6575"},{"key":"ref59","first-page":"4816","article-title":"Learning sequence encoders for temporal knowledge graph completion","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Garc\u00eda-Dur\u00e1n"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.36"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/10949581\/10596669.pdf?arnumber=10596669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T18:39:06Z","timestamp":1764959946000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10596669\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":60,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2024.3406869","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}