{"id":"W1944379106","doi":"10.1137/120895950","title":"Space Complexity in Polynomial Calculus","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Vetenskapsrådet; Kungliga Tekniska Högskolan; Akademie Věd České Republiky; Univerzita Karlova v Praze; Grantová Agentura České Republiky; European Commission","keywords":"Pigeonhole principle; Mathematics; Proof complexity; Polynomial; Space (punctuation); Mathematical proof; Calculus (dental); Upper and lower bounds; Linear space; PSPACE; Discrete mathematics; Resolution (logic); Combinatorics; Computational complexity theory; Geometry; Mathematical analysis; Algorithm; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.002713081,0.000136534,0.0002020297,0.0002283456,0.0001580033,0.0002491691,0.0008803729,0.00006040181,0.000003530774],"category_scores_gemma":[0.0003923948,0.0001267643,0.00006191937,0.0004864325,0.00005321023,0.0004136575,0.0002376774,0.0006175648,0.0000730126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003303296,"about_ca_system_score_gemma":0.0001693446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002730287,"about_ca_topic_score_gemma":0.000005031887,"domain_scores_codex":[0.9981178,0.0004044222,0.0004099217,0.0002449012,0.0004435743,0.000379388],"domain_scores_gemma":[0.9989318,0.0001052317,0.0002610301,0.0003309699,0.0001228718,0.0002480852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000198822,0.0005470708,0.006301741,0.00002959206,0.00004018294,0.0005177399,0.009539853,0.06383435,0.001047625,0.551865,0.01061305,0.355465],"study_design_scores_gemma":[0.00118781,0.0003101772,0.01322861,0.0001018095,0.000002085181,0.0005877717,0.0001442656,0.9722822,0.001492308,0.00480707,0.005574762,0.0002810851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.162744,0.00006564785,0.8273875,0.001197231,0.0021681,0.00008334129,2.7709e-7,0.00008255454,0.006271358],"genre_scores_gemma":[0.588158,0.00000141657,0.4112263,0.0002445262,0.0003394547,3.19709e-7,2.095025e-7,0.000006417966,0.00002337592],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9084479,"threshold_uncertainty_score":0.51693,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1428878891099822,"score_gpt":0.3584239022031194,"score_spread":0.2155360130931371,"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."}}