{"id":"W7052562646","doi":"","title":"A sharp threshold in proof complexity yields lower bounds for satisfiability search","year":2004,"lang":"en","type":"article","venue":"TSpace","topic":"Magnetic confinement fusion research","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Satisfiability; Boolean satisfiability problem; Upper and lower bounds; Proof complexity; Computational complexity theory; Time complexity","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01787188,0.003317428,0.003667709,0.005073582,0.002042182,0.0109376,0.007806812,0.005371473,0.02097255],"category_scores_gemma":[0.171868,0.002812793,0.004002313,0.005240022,0.00717768,0.02585373,0.008797357,0.01850095,0.006162079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007466543,"about_ca_system_score_gemma":0.005872617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002183211,"about_ca_topic_score_gemma":0.003733265,"domain_scores_codex":[0.9761211,0.005723576,0.001174687,0.004245977,0.008262785,0.004471849],"domain_scores_gemma":[0.7113112,0.2521265,0.004826091,0.02206473,0.005232189,0.004439307],"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.002367539,0.0007429271,0.004355975,0.002307247,0.0003337891,0.0004665771,0.0007590006,0.1390027,0.01898899,0.5781036,0.03913483,0.2134368],"study_design_scores_gemma":[0.0001254763,0.0003201472,0.0007997961,0.000355194,0.0001657867,0.00045374,0.000117638,0.392397,0.007911989,0.5892373,0.008035325,0.0000804908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03551465,0.01093299,0.8847036,0.01331996,0.0008584343,0.0003199946,0.00129459,0.00454449,0.04851132],"genre_scores_gemma":[0.5642295,0.008739299,0.3922423,0.004947673,0.002412226,0.0009936946,0.001875024,0.004208955,0.02035135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02097255,"threshold_uncertainty_score":0.09451669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05755551791385571,"score_gpt":0.3620055226319489,"score_spread":0.3044500047180932,"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."}}