{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003306228,0.0004919065,0.0007781197,0.00111681,0.0005785876,0.0004382382,0.002478046,0.0001642983,0.00005268739],"category_scores_gemma":[0.0004653389,0.0004000916,0.0005039885,0.001885348,0.0002334801,0.001887301,0.0008125048,0.001070513,0.0001648243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002967679,"about_ca_system_score_gemma":0.0001553275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003869312,"about_ca_topic_score_gemma":0.0000274458,"domain_scores_codex":[0.9948289,0.000730796,0.001162137,0.000704098,0.001492852,0.001081266],"domain_scores_gemma":[0.9958395,0.0005958027,0.0007343572,0.001126513,0.0006295844,0.001074195],"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.0003876282,0.0005779047,0.00273611,0.0001471138,0.0009988147,0.0007295387,0.009859954,0.01824754,0.01128232,0.03884868,0.02147697,0.8947074],"study_design_scores_gemma":[0.006330225,0.006806903,0.007716817,0.001012509,0.0002520296,0.002941828,0.001825717,0.6278001,0.01904919,0.170696,0.1520347,0.00353394],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007062428,0.0002165118,0.984482,0.004206657,0.002977373,0.0003564167,0.00003436572,0.0001108009,0.0005533695],"genre_scores_gemma":[0.5499224,0.0002424973,0.4444488,0.0006069454,0.001853587,0.00005720628,0.00002379772,0.0001611904,0.002683618],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8911735,"threshold_uncertainty_score":0.9998451,"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."}}