{"id":"W2760015015","doi":"10.1007/978-3-030-29962-0_17","title":"An Efficiently Searchable Encrypted Data Structure for Range Queries","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Plaintext; Overhead (engineering); Cryptanalysis; Data structure; Theoretical computer science; Data mining; Database; Computer security","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":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002145414,0.0006032475,0.0006657887,0.0009020608,0.0004434333,0.002185868,0.01773767,0.0004385615,0.00001221055],"category_scores_gemma":[0.0003082099,0.0005424256,0.0001292401,0.002321872,0.0007743468,0.002173112,0.01182727,0.001229845,0.000006229798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001327139,"about_ca_system_score_gemma":0.001269235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002622514,"about_ca_topic_score_gemma":0.000481457,"domain_scores_codex":[0.993299,0.0001960507,0.0005398946,0.003609475,0.001180249,0.001175324],"domain_scores_gemma":[0.9902707,0.0006868124,0.0002809274,0.008077587,0.0004054172,0.0002785775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001009202,0.0004696894,0.005987786,0.000847674,0.00005044569,0.00004081205,0.007111445,0.5109394,0.002449584,0.0145896,0.0003029251,0.4571097],"study_design_scores_gemma":[0.0004412848,0.0001995763,0.001868961,0.0001492765,0.000008905966,0.00001530459,0.000001491823,0.9241544,0.002430608,0.06961463,0.0004639229,0.0006516491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02911266,0.0005313559,0.9630447,0.0005769476,0.004067237,0.001389902,0.0009875012,0.0002838449,0.000005814267],"genre_scores_gemma":[0.5098733,0.00001491185,0.4890101,0.0004797452,0.000281664,0.00001709907,0.0003076519,0.00001539829,1.229453e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4807606,"threshold_uncertainty_score":0.9997028,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03227953578566503,"score_gpt":0.3079968936761742,"score_spread":0.2757173578905092,"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."}}