{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434051,0.00009776057,0.0001774754,0.00008253348,0.0004756447,0.0005441907,0.002399202,0.00002978422,7.300093e-7],"category_scores_gemma":[0.000006232008,0.00004771015,0.00004536925,0.0002421329,0.00007343297,0.001387362,0.0005743368,0.000093824,4.836304e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002030381,"about_ca_system_score_gemma":0.0002887645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004150326,"about_ca_topic_score_gemma":0.000007239345,"domain_scores_codex":[0.9988016,0.00002975264,0.0003446669,0.0002533884,0.0004074665,0.0001630709],"domain_scores_gemma":[0.9989303,0.0001760309,0.0002893114,0.0004004922,0.00009815107,0.0001056729],"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.00004549027,0.00009701445,0.0009050259,0.0001728623,0.0001711033,0.00004722684,0.002996665,0.04398482,0.0004944146,0.2321253,0.05085541,0.6681046],"study_design_scores_gemma":[0.001820187,0.001206229,0.008088204,0.0007061023,0.00004701357,0.004571329,0.0004775288,0.9229779,0.00007365801,0.02929794,0.03042791,0.0003060351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001999446,0.001574633,0.9932528,0.001934538,0.001012144,0.0001492543,0.0000155561,0.00001800796,0.00004362908],"genre_scores_gemma":[0.4340887,0.0000451121,0.5643814,0.0002008778,0.001262333,0.000001059957,0.000001700859,0.000003697447,0.00001506785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.878993,"threshold_uncertainty_score":0.5247644,"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."}}