{"id":"W4386792249","doi":"10.48550/arxiv.2309.06554","title":"An improved protocol for ExactlyN with more than 3 players","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação para a Ciência e a Tecnologia; Israel Science Foundation; European Commission","keywords":"Constructive; Randomness; Combinatorics; Communication complexity; Mathematics; Term (time); Computer science; Order (exchange); Protocol (science); Discrete mathematics; Field (mathematics); Point (geometry); Theoretical computer science; Pure mathematics; Statistics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006048262,0.0009651892,0.002095348,0.0008028242,0.003848839,0.003074365,0.003933665,0.003672177,0.007368759],"category_scores_gemma":[0.01583521,0.001010766,0.002602555,0.001080117,0.004457264,0.01117374,0.0167593,0.006962081,0.00266168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002980545,"about_ca_system_score_gemma":0.005478324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002199966,"about_ca_topic_score_gemma":0.002607816,"domain_scores_codex":[0.9883298,0.003529463,0.0007973184,0.002611893,0.003190761,0.001540834],"domain_scores_gemma":[0.9863193,0.007034064,0.0005466901,0.004517716,0.0009957874,0.0005863845],"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.0004008562,0.0002072447,0.0006661774,0.0003047813,0.00005161714,0.0003161333,0.001605065,0.01009636,0.01474384,0.905683,0.007530059,0.05839481],"study_design_scores_gemma":[0.0003784242,0.0003110586,0.0004658955,0.0002112957,0.0001076224,0.000834158,0.0005132905,0.1442233,0.0351272,0.7372292,0.08028824,0.0003103661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03229029,0.000413106,0.9156893,0.005219297,0.0005353304,0.000657782,0.0004593786,0.002200246,0.04253523],"genre_scores_gemma":[0.4447396,0.0005260092,0.5170152,0.003626189,0.0002528998,0.001707035,0.0009705407,0.0007181334,0.03044436],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007368759,"threshold_uncertainty_score":0.03198665,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1440938354312595,"score_gpt":0.2510016155646354,"score_spread":0.1069077801333759,"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."}}