{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005843946,0.0003618214,0.0005617782,0.0002586872,0.0002365446,0.00009847373,0.0004607175,0.0003557047,5.946077e-7],"category_scores_gemma":[0.00003183744,0.0003895198,0.0001512972,0.00002341936,0.0004305244,0.0002047961,0.0005454704,0.0003357376,4.071562e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007673193,"about_ca_system_score_gemma":0.00009127499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002649853,"about_ca_topic_score_gemma":0.00004837172,"domain_scores_codex":[0.9981595,0.00005797468,0.0003064173,0.000930763,0.0002004696,0.0003448953],"domain_scores_gemma":[0.9984026,0.0003252968,0.0001807024,0.0007162627,0.000160249,0.0002149203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001727426,0.00001611232,0.0003710105,0.0001363922,0.00003613122,0.00003378557,0.00009168245,0.00000393927,0.00002193984,0.9943438,0.001206121,0.003566411],"study_design_scores_gemma":[0.02916658,0.001163919,0.004043533,0.0010808,0.0005305934,0.0001971627,0.0001029427,0.01460381,0.000412741,0.1833092,0.761585,0.003803712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.05311878,0.001062997,0.008101,0.0001634697,0.00029563,0.00276702,0.0002044351,0.0003544349,0.9339322],"genre_scores_gemma":[0.2541018,0.0007946426,0.005705853,0.0002956013,0.00001654736,0.00001436482,0.00003987634,0.0000701196,0.7389612],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8110346,"threshold_uncertainty_score":0.9998557,"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."}}