{"id":"W3109005260","doi":"10.1007/s00453-022-01000-3","title":"Monotone Circuit Lower Bounds from Robust Sunflowers","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo; Alfred P. Sloan Foundation","keywords":"Mathematics; Monotone polygon; Conjecture; Upper and lower bounds; Combinatorics; Discrete mathematics; Boolean function; Theory of computation; Algorithm","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":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003362172,0.0002587972,0.0002874329,0.0002055838,0.0008899363,0.0002435596,0.002388681,0.00006022259,0.001146676],"category_scores_gemma":[0.00002263524,0.0002981686,0.0002161056,0.0009943405,0.000127271,0.0004417122,0.001470374,0.0005635535,0.0001325089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001656319,"about_ca_system_score_gemma":0.0001280209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00048965,"about_ca_topic_score_gemma":0.00001258645,"domain_scores_codex":[0.9973468,0.0001419773,0.0003445549,0.0008320967,0.0007581685,0.0005764461],"domain_scores_gemma":[0.998221,0.0001838969,0.0001168765,0.001227667,0.00006195952,0.0001886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007724117,0.002248505,0.0007944106,0.00002037256,0.0006051203,0.001517144,0.005326694,0.007533645,0.002105802,0.3160368,0.05145857,0.6122757],"study_design_scores_gemma":[0.001630513,0.0005310957,0.002454902,0.00001686298,0.00004103846,0.0001333712,0.0003154689,0.4117874,0.001235757,0.2116541,0.3687801,0.001419372],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02918484,0.0006241584,0.953198,0.00237476,0.005832892,0.0003778154,0.0001952283,0.0008546357,0.00735774],"genre_scores_gemma":[0.8662953,0.00002921895,0.1274566,0.003109224,0.0007660195,0.0002490595,0.000111107,0.00006967722,0.001913763],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8371105,"threshold_uncertainty_score":0.9999471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0248240701737722,"score_gpt":0.211981247396356,"score_spread":0.1871571772225838,"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."}}