{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320024,0.0002292294,0.0004276666,0.0001104173,0.000760194,0.0001672274,0.0009778639,0.00004183402,0.000009151769],"category_scores_gemma":[0.0001328982,0.0001785862,0.0001777869,0.0004094385,0.002640153,0.0003769834,0.0004896222,0.0001796032,0.0000021534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004333028,"about_ca_system_score_gemma":0.00006797438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004011966,"about_ca_topic_score_gemma":0.0001713972,"domain_scores_codex":[0.9977929,0.0004536907,0.0005819637,0.0004837429,0.0004145875,0.0002730901],"domain_scores_gemma":[0.996932,0.001385654,0.0003919885,0.0007353412,0.000501249,0.00005378871],"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.0001091491,0.0001700346,0.0006512821,0.00005173951,0.00002311659,2.045866e-7,0.0002844551,0.007238066,0.00002285221,0.9872041,0.0002809839,0.00396406],"study_design_scores_gemma":[0.001144728,0.0000319543,0.0496028,0.00002013303,0.00001161896,0.00000845122,0.00001918767,0.4322579,0.00008100938,0.5164871,0.000211565,0.0001235956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05153957,0.0005333859,0.9414292,0.002992049,0.0002147313,0.001185273,0.0001343889,0.0001716521,0.001799774],"genre_scores_gemma":[0.8259996,0.000005043893,0.1735557,0.00007353041,0.00007634248,0.00007424429,0.0001763966,0.00001004945,0.00002911255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.77446,"threshold_uncertainty_score":0.9727752,"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."}}