{"id":"W1663218918","doi":"10.1145/2698587","title":"Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Alice and Bob; Hamming distance; Communication complexity; Bounding overwatch; Upper and lower bounds; Mathematics; Quantum information science; Quantum; Discrete mathematics; Combinatorics; Computer science; Quantum entanglement; Quantum mechanics; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.0009338497,0.000165979,0.0001775916,0.0001137583,0.0004175318,0.0001242111,0.0008191528,0.00004978961,0.00000473131],"category_scores_gemma":[0.0001002352,0.0001252612,0.00006246955,0.0003242391,0.0004314297,0.000131252,0.0000403482,0.0002906721,0.00001112608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003539431,"about_ca_system_score_gemma":0.00006609286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329411,"about_ca_topic_score_gemma":0.000007894706,"domain_scores_codex":[0.9984652,0.0004647767,0.0003021208,0.0002941532,0.0003015385,0.0001722319],"domain_scores_gemma":[0.9973561,0.001361505,0.0001834186,0.0008627623,0.0001509078,0.00008530149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000126492,0.0004554251,0.00001018068,0.00004669336,0.00005969231,0.000003548547,0.007182064,0.2398942,0.00005855563,0.5465094,0.0001436114,0.2055101],"study_design_scores_gemma":[0.0002907936,0.0003224803,0.0002366726,0.00007817704,0.000008823664,0.00001440997,0.0001174899,0.5691168,0.0001289532,0.4292701,0.0002952512,0.0001200799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05770386,0.00008686473,0.9390102,0.002324783,0.0002666056,0.0002223642,0.000008267129,0.0001229998,0.000254071],"genre_scores_gemma":[0.9730549,0.000006587774,0.02650168,0.0003398286,0.00001538772,0.00001628866,0.000003477071,0.0000119844,0.00004986479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.915351,"threshold_uncertainty_score":0.5108002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04861793686885723,"score_gpt":0.2731714325194876,"score_spread":0.2245534956506303,"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."}}