{"id":"W1695953772","doi":"10.1016/j.ejc.2015.06.005","title":"Improved complexity results on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Vertex (graph theory); Complete coloring; Graph; Induced subgraph; Discrete mathematics; 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":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.009453803,0.002117013,0.001034421,0.001531224,0.003480792,0.003711063,0.008535828,0.002506399,0.01621563],"category_scores_gemma":[0.006802146,0.003523662,0.003772011,0.003496812,0.003518859,0.004296464,0.007081145,0.00585061,0.003271937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009880371,"about_ca_system_score_gemma":0.003659473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007827634,"about_ca_topic_score_gemma":0.0005883045,"domain_scores_codex":[0.9776818,0.002065478,0.004919237,0.003521127,0.006808025,0.005004376],"domain_scores_gemma":[0.9794554,0.003732068,0.006353144,0.006110345,0.0009660051,0.003383015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.006229797,0.001270871,0.00002974025,0.001315384,0.002234562,0.007236511,0.003360818,0.004244052,0.002404765,0.8802742,0.08895098,0.002448311],"study_design_scores_gemma":[0.01074063,0.01039646,0.0003636786,0.00374831,0.002097303,0.0051479,0.002609582,0.4596281,0.4876924,0.003583355,0.009919058,0.004073252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8107993,0.002143189,0.003434495,0.001256423,0.008551617,0.0001340817,0.0005837213,0.0004821747,0.172615],"genre_scores_gemma":[0.9827703,0.002357879,0.006290856,0.001926519,0.003345054,0.0004886514,0.0007525557,0.001609256,0.0004589816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8766909,"threshold_uncertainty_score":0.999193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03197586937708036,"score_gpt":0.2621459650223334,"score_spread":0.230170095645253,"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."}}