{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909421,0.0002679162,0.0004095145,0.0005234179,0.0004798771,0.0001784214,0.003022788,0.0000919426,0.000004109983],"category_scores_gemma":[0.0003034883,0.0001970418,0.0002306386,0.002305164,0.0001834929,0.0008178724,0.0003275987,0.001507719,0.00001902292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006700467,"about_ca_system_score_gemma":0.0007061109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000191957,"about_ca_topic_score_gemma":0.00001028516,"domain_scores_codex":[0.9967089,0.0004099326,0.0006823463,0.0002600524,0.0009112692,0.001027539],"domain_scores_gemma":[0.9971504,0.0006348618,0.0005857544,0.0007405663,0.0006852602,0.0002031123],"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.00008333065,0.0001888664,0.0001314294,0.000007875755,0.0001213896,0.00003747546,0.0006952454,0.001017152,0.009497493,0.987064,0.00001636328,0.0011394],"study_design_scores_gemma":[0.002259651,0.0007775722,0.0005238543,0.00005911421,0.00002220836,0.0004746909,0.00005578482,0.000684202,0.0115061,0.9827806,0.0006350605,0.0002211358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6356875,0.002125588,0.3595709,0.001654318,0.0005395514,0.0001716372,2.779378e-7,0.00007834964,0.0001719352],"genre_scores_gemma":[0.9983691,0.0004080793,0.0009578814,0.0001666526,0.0000456152,0.000003681936,0.000001054093,0.0000276151,0.00002033915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3626816,"threshold_uncertainty_score":0.8035131,"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."}}