{"id":"W2402204697","doi":"","title":"Lower Bounds on Interactive Compressibility by Constant-Depth Circuits.","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Upper and lower bounds; Mathematics; Connection (principal bundle); Constant (computer programming); Compressibility; Bounded function; Electronic circuit; Compression (physics); Discrete mathematics; Combinatorics; Omega; Probabilistic logic; Computer science; Mathematical analysis; Physics; Geometry; Quantum mechanics; Statistics","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.0003085286,0.000173115,0.0001836502,0.00006904554,0.0001728886,0.0001611221,0.0007626509,0.00005679934,0.0002986903],"category_scores_gemma":[0.00003698248,0.0001457123,0.00009658898,0.0002625593,0.0001684354,0.0009159108,0.0002954632,0.0002576293,0.0001972151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006615581,"about_ca_system_score_gemma":0.00003035174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000467996,"about_ca_topic_score_gemma":0.00001001063,"domain_scores_codex":[0.9985624,0.00009702845,0.000213276,0.0003765755,0.0003022864,0.000448423],"domain_scores_gemma":[0.9986516,0.0002887385,0.00007215256,0.0007284601,0.00006386853,0.000195234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000331638,0.002672982,0.009212889,0.00001874223,0.0001021236,0.00001097745,0.002121202,0.000004874605,0.002024975,0.6989216,0.06483892,0.2200376],"study_design_scores_gemma":[0.005436737,0.002549239,0.08546517,0.0003189743,0.0000621494,0.0002385112,0.00111149,0.06983192,0.08429841,0.1939791,0.5519496,0.004758678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05694582,0.0002423088,0.587258,0.0006509795,0.00314881,0.0002890175,0.00002697471,0.0005438694,0.3508942],"genre_scores_gemma":[0.9944043,0.000003996143,0.003640379,0.00124242,0.00007839681,0.000008576761,0.000003632673,0.000006668076,0.0006116704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9374585,"threshold_uncertainty_score":0.5941977,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03066489096434945,"score_gpt":0.283515508964421,"score_spread":0.2528506180000716,"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."}}