{"id":"W2296156273","doi":"10.4230/lipics.icalp.2017.52","title":"Randomized Communication vs. Partition Number.","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Partition (number theory); Randomized algorithm; Mathematics; Combinatorics; Clique; Upper and lower bounds; Set (abstract data type); Computational complexity theory; Discrete mathematics; Computer science; Algorithm","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.006098421,0.002114249,0.002207789,0.001429739,0.002835635,0.005770423,0.005778044,0.003675864,0.01741627],"category_scores_gemma":[0.05888246,0.001183287,0.00173847,0.002675814,0.00442953,0.01451112,0.005381756,0.007054313,0.002469515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006085685,"about_ca_system_score_gemma":0.005341155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001709994,"about_ca_topic_score_gemma":0.002963051,"domain_scores_codex":[0.985904,0.005184954,0.000419681,0.003072049,0.003241014,0.002178232],"domain_scores_gemma":[0.9079216,0.06762008,0.004852323,0.01524418,0.001916101,0.002445711],"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.002998352,0.0007500749,0.002977524,0.0008314077,0.0002086255,0.0001874066,0.0003419768,0.2915904,0.01281713,0.5882291,0.0222651,0.0768029],"study_design_scores_gemma":[0.0002672469,0.0002947984,0.0007627283,0.00008278219,0.00009949033,0.0002146503,0.00007470095,0.5682288,0.006643204,0.4187803,0.004488216,0.00006306416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381128,0.003092665,0.7791209,0.01276439,0.0009700555,0.0007919366,0.00293452,0.003725063,0.05848772],"genre_scores_gemma":[0.8728389,0.0009222871,0.1117936,0.001951969,0.0007484359,0.000994492,0.001589724,0.0009450953,0.008215529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01741627,"threshold_uncertainty_score":0.05826324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04041832574937575,"score_gpt":0.2913102703181808,"score_spread":0.250891944568805,"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."}}