{"id":"W2245981342","doi":"10.4230/lipics.csl.2013.296","title":"Theories for Subexponential-size Bounded-depth Frege Proofs","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematical proof; Bounded function; Proof complexity; Mathematics; Discrete mathematics; Class (philosophy); Complexity class; Pigeonhole principle; Proof theory; Computer science; Time complexity","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.003085655,0.0007347945,0.0008933379,0.002416396,0.001655128,0.004468378,0.002846569,0.001502733,0.01013066],"category_scores_gemma":[0.02128059,0.001039706,0.003134836,0.00155685,0.003857139,0.01739077,0.004384911,0.006993996,0.0008705623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007442713,"about_ca_system_score_gemma":0.002612988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003340006,"about_ca_topic_score_gemma":0.004641959,"domain_scores_codex":[0.9952173,0.0007942297,0.0002914758,0.0008774288,0.002146441,0.0006731619],"domain_scores_gemma":[0.9765062,0.01588243,0.001835802,0.003618452,0.001630452,0.0005267147],"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.00004382008,0.0000417257,0.0008135046,0.000136929,0.00002314028,0.00005929942,0.0002656551,0.006897385,0.00175064,0.9758919,0.001514611,0.01256139],"study_design_scores_gemma":[0.0000368305,0.00003233107,0.0008594639,0.00006044976,0.00005932806,0.0001888919,0.0001130085,0.06915011,0.004610468,0.9138958,0.01095639,0.00003687335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08090493,0.00101077,0.8832464,0.002593309,0.0001345694,0.0003199914,0.0006759653,0.001733854,0.02938026],"genre_scores_gemma":[0.5859565,0.0009281004,0.397236,0.001473104,0.0004128348,0.0006509124,0.001249541,0.000591089,0.01150196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01013066,"threshold_uncertainty_score":0.05400091,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01360851346926505,"score_gpt":0.2445596853273095,"score_spread":0.2309511718580445,"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."}}