{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331444,0.0001128447,0.0001759637,0.0001600549,0.0005521851,0.0001579527,0.0007030151,0.00004435701,0.000025889],"category_scores_gemma":[0.00008294788,0.0000938976,0.0001360121,0.0003464056,0.00008124538,0.0001707968,0.0001315476,0.0002508145,0.000005918508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002563016,"about_ca_system_score_gemma":0.0000826426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001027376,"about_ca_topic_score_gemma":0.000001715442,"domain_scores_codex":[0.9988948,0.00005242858,0.0003413529,0.0002002696,0.0002539523,0.000257164],"domain_scores_gemma":[0.9988117,0.00018644,0.000290082,0.0002814259,0.0003435573,0.00008682823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001298837,0.0003413037,0.0007957769,0.0001262318,0.0001610714,0.00001441946,0.00190116,0.002459063,0.01023876,0.2119216,0.01267798,0.7592328],"study_design_scores_gemma":[0.003502654,0.006471359,0.006191139,0.001136818,0.00002586188,0.0009185168,0.0001571404,0.6265953,0.04143174,0.2076504,0.1051066,0.0008124842],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01727757,0.00001115663,0.97908,0.0003944012,0.001131339,0.001494282,0.000006594305,0.00005592379,0.0005486991],"genre_scores_gemma":[0.757471,3.059781e-7,0.2406986,0.0002567717,0.001491917,0.00001925319,6.423082e-7,0.000009319018,0.00005218533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7584203,"threshold_uncertainty_score":0.4247017,"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."}}