{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002479209,0.001970074,0.001827514,0.00352229,0.001586294,0.004087123,0.003764625,0.002241012,0.02214851],"category_scores_gemma":[0.02501389,0.0009795565,0.002291397,0.002321737,0.002814516,0.01031284,0.00505244,0.006833149,0.002153079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002976614,"about_ca_system_score_gemma":0.00122733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001177375,"about_ca_topic_score_gemma":0.001490531,"domain_scores_codex":[0.9962918,0.0005734711,0.000141907,0.0008089434,0.001545301,0.0006387059],"domain_scores_gemma":[0.9729998,0.021541,0.0009025707,0.002388164,0.001296214,0.0008723056],"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.0005844281,0.0002578804,0.00249518,0.001076965,0.0001642625,0.0004677388,0.0004163417,0.1033121,0.01098236,0.7871249,0.02939936,0.06371852],"study_design_scores_gemma":[0.00005440246,0.00009886458,0.0005709491,0.0001103138,0.00006096728,0.0002532568,0.00005080049,0.2099366,0.004143577,0.7773651,0.007306082,0.00004902368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1703762,0.006464707,0.6494907,0.008844434,0.0008207813,0.000472892,0.005199891,0.003061485,0.155269],"genre_scores_gemma":[0.8647127,0.003523007,0.1068303,0.003367054,0.002048942,0.0007168571,0.003657433,0.001118033,0.01402572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02214851,"threshold_uncertainty_score":0.07409418,"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."}}