{"id":"W2908903570","doi":"10.1007/s00236-021-00411-z","title":"On Huang and Wong’s algorithm for generalized binary split trees","year":2022,"lang":"en","type":"preprint","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Hong Kong University of Science and Technology; University of Waterloo; Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Algorithm; Mathematics; Binary number; Dynamic programming; Property (philosophy); Time complexity; Optimal binary search tree; Binary tree; Computer science; Tree structure; 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.0007593385,0.000320856,0.0004100516,0.0004352191,0.0003412148,0.0003633757,0.001922608,0.0001484724,0.0001084731],"category_scores_gemma":[0.0001596537,0.0002950059,0.0001619394,0.0002638822,0.000111272,0.0006938629,0.004229287,0.0007171375,0.00001904895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113072,"about_ca_system_score_gemma":0.0001483019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008644566,"about_ca_topic_score_gemma":0.000001112013,"domain_scores_codex":[0.9978831,0.00009762428,0.000483704,0.0004386015,0.0005720753,0.0005248668],"domain_scores_gemma":[0.9975522,0.0006168978,0.0002383677,0.001331171,0.00008725964,0.0001740777],"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.0001096761,0.0001369151,0.00001112272,0.0006351577,0.0001991896,0.00002459729,0.003994562,0.001544486,0.00006536029,0.4133101,0.01126794,0.5687009],"study_design_scores_gemma":[0.0009789303,0.0004866908,0.0001880787,0.00009213983,0.00002057693,0.00001724611,0.0001579073,0.7057574,0.0001370618,0.2546099,0.03696222,0.0005917401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0388743,0.0004333509,0.9382555,0.002932037,0.001479559,0.003726725,0.0003851644,0.0006676862,0.01324569],"genre_scores_gemma":[0.0263349,0.0003542409,0.9666672,0.001795642,0.0001400492,0.001963625,0.0002850541,0.00006730246,0.002391981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.704213,"threshold_uncertainty_score":0.9999502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02943207565423358,"score_gpt":0.3137747860426243,"score_spread":0.2843427103883907,"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."}}