{"id":"W49738050","doi":"10.1007/978-3-319-08783-2_9","title":"On the Smoothed Heights of Trie and Patricia Index Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Trie; Combinatorics; String (physics); Bernoulli's principle; Tree (set theory); Binary tree; Set (abstract data type); Mathematics; Computer science; Discrete mathematics; Algorithm; Data structure; Physics; Mathematical physics","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.0007761458,0.000370815,0.0004465878,0.0004451064,0.0002414686,0.0002676557,0.002772207,0.0002133508,0.00001467755],"category_scores_gemma":[0.00009569737,0.0002209136,0.00008030327,0.0003720115,0.0006636694,0.0002187726,0.001307367,0.0005237896,0.000008017071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005083452,"about_ca_system_score_gemma":0.0001698293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003409954,"about_ca_topic_score_gemma":0.00003488073,"domain_scores_codex":[0.9973719,0.00005480542,0.0003956796,0.0009752797,0.0008533995,0.0003489489],"domain_scores_gemma":[0.9966368,0.001358293,0.000324003,0.00145336,0.000126931,0.0001006298],"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.00001067632,0.00002302991,0.00004330286,0.00001722806,0.000008232997,0.00001503144,0.000335285,0.003152078,0.00004314078,0.1633003,0.00009774234,0.832954],"study_design_scores_gemma":[0.0003006315,0.0002912881,0.0005668211,0.0003698157,0.000005647831,0.00001694955,1.071766e-7,0.6141464,0.0006941136,0.3808333,0.002390137,0.0003848366],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004267791,0.000343276,0.9962614,0.0006625506,0.000619891,0.0002565524,0.000006701364,0.00004801411,0.001374795],"genre_scores_gemma":[0.9058158,0.0001065766,0.09129281,0.002033523,0.0004237458,0.000007855318,0.000004230051,0.00003331582,0.0002821063],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9053891,"threshold_uncertainty_score":0.9008597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01215133138358691,"score_gpt":0.2210946877191035,"score_spread":0.2089433563355166,"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."}}