{"id":"W3000821546","doi":"10.5555/1704843.1705075","title":"Typical case complexity of Satisfiability Algorithms and the threshold phenomenon","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Satisfiability; Mathematics; Algorithm; Phenomenon; Computational complexity theory; Boolean satisfiability problem; Subject (documents); Theoretical computer science; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014759,0.0001079083,0.0002106852,0.00002921968,0.0001169028,0.00005878961,0.0001939509,0.00003967436,0.00004683148],"category_scores_gemma":[0.00002309803,0.00007241317,0.00003964472,0.0001345158,0.0005163195,0.0001069769,0.0001537343,0.0000986799,0.000007142658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001864964,"about_ca_system_score_gemma":0.00001826293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006202773,"about_ca_topic_score_gemma":0.00002367931,"domain_scores_codex":[0.9991837,0.00001965398,0.000315075,0.000184935,0.0001712522,0.0001253605],"domain_scores_gemma":[0.9991753,0.0001749147,0.0001321554,0.0004289329,0.00003544389,0.00005331636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009947344,0.00003301792,0.00002187022,0.00003222548,0.00001211457,0.000001646492,0.002247137,0.0001977545,0.00005153248,0.9722166,0.00001874552,0.02515742],"study_design_scores_gemma":[0.001245791,0.00001693808,0.0004549253,0.000009455972,0.00002481382,0.0001886381,0.0005570161,0.7922133,0.000395472,0.2046321,0.00009982687,0.0001616723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02662615,0.00002934001,0.9604689,0.001217393,0.00003070439,0.0004117238,0.000007560614,0.00006670132,0.01114156],"genre_scores_gemma":[0.6732351,0.000007244889,0.3266346,0.00007850912,0.00001721418,0.00001282524,0.000001414285,0.000003992628,0.000009090746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7920156,"threshold_uncertainty_score":0.2952923,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02678851015357779,"score_gpt":0.2563801699547778,"score_spread":0.2295916598012,"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."}}