{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002592761,0.002829083,0.001469514,0.001507814,0.001453796,0.002607563,0.004580886,0.002134224,0.008880667],"category_scores_gemma":[0.02206507,0.001117404,0.00172212,0.002096946,0.002934374,0.01393824,0.004006111,0.004605491,0.001950302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004092883,"about_ca_system_score_gemma":0.002726722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003141544,"about_ca_topic_score_gemma":0.006304863,"domain_scores_codex":[0.9957632,0.0007707494,0.0002111775,0.0006229279,0.001529594,0.001102374],"domain_scores_gemma":[0.9787023,0.01556724,0.001204869,0.002936916,0.0009788248,0.000609845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002704749,0.0006182367,0.004975972,0.001482531,0.000356499,0.0004541287,0.0006129425,0.4493749,0.05361068,0.3109002,0.0150074,0.1599017],"study_design_scores_gemma":[0.000173941,0.0003170641,0.000830397,0.0001496196,0.0001645862,0.0001767854,0.00007165576,0.732497,0.03149547,0.2264087,0.007665374,0.00004946448],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1978479,0.004937273,0.746102,0.004235081,0.000403686,0.000414538,0.001084676,0.004451367,0.04052349],"genre_scores_gemma":[0.7157683,0.002979456,0.2598556,0.001646046,0.0003196697,0.0009357317,0.001914608,0.001059633,0.01552102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008880667,"threshold_uncertainty_score":0.0297088,"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."}}