{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T14:11:45Z","timestamp":1765807905261,"version":"3.37.3"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/tit.2021.3076967","type":"journal-article","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T20:02:03Z","timestamp":1619812923000},"page":"4728-4746","source":"Crossref","is-referenced-by-count":3,"title":["Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1705-7380","authenticated-orcid":false,"given":"Ni","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9965-9483","authenticated-orcid":false,"given":"Parastoo","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Rakotoarivelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-44-01150-6"},{"key":"ref38","article-title":"On tightness of mutual dependence upperbound for secret-key capacity of multiple terminals","author":"chan","year":"2008","journal-title":"arXiv 0805 3200"},{"article-title":"A faster parametric submodular function minimization algorithm and applications","year":"2007","author":"nagano","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00458-4"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007051"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694850"},{"journal-title":"Elements of Information Theory","year":"2012","author":"cover","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.4.803"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580381"},{"key":"ref62","first-page":"1","article-title":"Provable submodular minimization via Fujishige-Wolfe algorithm","author":"chakrabarty","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref61","first-page":"1141","article-title":"SFO: A toolbox for submodular function optimization","volume":"11","author":"krause","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/2528404"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006942"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176786"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9177-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541715"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636087"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006995"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2630054"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3829"},{"key":"ref21","first-page":"1759","article-title":"Minimum average cost clustering","author":"nagano","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557610"},{"article-title":"Partition inequalities: Separation, extensions and network design","year":"2011","author":"ba\u00efou","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176782"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081210"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2533546"},{"key":"ref59","first-page":"3","article-title":"A submodular function minimization algorithm based on the minimum-norm base","volume":"7","author":"fujishige","year":"2011","journal-title":"Pacific J Optim"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0189-2"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0084-2"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437930"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006783"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513313"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743607"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90070-D"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCChina.2012.6356856"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120324"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290993"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523980"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848809"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761390"},{"journal-title":"Submodular Functions and Optimization","year":"2005","author":"fujishige","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555923"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089530"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707096"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref49","article-title":"Attaining fairness in communication for omniscience","author":"ding","year":"2019","journal-title":"arXiv 1902 03706"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2010.5680380"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437475"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034157"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2749372"},{"key":"ref42","article-title":"Part I: Improving computational efficiency of communication for omniscience","author":"ding","year":"2019","journal-title":"arXiv 1912 11808"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76796-1_7"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.221"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9457114\/09420101.pdf?arnumber=9420101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:27Z","timestamp":1652194467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9420101\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":65,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3076967","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}