{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:02:02Z","timestamp":1774990922576,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541604","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1774-1778","source":"Crossref","is-referenced-by-count":0,"title":["A reduction approach to the multiple-unicast conjecture in network coding"],"prefix":"10.1109","author":[{"given":"Xunrui","family":"Yin","sequence":"first","affiliation":[{"name":"SKLSE, School of Computer Science, Wuhan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Calgary, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213980"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874543"},{"key":"ref12","article-title":"A reduction approach to the multiple-unicast conjecture","author":"yin","year":"2016"},{"key":"ref13","article-title":"Checking coding advantage in small networks","year":"0"},{"key":"ref14","article-title":"Isomorph-free generation of 2-connected graphs with applications","author":"stolee","year":"2011"},{"key":"ref4","article-title":"Network coding: Open problems","author":"mitzenmacher","year":"2007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109585"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394800"},{"key":"ref5","article-title":"A geometric perspective to multiple-unicast network coding","volume":"60","author":"xiahou","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.344"},{"key":"ref2","article-title":"Comparing network coding with multicommodity flow for the k-pairs communication problem","author":"harvey","year":"2004","journal-title":"Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology"},{"key":"ref1","article-title":"Network coding: The case of multiple unicast sessions","volume":"16","author":"li","year":"2004","journal-title":"42nd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595304"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541604.pdf?arnumber=7541604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:25Z","timestamp":1774986745000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541604\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541604","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}