{"id":"W4280555761","doi":"10.1145/3486680","title":"Random \\( \\Theta (\\log n) \\) -CNFs are Hard for Cutting Planes","year":2022,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Concordia University; McGill University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisfiability; Combinatorics; Exponential function; Benchmark (surveying); Mathematics; Binary logarithm; Discrete mathematics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0005541955,0.00004639324,0.0001048351,0.0000567043,0.000304751,0.00006590434,0.001344097,0.00001179809,0.00005667572],"category_scores_gemma":[0.0005446789,0.00003136846,0.0001311861,0.0001208881,0.00001210611,0.0001708695,0.0004148743,0.00014852,0.000001314487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003916651,"about_ca_system_score_gemma":0.00005655317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001315074,"about_ca_topic_score_gemma":0.000001587905,"domain_scores_codex":[0.9993411,0.00008466149,0.0002059421,0.00006666432,0.000215896,0.00008576347],"domain_scores_gemma":[0.9989153,0.0001966573,0.0004142765,0.0003746192,0.00007098698,0.00002812463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009011222,0.0002889648,0.06762769,0.00007847887,0.0004538304,0.00007729731,0.0068108,0.4371418,0.004675284,0.0119062,0.2395447,0.2304938],"study_design_scores_gemma":[0.01990233,0.0008182186,0.1076935,0.0002250588,0.0002274781,0.006203121,0.003032557,0.3674472,0.004345319,0.1013115,0.3878857,0.0009079705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09541703,0.0003945189,0.7831964,0.111813,0.007764865,0.0005186841,0.00002187025,0.00007007436,0.0008035591],"genre_scores_gemma":[0.9089341,0.00002095759,0.08790362,0.001672181,0.0003184404,0.000008977612,7.36935e-7,0.000009539388,0.001131474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.813517,"threshold_uncertainty_score":0.2497689,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02479693373973376,"score_gpt":0.243603247963303,"score_spread":0.2188063142235693,"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."}}