{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:22:20Z","timestamp":1730272940873,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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":[[2019,6]]},"DOI":"10.1109\/iscc47284.2019.8969610","type":"proceedings-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T05:16:57Z","timestamp":1580447817000},"page":"1119-1122","source":"Crossref","is-referenced-by-count":0,"title":["Anonymous multi-source counting statistics New methodology applied to the health sector"],"prefix":"10.1109","author":[{"given":"T.","family":"Delsate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Boukhebouze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"A Review for Weighted MinHash Algorithms","year":"2018","author":"wei","key":"ref4"},{"key":"ref3","first-page":"241","volume":"37","year":"0","journal-title":"Paul Jaccard (1901) Bulletin de la Société vaudoise des sciences naturelles"},{"journal-title":"COMS 6998-12 Dealing with Massive Data (lecture notes Columbia university)","year":"2011","author":"vassilvitskii","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1086\/678125"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1098\/rsbl.2006.0553"},{"key":"ref8","first-page":"21","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proc Conf Compression and Complexity of Sequences"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1600-0587.2012.00124.x"},{"key":"ref2","first-page":"1","volume":"l119","year":"2016","journal-title":"Regulation (EU) 2016\/679 of the European Parliament and of the Council of 27 April 2016 (General Data Protection Regulation) Official Journal of the European Union"},{"key":"ref9","first-page":"327","article-title":"Min-wise independent permutations","author":"broder","year":"1998","journal-title":"Proc of the 30th ACM Symp on Theory of Computing (STOC"},{"journal-title":"World Economic Forum","year":"2017","key":"ref1"}],"event":{"name":"2019 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2019,6,29]]},"location":"Barcelona, Spain","end":{"date-parts":[[2019,7,3]]}},"container-title":["2019 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8961334\/8969568\/08969610.pdf?arnumber=8969610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T17:10:01Z","timestamp":1657991401000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8969610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/iscc47284.2019.8969610","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}