{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438098,0.001177637,0.002047893,0.003009289,0.001861072,0.002536265,0.002550341,0.001883309,0.01190234],"category_scores_gemma":[0.01695005,0.0009537062,0.0008169338,0.005267656,0.00291066,0.00467297,0.0024683,0.002217126,0.0009083386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002905407,"about_ca_system_score_gemma":0.001321931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006908836,"about_ca_topic_score_gemma":0.006723995,"domain_scores_codex":[0.9991401,0.0003471935,0.00003071579,0.0001123211,0.0001896009,0.0001800195],"domain_scores_gemma":[0.9817429,0.01463108,0.001170893,0.0006536633,0.001037631,0.0007638947],"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.0004995351,0.0001465713,0.001532546,0.0007242409,0.00008852935,0.0002912974,0.0008194649,0.1277523,0.002800185,0.7798151,0.033595,0.05193517],"study_design_scores_gemma":[0.0001081301,0.0000768757,0.000702604,0.0001443866,0.00008588103,0.0001873908,0.000267571,0.1854379,0.0006417789,0.8048251,0.007483989,0.00003843611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4219412,0.01795612,0.3569123,0.01404625,0.001750183,0.0002669661,0.001443005,0.0007005624,0.1849834],"genre_scores_gemma":[0.8798357,0.01917065,0.03451399,0.001663232,0.002443158,0.00035129,0.001108809,0.0004989873,0.06041416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01190234,"threshold_uncertainty_score":0.03981727,"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."}}