{"id":"W2124396273","doi":"10.1007/s00037-013-0064-x","title":"Lifting lower bounds for tree-like proofs","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Mathematical proof; Proof complexity; Mathematics; Constant (computer programming); Upper and lower bounds; Bounded function; Discrete mathematics; Sequent; Tree (set theory); Sequent calculus; Hierarchy; Combinatorics; Computer science","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.0003241088,0.0001787484,0.0002182213,0.00008046278,0.0003921204,0.0005219514,0.0007090638,0.00006175881,0.0000482971],"category_scores_gemma":[0.00005668731,0.0001606997,0.0001324982,0.0002607402,0.0001172416,0.0005027525,0.0002095722,0.0001066963,0.000284869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006100781,"about_ca_system_score_gemma":0.0001127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008591873,"about_ca_topic_score_gemma":0.00002443991,"domain_scores_codex":[0.9984108,0.00006869899,0.0003405732,0.0004574985,0.000346275,0.0003761489],"domain_scores_gemma":[0.9987003,0.0002450572,0.0001582413,0.0003181066,0.0004460115,0.0001323385],"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.000006098787,0.0001409359,0.001052069,0.00005389214,0.00003254259,0.000002384245,0.0004313433,0.0009230119,0.00002522544,0.9556435,0.008042841,0.03364613],"study_design_scores_gemma":[0.0004071762,0.0001452908,0.009872139,0.000003791643,0.000003596941,0.00001597583,0.00001649022,0.3551161,0.0000141577,0.6117195,0.02246364,0.0002220598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008252052,0.00008556888,0.9838758,0.0007796063,0.001033439,0.0007504805,0.000002638108,0.0003279613,0.004892512],"genre_scores_gemma":[0.8775916,1.842402e-7,0.1209254,0.0005224654,0.0002518631,0.0001437627,0.00004165972,0.00001222491,0.0005107902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8693396,"threshold_uncertainty_score":0.6553144,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0681648188073247,"score_gpt":0.2876902495246916,"score_spread":0.2195254307173669,"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."}}