{"id":"W2784736141","doi":"10.1145/3170711","title":"Randomized Communication versus Partition Number","year":2018,"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":"National Science Foundation","keywords":"Mathematics; Communication complexity; Partition (number theory); Combinatorics; Randomized algorithm; Upper and lower bounds; Discrete mathematics; Clique; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004864907,0.001651775,0.002056653,0.001275772,0.002316042,0.004700623,0.004672136,0.002759707,0.0172594],"category_scores_gemma":[0.04869736,0.001027893,0.001360004,0.002197646,0.004218678,0.01273168,0.005000607,0.006190276,0.002200488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00548745,"about_ca_system_score_gemma":0.005018327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562564,"about_ca_topic_score_gemma":0.002813632,"domain_scores_codex":[0.9874548,0.004535701,0.0003558993,0.002618604,0.002975144,0.002059949],"domain_scores_gemma":[0.9260398,0.05243616,0.00344247,0.01426671,0.001939303,0.001875586],"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.001904458,0.0005933743,0.002135898,0.0005157021,0.0001221826,0.0001347095,0.0002885551,0.3531638,0.01296685,0.5387885,0.01655174,0.07283417],"study_design_scores_gemma":[0.0001608188,0.0001939365,0.0004962034,0.00005364875,0.00005386207,0.0001203325,0.00005244763,0.6783204,0.006734808,0.3104733,0.00329248,0.00004773845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1261478,0.001772034,0.8078901,0.01008048,0.0006541166,0.0004957746,0.001368722,0.003055538,0.04853548],"genre_scores_gemma":[0.8725484,0.0006218442,0.1142182,0.001673911,0.0006004362,0.0007655743,0.0009817096,0.0008232975,0.007766528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0172594,"threshold_uncertainty_score":0.05773842,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04074193019947035,"score_gpt":0.3162857808016349,"score_spread":0.2755438506021645,"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."}}