{"id":"W1977646040","doi":"10.1145/1167350.1167389","title":"On using conditional rotations and randomized heuristics for self-organizing ternary search tries","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Binary search tree; Trie; Ternary search tree; Computer science; Heuristic; Binary number; A priori and a posteriori; Theoretical computer science; Invariant (physics); Search problem; Set (abstract data type); Algorithm; Search algorithm; Binary tree; Search tree; Mathematics; Data structure; Mathematical optimization; Artificial intelligence; Interval tree; Arithmetic","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.000322508,0.00006542308,0.0001160338,0.00008483615,0.0001883773,0.0002502188,0.0001845167,0.0000139351,0.0000208749],"category_scores_gemma":[0.0000585896,0.00005473808,0.00002747381,0.00009437127,0.00003619024,0.0004986702,0.0001156864,0.0000363476,0.0000112449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001686763,"about_ca_system_score_gemma":0.00002196549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005184544,"about_ca_topic_score_gemma":0.00000113087,"domain_scores_codex":[0.9994043,0.00003256757,0.0001294504,0.0001716856,0.000139751,0.0001222353],"domain_scores_gemma":[0.9993068,0.0004605797,0.00002819083,0.0001203384,0.00004900638,0.00003508441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002711101,0.00008584635,0.00003662926,0.00002011802,0.00006275799,0.000003166123,0.0003344939,0.000754104,0.00006056423,0.9863314,0.003308212,0.008731587],"study_design_scores_gemma":[0.01778685,0.00002478918,0.00005219857,0.00000651265,0.00001626762,0.00000396811,0.00002537189,0.966407,0.0003301477,0.01372319,0.00152948,0.00009420551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007797737,0.00002062827,0.9895605,0.001254376,0.00006799454,0.0003341625,0.00001719136,0.0001000464,0.0008473005],"genre_scores_gemma":[0.1814314,0.00001584044,0.8169213,0.0006075221,0.0001362185,0.00001667305,0.00004149571,0.000006588809,0.000822994],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9726082,"threshold_uncertainty_score":0.2412866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02493779807868019,"score_gpt":0.2852842621220211,"score_spread":0.2603464640433409,"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."}}