{"id":"W2405004071","doi":"","title":"Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Sino-Danish Center; University of Toronto; National Natural Science Foundation of China; National Research Foundation; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Upper and lower bounds; Bounded function; Combinatorics; Mathematics; Binary logarithm; Integer (computer science); Function (biology); Discrete mathematics; Log-log plot; Hash function; Computer science; Mathematical analysis","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"],"consensus_categories":[],"category_scores_codex":[0.0003744889,0.0003206478,0.0002963751,0.0001695169,0.0006222291,0.0003702461,0.00118235,0.00008546504,0.00009355909],"category_scores_gemma":[0.00001930211,0.0002619037,0.00009408288,0.0006890401,0.0002033794,0.0005507048,0.0002645639,0.0004281269,0.00007435551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005202446,"about_ca_system_score_gemma":0.00009636587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003338553,"about_ca_topic_score_gemma":0.0001278803,"domain_scores_codex":[0.9977565,0.00008649748,0.0003228818,0.0007467957,0.0004556479,0.0006316393],"domain_scores_gemma":[0.9986756,0.0002043901,0.0001549305,0.000687433,0.00008714874,0.0001905199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005615209,0.001444066,0.02962278,0.00009112033,0.0003035802,0.0002866858,0.01293315,0.00007823152,0.0004432861,0.5899879,0.01305574,0.3516973],"study_design_scores_gemma":[0.005712126,0.005678729,0.07193286,0.001422772,0.00009593587,0.001883135,0.002599831,0.5617756,0.1179477,0.1936897,0.03019155,0.007070003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1339865,0.0001514706,0.64799,0.0002321788,0.000848219,0.0002435679,0.000003879451,0.001081259,0.215463],"genre_scores_gemma":[0.9469373,0.000004837437,0.05112911,0.001231071,0.00008618992,0.000006029005,0.000005750894,0.00002511074,0.0005746611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8129508,"threshold_uncertainty_score":0.9999833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0442883628984545,"score_gpt":0.2428233523704291,"score_spread":0.1985349894719746,"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."}}