{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:04:01Z","timestamp":1774991041125,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541605","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1779-1783","source":"Crossref","is-referenced-by-count":3,"title":["On the relationship between edge removal and strong converses"],"prefix":"10.1109","author":[{"given":"Oliver","family":"Kosut","sequence":"first","affiliation":[{"name":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, 85287, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Kliewer","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, 07102, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Strong converse theorems for classes of multimessage multicast networks: A Rényi divergence approach","author":"fong","year":"2014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404766"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2102110"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978909"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691271"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120342"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.641556"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620371"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334291"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743582"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706933"},{"key":"ref9","article-title":"On achievable rate regions for source coding over networks","author":"gu","year":"2009"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541605.pdf?arnumber=7541605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:00Z","timestamp":1774986780000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541605\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541605","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}