{"id":"W1924533234","doi":"10.37236/1778","title":"Decomposing Infinite 2-Connected Graphs into 3-Connected Components","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Modular decomposition; Planar graph; Chordal graph; Connected component; Indifference graph; 1-planar graph; Pathwidth; Strongly connected component; Discrete mathematics; Clique-sum; Graph; Line graph","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.0003183426,0.0009664173,0.0005762912,0.001652816,0.0008991332,0.00188603,0.0007941531,0.0009691626,0.004213393],"category_scores_gemma":[0.001272099,0.0004901871,0.00104259,0.001297716,0.001840328,0.003974408,0.002203916,0.001593912,0.001019982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005973115,"about_ca_system_score_gemma":0.0005812049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001669716,"about_ca_topic_score_gemma":0.001928488,"domain_scores_codex":[0.9996945,0.00006507753,0.00002089542,0.00007696345,0.0000636445,0.00007898585],"domain_scores_gemma":[0.9994043,0.0002013658,0.00007956265,0.0001064803,0.0001289564,0.00007937758],"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.00008541206,0.00004087335,0.0007605118,0.0001977612,0.00002580044,0.0004579321,0.0008498261,0.02637662,0.006862885,0.9159656,0.002856286,0.04552042],"study_design_scores_gemma":[0.00001136036,0.00002502329,0.000308139,0.00005778921,0.00001875218,0.0002209683,0.0002232404,0.03529174,0.001591659,0.9495367,0.01269735,0.00001730067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1502889,0.001347261,0.800288,0.0006301034,0.0002060169,0.0001959895,0.0003880842,0.0005176685,0.04613797],"genre_scores_gemma":[0.6111746,0.002647526,0.3653593,0.000723174,0.000246932,0.0004499555,0.001655558,0.0004265158,0.01731644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004213393,"threshold_uncertainty_score":0.01409519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01177360459689662,"score_gpt":0.265083132715877,"score_spread":0.2533095281189803,"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."}}