{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:06:54Z","timestamp":1754485614650,"version":"3.37.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100013088","name":"Qinglan Project of Jiangsu Province of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013088","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/lcomm.2020.3011714","type":"journal-article","created":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T20:13:11Z","timestamp":1595621591000},"page":"2527-2531","source":"Crossref","is-referenced-by-count":4,"title":["RV-ML: An Effective Rumor Verification Scheme Based on Multi-Task Learning Model"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3790-3057","authenticated-orcid":false,"given":"Qian","family":"Lv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0448-325X","authenticated-orcid":false,"given":"Yufeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3926-1008","authenticated-orcid":false,"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1325-4275","authenticated-orcid":false,"given":"Qun","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2017.11.009"},{"key":"ref11","first-page":"1","article-title":"Detecting rumors from microblogs with recurrent neural networks","author":"jing","year":"2016","journal-title":"Proc 25th IJCAI"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/545"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/S17-2083"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2018.00021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3115\/1118108.1118117"},{"key":"ref16","first-page":"1301","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"Proc Workshop Int Conf Learn Represent"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1181"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/S17-2006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67217-5_8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1595"},{"key":"ref3","first-page":"1","article-title":"Stance classification in rumours as a sequential task exploiting the tree structure of social media conversations","author":"zubiaga","year":"2016","journal-title":"Proc 26th COLING"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3188729"},{"key":"ref5","first-page":"1","article-title":"All-in-one: Multi-task learning for rumour verification","author":"kochkina","year":"2018","journal-title":"Proc 27th COLING"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113322"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/S17-2082"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3137597.3137600"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3161603"},{"key":"ref9","first-page":"1","article-title":"The quest to automate fact-checking","author":"hassan","year":"2015","journal-title":"Proc Comput + Journalism Symp"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2950017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2876449"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9254095\/09146786.pdf?arnumber=9146786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:49:45Z","timestamp":1651074585000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9146786\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":21,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2020.3011714","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2020,11]]}}}