{"id":"W1972068724","doi":"10.1007/s00037-007-0220-2","title":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","year":2006,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Washington; National Science Foundation","keywords":"Corollary; Communication complexity; Upper and lower bounds; Mathematics; Product (mathematics); Direct product; Combinatorics; Function (biology); Discrete mathematics; Simple (philosophy); Computer science","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.01001425,0.001396263,0.002277565,0.001529192,0.002094837,0.005391201,0.004122844,0.002306054,0.008307949],"category_scores_gemma":[0.05271873,0.001323273,0.003535033,0.001683635,0.01026433,0.01824042,0.01057222,0.01054657,0.001476572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003730021,"about_ca_system_score_gemma":0.002269021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006602061,"about_ca_topic_score_gemma":0.0004291479,"domain_scores_codex":[0.9864928,0.005180871,0.0006247348,0.002863946,0.003401206,0.001436488],"domain_scores_gemma":[0.8648338,0.1092041,0.005007198,0.01613224,0.002984936,0.001837762],"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.0003167179,0.000152921,0.0009514508,0.0002440642,0.00007125251,0.0001602714,0.0004764257,0.03864212,0.003664557,0.9349495,0.002388336,0.01798245],"study_design_scores_gemma":[0.0000835664,0.0001081465,0.0004107888,0.00004891601,0.00005405686,0.0002576585,0.00005747467,0.1780438,0.006660986,0.8109513,0.003274821,0.00004859083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0676839,0.0005575976,0.9037819,0.003096901,0.0001024344,0.0001845959,0.0002218202,0.0003527535,0.02401817],"genre_scores_gemma":[0.8590695,0.0006927602,0.127554,0.0009236808,0.000367737,0.001166553,0.0003534171,0.0004055068,0.009466883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001425,"threshold_uncertainty_score":0.05296105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0649624365213801,"score_gpt":0.2936631913235376,"score_spread":0.2287007548021575,"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."}}