{"id":"W4388081324","doi":"10.1109/pimrc56721.2023.10293855","title":"An Efficient Bloom Filter-based Range Query Scheme Under Local Differential Privacy","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Bloom filter; Computer science; Differential privacy; Overhead (engineering); Range query (database); Filter (signal processing); Scheme (mathematics); Information privacy; Domain (mathematical analysis); Information retrieval; Web search query; Sargable; Data mining; Computer network; Computer security; Search engine","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001854126,0.0001661568,0.0001577238,0.0001781044,0.0001531794,0.0002357545,0.0008610567,0.00006597514,0.00009028625],"category_scores_gemma":[0.0000109735,0.0001392876,0.0001247198,0.0004122904,0.00005252588,0.0001589315,0.000249013,0.0001493088,0.0003807743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004154418,"about_ca_system_score_gemma":0.00007183781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001706173,"about_ca_topic_score_gemma":0.00001435666,"domain_scores_codex":[0.9984493,0.00008702899,0.0001919968,0.0004881776,0.0003973262,0.0003861318],"domain_scores_gemma":[0.99887,0.0000914954,0.00003740782,0.0007913602,0.00005066014,0.000159097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004904288,0.005089682,0.01741603,0.0002941795,0.0004476361,0.001012563,0.003274944,0.2456929,0.2097612,0.2664414,0.03123401,0.218845],"study_design_scores_gemma":[0.0007373246,0.00007952215,0.006501509,0.00001737127,0.000005961295,0.000003196291,0.00004426335,0.9902478,0.001776686,0.0001253597,0.0002415964,0.0002193402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4792662,0.000009795818,0.518855,0.0006959174,0.0003257605,0.00006459171,0.000001938974,0.0006257417,0.0001550334],"genre_scores_gemma":[0.9969112,0.000001451029,0.00164392,0.0006657619,0.0001174844,0.00001293132,0.00001586255,0.00001288022,0.0006184564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.744555,"threshold_uncertainty_score":0.5679985,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02768034050239556,"score_gpt":0.253283922351686,"score_spread":0.2256035818492904,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}