{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004987842,0.002373857,0.001950103,0.002191937,0.002585664,0.005301503,0.005763989,0.003704582,0.01886015],"category_scores_gemma":[0.04436431,0.001537916,0.003580837,0.002870477,0.006699197,0.02449514,0.009663993,0.01201508,0.002031033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00587451,"about_ca_system_score_gemma":0.00253778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001706415,"about_ca_topic_score_gemma":0.001737769,"domain_scores_codex":[0.989884,0.001602903,0.0003644669,0.001740293,0.003943267,0.002464954],"domain_scores_gemma":[0.9264131,0.0575347,0.003031042,0.009652169,0.001718962,0.001650101],"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.001950327,0.0004839277,0.005596194,0.001123405,0.0003165079,0.0006254605,0.001291347,0.08577202,0.02075695,0.8181678,0.01075777,0.05315826],"study_design_scores_gemma":[0.0002476295,0.0002525052,0.002381224,0.0002135824,0.0003800598,0.000747365,0.0001894028,0.2105697,0.03491004,0.7369269,0.01305742,0.0001242154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2044055,0.008010441,0.6147844,0.01741094,0.0003999476,0.0009127775,0.004138451,0.004164356,0.1457734],"genre_scores_gemma":[0.9086307,0.003113554,0.06683995,0.002230948,0.0007908655,0.001074815,0.002022873,0.0009738672,0.01432252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01886015,"threshold_uncertainty_score":0.06309342,"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."}}