{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383154,0.0005766241,0.0008737235,0.001224942,0.0007771679,0.001194541,0.001814123,0.001144915,0.005252604],"category_scores_gemma":[0.005602912,0.0004619261,0.0007543205,0.00219495,0.001028129,0.002852273,0.002286654,0.001716859,0.001242234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161242,"about_ca_system_score_gemma":0.002040464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003922618,"about_ca_topic_score_gemma":0.004886625,"domain_scores_codex":[0.9986449,0.0003376829,0.00009906114,0.0002869342,0.0004313012,0.0002001531],"domain_scores_gemma":[0.9983639,0.000775673,0.00008399516,0.000367613,0.0003404748,0.00006830582],"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.0007378787,0.000161362,0.001294894,0.0002236116,0.00007696641,0.0003023215,0.0005859418,0.1070438,0.01424405,0.2250766,0.01443763,0.635815],"study_design_scores_gemma":[0.0002950748,0.0001527377,0.0004306451,0.00004794163,0.0000469446,0.0002046662,0.0001728593,0.7116011,0.01027425,0.2587397,0.01798634,0.00004782459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04101315,0.0003712907,0.9503887,0.0007432023,0.0001152654,0.0002606851,0.0001538912,0.001661128,0.005292648],"genre_scores_gemma":[0.1633267,0.0001578244,0.8304384,0.0002424575,0.0000532805,0.0002687907,0.0004550444,0.0004083808,0.004649092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005252604,"threshold_uncertainty_score":0.01757169,"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."}}