{"id":"W2081172416","doi":"10.1109/ccc.2012.27","title":"Space Complexity in Polynomial Calculus","year":2012,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Pigeonhole principle; Proof complexity; Mathematics; Upper and lower bounds; Space (punctuation); Polynomial; PSPACE; Combinatorics; Discrete mathematics; Mathematical proof; Linear space; Calculus (dental); Computational complexity theory; Computer science; Algorithm; Mathematical analysis; Geometry","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.0003410691,0.00007756754,0.0001141622,0.00005058659,0.00004290121,0.0000669368,0.0003640629,0.00004523293,0.00004163133],"category_scores_gemma":[0.00001394506,0.00005984512,0.00003489938,0.000202119,0.00003613597,0.0003301683,0.0001627788,0.00007390438,0.0003659133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004093529,"about_ca_system_score_gemma":0.00002183898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001474229,"about_ca_topic_score_gemma":0.0003590808,"domain_scores_codex":[0.999171,0.00005567801,0.0001265995,0.0001530631,0.0001290819,0.0003646156],"domain_scores_gemma":[0.9995344,0.00002317873,0.00003244346,0.000284936,0.00001477419,0.000110241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001434708,0.00007233251,0.02498967,0.000004568819,0.000002705106,0.000003278159,0.0007570717,0.000001062609,0.00006881797,0.9660419,0.002716592,0.005340576],"study_design_scores_gemma":[0.002529079,0.0002708189,0.26603,0.000006951843,0.000008759422,0.0001655784,0.0005304212,0.02899613,0.006469765,0.024055,0.6695695,0.001368033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02473832,0.000283583,0.8228635,0.0009687768,0.001704705,0.0002362885,2.105003e-7,0.0002820779,0.1489226],"genre_scores_gemma":[0.9919357,8.307578e-7,0.006219423,0.000151472,0.0001894299,0.000005753996,5.604255e-7,0.000003221373,0.001493647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9671974,"threshold_uncertainty_score":0.4703197,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06274404171587286,"score_gpt":0.2822374591676989,"score_spread":0.2194934174518261,"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."}}