{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:20Z","timestamp":1774680620612,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Government within the Australian Research Council under Discovery Projects","doi-asserted-by":"publisher","award":["DP150103658"],"award-info":[{"award-number":["DP150103658"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/tit.2016.2529643","type":"journal-article","created":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T19:27:21Z","timestamp":1455305241000},"page":"1850-1865","source":"Crossref","is-referenced-by-count":12,"title":["Cut-Set Bounds on Network Information Flow"],"prefix":"10.1109","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-0975","authenticated-orcid":false,"given":"Satyajit","family":"Thakor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Grant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terence","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2008.4476184"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.749006"},{"key":"ref31","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023411"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557213"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928963"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090223"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90284-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860435"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874534"},{"key":"ref16","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"2373","DOI":"10.1109\/TIT.2006.874432","article-title":"An outer bound for multisource multisink network coding with minimum cost consideration","volume":"52","author":"yan","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-9019-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978922"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1561\/0100000007","author":"yeung","year":"2006","journal-title":"Network Coding Theory"},{"key":"ref27","author":"schrijver","year":"1998","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref6","author":"fragouli","year":"2008","journal-title":"Network Coding Applications"},{"key":"ref29","volume":"11","author":"kramer","year":"1998","journal-title":"Directed Information for Channels with Feedback"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1561\/9781601980458","author":"fragouli","year":"2007","journal-title":"Network Coding Applications"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8608-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754623"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205943"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.641556"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref21","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262454"},{"key":"ref23","first-page":"41","article-title":"Infinitely many information inequalities","author":"mat\u00fa\u0161","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691218"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/AUSCTW.2011.5728735"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7434091\/7406740.pdf?arnumber=7406740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:03:13Z","timestamp":1642003393000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7406740\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2529643","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}