{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191443,0.00006417456,0.0001000676,0.00008648734,0.00003873822,0.0001071959,0.000268975,0.0000353883,0.000035009],"category_scores_gemma":[0.00002647087,0.00005311398,0.00002887331,0.0003329574,0.000004654913,0.0002325635,0.00002532305,0.00006986854,0.00003931913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002154586,"about_ca_system_score_gemma":0.00001268371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000694827,"about_ca_topic_score_gemma":0.0002121431,"domain_scores_codex":[0.9993124,0.00004324041,0.0001910804,0.0001860853,0.00008789429,0.0001793235],"domain_scores_gemma":[0.9996579,0.00005176783,0.00003317694,0.0001869983,0.00003590799,0.00003423871],"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.00001130542,0.0001216035,0.002962923,0.000004350741,0.000008154899,0.0000818362,0.001691151,0.003774268,0.003420946,0.7051752,0.009556651,0.2731917],"study_design_scores_gemma":[0.000570767,0.000231941,0.02911753,0.00006049481,7.916491e-7,0.00008023169,0.0001389857,0.9580516,0.0006952379,0.004291088,0.006507584,0.0002537646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1416409,0.00007560888,0.736892,0.001899033,0.0006628596,0.0001267146,1.232026e-7,0.0003558398,0.118347],"genre_scores_gemma":[0.9945913,0.000001120192,0.003512451,0.0006786575,0.0000842555,0.000001883018,2.623111e-7,0.000001701061,0.001128359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9542773,"threshold_uncertainty_score":0.2165925,"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."}}