{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:22:03Z","timestamp":1760710923846,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004281","name":"National Science Center","doi-asserted-by":"publisher","award":["2014\/13\/D\/ST1\/01175"],"award-info":[{"award-number":["2014\/13\/D\/ST1\/01175"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1109\/tit.2022.3169775","type":"journal-article","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T19:39:12Z","timestamp":1651001952000},"page":"6134-6150","source":"Crossref","is-referenced-by-count":4,"title":["The Cover Time of a Random Walk in Affiliation Networks"],"prefix":"10.1109","volume":"68","author":[{"given":"Mindaugas","family":"Bloznelis","sequence":"first","affiliation":[{"name":"Faculty of Mathematics and Informatics, Vilnius University, Vilnius, Lithuania"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4520-6451","authenticated-orcid":false,"given":"Jerzy","family":"Jaworski","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3998-6482","authenticated-orcid":false,"given":"Katarzyna","family":"Rybarczyk","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.03.042"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/12-AAP874"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44983-7_6"},{"key":"ref4","article-title":"The cover time of a sparse random intersection graph","volume-title":"arXiv:1910.09639","author":"Bloznelis","year":"2019"},{"key":"ref5","first-page":"1","article-title":"On the problem of uniqueness for the maximal stirling number(s) of the second kind","volume":"2","author":"Canfield","year":"2002","journal-title":"Integers, Electron. J. Combinat. Number Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20151"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20201"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964809990064"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781316339831"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.03.007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"ref12","first-page":"353","article-title":"Random walks on graphs: A survey","volume-title":"Combinatorics, Paul Erd\u2019\u00b4os is Eighty","volume":"2","author":"Lov\u00e1sz","year":"1996"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003459"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026118"},{"key":"ref15","first-page":"1","article-title":"How to design connected sensor networks that are provably secure","volume-title":"Proc. 2nd IEEE Int. Conf. Secur. Privacy Emerg. Areas Commun. Netw. (SecureComm)","author":"Pietro"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74456-6_6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80045-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.37236\/5186"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-48478-1_9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90067-9"},{"article-title":"Random intersection graphs","year":"1995","author":"Singer-Cohen","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2181331"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9861208\/09763444.pdf?arnumber=9763444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T20:53:33Z","timestamp":1705956813000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9763444\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":23,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3169775","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}