{"id":"W3184920538","doi":"10.1109/focs52979.2021.00080","title":"LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic","year":2022,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Royal Society","keywords":"Equivalence (formal languages); Bounded function; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm","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.0006571701,0.0001153013,0.0001558671,0.0001737599,0.0004136763,0.0002302404,0.0006870672,0.0000265265,0.0002680669],"category_scores_gemma":[0.00003211654,0.0001165265,0.00005006196,0.0007757671,0.0001469864,0.0003362417,0.0009677983,0.000336674,0.000006745456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001088489,"about_ca_system_score_gemma":0.00009704034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000241793,"about_ca_topic_score_gemma":0.0001679146,"domain_scores_codex":[0.9985862,0.00009159063,0.0002194282,0.000462775,0.0003349941,0.0003049793],"domain_scores_gemma":[0.9992457,0.00008905861,0.00003834982,0.000528254,0.00002625419,0.00007237568],"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.00001362732,0.0006064498,0.006487595,0.00002999542,0.00001431929,0.00006392513,0.001740362,0.0001215321,0.00005949512,0.8474164,0.0003706631,0.1430756],"study_design_scores_gemma":[0.000898339,0.0004677525,0.03295587,0.000006781295,0.000003555922,0.00009937584,0.0003438989,0.1590211,0.00006303779,0.7575777,0.0481048,0.0004578239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7660088,0.0003844142,0.1634073,0.0057966,0.001623693,0.0009712873,0.00001048194,0.0006195442,0.06117793],"genre_scores_gemma":[0.9845997,0.00000328687,0.01386727,0.0005702141,0.00001467888,0.00005248711,0.000001258511,0.000005731044,0.0008853464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2185909,"threshold_uncertainty_score":0.4751813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02209304775552252,"score_gpt":0.230885224742771,"score_spread":0.2087921769872484,"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."}}