{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:42Z","timestamp":1773377802686,"version":"3.50.1"},"reference-count":21,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517975","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1344-1349","source":"Crossref","is-referenced-by-count":4,"title":["Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications"],"prefix":"10.1109","author":[{"given":"Abbas","family":"El Gamal","sequence":"first","affiliation":[{"name":"Stanford University,Dept. of Electrical Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Gohari","sequence":"additional","affiliation":[{"name":"Tehran Institute for Advanced Studies"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandra","family":"Nair","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Dept. of Information Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846438"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref12","article-title":"Outer bounds for multiuser settings: The auxiliary receiver approach","author":"gohari","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref13","first-page":"2007","article-title":"Coding techniques for primitive relay channels","author":"kim","year":"0","journal-title":"Proc Forty-Fifth Annual Allerton Conf Commun Contr Comput"},{"key":"ref14","article-title":"Minorization via mixed volumes and cover's problem for general channels","author":"liu","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849284"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492580"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797748"},{"key":"ref18","first-page":"120","article-title":"Three-terminal communication channels","author":"van der meulen","year":"0","journal-title":"Advances in Applied Probability"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006926"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174478"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4808-8_17"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056502"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056029"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262827"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011518"},{"key":"ref9","article-title":"Strengthened cutset upper bounds on the capacity of the relay channel and applications","author":"el gamal","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876892"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664811"}],"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\/09517975.pdf?arnumber=9517975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:12Z","timestamp":1773347712000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517975","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}