{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002681946,0.0001568727,0.0002248047,0.00005983035,0.0001262033,0.0001168524,0.0005144348,0.00006237877,0.00002037812],"category_scores_gemma":[0.00002055869,0.00009074739,0.00009838128,0.0001394273,0.00003688683,0.00006161381,0.0001025004,0.00003534422,0.000109387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000340659,"about_ca_system_score_gemma":0.00001689236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001342995,"about_ca_topic_score_gemma":0.000002943451,"domain_scores_codex":[0.9988449,0.00001034574,0.0003415129,0.0002940234,0.0002097523,0.0002994417],"domain_scores_gemma":[0.9988914,0.0003146245,0.0001457712,0.0005095945,0.00006262857,0.00007599034],"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.000009863758,0.00006510971,0.000002494133,0.00006131113,0.00003271403,8.091232e-7,0.001179161,0.0001170286,0.008522505,0.9702623,0.0018746,0.01787207],"study_design_scores_gemma":[0.001591945,0.0001420023,0.0000238872,0.0002569694,0.0000341568,0.0000127686,0.0004510169,0.8831646,0.01398484,0.08218071,0.01757122,0.0005858602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01376321,0.00003308187,0.9763899,0.0004515041,0.0003454789,0.000436633,0.000007203968,0.0001804123,0.008392542],"genre_scores_gemma":[0.911438,0.000004058163,0.08743119,0.0001071264,0.0001564155,0.0001834757,0.000001423355,0.00002016284,0.0006581424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8976748,"threshold_uncertainty_score":0.3700571,"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."}}