{"id":"W2067475075","doi":"10.1016/j.dam.2011.03.020","title":"Polynomial-time recognition of clique-width ≤3 graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; Clique-sum; Chordal graph; Bounded function; Discrete mathematics; Clique-width; Partial k-tree; 1-planar graph; Pathwidth; 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.0005492617,0.0001895668,0.000315612,0.0002159635,0.00007548347,0.00003084081,0.000969407,0.00008559577,0.0001243292],"category_scores_gemma":[0.00005356595,0.0001675503,0.0001148441,0.0005263083,0.0001877245,0.0002511463,0.0002962927,0.0001584935,0.0003019086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001690529,"about_ca_system_score_gemma":0.000036527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003657784,"about_ca_topic_score_gemma":7.319431e-7,"domain_scores_codex":[0.9984747,0.00003408378,0.0004552235,0.0003307459,0.000349216,0.0003561012],"domain_scores_gemma":[0.9984762,0.0001775496,0.0002620019,0.0008738812,0.00009327873,0.0001170624],"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.00006989174,0.000372557,0.00002397719,0.0002552632,0.00008841005,0.000008766816,0.006498097,0.000003291306,0.06322785,0.8931304,0.0007086599,0.0356128],"study_design_scores_gemma":[0.0003436022,0.00009743729,0.0000657983,0.00004373285,0.00001587887,0.000007930694,0.0001536764,0.001764552,0.1261477,0.871024,0.00007450665,0.000261279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06278682,0.00003896742,0.769644,0.00004519424,0.00008528054,0.0008287312,0.00002617339,0.0003427261,0.1662021],"genre_scores_gemma":[0.328841,0.0000210914,0.6708158,0.00005069125,0.00001583137,0.00007061549,0.000009925329,0.00003228363,0.000142752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2660542,"threshold_uncertainty_score":0.6832504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03931153115348086,"score_gpt":0.2653706749322945,"score_spread":0.2260591437788137,"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."}}