{"id":"W2024656522","doi":"10.1007/s00453-012-9624-8","title":"3-Colouring AT-Free Graphs in Polynomial Time","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Pathwidth; Interval graph; Combinatorics; Time complexity; Mathematics; Maximal independent set; Cograph; Theory of computation; Discrete mathematics; Split graph; Strong perfect graph theorem; Modular decomposition; Graph; Computer science; 1-planar graph; Line graph; Algorithm","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.0005954584,0.0001407151,0.0001672814,0.0002950975,0.0001193051,0.00004056211,0.001581672,0.00007173311,0.00007774696],"category_scores_gemma":[0.00009915613,0.0001401967,0.00006995753,0.0006903363,0.00009222129,0.0007396651,0.00132154,0.0002322133,0.0006715742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001309077,"about_ca_system_score_gemma":0.00002968366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001986111,"about_ca_topic_score_gemma":0.000005975581,"domain_scores_codex":[0.9982507,0.0001178564,0.0001962837,0.0003157242,0.0003146494,0.0008047703],"domain_scores_gemma":[0.9985796,0.0001926258,0.00004667661,0.0009427842,0.00002833557,0.0002100166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002821224,0.001474675,0.04080679,0.00006450917,0.000175714,0.0003609098,0.006698969,0.0001947767,0.06728963,0.3347363,0.03882327,0.5090924],"study_design_scores_gemma":[0.01110022,0.000817987,0.1516118,0.0001655428,0.00003101724,0.0006724414,0.000134144,0.0985379,0.1958644,0.4410909,0.09592097,0.004052657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8985843,0.001449297,0.06996425,0.002907609,0.001512771,0.0009462535,0.00002229154,0.0007829289,0.02383026],"genre_scores_gemma":[0.8914749,0.00001337366,0.1054771,0.0002427289,0.0002649922,0.00005567169,0.000003444743,0.00003364381,0.002434165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5050398,"threshold_uncertainty_score":0.8631952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01229900869453198,"score_gpt":0.2583412557159052,"score_spread":0.2460422470213732,"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."}}