{"id":"W2949986906","doi":"10.48550/arxiv.0907.3497","title":"A certifying algorithm for 3-colorability of P5-free graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; Natural Sciences and Engineering Research Council of Canada; University of Guelph","funders":"","keywords":"Computer science; Combinatorics; Algorithm; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002274591,0.001130966,0.001412105,0.001039157,0.001765042,0.002666961,0.003480504,0.001962115,0.0069404],"category_scores_gemma":[0.01409423,0.0007915138,0.00246692,0.001277326,0.002260809,0.005149466,0.005026095,0.004197157,0.001733378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001548639,"about_ca_system_score_gemma":0.002932489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002279252,"about_ca_topic_score_gemma":0.002084126,"domain_scores_codex":[0.9974381,0.000350463,0.0002386312,0.0009161104,0.0005622102,0.0004944567],"domain_scores_gemma":[0.9829105,0.009871592,0.001018214,0.004071251,0.001508999,0.0006194793],"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.001883517,0.0009552428,0.01199807,0.001392916,0.0003302727,0.001477593,0.001654422,0.1191905,0.06330851,0.1878089,0.04019195,0.5698082],"study_design_scores_gemma":[0.0005441025,0.0003708196,0.001905141,0.0001148333,0.0002614176,0.001117457,0.0005067479,0.4570375,0.0657895,0.4570694,0.0151178,0.000165129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09608835,0.0002289027,0.8811255,0.001518832,0.0001919979,0.0003163313,0.0008806981,0.01315241,0.006496971],"genre_scores_gemma":[0.5389606,0.0001896858,0.4529978,0.0005177725,0.0001085846,0.0003053039,0.00352564,0.001046431,0.002348054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0069404,"threshold_uncertainty_score":0.02321792,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09121376702777372,"score_gpt":0.3435038505590445,"score_spread":0.2522900835312707,"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."}}