{"id":"W2966205006","doi":"10.1145/3595180","title":"Competitive Online Search Trees on Trees","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Fonds De La Recherche Scientifique - FNRS; York University; National Science Foundation","keywords":"Ternary search tree; Weight-balanced tree; Binary search tree; Optimal binary search tree; Range tree; Self-balancing binary search tree; K-ary tree; Mathematics; Binary tree; Tree (set theory); Combinatorics; Generalization; Vertex (graph theory); Search tree; Path (computing); Interval tree; Set (abstract data type); Search algorithm; Computer science; Tree structure; Algorithm; Graph","routes":{"ca_aff":true,"ca_fund":true,"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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002401582,0.0002747968,0.0002568055,0.000493737,0.0004880814,0.0001728845,0.00162251,0.0001119852,0.0001363753],"category_scores_gemma":[0.0000257381,0.0002356011,0.0001546706,0.001328071,0.0000902915,0.0004856445,0.0000797575,0.0004829372,0.001271268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007126211,"about_ca_system_score_gemma":0.00007109872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001527104,"about_ca_topic_score_gemma":0.0001402665,"domain_scores_codex":[0.9976724,0.0001230479,0.0002770978,0.0007216664,0.0006956169,0.000510207],"domain_scores_gemma":[0.9977031,0.0004637458,0.00004037554,0.001489366,0.00009924062,0.0002041614],"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.0000302142,0.0006572943,0.000007593852,0.000006988498,0.00005634515,0.00008414809,0.0005304546,0.0105422,0.0004770251,0.005625976,0.00100881,0.9809729],"study_design_scores_gemma":[0.002714384,0.002085075,0.03313168,0.0003147599,0.00003834712,0.00005826444,0.001219183,0.8880336,0.01281717,0.004179933,0.05418194,0.001225647],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007461742,0.00003712627,0.9827312,0.005404918,0.001131721,0.0003176026,0.0004928549,0.001278111,0.001144698],"genre_scores_gemma":[0.6258402,0.001053514,0.3609371,0.002104175,0.0007480059,0.0001880417,0.0004363663,0.0001362898,0.008556329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9797473,"threshold_uncertainty_score":0.9995064,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04541435443245161,"score_gpt":0.3085284622071648,"score_spread":0.2631141077747132,"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."}}