{"id":"W2963225498","doi":"10.4230/lipics.itcs.2019.54","title":"On the Communication Complexity of High-Dimensional Permutations","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Integer (computer science); Communication complexity; Combinatorics; Abelian group; Discrete mathematics; Extension (predicate logic); Mathematics; Variety (cybernetics); Group (periodic table); Computational complexity theory; Computer science; Theoretical computer science; Algorithm","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.0004628639,0.0001855748,0.0002299,0.0001170739,0.0003564245,0.00005191149,0.0004522133,0.00009681458,0.0001449775],"category_scores_gemma":[0.00005409839,0.0001377939,0.0001230911,0.0001952426,0.0004263083,0.0002696744,0.00006945809,0.000218933,0.0001608593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000041832,"about_ca_system_score_gemma":0.00001383222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001946926,"about_ca_topic_score_gemma":0.00003312678,"domain_scores_codex":[0.9987513,0.0000524342,0.0006224979,0.00007433007,0.0002456341,0.0002538424],"domain_scores_gemma":[0.9986581,0.0002547177,0.0001605223,0.000649036,0.000218658,0.00005898282],"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.0001013229,0.0001596096,0.000286551,0.0003192009,0.000250436,2.432448e-7,0.01070949,0.002553829,0.0002833393,0.9707324,0.01359706,0.001006507],"study_design_scores_gemma":[0.006648645,0.001212953,0.009905057,0.001232771,0.0002132805,0.00008906255,0.009446153,0.5976141,0.02659354,0.3074207,0.03793089,0.001692808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9790958,0.00002548145,0.009068904,0.0002185401,0.0005380753,0.0006521766,0.0005665104,0.0001518456,0.009682625],"genre_scores_gemma":[0.9981754,0.000004433959,0.001059662,0.0002478437,0.00005408246,0.0000662344,0.0003029252,0.00002517773,0.00006417122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6633117,"threshold_uncertainty_score":0.5619074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0224591938585931,"score_gpt":0.2326522112510473,"score_spread":0.2101930173924542,"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."}}