{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:40:00Z","timestamp":1725583200694},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033983","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"234-238","source":"Crossref","is-referenced-by-count":10,"title":["Network flows for functions"],"prefix":"10.1109","author":[{"given":"Virag","family":"Shah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bikash Kumar","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Manjunath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328924"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057272"},{"key":"ref11","first-page":"257","article-title":"Network coding in undirected networks","author":"li","year":"2004","journal-title":"Proceedings of the 38th CISS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595066"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033983"},{"key":"ref8","article-title":"Sum-networks: system of polynomial equations, reversibility, insufficiency of linear network coding, unachiev-ability of coding capacity","author":"rai","year":"0","journal-title":"IEEE Trans Inform Th"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77620"},{"key":"ref9","article-title":"Network coding for computing part i: Cut-set bounds","author":"appuswamy","year":"0","journal-title":"IEEE Trans Inform Th"},{"article-title":"Network Flows: Theory, Algorithms, and Applications","year":"1993","author":"ahuja","key":"ref1"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033983.pdf?arnumber=6033983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:10:41Z","timestamp":1490065841000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033983","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}