{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T07:44:03Z","timestamp":1773560643653,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tcss.2024.3505205","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T14:05:38Z","timestamp":1733753138000},"page":"1653-1664","source":"Crossref","is-referenced-by-count":3,"title":["Rumor Containment in Hypergraph Representation of Social Networks: A Deep Reinforcement Learning-Based Solution"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0606-3358","authenticated-orcid":false,"given":"Gouri","family":"Kundu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Calcutta, Acharya Prafulla Chandra Roy Shiksha Prangan, Saltlake, Kolkata, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7026-1826","authenticated-orcid":false,"given":"Smita","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Santa Clara University, Santa Clara, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2680-7748","authenticated-orcid":false,"given":"Sankhayan","family":"Choudhury","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Calcutta, Acharya Prafulla Chandra Roy Shiksha Prangan, Saltlake, Kolkata, India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-014-0214-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103094"},{"key":"ref3","first-page":"1","article-title":"Cuttingedge: Influence minimization in networks","volume-title":"Proc. Workshop Frontiers Netw. Anal. Methods Models Appl. NIPS","author":"Khalil","year":"2013"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1514888.1514892"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0252-3"},{"key":"ref6","first-page":"134","article-title":"Negative influence minimizing by blocking nodes in social networks","volume-title":"Proc. 17th AAAI Conf. Late-Breaking Develop. Field Artif. Intell.","author":"Wang","year":"2013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-023-04555-y"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.osnem.2017.07.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.134"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.055"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21786-4_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3188701"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2022.3159840"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-023-02221-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2873759"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3390\/e23070796"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW58026.2022.00158"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103161"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1063\/5.0178329"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3604559"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref26","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. 31st Conf. Neural Inf. Process. Syst.","volume":"30","author":"Khalil","year":"2017"},{"key":"ref27","first-page":"20000","article-title":"Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs","volume-title":"Proc. 34th Conf. Neural Inf. Process. Syst.","volume":"33","author":"Manchanda","year":"2020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3164667"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2023.3272331"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1561\/2200000086"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2024.3408257"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120495"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/353"},{"key":"ref34","first-page":"1511","article-title":"HyperGCN: A new method for training graph convolutional networks on hypergraphs","volume-title":"Proc. 33rd Conf. Neural Inf. Process. Syst.","volume":"32","author":"Yadati","year":"2019"},{"key":"ref35","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"ref38","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_32"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-05195-x"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380152"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2938575"},{"key":"ref44","first-page":"1328","article-title":"Certified adversarial robustness for deep reinforcement learning","volume-title":"Proc. Conf. Robot Learn. (PMLR)","author":"L\u00fctjens","year":"2020"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3278715"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570650\/11118943\/10785555.pdf?arnumber=10785555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:45:51Z","timestamp":1754588751000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10785555\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2024.3505205","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}