{"id":"W3134377377","doi":"10.1145/3477910","title":"A Simple Algorithm for Optimal Search Trees with Two-way Comparisons","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Hong Kong University of Science and Technology; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Simple (philosophy); Correctness; Running time; Algorithm; Time complexity; Mathematics; Optimal binary search tree; Computer science; Search algorithm; SIMPLE algorithm; Search tree; Theoretical computer science; Interval tree","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009759779,0.001353725,0.00131043,0.001637538,0.001060803,0.001553122,0.002271449,0.001713817,0.01625681],"category_scores_gemma":[0.005247977,0.00076143,0.001199022,0.002710434,0.001034123,0.004499091,0.003327923,0.002121089,0.00561908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009126542,"about_ca_system_score_gemma":0.002261556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001461818,"about_ca_topic_score_gemma":0.002799256,"domain_scores_codex":[0.9981908,0.0002699766,0.0001653533,0.0004177971,0.0007192465,0.0002367938],"domain_scores_gemma":[0.9984056,0.0005611643,0.0001077793,0.0005091477,0.0003440111,0.00007226057],"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.0003688556,0.0002968882,0.0007762483,0.0006168315,0.0001056257,0.0001499251,0.0002156818,0.02740801,0.02139824,0.08621456,0.03169999,0.8307492],"study_design_scores_gemma":[0.0009584457,0.0005238054,0.001155122,0.0001547651,0.0001618936,0.001565489,0.000270924,0.4634731,0.03610707,0.3981248,0.09728482,0.0002197791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003345777,0.0002691305,0.9897974,0.0001799752,0.0001091239,0.0001921532,0.0002254127,0.003194233,0.002686918],"genre_scores_gemma":[0.04383558,0.0001228584,0.9526762,0.0001077538,0.00005267633,0.0002748605,0.0005741285,0.0003625415,0.001993552],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01625681,"threshold_uncertainty_score":0.05438447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03521639021366656,"score_gpt":0.3036884071578162,"score_spread":0.2684720169441496,"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."}}