{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002186192,0.00008216797,0.0001544126,0.00005981104,0.0001240607,0.0001115569,0.0002707204,0.0000489074,0.000005854231],"category_scores_gemma":[0.00001596946,0.00007206717,0.00002937717,0.0001224863,0.00004055606,0.0003878869,0.00008614131,0.0000437443,0.000005232966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002017255,"about_ca_system_score_gemma":0.000006822726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005118908,"about_ca_topic_score_gemma":0.000001388695,"domain_scores_codex":[0.9993382,0.000008784538,0.0003404358,0.00008396627,0.0001151915,0.0001134693],"domain_scores_gemma":[0.9991638,0.0001155425,0.0002511302,0.0003707052,0.00007025161,0.00002858146],"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.00000261651,0.00003876331,0.000006302681,0.0004595724,0.00002294063,7.008958e-8,0.01388026,0.0006705431,0.001312498,0.9721498,0.0005568031,0.01089986],"study_design_scores_gemma":[0.0002032472,0.00002855337,0.000006634802,0.00008658494,0.000009308985,0.000009810159,0.0004886474,0.9864213,0.000979583,0.01094882,0.0007146088,0.0001029172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01783808,0.0001115101,0.975778,0.00004913328,0.00006046307,0.0003360033,0.000003805328,0.00003998513,0.005783048],"genre_scores_gemma":[0.8107544,0.00002540764,0.1891052,0.0000355296,0.00001438152,0.00002928197,0.000003335754,0.000004673764,0.00002783193],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9857507,"threshold_uncertainty_score":0.2938814,"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."}}