{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002921691,0.000602142,0.00111648,0.001399543,0.001024529,0.00294082,0.002026483,0.001825042,0.004518591],"category_scores_gemma":[0.04025192,0.000561906,0.0007986466,0.001785092,0.003136434,0.005315205,0.002080339,0.003119758,0.0005878314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002201543,"about_ca_system_score_gemma":0.0008665522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006632092,"about_ca_topic_score_gemma":0.0006235134,"domain_scores_codex":[0.9963856,0.0009112004,0.0002054541,0.001024795,0.0008798678,0.0005929973],"domain_scores_gemma":[0.954899,0.03604792,0.003244641,0.003373317,0.001363522,0.001071563],"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.0006600047,0.0002518646,0.0126036,0.0004151338,0.0001853595,0.0005614824,0.0005810706,0.2139393,0.01623988,0.7040756,0.007321499,0.04316524],"study_design_scores_gemma":[0.0000446342,0.0001069836,0.001691688,0.00003505046,0.00004073855,0.0005221375,0.0001331567,0.473551,0.009105634,0.5130443,0.001690236,0.0000343984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4807424,0.001200018,0.4852501,0.002861739,0.00009326485,0.0001480771,0.001092693,0.001072451,0.0275393],"genre_scores_gemma":[0.9662402,0.00031997,0.03104527,0.0002395306,0.00007580069,0.0001179375,0.0005028578,0.0001239307,0.001334608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004518591,"threshold_uncertainty_score":0.01597339,"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."}}