{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:41:02Z","timestamp":1776444062403,"version":"3.51.2"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/tit.2010.2095070","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:15:42Z","timestamp":1295640942000},"page":"1015-1030","source":"Crossref","is-referenced-by-count":92,"title":["Network Coding for Computing: Cut-Set Bounds"],"prefix":"10.1109","volume":"57","author":[{"given":"Rathinakumar","family":"Appuswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Franceschetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"Zeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1109\/ITW.2004.1405315","article-title":"network coding gain of combination networks","author":"ngai","year":"2004","journal-title":"Proc IEEE Information Theory Workshop"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"ref32","first-page":"142","article-title":"complexity classification of network information flow problems","author":"rasala lehman","year":"2003","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205758"},{"key":"ref30","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904785"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924648"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205926"},{"key":"ref34","first-page":"51","article-title":"two-terminal distributed source coding with alternating messages for function computation","author":"ma","year":"2008","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400474"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205983"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref21","author":"hardy","year":"1979","journal-title":"An Introduction to the Theory of Numbers"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref23","article-title":"comparing network coding with multicommodity flow for the k-pairs communication problem","author":"harvey","year":"2004","journal-title":"M I T LCS Tech Rep 964"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158545"},{"key":"ref25","first-page":"266","article-title":"packing steiner trees","author":"jain","year":"2003","journal-title":"Proc 14th Ann ACM-SIAM Symp Discrete Algorithms"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909156"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557136"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2006.355146"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205921"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2007.34"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874405"},{"key":"ref14","first-page":"1056","article-title":"a tight lower bound for parity in noisy communication networks","author":"dutta","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref15","first-page":"1419","article-title":"functional source coding for networks with receiver side information","author":"feng","year":"2004","journal-title":"Proc 42nd Allerton Conf Computation Communication and Control"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-1-4612-4808-8_14","author":"el gamal","year":"1987","journal-title":"Open Prob in Commun and Comput"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/060654864"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595067"},{"key":"ref3","article-title":"lower bounds on information rates for distributed computation via noisy channels","author":"ayaso","year":"2007","journal-title":"Proc 45th Allerton Conf Computation Communication and Control"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref5","article-title":"gossip along the way: order-optimal consensus through randomized path averaging","author":"benezit","year":"2007","journal-title":"Proc 45th Allerton Conf Computation Communication and Control"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205989"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864474"},{"key":"ref49","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1127777.1127791"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055607"},{"key":"ref45","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056560"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595267"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503143"},{"key":"ref44","author":"vazirani","year":"2004","journal-title":"Approximation Algorithms"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557216"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5695090\/05695137.pdf?arnumber=5695137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:41Z","timestamp":1633909661000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5695137\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":50,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2095070","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}