{"id":"W4290040450","doi":"10.1142/s0219265921500377","title":"Optimal Broadcasting in Fully Connected Trees","year":2022,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Combinatorics; Dissemination; Graph; Binary logarithm; Discrete mathematics; Mathematics; Computer network; Telecommunications","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.002071336,0.0002036803,0.0004459546,0.0006760412,0.0002971642,0.0002086551,0.0009421999,0.00008770253,0.0002494605],"category_scores_gemma":[0.0001413553,0.0001954443,0.000274492,0.001122982,0.00002653684,0.0007929087,0.0003319882,0.001136757,0.000004132923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004192737,"about_ca_system_score_gemma":0.00009001556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004544353,"about_ca_topic_score_gemma":0.00010255,"domain_scores_codex":[0.9970065,0.0006135015,0.001232121,0.0003027348,0.0004405056,0.0004046517],"domain_scores_gemma":[0.9980237,0.0003843792,0.0008824795,0.0002882991,0.0003015795,0.0001195313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001601242,0.0001429528,0.001187601,0.000004903079,0.00006383778,0.0002064904,0.001024866,0.9752521,0.0002910453,0.003370259,0.006537678,0.01175814],"study_design_scores_gemma":[0.001291494,0.001172294,0.001108203,0.0001226459,0.00001011727,0.00407417,0.001948942,0.9772891,0.00008574537,0.0002450632,0.01237806,0.0002742015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2835561,0.0005606445,0.706404,0.0006342162,0.007629369,0.0001399858,8.367045e-7,0.00007094542,0.001003854],"genre_scores_gemma":[0.9963882,0.00002421792,0.002075116,0.0003910875,0.0008460135,0.00001876981,0.000001064528,0.00001904984,0.0002364773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7128321,"threshold_uncertainty_score":0.7969986,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01184641524461155,"score_gpt":0.2263594755566411,"score_spread":0.2145130603120295,"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."}}