{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002118696,0.0003108855,0.0006091286,0.0001665494,0.0003841954,0.0006161376,0.001746278,0.0001669952,0.00002983162],"category_scores_gemma":[0.0002849656,0.0002790376,0.0003403534,0.0004275841,0.0002800057,0.002470259,0.0006570391,0.0003595852,0.0003847569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001132121,"about_ca_system_score_gemma":0.0001001807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000429431,"about_ca_topic_score_gemma":0.00001681512,"domain_scores_codex":[0.9973316,0.0001892127,0.001113815,0.0002345664,0.0005794315,0.0005514274],"domain_scores_gemma":[0.997073,0.000359382,0.0004872499,0.001312622,0.0004821788,0.000285549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006739194,0.0008170494,0.001532836,0.0003475041,0.0003634906,0.000005220108,0.03118444,0.0003756154,0.000005529621,0.8825613,0.04669962,0.02936818],"study_design_scores_gemma":[0.1421769,0.000191418,0.0001388935,0.0001997063,0.00006597503,0.0001169406,0.0009216155,0.5591404,0.0004405711,0.1361375,0.1595797,0.0008903343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02735142,0.0001110137,0.9394038,0.002262769,0.001513773,0.001917978,0.0001307683,0.0006489986,0.02665945],"genre_scores_gemma":[0.758943,0.0001278874,0.2368812,0.002278651,0.000178185,0.0004584155,0.0006479335,0.00003770158,0.000447066],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7464238,"threshold_uncertainty_score":0.9999662,"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."}}