{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016909,0.0001675516,0.0003060868,0.0001812006,0.0001215331,0.00034447,0.0008142877,0.00008221446,0.00004389891],"category_scores_gemma":[0.000048342,0.0001136372,0.0002035954,0.0003101285,0.00004850849,0.001161926,0.0001692253,0.0002635949,0.0001136913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008289188,"about_ca_system_score_gemma":0.00006127713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001135032,"about_ca_topic_score_gemma":0.000002104495,"domain_scores_codex":[0.9982368,0.0001618084,0.0005595571,0.0001934512,0.0004912714,0.0003570905],"domain_scores_gemma":[0.9985967,0.00006952358,0.0005538643,0.0003126145,0.0002196757,0.0002476141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000104313,0.0002160501,0.00480407,0.00009509389,0.0003339467,0.0003549398,0.00834929,0.0001314733,0.00290041,0.04788952,0.009710924,0.9252039],"study_design_scores_gemma":[0.009519498,0.006825471,0.07031409,0.0003364234,0.0002585366,0.007391502,0.005552559,0.2811416,0.01929272,0.4000963,0.195267,0.004004267],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01400139,0.0003292594,0.9817429,0.0009700738,0.001723648,0.0001694469,6.219406e-7,0.00004138285,0.001021316],"genre_scores_gemma":[0.9779514,0.00002681337,0.02118555,0.00007417822,0.0004108275,0.00000533534,0.000001336251,0.00001231772,0.0003322162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.96395,"threshold_uncertainty_score":0.463399,"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."}}