{"id":"W2089762633","doi":"10.1016/s0166-218x(02)00240-8","title":"Tight bounds for synchronous communication of information using bits and silence","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Oracle; Communication complexity; Mathematics; Upper and lower bounds; Constant (computer programming); Broadcast communication network; Telecommunications network; Computational complexity theory; Discrete mathematics; Computer science; Combinatorics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008734995,0.003552376,0.004288536,0.00421185,0.003404645,0.009149347,0.004723455,0.003239158,0.01581586],"category_scores_gemma":[0.05987157,0.002052717,0.00185747,0.004524161,0.006408586,0.01636586,0.007885263,0.007924877,0.002275743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006324911,"about_ca_system_score_gemma":0.003899428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003321613,"about_ca_topic_score_gemma":0.004048727,"domain_scores_codex":[0.9923989,0.001723243,0.0003897613,0.001152594,0.002212644,0.002122835],"domain_scores_gemma":[0.889226,0.09159986,0.004016983,0.006721636,0.005178428,0.003257009],"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.001117706,0.0001796125,0.0005536375,0.0006085394,0.0001267662,0.0002365556,0.0008942698,0.1408425,0.007149698,0.8111601,0.009361755,0.02776903],"study_design_scores_gemma":[0.00008983751,0.0001534114,0.0002807734,0.0001341365,0.0001395615,0.0001310435,0.0001812401,0.3358151,0.003394795,0.6558865,0.003717289,0.0000762345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08932563,0.006449315,0.8402078,0.005404984,0.0007328648,0.0001823561,0.0008826369,0.001486045,0.05532846],"genre_scores_gemma":[0.9065535,0.004921992,0.06401938,0.0017025,0.001529982,0.0007055829,0.0006848791,0.00112709,0.01875504],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01581586,"threshold_uncertainty_score":0.05290931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02144961010618619,"score_gpt":0.2344175965759024,"score_spread":0.2129679864697162,"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."}}