{"id":"W2119420156","doi":"10.1109/icpads.2009.48","title":"Broadcasting in Fully Connected Trees","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Vertex (graph theory); Computer network; Graph; Node (physics); Tree (set theory); Theoretical computer science; Binary logarithm; Class (philosophy); Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence","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.0002715033,0.000196037,0.0004562948,0.000541701,0.0007862853,0.001148115,0.0006383343,0.0006489012,0.002830349],"category_scores_gemma":[0.002724276,0.0002928539,0.0003546583,0.001362398,0.0004331397,0.002072967,0.000624431,0.0004880544,0.0004420065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008050258,"about_ca_system_score_gemma":0.0006459136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002824361,"about_ca_topic_score_gemma":0.002566244,"domain_scores_codex":[0.9995468,0.0001082588,0.00002710485,0.0001078333,0.0001060785,0.0001039266],"domain_scores_gemma":[0.9985513,0.0007487288,0.0001844528,0.0001910624,0.000242094,0.00008227655],"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.0005553106,0.00009393177,0.001740271,0.001166709,0.0000988798,0.0004605401,0.0008447501,0.2308447,0.027374,0.4644642,0.02269828,0.2496584],"study_design_scores_gemma":[0.0001055616,0.0001777323,0.001276036,0.0001085834,0.00005132455,0.0006563356,0.0002381653,0.5571855,0.007206758,0.3931549,0.03980041,0.00003874565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3046932,0.00607762,0.6418549,0.001355657,0.0001794407,0.0002908402,0.002093809,0.00147557,0.04197878],"genre_scores_gemma":[0.8406411,0.002822391,0.1464029,0.0002973078,0.0001121853,0.0001829677,0.001457674,0.0001494862,0.007933971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002830349,"threshold_uncertainty_score":0.009468496,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01312952858956266,"score_gpt":0.2319182446689422,"score_spread":0.2187887160793796,"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."}}