{"id":"W2787163834","doi":"10.1137/17m1136869","title":"Structure of Protocols for XOR Functions","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Boolean function; Combinatorics; Mathematics; Parity (physics); Function (biology); Discrete mathematics; Communication complexity; Binary entropy function; Reduction (mathematics); Entropy (arrow of time); Time complexity; Parity function; Computational complexity theory; Algorithm; Boolean expression; Physics; Principle of maximum entropy; Biology; Genetics; Statistics","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.002316997,0.0007434198,0.00107658,0.001496482,0.002252049,0.004731822,0.002190665,0.002552325,0.01096439],"category_scores_gemma":[0.01114474,0.001044895,0.001386906,0.001495316,0.003119675,0.01004496,0.005525108,0.004575523,0.002175184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002692099,"about_ca_system_score_gemma":0.002137491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005648438,"about_ca_topic_score_gemma":0.0005726489,"domain_scores_codex":[0.9961464,0.001035072,0.0002704077,0.0008053989,0.001138898,0.0006037831],"domain_scores_gemma":[0.9892673,0.005868522,0.001118896,0.002201718,0.0009947405,0.0005487779],"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.000065623,0.00003207969,0.0001449805,0.00004119079,0.000009520862,0.00006484753,0.0001865308,0.004054985,0.0009863239,0.9885098,0.0009802985,0.004923836],"study_design_scores_gemma":[0.00003022542,0.00002778914,0.00008041208,0.00001649528,0.00001262409,0.00005222518,0.00003469134,0.02872266,0.001218112,0.9672624,0.002527675,0.00001472677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1574094,0.0005844047,0.77714,0.003975159,0.0002217515,0.0005157467,0.001293269,0.001246886,0.0576134],"genre_scores_gemma":[0.8605996,0.000683459,0.1041467,0.000833749,0.0003030383,0.00112051,0.001334264,0.0004060496,0.03057256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01096439,"threshold_uncertainty_score":0.03667957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0393946758735956,"score_gpt":0.3277555133152117,"score_spread":0.2883608374416161,"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."}}