{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002892783,0.000377736,0.0003773759,0.000892949,0.0006189661,0.001186394,0.0008635391,0.000574107,0.01061138],"category_scores_gemma":[0.001042153,0.0003298752,0.0006181758,0.001288263,0.0003612827,0.001635672,0.0009227989,0.001024135,0.001935899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006430844,"about_ca_system_score_gemma":0.001038784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001416082,"about_ca_topic_score_gemma":0.004148329,"domain_scores_codex":[0.9997568,0.00004416459,0.00001801115,0.0000521498,0.0000919804,0.00003698151],"domain_scores_gemma":[0.9997097,0.0001091556,0.00001588794,0.00008327187,0.00006132317,0.00002067086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001908532,0.0002651819,0.0005425355,0.0005001745,0.00003904563,0.0003537454,0.0004721569,0.03830802,0.02845216,0.5038464,0.01947915,0.4075505],"study_design_scores_gemma":[0.0001031686,0.0001200233,0.000546918,0.0001651331,0.0001150463,0.0006787563,0.000241815,0.3544472,0.02740517,0.5101103,0.1060039,0.00006259729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01375417,0.0001234982,0.9655147,0.0001927872,0.00006280447,0.0002521143,0.001167812,0.001913588,0.0170185],"genre_scores_gemma":[0.1868797,0.0002871619,0.7962323,0.0001000422,0.00002683546,0.0003400291,0.002550415,0.0003543205,0.01322914],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01061138,"threshold_uncertainty_score":0.03549862,"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."}}