{"id":"W2127493538","doi":"10.1109/ccc.2006.12","title":"Circuit Lower Bounds via Ehrenfeucht-Fraisse Games","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Class (philosophy); Electronic circuit; Mathematics; Order (exchange); Discrete mathematics; Upper and lower bounds; Combinatorics; Computer science","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.005648713,0.002347194,0.001979867,0.002840675,0.001830306,0.005427023,0.003233703,0.002824204,0.009018881],"category_scores_gemma":[0.024219,0.0007810497,0.002315055,0.001997263,0.004580192,0.01589806,0.004023686,0.007567889,0.001232751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00474925,"about_ca_system_score_gemma":0.001783709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002681284,"about_ca_topic_score_gemma":0.002198981,"domain_scores_codex":[0.9945729,0.001254934,0.000184115,0.0009539957,0.001703545,0.001330477],"domain_scores_gemma":[0.9792259,0.01716907,0.0006568097,0.00139304,0.0009673574,0.0005878081],"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.0001064982,0.00008035872,0.0003631329,0.00009090921,0.00002881809,0.00006043414,0.0001265086,0.02405083,0.00129668,0.9623572,0.001654398,0.00978434],"study_design_scores_gemma":[0.00002977582,0.00004478691,0.0001626016,0.00002999914,0.0000236171,0.00005708222,0.00003305279,0.07904098,0.001668852,0.9166678,0.002220649,0.00002081973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1537611,0.002787266,0.7258431,0.00470993,0.0003253291,0.0002387497,0.0005457129,0.0009577724,0.1108311],"genre_scores_gemma":[0.8952992,0.001718214,0.08843239,0.001341991,0.0004155873,0.0004113434,0.0005116034,0.0002593471,0.01161027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009018881,"threshold_uncertainty_score":0.0344584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01418096740207047,"score_gpt":0.2212683814214968,"score_spread":0.2070874140194263,"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."}}