{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:02:19Z","timestamp":1755993739008,"version":"3.44.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1908308"],"award-info":[{"award-number":["CCF-1908308"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1109\/tai.2022.3201807","type":"journal-article","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T15:43:10Z","timestamp":1661528590000},"page":"416-427","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing Multidocument Summarization by Blending Reinforcement Learning Policies"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9369-4715","authenticated-orcid":false,"given":"DiJia","family":"Su","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Difei","family":"Su","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John M.","family":"Mulvey","sequence":"additional","affiliation":[{"name":"Department of Operation Research and Financial Engineering, Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2062-131X","authenticated-orcid":false,"given":"H.Vincent","family":"Poor","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10955"},{"key":"ref35","first-page":"1223","article-title":"MeanSum: A neural model for unsupervised multi-document abstractive summarization","author":"chu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","first-page":"55","article-title":"Multilingual summarization: Dimensionality reduction and a step towards optimal term coverage","author":"conroy","year":"0","journal-title":"Proc Workshop Multilingual Multi-document Summarization"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1223"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10958"},{"key":"ref37","first-page":"4171","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"0","journal-title":"Proc Conf North Amer Chapter Assoc Comput Linguistics Hum Langu Technol"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1223"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3115\/1654679.1654689"},{"key":"ref31","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","article-title":"Actor-critic algorithms","volume":"12","author":"konda","year":"1999","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/K17-1045"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1443"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.556"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1166"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119004752"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0591-0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.497"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2015.1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96890-2_1"},{"key":"ref24","article-title":"A deep reinforced model for abstractive summarization","author":"paulus","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1063"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1409"},{"key":"ref25","article-title":"Actor-critic based training framework for abstractive summarization","author":"li","year":"2018","journal-title":"arXiv 1803 11070"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1158"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-3015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref28","first-page":"1087","article-title":"Mix and match agent curricula for reinforcement learning","author":"czarnecki","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2102"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1172"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1446"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.552"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-6545"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1102"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71496-5_51"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3115\/1611638.1611640"},{"key":"ref5","first-page":"912","article-title":"Multi-document summarization via budgeted maximization of submodular functions","author":"lin","year":"0","journal-title":"Proc Hum Lang Technol Annu Conf North Amer Chapter Assoc Comput Linguistics"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9078688\/10132888\/9868151-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9078688\/10132888\/09868151.pdf?arnumber=9868151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T01:08:35Z","timestamp":1755911315000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9868151\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":37,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tai.2022.3201807","relation":{},"ISSN":["2691-4581"],"issn-type":[{"type":"electronic","value":"2691-4581"}],"subject":[],"published":{"date-parts":[[2023,6]]}}}