{"id":"W113038098","doi":"10.1017/cbo9780511721328.009","title":"Thresholds for colourability and satisfiability in random graphs and boolean formulae","year":2001,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Toronto","keywords":"Satisfiability; Boolean satisfiability problem; Combinatorics; Mathematics; Discrete mathematics; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001703713,0.0006562787,0.001197994,0.00243197,0.0008381871,0.004034311,0.001870531,0.001876255,0.01651947],"category_scores_gemma":[0.01064598,0.0008015422,0.001131923,0.003007511,0.003550865,0.008249823,0.001591743,0.004681075,0.001751454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004433898,"about_ca_system_score_gemma":0.0008884282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001335243,"about_ca_topic_score_gemma":0.001298003,"domain_scores_codex":[0.9984931,0.0003082108,0.0001028265,0.0003601155,0.0005773306,0.0001584789],"domain_scores_gemma":[0.9899253,0.00863367,0.0002318317,0.0006364749,0.0003489162,0.0002237837],"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.00004962808,0.00002294314,0.0002782756,0.0002667852,0.00001294001,0.00003732858,0.000170664,0.003453787,0.000668855,0.9421243,0.01357125,0.0393433],"study_design_scores_gemma":[0.000006263661,0.000009235355,0.0002264799,0.00005099802,0.000006062842,0.00006152615,0.00003118119,0.005809363,0.0003475369,0.9887801,0.004662184,0.000009023019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04572733,0.02805389,0.3985742,0.01137152,0.001193724,0.0001943449,0.001658713,0.001721644,0.5115046],"genre_scores_gemma":[0.749117,0.01835323,0.1217004,0.00258858,0.001679183,0.0006204045,0.001961996,0.0009571276,0.1030222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01651947,"threshold_uncertainty_score":0.05526316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01892958969263517,"score_gpt":0.1993513827268643,"score_spread":0.1804217930342291,"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."}}