{"id":"W2768278295","doi":"10.1109/focs.2017.19","title":"Random Θ(log n)-CNFs Are Hard for Cutting Planes","year":2017,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Benchmark (surveying); Combinatorics; Exponential function; Probability distribution; Binary logarithm; Distribution (mathematics); Mathematics; Computer science; Discrete mathematics; Algorithm; Statistics; Mathematical analysis","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406604,0.00005762293,0.00008523427,0.00003067348,0.0004524066,0.0003945686,0.0003406917,0.00003008618,0.00006002618],"category_scores_gemma":[0.0001525172,0.00004898778,0.00004176402,0.00001800741,0.00002444377,0.0004090395,0.00006354508,0.00003122646,0.00002610337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007972771,"about_ca_system_score_gemma":0.00001880588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001771613,"about_ca_topic_score_gemma":0.00004258906,"domain_scores_codex":[0.9995365,0.000009616575,0.00009900858,0.0001682211,0.00007269964,0.0001139179],"domain_scores_gemma":[0.9993658,0.00007799641,0.0001177257,0.0003458317,0.00005384063,0.00003880788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007509436,0.00004835895,0.09512009,0.00005658513,0.00005768885,0.0000130791,0.0006581133,0.002260691,0.000517186,0.1472725,0.02311309,0.7308075],"study_design_scores_gemma":[0.005039649,0.0000482525,0.1407067,0.00004771389,0.0000125469,0.00003562384,0.0001164109,0.8118326,0.002383362,0.003743309,0.03562121,0.0004126176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001526447,0.000006891831,0.9841585,0.003195776,0.0005127693,0.0001567625,0.000002566104,0.0001312484,0.01030903],"genre_scores_gemma":[0.742451,0.00001039232,0.2531143,0.0005295422,0.0001320204,0.00002293611,0.000003830139,0.000005612637,0.003730402],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8095719,"threshold_uncertainty_score":0.3804834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03328536348223558,"score_gpt":0.2718105256040718,"score_spread":0.2385251621218362,"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."}}