{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001575783,0.0003973135,0.0006796957,0.0003773963,0.0001751939,0.0000783833,0.00464694,0.0003411659,0.0000116599],"category_scores_gemma":[0.0006552373,0.0003926868,0.000507225,0.0006691493,0.000301287,0.0003406108,0.003327029,0.0008442359,0.00001357573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001224416,"about_ca_system_score_gemma":0.000267313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004957219,"about_ca_topic_score_gemma":0.00001678121,"domain_scores_codex":[0.9964756,0.0002582974,0.0006697587,0.001302178,0.0005700965,0.0007241181],"domain_scores_gemma":[0.9946292,0.0005822572,0.0003900231,0.003644743,0.000558196,0.000195568],"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.0002013203,0.001213584,0.0693987,0.001420862,0.0004169749,0.00005971416,0.002084993,0.001278999,0.005464647,0.08667549,0.001175571,0.8306091],"study_design_scores_gemma":[0.0007705583,0.0003022083,0.04612888,0.0001653838,0.00002450651,0.000005346168,0.00002954958,0.0210039,0.01056017,0.9200009,0.0004707127,0.0005379043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2411635,0.0005467137,0.7551723,0.0007237695,0.0004764081,0.001307284,0.00006797562,0.0002474183,0.0002946223],"genre_scores_gemma":[0.5286693,0.0001044859,0.4702852,0.0001851332,0.0001228678,0.0003644106,0.0000233999,0.00004576731,0.0001994715],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8333254,"threshold_uncertainty_score":0.9998525,"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."}}