{"id":"W2610939548","doi":"","title":"Communication Complexity of Set-Disjointness for All Probabilities.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Characterization (materials science); Mathematics; Class (philosophy); Bounded function; Complexity class; Set (abstract data type); Upper and lower bounds; Discrete mathematics; Simple (philosophy); Combinatorics; Structural complexity theory; Computational complexity theory; Time complexity; 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.005460844,0.001245338,0.001585721,0.001281647,0.001775519,0.004641608,0.0040636,0.002885198,0.006622441],"category_scores_gemma":[0.04425173,0.0007342148,0.002429689,0.00159882,0.005092558,0.01409753,0.005474818,0.008940887,0.0006198206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005107096,"about_ca_system_score_gemma":0.002169363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433467,"about_ca_topic_score_gemma":0.0008622524,"domain_scores_codex":[0.9903583,0.003666218,0.0003611025,0.00197821,0.002190852,0.001445316],"domain_scores_gemma":[0.9045138,0.08013954,0.00525339,0.006732161,0.001558727,0.001802433],"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.0003690036,0.0001634725,0.001915689,0.0002438778,0.0001294783,0.0001768569,0.0005356801,0.1086502,0.002478076,0.8696096,0.003180254,0.01254778],"study_design_scores_gemma":[0.00005709489,0.00005493161,0.0004443869,0.00002097093,0.00003856144,0.0001052312,0.00006667282,0.289003,0.001561414,0.7073177,0.00130443,0.00002565397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.34937,0.001090958,0.617035,0.008117673,0.0001544058,0.0003255655,0.001227312,0.0005113894,0.02216768],"genre_scores_gemma":[0.9574519,0.0004794455,0.03568854,0.0006267219,0.0002790533,0.0004217374,0.0004859557,0.0001600111,0.004406597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006622441,"threshold_uncertainty_score":0.03705472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05825951324735681,"score_gpt":0.3010568026989903,"score_spread":0.2427972894516335,"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."}}