{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002646124,0.0003660419,0.0004193092,0.0002033118,0.0007817433,0.0004078637,0.001384759,0.0001155478,0.0001251597],"category_scores_gemma":[0.00001633875,0.0003125349,0.0002080859,0.0008896714,0.0001096468,0.000784718,0.00008881642,0.0004448257,0.00005998086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008538899,"about_ca_system_score_gemma":0.0002772577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001488144,"about_ca_topic_score_gemma":0.00009996512,"domain_scores_codex":[0.9971492,0.0001176851,0.0003669676,0.00101256,0.0006430766,0.0007105253],"domain_scores_gemma":[0.9969149,0.0004646509,0.00007891282,0.001848483,0.0003810589,0.0003120478],"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.00003065192,0.0006275034,0.00001041674,0.00001137728,0.0001235116,0.00007929176,0.0002475804,0.01350492,0.0002581606,0.0005311375,0.001130552,0.9834449],"study_design_scores_gemma":[0.002784763,0.0006778021,0.0004026873,0.00005391419,0.00005370799,0.0001885994,0.0003581358,0.9496602,0.02046572,0.0005291899,0.02425859,0.0005666983],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005489112,0.000132953,0.9964381,0.001191649,0.0003977449,0.0004207574,0.0003721425,0.0003441825,0.0001535123],"genre_scores_gemma":[0.02140493,0.00004734159,0.9770527,0.0003181253,0.0001592188,0.0001975671,0.0001099905,0.00004584872,0.0006642421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9828782,"threshold_uncertainty_score":0.9999326,"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."}}