{"id":"W2527693017","doi":"10.1002/jgt.20057","title":"Disjoint clique cutsets in graphs without long holes","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Dayton","keywords":"Combinatorics; Mathematics; Complete bipartite graph; Cograph; Split graph; Discrete mathematics; Clique graph; Disjoint sets; Block graph; Vertex (graph theory); Separable space; Clique problem; Clique-sum; Bipartite graph; Chordal graph; Graph; 1-planar graph; Line graph; Graph power","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433195,0.0002225457,0.0004186571,0.001392578,0.0001073299,0.0001125862,0.001689647,0.00009667062,0.00002713084],"category_scores_gemma":[0.0002507401,0.0001766915,0.000326906,0.00114603,0.0003952069,0.001477263,0.0002327821,0.0008447733,0.00002058546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008182391,"about_ca_system_score_gemma":0.0001198778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001679874,"about_ca_topic_score_gemma":0.00002772386,"domain_scores_codex":[0.9970109,0.00075241,0.0007553698,0.000295576,0.0006438547,0.0005418374],"domain_scores_gemma":[0.998018,0.0004493612,0.0004363313,0.0006033944,0.0002317611,0.0002611734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002703665,0.0002797809,0.02327318,0.00001787358,0.00006177626,0.000260795,0.001108511,0.0007992102,0.001707206,0.9012119,0.0001259356,0.07088351],"study_design_scores_gemma":[0.001005749,0.0002577427,0.02231032,0.000162908,0.000008508136,0.0004413055,0.0001275731,0.000323832,0.003961987,0.9706259,0.0005285915,0.0002455784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.536603,0.002170419,0.4580152,0.001334252,0.0003116027,0.0001861494,0.000001796814,0.00005272888,0.001324871],"genre_scores_gemma":[0.979821,0.0003794563,0.01920932,0.000337681,0.0001061148,0.00000520706,2.893995e-7,0.0000216526,0.0001192417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4432181,"threshold_uncertainty_score":0.7205269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01548365946426287,"score_gpt":0.3015029554822439,"score_spread":0.286019296017981,"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."}}