{"id":"W2204215863","doi":"10.1016/j.dam.2015.10.024","title":"Complexity of coloring graphs without paths and cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Complement (music); Characterization (materials science); Induced subgraph; Discrete mathematics; Time complexity; Graph; Vertex (graph theory); Physics","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.0005694776,0.0001461099,0.0002983146,0.0001072481,0.00006976903,0.00005637722,0.0005959397,0.00004324121,0.000002070758],"category_scores_gemma":[0.00006425064,0.0001231455,0.00003712571,0.0003127904,0.0004456164,0.0001749425,0.0004926788,0.0001212338,0.000009016016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001556815,"about_ca_system_score_gemma":0.00003365059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003169229,"about_ca_topic_score_gemma":0.000003182751,"domain_scores_codex":[0.9987678,0.00002378622,0.0002831555,0.0002572586,0.0004037917,0.0002641968],"domain_scores_gemma":[0.9988757,0.0001342124,0.0001497781,0.0005850103,0.00008258632,0.0001726536],"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.0000103529,0.00003969523,0.0002425128,0.00009240201,0.00001454072,0.000001675802,0.002208712,0.00002081941,0.002993967,0.9929855,0.00001555252,0.001374228],"study_design_scores_gemma":[0.0004077089,0.00005181977,0.0002340576,0.00002740142,0.000006884584,0.000008234112,0.0008513058,0.01214311,0.008173973,0.9778988,0.00004374151,0.0001529673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3147129,0.00008531097,0.6696805,0.00008992357,0.00004229958,0.0004187187,0.000007804208,0.0001413052,0.01482122],"genre_scores_gemma":[0.6770082,0.000008167603,0.3229157,0.00001374741,0.000006096698,0.00002185828,0.000001265629,0.00001090765,0.0000140714],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3622952,"threshold_uncertainty_score":0.5021729,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08204450352929933,"score_gpt":0.3212024805618994,"score_spread":0.2391579770326001,"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."}}