{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:36Z","timestamp":1773377736722,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9173964","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1617-1622","source":"Crossref","is-referenced-by-count":2,"title":["The Langberg-M\u00e9dard Multiple Unicast Conjecture: Stable 3-Pair Networks"],"prefix":"10.1109","author":[{"given":"Kai","family":"Cai","sequence":"first","affiliation":[{"name":"The University of Hong Kong"}]},{"given":"Guangyue","family":"Han","sequence":"additional","affiliation":[{"name":"The University of Hong Kong"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874434"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394800"},{"key":"ref12","article-title":"Network coding: The case of multiple unicast sessions","author":"li","year":"2004","journal-title":"Proc 42nd Annual Allerton"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283627"},{"key":"ref14","article-title":"Combinatorial Optimization","author":"schrijver","year":"2003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261881"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.040214.140280"},{"key":"ref17","author":"yeung","year":"2006","journal-title":"Network Coding Theory (Foundations and Trends in Communications and Information Theory)"},{"key":"ref4","article-title":"On the Langberg-Médard k-unicast conjecture with k = 3,4","author":"cai","year":"2018","journal-title":"Proc ISIT"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0132-2"},{"key":"ref6","article-title":"Introduction to algorithms","author":"cormen","year":"2009"},{"key":"ref5","article-title":"The Langberg-Médard multiple unicast conjecture: stable 3-pair networks","author":"cai","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref7","article-title":"Menger’s paths with minimum mergings","author":"han","year":"2009","journal-title":"Proc ITW"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541711"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282478"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874543"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09173964.pdf?arnumber=9173964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:01Z","timestamp":1773347701000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9173964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9173964","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}