{"id":"W2398731595","doi":"10.1007/978-3-642-32512-0_39","title":"A Discrepancy Lower Bound for Information Complexity","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Omega; Upper and lower bounds; Communication complexity; Combinatorics; Function (biology); Corollary; Binary logarithm; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical analysis; Quantum mechanics","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.001023955,0.0001643131,0.0001623017,0.0003285041,0.0003404304,0.0005849807,0.001508465,0.00006082721,0.000004672645],"category_scores_gemma":[0.0001537658,0.0001410265,0.00007807049,0.001713846,0.0003891175,0.005688289,0.0005831882,0.0001620027,0.00001590915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000649738,"about_ca_system_score_gemma":0.0001058657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004403007,"about_ca_topic_score_gemma":0.00004341151,"domain_scores_codex":[0.9982551,0.00003241618,0.0002726818,0.0003507962,0.0004089419,0.0006800932],"domain_scores_gemma":[0.9986124,0.000242176,0.00009901072,0.000753431,0.0001248862,0.0001680804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002410803,0.0002703302,0.009299791,0.00005170147,0.000006574222,0.0000013976,0.005927532,0.0009397236,0.000172962,0.3525353,0.0001082149,0.6306623],"study_design_scores_gemma":[0.000735973,0.000227783,0.03901602,0.00004869878,0.00000468478,0.00003970242,0.000002077177,0.635114,0.003313124,0.3136162,0.007286844,0.0005948877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02234545,0.00009592219,0.9746453,0.000601805,0.001822582,0.0003086471,0.00001386213,0.000118257,0.00004818619],"genre_scores_gemma":[0.5630752,0.000001570218,0.4359899,0.0007868854,0.0001263983,0.00001228566,0.000005873041,0.00000184658,3.105458e-8],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6341743,"threshold_uncertainty_score":0.5750895,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0225872092154184,"score_gpt":0.2732557279398206,"score_spread":0.2506685187244022,"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."}}