{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T10:20:03Z","timestamp":1725445203938},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874831","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"241-245","source":"Crossref","is-referenced-by-count":0,"title":["Scalable upper bounding models for wireless networks"],"prefix":"10.1109","author":[{"given":"Jinfeng","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454134"},{"journal-title":"A Theory of Network Equivalence Part II","year":"2010","author":"koetter","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2102110"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802612"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089494"},{"key":"5","article-title":"Equivalent models for multiterminal channels","author":"calmon","year":"2011","journal-title":"Proc IEEE ITW"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513528"},{"journal-title":"Scalable Capacity Bounding Models for Wireless Networks","year":"2014","author":"du","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054651"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"12","article-title":"Tighter cut-set bounds for k-pairs communication problems","author":"harvey","year":"2005","journal-title":"Proc 43rdAllerton"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874831.pdf?arnumber=6874831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:24:17Z","timestamp":1602674657000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874831","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}