{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T22:50:35Z","timestamp":1775515835442,"version":"3.50.1"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"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":[[2010,12]]},"DOI":"10.1109\/tit.2010.2081450","type":"journal-article","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T21:08:54Z","timestamp":1291151334000},"page":"6490-6500","source":"Crossref","is-referenced-by-count":55,"title":["Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing"],"prefix":"10.1109","volume":"56","author":[{"given":"Sirin","family":"Nitinawarat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Narayan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595140"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797559"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081210"},{"key":"ref15","author":"schrijver","year":"1986","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"on the problem of decomposing a graph into <formula formulatype=\"inline\"><tex notation=\"tex\">$n$<\/tex><\/formula> connected factors","volume":"36","author":"tutte","year":"1961","journal-title":"J London Math Soc"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"2398","DOI":"10.1109\/TIT.2006.874430","article-title":"a unification of network coding and tree-packing (routing) theorems","volume":"52","author":"wu","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173731"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557610"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(02)00013-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592086"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01902503"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1109\/TIT.2006.874515","article-title":"on achieving maximum multicast throughput in undirected networks","volume":"52","author":"li","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.825796"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","article-title":"provably secure key distribution based on independent channels","author":"maurer","year":"1990","journal-title":"IEEE Inf Theory Workshop"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262101"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5625612\/05625644.pdf?arnumber=5625644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:47:46Z","timestamp":1633913266000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5625644\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":20,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2081450","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}