{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004350843,0.0009371373,0.001147424,0.003096523,0.002123609,0.008658848,0.003267614,0.001461183,0.01442822],"category_scores_gemma":[0.02848864,0.0007572341,0.001859478,0.00401129,0.005459021,0.01877267,0.005020354,0.007196809,0.002055217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004587246,"about_ca_system_score_gemma":0.002339551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001621091,"about_ca_topic_score_gemma":0.001202196,"domain_scores_codex":[0.9911978,0.001868016,0.000646101,0.001603509,0.003994427,0.0006901804],"domain_scores_gemma":[0.9579616,0.03185646,0.001798988,0.003814805,0.003785443,0.000782739],"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.00001657275,0.00001680759,0.0002533985,0.0002851561,0.00002121904,0.0000271002,0.00009812988,0.003075454,0.0002590141,0.9769812,0.002731669,0.01623418],"study_design_scores_gemma":[0.000007433044,0.000009472617,0.0001736885,0.00004729223,0.00001616615,0.00008471435,0.00002739043,0.007089675,0.0003513513,0.9774343,0.01474724,0.00001142547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03037457,0.02620246,0.7929596,0.01660728,0.0008935712,0.0001978935,0.001630678,0.00104231,0.1300917],"genre_scores_gemma":[0.7160318,0.04035531,0.2115302,0.004214949,0.005096311,0.0004900469,0.002876712,0.0006621139,0.01874267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01442822,"threshold_uncertainty_score":0.04826725,"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."}}