{"id":"W2767976260","doi":"10.1016/j.apal.2019.102735","title":"Feasibly constructive proofs of succinct weak circuit lower bounds","year":2019,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; European Commission","keywords":"Mathematical proof; Mathematics; Pigeonhole principle; Upper and lower bounds; Proof complexity; Discrete mathematics; Bounded function; Combinatorics; Constructive; Logarithm; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004716328,0.0002209097,0.0005116873,0.0001238755,0.0000543543,0.00005908319,0.0006817048,0.0001316775,0.00006340755],"category_scores_gemma":[0.00002405187,0.000183914,0.0001173738,0.0004288022,0.0002430635,0.0001870639,0.0003936978,0.0001686521,0.0000244407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009774223,"about_ca_system_score_gemma":0.00009300754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001243139,"about_ca_topic_score_gemma":0.000004589253,"domain_scores_codex":[0.9982885,0.00004909111,0.0003986669,0.0005739111,0.0003454434,0.0003444347],"domain_scores_gemma":[0.9985897,0.0001623332,0.0002660384,0.0006513125,0.0002273721,0.0001032557],"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.00006037094,0.0004190106,0.00835396,0.000217774,0.000103205,0.000006342444,0.0006877877,0.0001318361,0.006753301,0.9001328,0.0006325808,0.08250106],"study_design_scores_gemma":[0.001414448,0.001498495,0.06551909,0.00006981385,0.00003034787,0.00006185555,0.0003466641,0.00195741,0.0244281,0.9014381,0.00246995,0.0007657036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9088429,0.000757718,0.03097631,0.001007317,0.0004154667,0.001004,0.00001913132,0.0001197711,0.05685743],"genre_scores_gemma":[0.9953024,0.00002548459,0.004169327,0.0003277469,0.00004855257,0.00001264093,0.000002357588,0.000008297839,0.0001031462],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08645958,"threshold_uncertainty_score":0.7499795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03561292216084491,"score_gpt":0.2667928805127758,"score_spread":0.2311799583519309,"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."}}