{"id":"W2044832252","doi":"10.1016/j.jcss.2003.11.003","title":"Implicit B-trees: a new data structure for the dictionary problem","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Data structure; Computer science; Block (permutation group theory); Combinatorics; Conjecture; Hierarchy; Theoretical computer science; B-tree; Auxiliary memory; Tree (set theory); Arithmetic; Discrete mathematics; Algorithm; Mathematics; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001330767,0.0006515312,0.001733452,0.00239807,0.001335026,0.00274899,0.002865749,0.002453254,0.006605379],"category_scores_gemma":[0.0134229,0.0008008761,0.0007717064,0.005543728,0.001449818,0.006549353,0.004016886,0.004001384,0.004075261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000437605,"about_ca_system_score_gemma":0.001435469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001357939,"about_ca_topic_score_gemma":0.001791831,"domain_scores_codex":[0.9984108,0.0004371275,0.0001430632,0.0002532362,0.0006403648,0.0001154221],"domain_scores_gemma":[0.9947737,0.001931753,0.0003567961,0.001599769,0.001042943,0.0002950054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004863789,0.0001652763,0.001126513,0.0004832573,0.00006387172,0.0002097417,0.0004505064,0.0257068,0.01017889,0.3021772,0.03974205,0.6192095],"study_design_scores_gemma":[0.0001685699,0.0002544973,0.0003136197,0.0001418068,0.00004888781,0.0006355534,0.0001894347,0.3956648,0.006318763,0.5248971,0.07128405,0.00008289176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004189004,0.0005550474,0.9921243,0.0004907966,0.0001938227,0.00004459333,0.00045736,0.0006654232,0.001279671],"genre_scores_gemma":[0.04807834,0.001095089,0.9445224,0.0003866492,0.0004050307,0.0001963304,0.001568047,0.0005444681,0.003203598],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006605379,"threshold_uncertainty_score":0.02209723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03367135016106029,"score_gpt":0.2810130159319378,"score_spread":0.2473416657708775,"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."}}