{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:11Z","timestamp":1740169211785,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61872446","61902417","71690233","71971212"],"award-info":[{"award-number":["61872446","61902417","71690233","71971212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF of Hunan Province","award":["2019JJ20024"],"award-info":[{"award-number":["2019JJ20024"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3025957","type":"journal-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T23:07:26Z","timestamp":1600816046000},"page":"174255-174264","source":"Crossref","is-referenced-by-count":1,"title":["A Sentence-Based Circular Reasoning Model in Multi-Hop Reading Comprehension"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9930-7736","authenticated-orcid":false,"given":"Lijun","family":"Huo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6339-0219","authenticated-orcid":false,"given":"Xiang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.18653\/v1\/N18-1202"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.18653\/v1\/P19-1218"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.3115\/1225403.1225421"},{"key":"ref32","first-page":"315","article-title":"Deep sparse rectifier neural networks","author":"glorot","year":"2011","journal-title":"Proc Int Conf Artif Intell Statist"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref30","article-title":"Layer normalization","author":"lei ba","year":"2016","journal-title":"arXiv 1607 06450"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.18653\/v1\/N19-1240"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.18653\/v1\/N18-2007"},{"key":"ref35","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref34","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.18653\/v1\/P19-1263"},{"key":"ref40","first-page":"4171","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2019","journal-title":"Proc Conf North Amer Chapter Assoc Comput Linguistics"},{"key":"ref11","first-page":"1","article-title":"Coarse-grain fine-grain coattention network for multi-evidence question answering","author":"zhong","year":"2019","journal-title":"Proc Int Conf Learn Represent (ICLR)ICLR"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.18653\/v1\/D18-1259"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.18653\/v1\/P17-1147"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.18653\/v1\/D19-1600"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1162\/tacl_a_00021"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.18653\/v1\/D17-1082"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.18653\/v1\/D16-1241"},{"key":"ref18","article-title":"The goldilocks principle: Reading Children’s books with explicit memory representations","author":"hill","year":"2015","journal-title":"arXiv 1511 02301"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.18653\/v1\/P19-1219"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref4","first-page":"1","article-title":"Machine comprehension using match-lstm and answer pointer","author":"wang","year":"2017","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref27","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","first-page":"1","article-title":"Bidirectional attention flow for machine comprehension","author":"seo","year":"2017","journal-title":"Proc Int Conf Learn Represent"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.18653\/v1\/P19-1261"},{"key":"ref29","article-title":"Gaussian error linear units (GELUs)","author":"hendrycks","year":"2016","journal-title":"arXiv 1606 08415"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.18653\/v1\/D18-1232"},{"key":"ref8","article-title":"Exploring graph-structured passage representation for multi-hop reading comprehension with graph neural networks","author":"song","year":"2018","journal-title":"arXiv 1809 02040"},{"key":"ref7","article-title":"Select, answer and explain: Interpretable multi-hop reading comprehension over multiple documents","author":"tu","year":"2019","journal-title":"arXiv 1911 00484"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1162\/tacl_a_00023"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.18653\/v1\/P19-1260"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.18653\/v1\/D16-1264"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.18653\/v1\/P19-1259"},{"key":"ref22","article-title":"Relational inductive biases, deep learning, and graph networks","author":"battaglia","year":"2018","journal-title":"arXiv 1806 01261"},{"key":"ref21","first-page":"357","article-title":"BAG: Bi-directional attention entity graph convolutional network for multi-hop reasoning question answering","author":"cao","year":"2019","journal-title":"Proc 2019 Conf North Amer Chapter Assoc Comput Linguistics Hum Lang Technol"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.18653\/v1\/P19-1220"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.18653\/v1\/D17-1206"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.18653\/v1\/K17-1028"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.3115\/v1\/D14-1162"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref25","article-title":"Highway networks","author":"kumar srivastava","year":"2015","journal-title":"arXiv 1505 00387"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09203847.pdf?arnumber=9203847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:07Z","timestamp":1639770967000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9203847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3025957","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}