{"id":"W32072441","doi":"10.1007/s11060-020-03434-7","title":"Efficient Communication Using Partial Information.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Computer science; Bounded function; Protocol (science); Theoretical computer science; Computational complexity theory; Discrete mathematics; Communications protocol; Mathematics; Algorithm; Computer network","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"],"consensus_categories":[],"category_scores_codex":[0.0007258623,0.0002672683,0.0002479576,0.0003083224,0.0009686218,0.0003906684,0.001452864,0.00009777907,0.000132504],"category_scores_gemma":[0.00009043021,0.0002882085,0.0001544581,0.0009303131,0.0002856337,0.0004685748,0.0004269939,0.0008688385,0.0001494127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002121334,"about_ca_system_score_gemma":0.0006097011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008101202,"about_ca_topic_score_gemma":0.00006690399,"domain_scores_codex":[0.9975005,0.0001725643,0.0005214143,0.0003906277,0.0007858062,0.0006290684],"domain_scores_gemma":[0.9979696,0.000370075,0.0002571279,0.0008807792,0.0003643569,0.0001580602],"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.00002274821,0.0001602465,0.00004217824,0.000005565734,0.00002147601,8.227219e-7,0.0001874075,0.1241079,0.00009598219,0.8724174,0.0002728376,0.002665492],"study_design_scores_gemma":[0.0005461313,0.0001080321,0.002208561,0.00001065106,0.000005383162,0.00004116812,0.00001114402,0.8039868,0.0001433943,0.1847982,0.007869296,0.0002711749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2487932,0.00003411879,0.7452818,0.001824262,0.0007152013,0.0004321217,0.00002364302,0.0003928416,0.002502823],"genre_scores_gemma":[0.8833115,0.000001385993,0.1157303,0.0007525316,0.00009260639,0.00002486917,0.0000622786,0.000009784198,0.00001473237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6876191,"threshold_uncertainty_score":0.999957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0231787037010444,"score_gpt":0.2737260755837392,"score_spread":0.2505473718826948,"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."}}