{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:19:25Z","timestamp":1780571965544,"version":"3.54.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001852","name":"CEFIPRA","doi-asserted-by":"crossref","award":["5100-IT1"],"award-info":[{"award-number":["5100-IT1"]}],"id":[{"id":"10.13039\/501100001852","id-type":"DOI","asserted-by":"crossref"}]},{"name":"INSPIRE Faculty Fellowship from the Government of India"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/tsipn.2017.2668141","type":"journal-article","created":{"date-parts":[[2017,2,13]],"date-time":"2017-02-13T21:37:12Z","timestamp":1487021832000},"page":"316-329","source":"Crossref","is-referenced-by-count":13,"title":["Temporally Agnostic Rumor-Source Detection"],"prefix":"10.1109","volume":"3","author":[{"given":"Ankit","family":"Kumar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vivek. S.","family":"Borkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0435-9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282990"},{"key":"ref33","first-page":"1817","article-title":"Finding rumor sources on random graphs","author":"tripathy","year":"0","journal-title":"Proc ACM Int Conf Inf Knowl Manag"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835937"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254782"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1455"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736613"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","article-title":"Rumors in a network: Who's the culprit?","volume":"57","author":"zaman","year":"2011","journal-title":"IEEE Trans Inform Theory"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237880"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591993"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814143"},{"key":"ref40","first-page":"1","article-title":"Information source detection in the SIR model: A sample path based approach","author":"zhu","year":"2013","journal-title":"Proc IEEE Inform Theory Workshop"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620711"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0392192107073434"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511806018"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs. I","volume":"6","author":"erd?s","year":"1959","journal-title":"Publ Math Debrecen"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745866"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620613"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.75"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0671-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0167-7152(89)90016-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.068702"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2014\/10\/P10016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2316801"},{"key":"ref29","first-page":"1589","article-title":"Rumor has it: Identifying misinformation in microblogs","author":"qazvinian","year":"0","journal-title":"Proc Conf Empirical Methods Natural Lang Process"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69033-9","author":"asmussen","year":"2007","journal-title":"Stochastic simulation Algorithms and analysis"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483426"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(00)00018-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0403039"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483315"},{"key":"ref1","article-title":"A fast Monte Carlo algorithm for source localization on graphs","volume":"8858","author":"agaskar","year":"0","journal-title":"Proc SPIE"},{"key":"ref20","article-title":"SNAP Datasets: Stanford large network dataset collection","author":"leskovec","year":"2014"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2256902"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.012801"},{"key":"ref42","first-page":"1","article-title":"Source localization in networks: trees and beyond","author":"zhu","year":"0","journal-title":"Proc 35th IEEE Int Conf Comput Commun (INFOCOM)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254784"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848164"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2315533"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254783"},{"key":"ref25","author":"montenegro","year":"2006","journal-title":"Mathematical Aspects of Mixing Times in Markov Chains"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6884276\/7931734\/07850969.pdf?arnumber=7850969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T09:22:50Z","timestamp":1749979370000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7850969\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":42,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tsipn.2017.2668141","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"value":"2373-776X","type":"electronic"},{"value":"2373-7778","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}