{"id":"W2962731772","doi":"10.1145/2984450.2984455","title":"Algebraic proof complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Proof complexity; Algebraic number; Mathematics; Circuit complexity; Upper and lower bounds; Connection (principal bundle); Discrete mathematics; Algebraic number theory; Polynomial; Computer science; Algebra over a field; Pure mathematics; Electronic circuit","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.0002140381,0.0001810777,0.0002084167,0.0001025159,0.0001797219,0.0001009408,0.002688618,0.00006773772,0.0002027191],"category_scores_gemma":[0.0002781397,0.0001213463,0.0001189401,0.0004181474,0.00022938,0.0005361457,0.001157438,0.0001104896,0.0004180354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003812105,"about_ca_system_score_gemma":0.00005884275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006351264,"about_ca_topic_score_gemma":0.00009594092,"domain_scores_codex":[0.9984026,0.00009051456,0.0002521841,0.0005234629,0.0002951479,0.0004360668],"domain_scores_gemma":[0.9976003,0.0003228463,0.00008813331,0.001773125,0.00006660753,0.0001490452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005290647,0.00009525268,0.00202492,0.000007761511,0.00002007764,0.00002037637,0.0001704096,5.754468e-7,0.00204245,0.4627162,0.01571061,0.517186],"study_design_scores_gemma":[0.0006468474,0.0001415661,0.009464577,0.00003574492,0.000004588016,0.00003908461,0.000009266736,0.0005930049,0.005541118,0.8945599,0.08860291,0.0003614161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02679149,0.0002327159,0.9278423,0.03141686,0.001330124,0.0004088701,0.0000157613,0.0007375182,0.01122441],"genre_scores_gemma":[0.7996475,0.000035179,0.1955493,0.002635543,0.0003562375,0.00004318518,0.000003089328,0.00002060733,0.001709367],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7728561,"threshold_uncertainty_score":0.5373139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05705805629815051,"score_gpt":0.2720437758751473,"score_spread":0.2149857195769967,"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."}}