{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00389177,0.001802901,0.003254837,0.001495397,0.002238159,0.004323003,0.00474665,0.003775765,0.01499557],"category_scores_gemma":[0.05152892,0.001638841,0.002755855,0.003249098,0.003506553,0.01041736,0.002487945,0.005251914,0.001628708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00378027,"about_ca_system_score_gemma":0.003089344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00733164,"about_ca_topic_score_gemma":0.01062908,"domain_scores_codex":[0.994395,0.001154853,0.0003849504,0.001840333,0.0011011,0.001123821],"domain_scores_gemma":[0.9350469,0.05536279,0.00287395,0.003995864,0.001459779,0.001260864],"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.002717635,0.0008748096,0.008922147,0.001603535,0.0005671032,0.001418716,0.0004226097,0.4926207,0.004577401,0.3577215,0.05271073,0.07584325],"study_design_scores_gemma":[0.0004564872,0.0001109419,0.001711146,0.0001167041,0.00008227291,0.0007878959,0.0001759254,0.412483,0.001691508,0.57907,0.003248647,0.00006543574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5773304,0.0037894,0.3521783,0.01506279,0.0007403953,0.0007505344,0.01121327,0.004645352,0.03428964],"genre_scores_gemma":[0.9040899,0.001333766,0.07010669,0.002632464,0.000708079,0.0007152392,0.007956339,0.001128546,0.011329],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01499557,"threshold_uncertainty_score":0.05016518,"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."}}