{"id":"W2001331197","doi":"10.1016/j.jda.2013.10.003","title":"Finding dominators via disjoint set union","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Computer science; Disjoint sets; Correctness; Disjoint union (topology); Set (abstract data type); Theoretical computer science; Data structure; Graph; Time complexity; Simple (philosophy); Algorithm; Code (set theory); Linear programming; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003835499,0.0008873935,0.002826164,0.004566733,0.002589851,0.005634356,0.004070267,0.001986121,0.008401792],"category_scores_gemma":[0.02781858,0.001475324,0.002542607,0.004757301,0.00357278,0.01520115,0.006662973,0.00352054,0.001410124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001566037,"about_ca_system_score_gemma":0.00165701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001443209,"about_ca_topic_score_gemma":0.002066951,"domain_scores_codex":[0.9954614,0.001518985,0.0003364546,0.001019156,0.001157845,0.0005061539],"domain_scores_gemma":[0.9663517,0.0269325,0.001318508,0.002999346,0.001608656,0.000789256],"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.001612118,0.0006640373,0.01215158,0.0009488624,0.0005217009,0.0003833753,0.002008491,0.04759312,0.008794868,0.5605924,0.01893242,0.345797],"study_design_scores_gemma":[0.0001299038,0.00006921623,0.0006038814,0.0001051001,0.0001407352,0.0002589068,0.0004865917,0.1157586,0.003878775,0.8733997,0.005119191,0.00004941385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1561166,0.001284507,0.8233219,0.001986238,0.0001446315,0.0002544297,0.001071759,0.001182494,0.0146374],"genre_scores_gemma":[0.6003333,0.0008879024,0.3842634,0.0004985253,0.0002144858,0.0003162534,0.001739483,0.0005473172,0.01119923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008401792,"threshold_uncertainty_score":0.02810675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01849874032045662,"score_gpt":0.2591521809598428,"score_spread":0.2406534406393862,"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."}}