{"id":"W2256514854","doi":"10.4230/lipics.tqc.2015.206","title":"Round Elimination in Exact Communication Complexity","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Communication complexity; Upper and lower bounds; Alice and Bob; Chromatic scale; Mathematics; Discrete mathematics; Rank (graph theory); Hierarchy; Context (archaeology); Theoretical computer science; Computer science; Combinatorics; Alice (programming language)","routes":{"ca_aff":true,"ca_fund":true,"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.0004313315,0.0001028191,0.0001209396,0.0002098657,0.0001163005,0.0001022974,0.001117402,0.00005431012,0.000008844018],"category_scores_gemma":[0.00003998246,0.0001251777,0.00004629974,0.001015174,0.0001353514,0.001432327,0.0003881872,0.0001675997,0.00004191234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001850824,"about_ca_system_score_gemma":0.00006062666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00038561,"about_ca_topic_score_gemma":0.0003304325,"domain_scores_codex":[0.9990839,0.0001842879,0.0001248421,0.0003298619,0.00008275631,0.0001943511],"domain_scores_gemma":[0.9988723,0.00009064235,0.00007803563,0.0007324908,0.0001171381,0.0001094245],"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.00001166203,0.0001204171,0.004045496,0.000003552695,0.000005575261,0.00002989138,0.0004669261,0.004379289,0.000008385458,0.9889978,0.0001592105,0.001771771],"study_design_scores_gemma":[0.0006881573,0.00005344783,0.01702319,0.00001563203,0.000004168807,0.000005192542,0.0002020024,0.6376293,0.00007123731,0.3431956,0.0009344369,0.0001775728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.311791,0.0000486491,0.6775525,0.0004569204,0.0001483764,0.0001317225,0.000001951029,0.000154965,0.009713941],"genre_scores_gemma":[0.9928403,0.00002485483,0.006679693,0.00008102717,0.00001295676,3.80932e-7,0.00000748881,0.000004035705,0.0003491985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6810493,"threshold_uncertainty_score":0.5104598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2105234802304926,"score_gpt":0.2184215507897412,"score_spread":0.007898070559248682,"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."}}