{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:40:51Z","timestamp":1776444051518,"version":"3.51.2"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437902","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1824-1828","source":"Crossref","is-referenced-by-count":6,"title":["On the Tightness of a Cut-Set Bound on Network Function Computation"],"prefix":"10.1109","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong Shenzhen, School of Science and Engineering, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenghao","family":"Yang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Congduan","family":"Li","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Department of Computer Science, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283075"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252052"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606786"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133086"},{"key":"ref8","article-title":"Improved upper bound on the network function computing capacity","author":"guang","year":"0","journal-title":"Submitted to IEEE Transactions on Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188883"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050835"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095070"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437902.pdf?arnumber=8437902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:31Z","timestamp":1754588551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437902\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437902","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}