{"id":"W2567386150","doi":"10.1109/iri.2016.60","title":"Bloom Filter Tree for Fast Search and Synchronization of Tree-Structured Data","year":2016,"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); Synchronizing; Search tree; Metadata; Data structure; Interval tree; Depth-first search; Overhead (engineering); Synchronization (alternating current); Data mining; Search algorithm; Algorithm; Computer network; Mathematics; Operating system","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.000137084,0.00005645839,0.00008237652,0.00004626813,0.00003795716,0.00004290065,0.0005345768,0.00002628996,0.00001319481],"category_scores_gemma":[0.00003264954,0.00003431752,0.00001733496,0.00006489685,0.00003136695,0.0003521732,0.000312471,0.00001960728,0.000002319587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007798795,"about_ca_system_score_gemma":0.00002659887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004912389,"about_ca_topic_score_gemma":0.0001418209,"domain_scores_codex":[0.999391,0.00002023238,0.0001056507,0.0002576042,0.0001132736,0.000112243],"domain_scores_gemma":[0.9992191,0.00009364729,0.00002237096,0.0005702401,0.00005981137,0.00003487911],"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.00001473823,0.0000170215,0.001401876,0.00001842498,0.00001989042,8.144626e-7,0.0001143613,0.000005866795,0.02837952,0.00551718,0.002346711,0.9621636],"study_design_scores_gemma":[0.002557289,0.0002807104,0.01086704,0.00008786687,0.00002602033,0.0000215574,0.00005630916,0.9610143,0.02157337,0.001454118,0.00175854,0.0003029036],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05313863,0.00005516151,0.9453771,0.0008710094,0.00008723814,0.00010027,0.00004218695,0.00003866248,0.0002897725],"genre_scores_gemma":[0.9884538,0.00001409262,0.009926353,0.00006780983,0.00004078771,0.000002041987,0.00001225075,0.000003885786,0.00147899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9618607,"threshold_uncertainty_score":0.1399428,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04022922930280814,"score_gpt":0.2579456104917413,"score_spread":0.2177163811889331,"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."}}