{"id":"W1528425384","doi":"10.1109/spdp.1990.143551","title":"An optimal parallel minimax tree algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Minimax; Computer science; Tree (set theory); Construct (python library); Algorithm; Parallel algorithm; Running time; Theoretical computer science; Mathematics; Combinatorics; Mathematical optimization; Programming language","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.000089238,0.000127969,0.0001192204,0.00005743842,0.000122032,0.0002155803,0.001106304,0.00005324276,0.0006305972],"category_scores_gemma":[0.000004134708,0.00009937619,0.00004360164,0.0001745486,0.0000269861,0.001210871,0.0002476102,0.00008647973,0.0004280395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001191832,"about_ca_system_score_gemma":0.000008068702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002338338,"about_ca_topic_score_gemma":0.000001996888,"domain_scores_codex":[0.9988658,0.00003362053,0.0001584006,0.0004129432,0.0002511885,0.0002780436],"domain_scores_gemma":[0.9989011,0.00002557536,0.00003677132,0.0008252044,0.00003556423,0.0001758263],"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.000001160259,0.0001493494,0.00001417932,9.324892e-7,0.000004132748,0.00002960019,0.0001608458,0.000101368,0.00007077766,0.003115393,0.02592983,0.9704224],"study_design_scores_gemma":[0.0002728821,0.0001380148,0.000430994,0.000003175676,0.000001603487,0.00002507902,0.00001683224,0.9637939,0.0002402119,0.0002500604,0.03465907,0.0001682229],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004541685,0.000164637,0.984594,0.0004038721,0.0001996039,0.00007092625,0.000004380059,0.0002948314,0.01381356],"genre_scores_gemma":[0.008523998,0.00003321501,0.9886785,0.0004039181,0.0001375947,0.000008702566,0.00000760772,0.000007508498,0.002198954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9702542,"threshold_uncertainty_score":0.6904597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02218531080508962,"score_gpt":0.2459469508847347,"score_spread":0.2237616400796451,"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."}}