{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00162645,0.0003960337,0.0006433728,0.0002812013,0.0005737398,0.0001493226,0.002104777,0.0001132326,0.00005564183],"category_scores_gemma":[0.0002238003,0.0004259822,0.0003460388,0.0007301868,0.0009304152,0.0003704128,0.0004744448,0.0004236093,0.00001831693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003379912,"about_ca_system_score_gemma":0.0004275998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001051918,"about_ca_topic_score_gemma":0.0002319789,"domain_scores_codex":[0.9962212,0.0005264902,0.0008517771,0.0008011122,0.000788268,0.0008111616],"domain_scores_gemma":[0.9956894,0.001692167,0.0004822678,0.001276197,0.0006980473,0.000161945],"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.0001049274,0.0004008588,0.00004623594,0.00008760615,0.00007610844,1.878447e-7,0.0003485241,0.008178433,0.00004154479,0.9858613,0.001198179,0.003656104],"study_design_scores_gemma":[0.0009640239,0.0006123992,0.002122848,0.00003087253,0.00001175618,0.000008985464,0.00001780209,0.3727143,0.0002555748,0.615657,0.007318803,0.0002855693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02819965,0.000123967,0.9617241,0.004890299,0.0003112033,0.001328431,0.0001142295,0.0003677951,0.002940301],"genre_scores_gemma":[0.8505698,0.000005883429,0.1480694,0.0007450297,0.00008193373,0.0001537161,0.0002709433,0.0000249445,0.00007828942],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8223702,"threshold_uncertainty_score":0.9998192,"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."}}