{"id":"W2035762900","doi":"10.1145/1595391.1595392","title":"Improved Separations between Nondeterministic and Randomized Multiparty Communication","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Division of Computing and Communication Foundations","keywords":"Mathematics; Nondeterministic algorithm; Constant (computer programming); Combinatorics; Function (biology); Communication complexity; Binary logarithm; Discrete mathematics; Set (abstract data type); Computer science","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.0008630455,0.000177768,0.000314113,0.0002281106,0.000619966,0.0001971188,0.0006190187,0.00007435343,0.00001465084],"category_scores_gemma":[0.0001098256,0.0001711297,0.0001306877,0.0003470418,0.0002024486,0.0004436848,0.00001915598,0.0002491453,0.0000162125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002693357,"about_ca_system_score_gemma":0.00003725472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008159292,"about_ca_topic_score_gemma":0.00000425109,"domain_scores_codex":[0.9983197,0.0006053537,0.0003923627,0.0003361953,0.0001666763,0.0001797433],"domain_scores_gemma":[0.9962049,0.002727644,0.0001349372,0.0007347501,0.0001003418,0.00009742596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007285625,0.0002053698,0.00000404361,0.000008546092,0.00006390709,0.000001316698,0.001880153,0.002961593,0.0001234321,0.1266325,0.00002396575,0.8673666],"study_design_scores_gemma":[0.01219857,0.0001512722,0.0006388973,0.00002470616,0.00005578501,0.00001049101,0.00004507547,0.3603275,0.0005033606,0.6257399,0.00007426801,0.0002302254],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004819938,0.0000781967,0.9919532,0.001833179,0.0001281609,0.0004566872,0.00001186645,0.0002895906,0.0004292069],"genre_scores_gemma":[0.8116878,0.00003132677,0.1876633,0.000435743,0.00001932616,0.00003434189,0.00001625785,0.000006196356,0.0001056443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8671364,"threshold_uncertainty_score":0.6978466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02359461181519825,"score_gpt":0.2962639757253391,"score_spread":0.2726693639101408,"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."}}