{"id":"W136426073","doi":"10.1007/978-3-642-35926-2_5","title":"Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Computer science; Digraph; Disjoint sets; Correctness; Representation (politics); Tree (set theory); Theoretical computer science; Set (abstract data type); Simple (philosophy); Algorithm; Discrete mathematics; Mathematics; Combinatorics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001798206,0.0004831807,0.0004723717,0.0008907237,0.0003634808,0.0004911877,0.002211155,0.0003405073,0.000006004805],"category_scores_gemma":[0.0002446682,0.0004511355,0.0001816841,0.0006395966,0.0008781619,0.001211119,0.0005359328,0.0004550929,0.00001414304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003515579,"about_ca_system_score_gemma":0.0002471717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002057839,"about_ca_topic_score_gemma":0.00006536188,"domain_scores_codex":[0.9961462,0.00008779414,0.0006747828,0.001515179,0.0008834104,0.0006926139],"domain_scores_gemma":[0.9965821,0.0004503905,0.0005597267,0.001794111,0.0003699622,0.0002437467],"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.00002189586,0.00003980157,0.0001577343,0.0000432039,0.000007887309,0.000002273012,0.001014973,0.02697936,0.0002408917,0.1785788,0.000008391185,0.7929047],"study_design_scores_gemma":[0.0003923982,0.0002955248,0.001080165,0.000133239,0.0000183603,0.00008203325,0.000001250505,0.8549647,0.00496617,0.1368263,0.0006311835,0.0006087399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001014049,0.0001769599,0.9929288,0.0001569908,0.003661053,0.001120837,0.00001640641,0.0001934807,0.0007314184],"genre_scores_gemma":[0.1095966,0.00001674391,0.8895459,0.0001720678,0.0005053684,0.00006488054,0.00002932451,0.00003304231,0.00003610947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8279853,"threshold_uncertainty_score":0.9997941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.041692570855373,"score_gpt":0.3103706454675672,"score_spread":0.2686780746121942,"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."}}