{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004431027,0.001079067,0.003291121,0.002493823,0.002846756,0.009442759,0.006801512,0.004650916,0.0166645],"category_scores_gemma":[0.04869311,0.001493317,0.001971252,0.00415608,0.007633619,0.02219176,0.004880595,0.008049592,0.001260254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005095364,"about_ca_system_score_gemma":0.002541953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003468972,"about_ca_topic_score_gemma":0.001949745,"domain_scores_codex":[0.9937859,0.002433519,0.0002360665,0.001173036,0.001396296,0.0009751772],"domain_scores_gemma":[0.921007,0.06341964,0.003690724,0.006637497,0.002162019,0.003083148],"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.0003165481,0.00007849827,0.001195811,0.0002161384,0.00006552329,0.0001099787,0.000355176,0.03927999,0.0009708132,0.9421519,0.005908824,0.00935082],"study_design_scores_gemma":[0.00005814403,0.00001644946,0.0003846945,0.00001972355,0.00002593027,0.00008219689,0.00007795772,0.07566284,0.0003511081,0.9225875,0.0007037652,0.00002964305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.606996,0.003647947,0.2940085,0.02599137,0.0004190553,0.0002091508,0.003154632,0.001140198,0.0644332],"genre_scores_gemma":[0.9752789,0.001188903,0.01488649,0.0007400453,0.0005387575,0.0001746396,0.0008791038,0.0002730947,0.006040051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0166645,"threshold_uncertainty_score":0.05574834,"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."}}