{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:14:25Z","timestamp":1725534865864},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283557","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"1657-1661","source":"Crossref","is-referenced-by-count":3,"title":["An information-theoretic meta-theorem on edge-cut bounds"],"prefix":"10.1109","author":[{"given":"Sudeep","family":"Kamath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Multicommodity Flows in Polymatroidal Capacity Networks","year":"2011","author":"chekuri","key":"19"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034008"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732147X"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0833"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978909"},{"key":"13","article-title":"Network coding: The case of multiple unicast sessions","author":"li","year":"0","journal-title":"Proc of the 42nd Allerton Annual Conference on Communication Control and Computing September 2004"},{"key":"14","article-title":"Comparing network coding with the multicommodity flow for the k-pairs communication problem","author":"harvey","year":"2004","journal-title":"MIT LCS"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060673"},{"journal-title":"Proc ACM STOC 2005","year":"0","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0031-x"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920209"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283993"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250817"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-9019-0"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595000"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21958"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250888"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283557.pdf?arnumber=6283557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T00:58:42Z","timestamp":1490144322000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283557\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283557","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}