{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T03:36:10Z","timestamp":1730259370864,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/ict.2018.8464913","type":"proceedings-article","created":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T22:10:07Z","timestamp":1537222207000},"page":"356-360","source":"Crossref","is-referenced-by-count":1,"title":["Partition of Random Items: Tradeoff between Binning Utility and Meta Information Leakage"],"prefix":"10.1109","author":[{"given":"Farhang","family":"Bayat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuangqing","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"570","article-title":"A unified continuous greedy algorithm for submodular maximization.","author":"feldman","year":"2011","journal-title":"FOCS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.34"},{"key":"ref12","article-title":"Maximizing symmetric submodular functions","volume":"abs 1409 5900","author":"feldman","year":"2014","journal-title":"CoRR"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_8"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1109\/TIFS.2018.2790937","article-title":"Non-adaptive sequential detection of active edge-wise disjoint subgraphs under privacy constraints","author":"bayat","year":"2018","journal-title":"IEEE Transactions on Information Forensics Security"},{"key":"ref3","first-page":"1","article-title":"Sequential detection of disjoint subgraphs over boolean mac channels: A probabilistic approach","author":"bayat","year":"2016","journal-title":"2016 IEEE Globecom Workshops (GC Wkshps)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/sec.795"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.06.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2018.8464913"},{"key":"ref7","article-title":"Multi-agent and multivariate submodular optimization","volume":"abs 1612 5222","author":"santiago","year":"2016","journal-title":"CoRR"},{"key":"ref2","first-page":"153","author":"zheleva","year":"2008","journal-title":"Preserving the privacy of sensitive relationships in graph data"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2600566"},{"journal-title":"Combinatorial Optimization","year":"1998","author":"cook","key":"ref9"}],"event":{"name":"2018 25th International Conference on Telecommunications (ICT)","start":{"date-parts":[[2018,6,26]]},"location":"Saint Malo, France","end":{"date-parts":[[2018,6,28]]}},"container-title":["2018 25th International Conference on Telecommunications (ICT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8411300\/8464825\/08464913.pdf?arnumber=8464913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T17:48:40Z","timestamp":1537292920000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8464913\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ict.2018.8464913","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}