{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006013395,0.001379045,0.00198668,0.001381169,0.001770616,0.005417663,0.003873867,0.002654161,0.006118221],"category_scores_gemma":[0.03940003,0.0008043469,0.00267588,0.001582162,0.005461429,0.01331083,0.00635508,0.00936303,0.000583549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005763544,"about_ca_system_score_gemma":0.002310385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001903094,"about_ca_topic_score_gemma":0.0009425822,"domain_scores_codex":[0.9904974,0.003541545,0.0003830694,0.001923192,0.002130169,0.001524598],"domain_scores_gemma":[0.9024466,0.08206389,0.005239782,0.006973353,0.00146238,0.001814001],"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.0005231291,0.0002079947,0.002255402,0.0002362166,0.0001416942,0.0002421434,0.0006679469,0.1791535,0.003192335,0.798717,0.002207244,0.01245548],"study_design_scores_gemma":[0.00006703153,0.00005254791,0.0003668416,0.00001748984,0.00003657052,0.00006743516,0.00006140632,0.4534473,0.001718711,0.5434777,0.0006566548,0.00003022858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4900705,0.0007065273,0.4864632,0.00649581,0.00009719648,0.0002216902,0.0008750766,0.0005589224,0.01451101],"genre_scores_gemma":[0.9672155,0.0003761904,0.0270608,0.000389385,0.0002315872,0.0003236519,0.0003410563,0.0001657045,0.003896045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006118221,"threshold_uncertainty_score":0.04181767,"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."}}