{"id":"W2293223786","doi":"10.1109/csci.2015.30","title":"Bloom Filter Tree for Fast Search in Tree-Structured Data","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Bloom filter; Tree traversal; Computer science; Tree (set theory); Search tree; Pruning; Set (abstract data type); Interval tree; Fractal tree index; Node (physics); Metadata; Optimal binary search tree; Data structure; Depth-first search; Filter (signal processing); Data mining; Algorithm; Search algorithm; Mathematics; World Wide Web","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.0004133816,0.00008797036,0.0001177621,0.00009368562,0.00003171369,0.0001454374,0.001582491,0.00004001428,0.000008377558],"category_scores_gemma":[0.00005107597,0.00007014289,0.00003063184,0.0001657823,0.00001786812,0.0004513138,0.0006261665,0.00009580178,0.00002743847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002532185,"about_ca_system_score_gemma":0.00008325113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003993584,"about_ca_topic_score_gemma":0.00168994,"domain_scores_codex":[0.9989585,0.00004111669,0.0001409101,0.0004012623,0.000214569,0.0002436129],"domain_scores_gemma":[0.998717,0.00006900192,0.00001772753,0.001038105,0.0000563815,0.0001018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001125742,0.0001684508,0.006414599,0.00002245006,0.00004327973,0.00005219111,0.00203329,0.0003422624,0.003459831,0.01407107,0.1290139,0.8442661],"study_design_scores_gemma":[0.001882313,0.0001244429,0.002900637,0.00001323903,0.000005188216,0.00001701936,0.0002052233,0.9826236,0.0008287097,0.001565366,0.009600836,0.0002333614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1476772,0.000183576,0.8341643,0.004411582,0.0008834243,0.0004621579,0.00006879367,0.0002665454,0.0118825],"genre_scores_gemma":[0.9710725,0.000002176092,0.02336986,0.0005519828,0.0001177981,0.000008929845,0.00004893407,0.000007675844,0.00482016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9822814,"threshold_uncertainty_score":0.2940688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1417759591219327,"score_gpt":0.305617112929154,"score_spread":0.1638411538072213,"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."}}