{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:53Z","timestamp":1750221053073,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3269323","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"1495-1498","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["AQuPR"],"prefix":"10.1145","author":[{"given":"Parth","family":"Pathak","sequence":"first","affiliation":[{"name":"Microsoft, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mithun","family":"Das Gupta","sequence":"additional","affiliation":[{"name":"Microsoft, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niranjan","family":"Nayak","sequence":"additional","affiliation":[{"name":"Microsoft, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harsh","family":"Kohli","sequence":"additional","affiliation":[{"name":"Microsoft, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"volume-title":"Mapping Unseen Words to Task-Trained Embedding Spaces. CoRR","year":"2015","author":"Madhyastha Pranava Swaroop","key":"e_1_3_2_1_1_1"},{"volume-title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. arXiv (November","year":"2016","author":"Nguyen Tri","key":"e_1_3_2_1_2_1"},{"volume-title":"Manning","year":"2014","author":"Pennington Jeffrey","key":"e_1_3_2_1_3_1"},{"volume-title":"100,000+ Questions for Machine Comprehension of Text. CoRR","year":"2016","author":"Rajpurkar Pranav","key":"e_1_3_2_1_4_1"},{"volume-title":"Bidirectional Attention Flow for Machine Comprehension. CoRR","year":"2016","author":"Seo Min Joon","key":"e_1_3_2_1_5_1"},{"unstructured":"Rupesh K Srivastava Klaus Greff and Juergen Schmidhuber. 2015. Training Very Deep Networks. In NIPS. 2377--2385.   Rupesh K Srivastava Klaus Greff and Juergen Schmidhuber. 2015. Training Very Deep Networks. In NIPS. 2377--2385.","key":"e_1_3_2_1_6_1"},{"volume-title":"Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering. CoRR","year":"2017","author":"Wang Shuohang","key":"e_1_3_2_1_7_1"},{"doi-asserted-by":"crossref","unstructured":"Wenhui Wang Nan Yang Furu Wei Baobao Chang and Ming Zhou. 2017a. Gated Self-Matching Networks for Reading Comprehension and Question Answering. In ACL .  Wenhui Wang Nan Yang Furu Wei Baobao Chang and Ming Zhou. 2017a. Gated Self-Matching Networks for Reading Comprehension and Question Answering. In ACL .","key":"e_1_3_2_1_8_1","DOI":"10.18653\/v1\/P17-1018"},{"volume-title":"Memory Networks. CoRR","year":"2014","author":"Weston Jason","key":"e_1_3_2_1_9_1"},{"volume-title":"Scott Wen-tau Yih, and Chris Meek","year":"2015","author":"Yang Yi","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","first-page":"259","article-title":"ABCNN","volume":"4","author":"Yin Wenpeng","year":"2016","journal-title":"Attention-Based Convolutional Neural Network for Modeling Sentence Pairs. TACL"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"CIKM '18","name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","location":"Torino Italy"},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269323","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3269323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:21Z","timestamp":1750207461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269323"}},"subtitle":["Attention based Query Passage Retrieval"],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":11,"alternative-id":["10.1145\/3269206.3269323","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3269323","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}