{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004978402,0.001089384,0.001407004,0.001321585,0.002227339,0.004465454,0.002990565,0.002216321,0.009058183],"category_scores_gemma":[0.02557267,0.0007312629,0.001795825,0.001869146,0.006302859,0.0139766,0.005252891,0.005858925,0.001112118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004512244,"about_ca_system_score_gemma":0.002640701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001870129,"about_ca_topic_score_gemma":0.001295603,"domain_scores_codex":[0.9919972,0.003030306,0.0002919985,0.00116218,0.00215477,0.001363629],"domain_scores_gemma":[0.9622381,0.03028107,0.001391041,0.004369154,0.001079502,0.0006411375],"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.00009422567,0.00003935361,0.0003406081,0.0001289118,0.00002024858,0.00006783268,0.0002868216,0.02266708,0.0006294487,0.9657718,0.001755757,0.008197836],"study_design_scores_gemma":[0.00004443943,0.0000309309,0.0001513391,0.00002012595,0.00001898731,0.00005031941,0.00005902537,0.0812101,0.0006935326,0.9154925,0.002208542,0.00002022625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2423467,0.00210257,0.6690948,0.0105848,0.0002565969,0.0003726583,0.0008764191,0.001085688,0.07327979],"genre_scores_gemma":[0.8948316,0.00125776,0.08559499,0.0011348,0.0003902965,0.0008139572,0.0005516275,0.0003139234,0.01511111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009058183,"threshold_uncertainty_score":0.0327388,"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."}}