{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T16:11:59Z","timestamp":1782835919648,"version":"3.54.5"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61571335"],"award-info":[{"award-number":["61571335"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61628209"],"award-info":[{"award-number":["61628209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61571136"],"award-info":[{"award-number":["61571136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012164","name":"863 program","doi-asserted-by":"crossref","award":["2015AA016106"],"award-info":[{"award-number":["2015AA016106"]}],"id":[{"id":"10.13039\/501100012164","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/tit.2017.2771738","type":"journal-article","created":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T19:24:16Z","timestamp":1510169056000},"page":"4530-4539","source":"Crossref","is-referenced-by-count":13,"title":["A Reduction Approach to the Multiple-Unicast Conjecture in Network Coding"],"prefix":"10.1109","volume":"64","author":[{"given":"Xunrui","family":"Yin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaduo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"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.874405"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090620"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050932"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.053013.120542"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2270438"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80012-3"},{"key":"ref18","first-page":"329","article-title":"Homotopic routing methods","author":"schrijver","year":"1990","journal-title":"Paths Flows and VLSI-Layout"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874543"},{"key":"ref4","author":"mitzenmacher","year":"2007","journal-title":"Network Coding Open Problems"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2308998"},{"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"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595304"},{"key":"ref1","first-page":"1","article-title":"Network coding: The case of multiple unicast sessions","volume":"16","author":"li","year":"2004","journal-title":"Proc 42nd Annu Allerton Conf Commun Control Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283627"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/304893.304983"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102417379"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.79"},{"key":"ref26","author":"stolee","year":"2011","journal-title":"Isomorph-free generation of 2-connected graphs with applications"},{"key":"ref25","year":"2016","journal-title":"Checking Coding Advantage in Small Networks"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8361085\/08101552.pdf?arnumber=8101552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T04:45:03Z","timestamp":1643172303000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8101552\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":26,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2771738","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}