{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:05:58Z","timestamp":1761581158912},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1109\/tit.2013.2293214","type":"journal-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T19:18:07Z","timestamp":1388776687000},"page":"432-442","source":"Crossref","is-referenced-by-count":10,"title":["On Distributed Function Computation in Structure-Free Random Wireless Networks"],"prefix":"10.1109","volume":"60","author":[{"given":"Sudeep","family":"Kamath","sequence":"first","affiliation":[]},{"given":"D.","family":"Manjunath","sequence":"additional","affiliation":[]},{"given":"Ravi","family":"Mazumdar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/060654864"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1109\/CDC.1998.760846","article-title":"Critical power for asymptotic connectivity in wireless networks","volume":"1","author":"gupta","year":"1998","journal-title":"Proc 37th IEEE Conf Decision Control"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557101"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498546"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279109"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313813"},{"key":"ref17","first-page":"136","article-title":"Scaling bounds for function computation over large networks","author":"subramaniam","year":"2007","journal-title":"Proc IEEE ISIT"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/B:WINE.0000013081.09837.c0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909156"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00851-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00002-8"},{"key":"ref5","first-page":"1056","article-title":"A tight lower bound for parity in noisy communication networks","author":"dutta","year":"2008","journal-title":"Proc 9th Annu ACM-SIAM SODA"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892325"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s446-002-8028-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1632656"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6690264\/06676812.pdf?arnumber=6676812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:55Z","timestamp":1638218875000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6676812\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":19,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2293214","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}