{"id":"W2143722695","doi":"10.1109/focs.2013.70","title":"Average Case Lower Bounds for Monotone Switching Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotone polygon; Corollary; Mathematics; Boolean function; Upper and lower bounds; Computation; Discrete mathematics; Function (biology); Exponential function; Combinatorics; Applied mathematics; Algorithm; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003998424,0.001677256,0.00172307,0.002558212,0.001908604,0.004235855,0.004488521,0.002019151,0.0122627],"category_scores_gemma":[0.03672531,0.0008416019,0.002281386,0.00221523,0.003172063,0.0140744,0.005192148,0.007179934,0.001372698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005607537,"about_ca_system_score_gemma":0.002453908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001896433,"about_ca_topic_score_gemma":0.002297011,"domain_scores_codex":[0.9935028,0.0009134799,0.0002380917,0.001220962,0.002504907,0.001619774],"domain_scores_gemma":[0.9561819,0.03231007,0.00211164,0.004809759,0.003176041,0.001410633],"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.0007700202,0.0002927552,0.005111958,0.0007960985,0.0001430159,0.0003258052,0.0006525937,0.1706225,0.01590233,0.7182819,0.01225852,0.07484251],"study_design_scores_gemma":[0.00004155798,0.0001323292,0.000993649,0.0001028598,0.00007642393,0.0003632536,0.0001366805,0.4243355,0.01018819,0.5577799,0.005797286,0.00005239976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1366783,0.003583228,0.7665349,0.006605025,0.000293631,0.0002642624,0.001797528,0.001472951,0.08277024],"genre_scores_gemma":[0.8853285,0.003463358,0.09340963,0.001887499,0.0007621211,0.0006284061,0.001291611,0.0007498734,0.01247908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0122627,"threshold_uncertainty_score":0.04102284,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01514264386887832,"score_gpt":0.2372938375577195,"score_spread":0.2221511936888412,"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."}}