{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:14Z","timestamp":1773377534468,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849369","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"206-210","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region"],"prefix":"10.1109","author":[{"given":"Yirui","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, 19104, USA"}]},{"given":"John MacLaren","family":"Walsh","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, 19104, USA"}]}],"member":"263","reference":[{"key":"ref10","first-page":"5491","article-title":"Optimal Rate Delay Tradeoffs and Delay Mitigating Codes for Multipath Routed and Network Coded Networks","volume":"55","author":"walsh","year":"2009"},{"key":"ref11","first-page":"913","article-title":"Trading Rate for Delay at the Application and Transport Layers (Guest Editorial)","volume":"29","author":"walsh","year":"2011"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201340"},{"key":"ref13","article-title":"Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation","author":"apte","year":"2016"},{"key":"ref14","article-title":"Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding","author":"apte","year":"2016"},{"key":"ref15","article-title":"Algorithms for Computing Limits on Information Flow and Storage in Networks","author":"apte","year":"2016","journal-title":"PhD thesis"},{"key":"ref16","author":"apte","year":"0","journal-title":"Information Theoretic Converse Prover"},{"key":"ref17","author":"apte","year":"0","journal-title":"Information Theoretic Achievability Prover"},{"key":"ref18","author":"li","year":"0","journal-title":"Network Enumeration and Hierarchy in GAP"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2745620"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009410"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61576-8_77"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2414926"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2319075"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3390\/e20080603"},{"key":"ref7","article-title":"Index coding capacity: How far can one go with only shannon inequalities?","author":"sun","year":"2013","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140516"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310926"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620462"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176793"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360731"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028610"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875245"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360731"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2628791"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570825"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849369.pdf?arnumber=8849369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:17Z","timestamp":1773347657000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849369\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849369","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}