{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T23:36:23Z","timestamp":1723073783289},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korea government (MEST)","award":["(2014R1A2A1A11051762)"]},{"DOI":"10.13039\/501100004083","name":"MSIP (Ministry of Science, ICT and Future Planning)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004083","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Information Technology Research Center (ITRC)","award":["(IITP-2015-H8501-15-1007)"]},{"name":"Institute for Information & communications Technology Promotion (IITP)"},{"name":"Basic Science Research Program through the National Research Foundation of Korea (NRF)"},{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["(20110009426)"],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/lcomm.2015.2478462","type":"journal-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T18:27:27Z","timestamp":1442255247000},"page":"1905-1908","source":"Crossref","is-referenced-by-count":30,"title":["Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter"],"prefix":"10.1109","volume":"19","author":[{"given":"Hyesook","family":"Lim","sequence":"first","affiliation":[]},{"given":"Jungwon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Changhoon","family":"Yim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/080445"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2444850"},{"key":"ref10","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/11841036_42","article-title":"Less hashing, same performance: Building a better Bloom Filter","volume":"4168","author":"kirsch","year":"2006","journal-title":"Lect Notes Comput Sci"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.193"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656887"},{"key":"ref7","year":"0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.06.100344"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848146"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7322307\/07264999.pdf?arnumber=7264999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:46:57Z","timestamp":1642006017000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7264999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":11,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2015.2478462","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}