{"id":"W3022052004","doi":"10.4230/lipics.itcs.2021.61","title":"Communication Memento: Memoryless Communication Complexity","year":2020,"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":"University of Ottawa","funders":"","keywords":"Communication complexity; Alice and Bob; Bipartite graph; Bounded function; Logarithm; Discrete mathematics; Alice (programming language); Computer science; Models of communication; Theoretical computer science; Combinatorics; Mathematics","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":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004972382,0.000396564,0.0004768424,0.0002125779,0.0006179075,0.0003371005,0.007537463,0.000262574,0.00007559828],"category_scores_gemma":[0.00004278554,0.0005133635,0.0002984873,0.0008939733,0.0004906922,0.000582907,0.0100226,0.001217212,0.0001282564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002483384,"about_ca_system_score_gemma":0.0001693565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005785966,"about_ca_topic_score_gemma":0.0001881865,"domain_scores_codex":[0.9973139,0.0006766899,0.0003649081,0.001098425,0.0001870749,0.0003590042],"domain_scores_gemma":[0.994387,0.000218393,0.0004835421,0.004405912,0.0002710065,0.0002341127],"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.00001833848,0.0002021375,0.0002928298,0.00009096722,0.0001264806,0.00003228588,0.0008716801,0.009489773,0.000021233,0.9858711,0.001446253,0.001536874],"study_design_scores_gemma":[0.0003956999,0.00002696472,0.001078595,0.0001032129,0.00004854127,0.000002674419,0.0001161925,0.4948072,0.0001252105,0.5011969,0.00165675,0.0004420271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02640784,0.0004933395,0.9522209,0.003615497,0.0004936681,0.0007367913,0.00006219071,0.0009857791,0.01498402],"genre_scores_gemma":[0.9671906,0.0007392872,0.03117076,0.0003836526,0.00004130634,0.000003481858,0.0001835194,0.00002098089,0.0002664009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9407828,"threshold_uncertainty_score":0.9997318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1946243241498156,"score_gpt":0.229010806568975,"score_spread":0.0343864824191594,"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."}}