{"id":"W2249023948","doi":"10.4230/lipics.approx-random.2014.721","title":"Communication Complexity of Set-Disjointness for All Probabilities","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication complexity; Characterization (materials science); Mathematics; Bounded function; Upper and lower bounds; Class (philosophy); Complexity class; Discrete mathematics; Set (abstract data type); Combinatorics; Alpha (finance); Computational complexity theory; Time complexity; Computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.00133332,0.0003274987,0.000559474,0.0002171428,0.0004008336,0.0002668965,0.002276989,0.0001547707,0.00001216227],"category_scores_gemma":[0.000208954,0.0003074507,0.00034689,0.0002803509,0.0005738918,0.001386637,0.0007354017,0.0002536484,0.00001407616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007122058,"about_ca_system_score_gemma":0.00006097837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004005074,"about_ca_topic_score_gemma":0.00005605982,"domain_scores_codex":[0.997409,0.00009298962,0.001221369,0.0002730314,0.0004118314,0.0005917033],"domain_scores_gemma":[0.9964936,0.0005454739,0.0006185464,0.001631291,0.0005682071,0.0001429006],"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.0000704914,0.0003780874,0.0006024307,0.001408098,0.000124169,1.011416e-7,0.01226978,0.0001557542,0.0000335899,0.9656797,0.002559818,0.01671798],"study_design_scores_gemma":[0.003151153,0.0005704618,0.0009345625,0.0002294438,0.00004032194,0.0000215637,0.001019707,0.5732377,0.001962719,0.321386,0.09678867,0.0006576151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04138949,0.00004385553,0.9512013,0.001082191,0.0005851557,0.001844134,0.0005742545,0.0002610885,0.003018578],"genre_scores_gemma":[0.6209964,0.00001744691,0.3772232,0.0007061666,0.00007695638,0.000287852,0.0005647229,0.00002781292,0.00009950136],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6442937,"threshold_uncertainty_score":0.9999378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05522852973585569,"score_gpt":0.2891848481189355,"score_spread":0.2339563183830798,"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."}}