{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:05:19Z","timestamp":1761293119036},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"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":[[2014,5]]},"DOI":"10.1109\/tit.2014.2308998","type":"journal-article","created":{"date-parts":[[2014,2,27]],"date-time":"2014-02-27T19:03:54Z","timestamp":1393527834000},"page":"2884-2895","source":"Crossref","is-referenced-by-count":15,"title":["A Geometric Perspective to Multiple-Unicast Network Coding"],"prefix":"10.1109","volume":"60","author":[{"family":"Tang Xiahou","sequence":"first","affiliation":[]},{"family":"Zongpeng Li","sequence":"additional","affiliation":[]},{"family":"Chuan Wu","sequence":"additional","affiliation":[]},{"family":"Jiaqing Huang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273343"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/1969989"},{"key":"ref30","author":"fragouli","year":"2007","journal-title":"Network Coding Fundamentals"},{"key":"ref34","first-page":"325","article-title":"Network coding in star networks","author":"yazdi","year":"0","journal-title":"Proc IEEE ISIT"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883634"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523398"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394800"},{"key":"ref14","author":"mitzenmacher","year":"2007","journal-title":"Network Coding Open Problems"},{"key":"ref15","author":"chekuri","year":"2009","journal-title":"Routing Vs Network Coding"},{"key":"ref16","first-page":"1","article-title":"Tighter cut-based bounds for k-pairs communication problems","author":"harvey","year":"0","journal-title":"Proc 43rd Annu Allerton Conf Commun Control Computing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595304"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-9019-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557369"},{"key":"ref28","first-page":"1","article-title":"Network coding in undirected networks","author":"li","year":"0","journal-title":"Proc 38th Annu CISS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283627"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570816"},{"key":"ref3","author":"li","year":"2012","journal-title":"Space Information Flow"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405308"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283071"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557213"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref2","author":"harvey","year":"2004","journal-title":"Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.344"},{"key":"ref1","first-page":"1","article-title":"Network coding: The case of multiple unicast sessions","author":"li","year":"0","journal-title":"Proc 42nd Annu Allerton Conf Commun Control Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040866"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1971.1083312"},{"key":"ref21","first-page":"129","article-title":"On an extension of the maximum-flow minimum-cut theorem to multicommodity flows","volume":"13","author":"iri","year":"1971","journal-title":"J Oper Res Soc Jpn"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050932"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261656"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962872"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090620"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6800061\/06750094.pdf?arnumber=6750094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:53Z","timestamp":1642004993000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6750094\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":34,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2308998","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5]]}}}