{"id":"W2030063053","doi":"10.1142/s0129054102001497","title":"CONSTRUCTING RED-BLACK TREE SHAPES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tree (set theory); Correctness; Binary tree; Mathematics; Combinatorics; Sequence (biology); Optimal binary search tree; Random binary tree; K-ary tree; Range tree; Algorithm; Ternary search tree; Weight-balanced tree; Interval tree; Discrete mathematics; Binary search tree; Tree structure; Chemistry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001310581,0.0006598573,0.0007615239,0.001059972,0.001082457,0.001199364,0.001824258,0.001187474,0.003145997],"category_scores_gemma":[0.008398391,0.0008624602,0.0009147714,0.001095421,0.001650829,0.002733513,0.002759838,0.001402231,0.001685022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007133414,"about_ca_system_score_gemma":0.0009537748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009386771,"about_ca_topic_score_gemma":0.001417148,"domain_scores_codex":[0.9983141,0.0003381423,0.0001260474,0.0003038952,0.000704938,0.0002129379],"domain_scores_gemma":[0.9958166,0.001243221,0.0003990954,0.001434622,0.0008869633,0.0002194164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006548635,0.000210702,0.004758751,0.0005043341,0.00007480291,0.0009044248,0.001980731,0.05393761,0.08331689,0.4648537,0.01199393,0.3768093],"study_design_scores_gemma":[0.0001058686,0.0002273643,0.001434512,0.0002080572,0.00009419372,0.001063476,0.0004566779,0.3784183,0.1566922,0.3591313,0.102047,0.0001210733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04889825,0.0001992973,0.93655,0.0002982796,0.00007184804,0.0001652864,0.0002952857,0.004604308,0.008917418],"genre_scores_gemma":[0.2574911,0.0002053555,0.7350606,0.0002693978,0.0000183112,0.0002087516,0.0006403474,0.001307315,0.004798952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003145997,"threshold_uncertainty_score":0.01052439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03742748328499703,"score_gpt":0.3026949447411231,"score_spread":0.2652674614561261,"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."}}