{"id":"W2066613498","doi":"10.1002/1097-0037(200103)37:2<94::aid-net4>3.0.co;2-6","title":"Improved upper and lower bounds fork-broadcasting","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Brandon University","funders":"","keywords":"Upper and lower bounds; Vertex (graph theory); Broadcasting (networking); Graph; Combinatorics; Computer science; Mathematics; 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.004146937,0.002205177,0.002073837,0.00279192,0.002945422,0.003379033,0.005874699,0.00195718,0.02286545],"category_scores_gemma":[0.02351966,0.001046349,0.001549606,0.00342723,0.002617974,0.01214874,0.004905818,0.005103502,0.005330056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00561835,"about_ca_system_score_gemma":0.003172588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007742407,"about_ca_topic_score_gemma":0.01029949,"domain_scores_codex":[0.9949479,0.0006726399,0.0001802774,0.0009329014,0.001763826,0.001502384],"domain_scores_gemma":[0.9811558,0.01117704,0.0009072484,0.003099158,0.002697626,0.0009630793],"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.0008355877,0.0003596287,0.002398158,0.000994842,0.00008453145,0.0002826839,0.001038544,0.1057722,0.01237135,0.6739661,0.05000468,0.1518918],"study_design_scores_gemma":[0.00007866179,0.0002193826,0.001290045,0.0003129492,0.0001581192,0.0006299612,0.0004031355,0.2960461,0.01022646,0.6405958,0.04991318,0.0001261615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05965567,0.01316564,0.7615104,0.00481402,0.0009728659,0.0002890685,0.002439778,0.003545709,0.153607],"genre_scores_gemma":[0.5655164,0.01156108,0.3656707,0.001693481,0.001742681,0.000629793,0.002986281,0.002132728,0.04806688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02286545,"threshold_uncertainty_score":0.07649255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02272322714607927,"score_gpt":0.2593834600695674,"score_spread":0.2366602329234881,"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."}}