{"id":"W312445613","doi":"10.1016/j.dam.2005.05.004","title":"The resolution complexity of random graph k-colorability","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Mathematical proof; Upper and lower bounds; Discrete mathematics; Random graph; Graph; Exponential function","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":[],"consensus_categories":[],"category_scores_codex":[0.001630419,0.0001463316,0.0002659252,0.00006275853,0.000329735,0.00007033865,0.001265248,0.00005115693,0.000008451779],"category_scores_gemma":[0.0001512981,0.00009652582,0.0001185016,0.0004803113,0.000830609,0.0001767578,0.000380397,0.0001882279,0.00003222345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000401769,"about_ca_system_score_gemma":0.00003425008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002125717,"about_ca_topic_score_gemma":0.00001564755,"domain_scores_codex":[0.9983244,0.00007226803,0.0004740936,0.0002701342,0.0005010048,0.0003580915],"domain_scores_gemma":[0.997604,0.000773826,0.0002177899,0.001222688,0.0001033173,0.00007837446],"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.00004759419,0.00006944863,0.000005261079,0.00003976205,0.00001696081,2.036097e-7,0.0006619921,0.0002894534,0.002259549,0.9910005,0.00008913181,0.005520143],"study_design_scores_gemma":[0.0006265769,0.00002696225,0.0001198279,0.00001028849,0.000006711996,0.00000238644,0.000183203,0.04455197,0.00865703,0.9449202,0.0007738412,0.0001210227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01610676,0.0001048229,0.9690558,0.0008490546,0.00003929835,0.0006588012,0.000006351933,0.0001184897,0.01306062],"genre_scores_gemma":[0.7141351,0.00002683472,0.2856564,0.00002888898,0.00002411969,0.00007031533,0.000002119343,0.00001051525,0.00004570196],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6980283,"threshold_uncertainty_score":0.3936208,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03941499046506563,"score_gpt":0.3009212942072034,"score_spread":0.2615063037421378,"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."}}