{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001594258,0.0001600465,0.0001525078,0.0001269485,0.0001830683,0.0003231161,0.001023388,0.0000605119,0.0003627398],"category_scores_gemma":[0.000009099226,0.0001451469,0.0001242116,0.0005125164,0.0001006251,0.0004383771,0.0002564007,0.0001297634,0.000266464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002396824,"about_ca_system_score_gemma":0.00003936462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002531551,"about_ca_topic_score_gemma":0.0001005591,"domain_scores_codex":[0.9986526,0.00002719497,0.0002239957,0.0004158822,0.0003071297,0.0003732367],"domain_scores_gemma":[0.9989938,0.00006890766,0.0000480718,0.0007418507,0.0000663923,0.00008093625],"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.000001820314,0.0002169241,0.0007668381,0.000007145625,0.00001283664,0.00004610837,0.0001007209,0.00002568538,0.0006344143,0.8695302,0.01849548,0.1101618],"study_design_scores_gemma":[0.0003539154,0.00009551474,0.01114393,0.00001173012,0.000005069438,0.00006505347,0.000005933954,0.0311196,0.001934379,0.8457413,0.1090646,0.000458976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006926638,0.0002212399,0.8976322,0.0007403743,0.0008480132,0.00008063282,0.000001438537,0.0004889487,0.09306048],"genre_scores_gemma":[0.9469982,0.000004386445,0.04452926,0.0007091452,0.000268618,0.00001040029,0.00000334155,0.00001076047,0.007465918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9400715,"threshold_uncertainty_score":0.5918919,"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."}}