{"id":"W1998169461","doi":"10.1007/s10878-008-9160-2","title":"On broadcasting in unicyclic graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Graph; Vertex (graph theory); Combinatorics; Time complexity; Broadcasting (networking); Connectivity; Theory of computation; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Computer network","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.0004589377,0.00007765767,0.0001857865,0.0003098079,0.00008304159,0.0000507159,0.000304644,0.00006449298,0.000006820141],"category_scores_gemma":[0.0001935244,0.00006826837,0.00007599059,0.0005332605,0.00001338544,0.0004978493,0.00002627007,0.0001976909,0.000002572522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007831062,"about_ca_system_score_gemma":0.00008135652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000663515,"about_ca_topic_score_gemma":2.626891e-7,"domain_scores_codex":[0.9988607,0.0001365515,0.0004931575,0.00009732887,0.000289866,0.000122363],"domain_scores_gemma":[0.9990552,0.0001322041,0.000386939,0.0001306769,0.0002264754,0.00006849746],"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.00002905501,0.0001075741,0.0003630451,0.00000213721,0.000008736005,0.00005877323,0.0003609918,0.8340936,0.00001554249,0.1628994,0.001251207,0.0008099928],"study_design_scores_gemma":[0.002218731,0.0006280981,0.0002534419,0.0001388108,0.00000310391,0.0003558873,0.00001963631,0.9738798,0.0001039574,0.02183428,0.0004222223,0.0001420785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05148584,0.00006290989,0.9351203,0.0002504823,0.01044695,0.00008629166,9.844977e-8,0.00002399533,0.002523071],"genre_scores_gemma":[0.9861191,0.00004063374,0.0134571,0.00008990042,0.0002575666,8.911935e-7,2.643071e-7,0.000006003168,0.00002854909],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9346333,"threshold_uncertainty_score":0.2783904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01514791040988392,"score_gpt":0.2288880742478951,"score_spread":0.2137401638380112,"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."}}