{"id":"W2903896173","doi":"10.1137/18m1214196","title":"Corrigendum: Orthogonal Tree Decompositions of Graphs","year":2018,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.003188216,0.002131043,0.002120636,0.005046939,0.003015454,0.003974561,0.003516436,0.003082106,0.08969412],"category_scores_gemma":[0.04620136,0.001010779,0.00219319,0.003905083,0.002141324,0.004985083,0.002493897,0.005901668,0.04384653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005423889,"about_ca_system_score_gemma":0.00292516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01152814,"about_ca_topic_score_gemma":0.01303197,"domain_scores_codex":[0.9936112,0.001064093,0.0006644373,0.0011032,0.00308011,0.0004769501],"domain_scores_gemma":[0.9751389,0.004750761,0.0006525226,0.002330139,0.01609077,0.001036969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002148445,0.00001047425,0.00005090301,0.0001126228,0.00001163044,0.00008112099,0.00001633866,0.00010294,0.00005346952,0.003210191,0.9862954,0.01003342],"study_design_scores_gemma":[0.00003300052,0.00004249443,0.0009578126,0.0003148867,0.00004797995,0.0004174242,0.00005121843,0.0008414017,0.000485347,0.01364111,0.9830973,0.00007007243],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0004252369,0.004531445,0.005383927,0.05252749,0.9141685,0.00006282167,0.00160464,0.001037132,0.02025873],"genre_scores_gemma":[0.03156897,0.02430817,0.01811698,0.09218615,0.4480877,0.0004505258,0.008224246,0.004714345,0.3723429],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.08969412,"threshold_uncertainty_score":0.3000567,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03365558894771017,"score_gpt":0.3176513302921984,"score_spread":0.2839957413444883,"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."}}