{"id":"W1997569066","doi":"10.1016/j.jda.2014.01.002","title":"Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20]","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Disjoint sets; Set (abstract data type); Algorithm; Computer science; Mathematics; Combinatorics","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.007419859,0.003202937,0.003297457,0.004370946,0.006627126,0.005048587,0.009035851,0.006346044,0.03192697],"category_scores_gemma":[0.1035544,0.002091662,0.003471677,0.005934908,0.007793692,0.01092662,0.004320625,0.01725026,0.01480588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005895203,"about_ca_system_score_gemma":0.00495819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02543768,"about_ca_topic_score_gemma":0.02288828,"domain_scores_codex":[0.9850209,0.004528454,0.001179617,0.002895641,0.005640983,0.0007343304],"domain_scores_gemma":[0.9562827,0.01699531,0.001670629,0.006984009,0.01679288,0.001274446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001200733,0.00003074743,0.0001466674,0.0002183121,0.00006624246,0.0001431062,0.0001533614,0.0008554081,0.000296984,0.04788153,0.9359468,0.01414065],"study_design_scores_gemma":[0.0001591552,0.00005218273,0.0008868256,0.0003081553,0.0001751676,0.0006143734,0.0001854814,0.009390872,0.002040838,0.2711662,0.7147658,0.0002549124],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.00230787,0.006440333,0.08528794,0.2512029,0.6208869,0.0001118802,0.002122802,0.003892374,0.02774697],"genre_scores_gemma":[0.1354216,0.01773836,0.1448718,0.1809234,0.2998535,0.0005491388,0.004831363,0.009349241,0.2064617],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.03192697,"threshold_uncertainty_score":0.1068063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01905617632858814,"score_gpt":0.3086476241732968,"score_spread":0.2895914478447087,"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."}}