{"id":"W2057952251","doi":"10.1109/focs.2014.20","title":"Circuit Complexity, Proof Complexity, and Polynomial Identity Testing","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Santa Fe Institute; National Science Foundation","keywords":"Proof complexity; Mathematics; Discrete mathematics; Mathematical proof; Polynomial; Upper and lower bounds; Algebraic number; Proof theory; Complexity class; Combinatorics; Identity (music); Boolean circuit; Conjecture; Time complexity; Boolean function","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002861316,0.0006672315,0.0006567542,0.002477464,0.00169494,0.00517496,0.002564286,0.001318102,0.006506254],"category_scores_gemma":[0.01995315,0.0004781368,0.001349553,0.002051466,0.006718192,0.0126546,0.004149036,0.006130728,0.0007220089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004802014,"about_ca_system_score_gemma":0.002020912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002477544,"about_ca_topic_score_gemma":0.002440587,"domain_scores_codex":[0.9953421,0.001197991,0.0002685753,0.0008596081,0.001688473,0.0006431454],"domain_scores_gemma":[0.9743004,0.01771804,0.002102004,0.003349375,0.001821911,0.0007083262],"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.000011568,0.00001576014,0.0002842426,0.00003567271,0.000005478095,0.00002074664,0.00007249766,0.002499757,0.0006827424,0.990239,0.0007174354,0.005414988],"study_design_scores_gemma":[0.000009063709,0.0000222065,0.0003310061,0.00001447642,0.00001254691,0.00008393708,0.00003428103,0.02171924,0.001802558,0.9709185,0.005034004,0.00001807293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06163241,0.0009348926,0.8812504,0.006467628,0.0001640953,0.0001392122,0.0004212712,0.0006291189,0.04836109],"genre_scores_gemma":[0.7805648,0.001000817,0.2080764,0.0009961795,0.0005026663,0.0002505972,0.0004796779,0.0002372147,0.007891571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006506254,"threshold_uncertainty_score":0.03484124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1470915544222957,"score_gpt":0.3050535386634883,"score_spread":0.1579619842411926,"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."}}