{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:34Z","timestamp":1773377674803,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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-1617934"],"award-info":[{"award-number":["CCF-1617934"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518211","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2572-2577","source":"Crossref","is-referenced-by-count":3,"title":["On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes"],"prefix":"10.1109","author":[{"given":"Eray Can","family":"Elumar","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,CyLab,Department of Electrical and Computer Engineering,Pittsburgh,PA,USA,15213"}]},{"given":"Mansi","family":"Sood","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,CyLab,Department of Electrical and Computer Engineering,Pittsburgh,PA,USA,15213"}]},{"given":"Osman","family":"Ya\u011fan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,CyLab,Department of Electrical and Computer Engineering,Pittsburgh,PA,USA,15213"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3005876"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304388"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579431"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2527742"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.peva.2013.03.001","article-title":"On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes","volume":"70","author":"ya?an","year":"2013","journal-title":"Performance Evaluation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2471295"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2634422"},{"key":"ref19","author":"elumar","year":"2020","journal-title":"On the connectivity and giant component size of random k-out graphs under randomly deleted nodes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2265694"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3224424"},{"key":"ref5","author":"sabater","year":"2020","journal-title":"Distributed differentially private averaging with improved utility and robustness to malicious parties"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7249324"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2219578"},{"key":"ref2","first-page":"633","article-title":"Economic properties of social networks","author":"kakade","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"ref9","article-title":"Random key predistribution schemes for sensor networks","author":"chan","year":"0","journal-title":"Proc of IEEE S&P 2003"},{"key":"ref20","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erd?s","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1460877.1460911"},{"key":"ref21","author":"dellenbach","year":"2018","journal-title":"Hiding in the crowd A massively distributed algorithm for private averaging with malicious adversaries"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518211.pdf?arnumber=9518211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:50Z","timestamp":1773347690000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518211\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518211","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}