{"id":"W4301417336","doi":"10.1002/rsa.20118","title":"The satisfiability threshold for randomly generated binary constraint satisfaction problems","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Satisfiability; Homomorphism; Constraint (computer-aided design); Constraint satisfaction; Discrete mathematics; Binary number; Mathematics; Random graph; Computer science; Combinatorics; Statistics; Arithmetic; Graph","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.0009516609,0.0002102236,0.0002817891,0.00006470439,0.000898991,0.0003622078,0.0003411494,0.00008221009,0.000006122293],"category_scores_gemma":[0.00007869647,0.0001284465,0.0001123088,0.0002451738,0.000403104,0.0002590918,0.0001091555,0.0001932718,6.649336e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003368188,"about_ca_system_score_gemma":0.00005338957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001054607,"about_ca_topic_score_gemma":0.0000823019,"domain_scores_codex":[0.9982794,0.0001577318,0.0003473091,0.0004815494,0.0002916781,0.0004423577],"domain_scores_gemma":[0.9983746,0.0008512523,0.0001130329,0.0004255629,0.000151418,0.00008414701],"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.001187981,0.0000345847,0.002573295,0.00008465855,0.0001092234,0.000009645231,0.0002045795,0.00765024,0.0137219,0.5102849,0.001147512,0.4629915],"study_design_scores_gemma":[0.0133082,0.0001618694,0.01699973,0.0000126723,0.00001444283,0.00005655114,0.00003418772,0.1568402,0.002573969,0.8073593,0.002335409,0.0003034142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1774873,0.002892119,0.8151143,0.001152677,0.0005821647,0.002316823,0.00005219792,0.0001888714,0.0002135691],"genre_scores_gemma":[0.9734324,0.0001756814,0.02578229,0.00004963552,0.0002038558,0.0001997091,0.00001318366,0.00001599491,0.0001272617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7959451,"threshold_uncertainty_score":0.6914403,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01327690187490386,"score_gpt":0.2629478193031268,"score_spread":0.2496709174282229,"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."}}