{"id":"W2532807735","doi":"10.1016/j.dam.2016.09.029","title":"Efficient broadcast trees for weighted vertices","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Broadcasting (networking); Dissemination; Mathematics; Node (physics); Binary logarithm; Computer science; Set (abstract data type); Time complexity; Combinatorics; Theoretical computer science; Computer network; Graph","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.0005986519,0.0006403137,0.001181706,0.0008903939,0.0008670469,0.001837414,0.001501117,0.0008500224,0.006926272],"category_scores_gemma":[0.005031041,0.0005557699,0.0005880576,0.001832946,0.0005904625,0.002503485,0.001575384,0.001515445,0.001378446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001383099,"about_ca_system_score_gemma":0.001360093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002484625,"about_ca_topic_score_gemma":0.006765312,"domain_scores_codex":[0.9993248,0.0001352102,0.00003781313,0.0001182546,0.0002168372,0.0001672217],"domain_scores_gemma":[0.9977996,0.001124634,0.0001554428,0.0004637404,0.0003217909,0.0001347832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001057366,0.0003090265,0.0009473754,0.0007302073,0.0001262874,0.0002500858,0.0005105931,0.2856355,0.02890609,0.3263353,0.02798459,0.3272076],"study_design_scores_gemma":[0.0001400717,0.0001084775,0.0003002996,0.00005570699,0.00007733663,0.00009869503,0.0001417236,0.6254568,0.007313912,0.3581156,0.008171255,0.00002012496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09766738,0.0005557669,0.8856447,0.0006600006,0.0001475523,0.0002359882,0.001033277,0.001164535,0.0128908],"genre_scores_gemma":[0.583887,0.0009325598,0.3851337,0.0002596339,0.0001465325,0.0004100085,0.001966197,0.0005960377,0.02666829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006926272,"threshold_uncertainty_score":0.02317065,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01563057842627664,"score_gpt":0.2396631979087195,"score_spread":0.2240326194824429,"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."}}