{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684999,0.0001205432,0.0001197315,0.00004188717,0.0003328621,0.0002858905,0.0005060719,0.00006675746,0.00004036902],"category_scores_gemma":[0.00002772252,0.0001117679,0.00003718732,0.0003627681,0.00004704927,0.000329833,0.0006974339,0.0002277237,0.000007623331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002316567,"about_ca_system_score_gemma":0.00001775607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003310278,"about_ca_topic_score_gemma":0.00002355208,"domain_scores_codex":[0.9991191,0.00006305234,0.0001680137,0.0002685098,0.00008422016,0.000297116],"domain_scores_gemma":[0.9991216,0.0001184233,0.00005405483,0.0005369085,0.00007233773,0.00009665941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009331713,0.00003076263,0.002833134,0.000001788794,0.00001295914,0.000007183608,0.0002734536,0.0004943299,0.0001547433,0.01779786,0.002352283,0.9760322],"study_design_scores_gemma":[0.0002570931,0.00004761769,0.002091453,0.00002790398,0.000002883389,0.00002995432,0.000008290016,0.9418921,0.000009258606,0.0003245335,0.05514552,0.0001633191],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01653571,0.002995912,0.9647681,0.001231022,0.0005343204,0.0001350551,1.253466e-7,0.0002111485,0.0135886],"genre_scores_gemma":[0.9865625,0.001877849,0.009187267,0.001152485,0.0002404689,0.00001278099,0.00000169523,0.00001019269,0.0009547523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9758689,"threshold_uncertainty_score":0.4557764,"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."}}