{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074334,0.0001498489,0.0002139474,0.0001429675,0.0006245504,0.0001486624,0.0008217563,0.00006828317,0.0003203564],"category_scores_gemma":[0.0001125941,0.0001473101,0.0001678582,0.0005150653,0.0004140199,0.0005054348,0.00002754757,0.0001969124,0.0006724843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004666997,"about_ca_system_score_gemma":0.00003657637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001580996,"about_ca_topic_score_gemma":0.00001341416,"domain_scores_codex":[0.998108,0.0008281649,0.0003112876,0.0003048519,0.0002593797,0.0001883707],"domain_scores_gemma":[0.996501,0.002215032,0.0001195494,0.0008855729,0.0002090842,0.00006973142],"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.007697687,0.000218532,0.000001224826,0.000005936142,0.0001113867,0.000001010349,0.001474603,0.001772364,0.00001335202,0.6401271,0.0002013864,0.3483755],"study_design_scores_gemma":[0.03767036,0.0001215475,0.00004230448,0.00002960413,0.00003679908,0.000009349107,0.0000775127,0.1093888,0.001256996,0.8503853,0.0007566306,0.0002247409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003432192,0.00002482235,0.9875635,0.001243318,0.001062075,0.0002702643,0.000003912172,0.0004084586,0.005991466],"genre_scores_gemma":[0.8482421,0.00002977941,0.1510001,0.0003860607,0.00006243955,0.00006414462,0.00001176276,0.00001060204,0.0001930255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8448099,"threshold_uncertainty_score":0.864365,"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."}}