{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007931378,0.00009526921,0.0001596959,0.0006948585,0.0001066958,0.0004004798,0.003201078,0.00002485937,0.0000262806],"category_scores_gemma":[0.0005431979,0.0000865906,0.0000956853,0.0006626802,0.0005152317,0.00171715,0.0003697842,0.0001382825,0.000009428954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001155549,"about_ca_system_score_gemma":0.0001483198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006635279,"about_ca_topic_score_gemma":0.00000101665,"domain_scores_codex":[0.9980405,0.00003237355,0.0005689518,0.0001998744,0.0009980077,0.0001602772],"domain_scores_gemma":[0.9967908,0.000340349,0.0006555564,0.0002512013,0.001876514,0.00008561745],"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.000004047915,0.0001515625,0.006466536,0.000004963716,0.00004533969,0.00003131118,0.0008620359,0.000757698,0.0005946935,0.05491749,0.005669823,0.9304945],"study_design_scores_gemma":[0.0005958423,0.0003333398,0.008835312,0.000313861,0.00001107833,0.00150699,0.00001546378,0.8908471,0.004119867,0.09153701,0.001613971,0.0002701512],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01547201,0.00003088419,0.9779466,0.002711828,0.001280682,0.00003668886,0.00000104601,0.0002679632,0.002252291],"genre_scores_gemma":[0.5753278,0.000007819819,0.4244241,0.0000905254,0.0001348634,3.522783e-7,1.488792e-7,0.000002252407,0.00001218515],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9302244,"threshold_uncertainty_score":0.5948452,"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."}}