{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:32:01Z","timestamp":1724135521950},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/netcod.2012.6261881","type":"proceedings-article","created":{"date-parts":[[2012,8,16]],"date-time":"2012-08-16T20:06:13Z","timestamp":1345147573000},"source":"Crossref","is-referenced-by-count":9,"title":["A geometric framework for investigating the multiple unicast network coding conjecture"],"prefix":"10.1109","author":[{"given":"Tang","family":"Xiahou","sequence":"first","affiliation":[]},{"given":"Chuan","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jiaqing","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523398"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394800"},{"key":"ref13","article-title":"Network Coding: Open Problems","author":"mitzenmacher","year":"2007","journal-title":"post Tech Rep"},{"key":"ref14","article-title":"Routing vs. Network Coding","author":"chekuri","year":"2009","journal-title":"Tech Rep"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"ref16","article-title":"Network Coding in Star Networks","author":"yazdi","year":"2008","journal-title":"Proc of IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283627"},{"key":"ref3","article-title":"Space Information Flow","author":"li","year":"2012","journal-title":"submitted to NetCod"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283071"},{"key":"ref8","article-title":"The Capacity Region for Multisource Multi-sink Network Coding","author":"yan","year":"2007","journal-title":"Proc of IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref2","article-title":"Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem","author":"harvey","year":"2004","journal-title":"MIT-LCS-TR-964 Tech Rep"},{"key":"ref1","article-title":"Network Coding: The Case of Multiple Unicast Sessions","author":"li","year":"2004","journal-title":"Proc of The 42nd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.344"}],"event":{"name":"2012 International Symposium on Network Coding (NetCod)","location":"Cambridge, MA, USA","start":{"date-parts":[[2012,6,29]]},"end":{"date-parts":[[2012,6,30]]}},"container-title":["2012 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6253017\/6261874\/06261881.pdf?arnumber=6261881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T21:06:16Z","timestamp":1490130376000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6261881\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/netcod.2012.6261881","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}