{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T21:44:42Z","timestamp":1770846282309,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:00:00Z","timestamp":1759622400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:00:00Z","timestamp":1759622400000},"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","id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,5]]},"DOI":"10.1109\/smc58881.2025.11343127","type":"proceedings-article","created":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T20:54:44Z","timestamp":1769633684000},"page":"1992-1999","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Multi-Hop Reading Comprehension through Multi-Hop Attention Diffusion with Hierarchical Graph Extensions"],"prefix":"10.1109","author":[{"given":"Yingying","family":"Zhang","sequence":"first","affiliation":[{"name":"Beijing University of Posts and Telecommunications,State Key Laboratory of Networking and Switching Technology,Beijing,China,100876"}]},{"given":"Bo","family":"Cheng","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications,State Key Laboratory of Networking and Switching Technology,Beijing,China,100876"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1264"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-2124"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00266"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1259"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-2253-2_9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.naacl-long.96"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-9431-7_4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00023"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.602"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.580"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00475"},{"key":"ref12","article-title":"A comprehensive survey on multi-hop machine reading comprehension datasets and metrics","author":"Mohammadi","year":"2022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1613"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.713"},{"key":"ref15","article-title":"Gendec: A robust generative question-decomposition method for multi-hop reasoning","author":"Wu","year":"2024"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1617"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.710"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.464"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.dlg4nlp-1.8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07072-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN60899.2024.10650851"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19-1240"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1260"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6441"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014424"},{"key":"ref26","article-title":"Improving graph attention networks with large margin-based constraints","author":"Wang","year":"2019"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10096119"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-6207-5_5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2007"},{"key":"ref30","article-title":"Roberta: A robustly optimized bert pretraining approach","volume":"364","author":"Liu","year":"2019"},{"key":"ref31","article-title":"Bidirectional attention flow for machine comprehension","volume-title":"International Conference on Learning Representations","author":"Seo"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14711\/thesis-991012757468803412"}],"event":{"name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","location":"Vienna, Austria","start":{"date-parts":[[2025,10,5]]},"end":{"date-parts":[[2025,10,8]]}},"container-title":["2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11342430\/11342431\/11343127.pdf?arnumber=11343127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:53:04Z","timestamp":1770843184000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11343127\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,5]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/smc58881.2025.11343127","relation":{},"subject":[],"published":{"date-parts":[[2025,10,5]]}}}