{"id":"W2578790121","doi":"10.1145/3055399.3055478","title":"Strongly exponential lower bounds for monotone computation","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Constant (computer programming); Computation; Mathematics; Function (biology); Exponential function; Strongly monotone; Exponent; Discrete mathematics; Upper and lower bounds; Monotonic function; Combinatorics; Applied mathematics; Computer science; Algorithm; Mathematical analysis","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001568072,0.00009068221,0.0001033745,0.00004831751,0.0007607,0.0008121549,0.0009721249,0.00003558054,0.00001999968],"category_scores_gemma":[0.0000248885,0.00008637241,0.0000928303,0.00003643519,0.00008403676,0.0007165914,0.0002767525,0.00005322945,0.0000219322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001373566,"about_ca_system_score_gemma":0.00002772563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005666489,"about_ca_topic_score_gemma":0.00001953456,"domain_scores_codex":[0.999214,0.00001092261,0.0001345091,0.0002751081,0.0001568125,0.0002086632],"domain_scores_gemma":[0.9991392,0.00004849657,0.00009417792,0.0005800142,0.00007933083,0.00005870308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003535847,0.000240725,0.0003263302,0.00002695337,0.00004600843,0.000008436159,0.0002784691,0.0003853968,0.0005878505,0.8053856,0.005776296,0.1869026],"study_design_scores_gemma":[0.001002932,0.000213418,0.008552251,0.00001459295,0.000006120101,0.000005323108,0.00001402028,0.8769729,0.001332708,0.103884,0.007747051,0.0002547552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0163323,0.00001157291,0.9774794,0.0008113571,0.001358477,0.0001823289,0.000003695816,0.0001243708,0.003696516],"genre_scores_gemma":[0.7709329,0.000001213058,0.2282162,0.00005055431,0.0001266895,0.00001928145,0.000003499792,0.000004649961,0.0006450422],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8765875,"threshold_uncertainty_score":0.7831628,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04222843197678203,"score_gpt":0.3123509212870785,"score_spread":0.2701224893102965,"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."}}