{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003704454,0.001393319,0.002351777,0.001280514,0.001951276,0.003778212,0.003943408,0.003154075,0.01434862],"category_scores_gemma":[0.04271818,0.001327445,0.002853892,0.002381278,0.003369287,0.009816206,0.002384816,0.005556684,0.001727441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003792637,"about_ca_system_score_gemma":0.00331426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00869948,"about_ca_topic_score_gemma":0.01223899,"domain_scores_codex":[0.9957417,0.00086527,0.0002779877,0.001371316,0.000835629,0.0009081019],"domain_scores_gemma":[0.9441872,0.0473438,0.002351709,0.003571457,0.001431789,0.001113905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002270144,0.0007710591,0.006965221,0.001224917,0.0003672182,0.001179226,0.0004064886,0.4319607,0.005559067,0.4229534,0.04893082,0.07741173],"study_design_scores_gemma":[0.0003347788,0.0001093649,0.001317614,0.0001008572,0.0000621924,0.0005400957,0.0001369157,0.4170139,0.002192932,0.5748481,0.003282112,0.00006130667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5235186,0.002823075,0.4127817,0.01287138,0.0006642513,0.0007279521,0.008265945,0.004905469,0.03344157],"genre_scores_gemma":[0.8899928,0.001052539,0.08313656,0.002452769,0.0005661776,0.0006395754,0.006255208,0.001321686,0.01458283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01434862,"threshold_uncertainty_score":0.04800093,"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."}}