{"id":"W4390897584","doi":"10.4230/lipics.itcs.2024.53","title":"New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; National Science Foundation","keywords":"Communication complexity; Alice and Bob; Upper and lower bounds; Computer science; Alice (programming language); Function (biology); Merlin (protein); Discrete mathematics; Combinatorics; Mathematics; Theoretical computer science","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.008229713,0.00238221,0.001980129,0.002768665,0.003323701,0.00659237,0.005653032,0.00356824,0.01404654],"category_scores_gemma":[0.05074919,0.001158947,0.003764239,0.002680084,0.006961728,0.02734944,0.009610764,0.01376513,0.002127429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006662418,"about_ca_system_score_gemma":0.003568715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00211283,"about_ca_topic_score_gemma":0.002336205,"domain_scores_codex":[0.9866916,0.003851267,0.0006459936,0.002520387,0.004244126,0.002046562],"domain_scores_gemma":[0.908503,0.07250209,0.002873305,0.01048881,0.003709467,0.00192339],"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.0002248888,0.0001513569,0.001100184,0.0003698784,0.00006224579,0.0001677981,0.0005231778,0.03037022,0.002431508,0.9364274,0.004805152,0.02336627],"study_design_scores_gemma":[0.00002718139,0.00005077338,0.0002008635,0.00006880128,0.00003747048,0.00007636997,0.00006149394,0.1135331,0.002034159,0.8802975,0.003579174,0.00003307689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05400632,0.002304214,0.8755531,0.00867646,0.0004132498,0.0003071009,0.000880435,0.00183328,0.05602581],"genre_scores_gemma":[0.7861781,0.001709277,0.1863002,0.002652708,0.001253283,0.001009786,0.001528797,0.001513768,0.01785409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01404654,"threshold_uncertainty_score":0.04833943,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03856684793016905,"score_gpt":0.1916367760298901,"score_spread":0.1530699280997211,"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."}}