{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007297412,0.0005666415,0.0006001869,0.0002603144,0.0009033993,0.001736766,0.002462734,0.00025696,0.00009846002],"category_scores_gemma":[0.0002491789,0.0004983238,0.0005302529,0.0004780673,0.0003354233,0.003857691,0.0007958123,0.0003914736,0.0002535096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055433,"about_ca_system_score_gemma":0.0001330722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005370679,"about_ca_topic_score_gemma":0.00004036835,"domain_scores_codex":[0.9963377,0.00004934597,0.001242685,0.0004848228,0.0006342915,0.001251193],"domain_scores_gemma":[0.9966298,0.0005817727,0.0004951814,0.001363108,0.0006167658,0.0003133507],"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.00009719172,0.0006523243,0.002188738,0.0008947073,0.0003559426,0.000003300118,0.01147665,0.00002892254,0.0001482527,0.8888376,0.02414098,0.07117545],"study_design_scores_gemma":[0.006409789,0.0009606639,0.003531271,0.0002453092,0.00006286172,0.0001162577,0.001526905,0.1601036,0.003688955,0.5154134,0.3060643,0.001876712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0505803,0.0001125315,0.9347641,0.001434487,0.002738143,0.004045185,0.0004160171,0.0006906383,0.005218596],"genre_scores_gemma":[0.5866143,0.00004739682,0.4064254,0.002504263,0.0005768128,0.001900121,0.0003178471,0.00009552087,0.001518298],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.536034,"threshold_uncertainty_score":0.9997469,"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."}}