{"id":"W2097890626","doi":"10.1109/focs.2004.66","title":"The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Satisfiability; Conjecture; Boolean satisfiability problem; Constraint (computer-aided design); Mathematics; Class (philosophy); Complexity of constraint satisfaction; Discrete mathematics; Backtracking; Maximum satisfiability problem; Resolution (logic); Combinatorics; Computer science; Algorithm; Boolean function; Local consistency; Artificial intelligence; Statistics","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.0007969009,0.0001719817,0.0001663794,0.00006685771,0.0006349989,0.0005107034,0.0003024961,0.00008597758,0.00006843449],"category_scores_gemma":[0.0001017383,0.0001218634,0.0001366358,0.0002517652,0.0001517749,0.0007356291,0.00006403162,0.0001585898,0.00002153586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001747966,"about_ca_system_score_gemma":0.0003237251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002366554,"about_ca_topic_score_gemma":0.0014773,"domain_scores_codex":[0.9985034,0.00005177626,0.0004173531,0.0004149099,0.0002785151,0.000334041],"domain_scores_gemma":[0.9987228,0.0003392427,0.0001604324,0.0004681428,0.0002034799,0.0001059055],"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.00008122658,0.00004975489,0.001646335,0.00001597,0.00004828148,0.000001599715,0.0002885777,0.01513469,0.001248731,0.5303953,0.0003323338,0.4507572],"study_design_scores_gemma":[0.02774851,0.0009700694,0.1137583,0.0001256665,0.0001264656,0.000467207,0.001147529,0.1814983,0.01514532,0.6422676,0.01470678,0.002038213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005216788,0.00002233848,0.981724,0.0062069,0.0005279885,0.001241093,0.000004773934,0.0003215942,0.004734482],"genre_scores_gemma":[0.8049836,0.00004061986,0.1944489,0.0002540588,0.00004798448,0.0001116101,0.000004004131,0.000008617332,0.0001006114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7997668,"threshold_uncertainty_score":0.4969445,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01110968460958112,"score_gpt":0.2407961202387141,"score_spread":0.229686435629133,"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."}}