{"id":"W4389478371","doi":"10.1007/978-3-031-49614-1_7","title":"Improved Approximation for Broadcasting in k-Path Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Network topology; Heuristic; Node (physics); Path (computing); Scope (computer science); Time complexity; Computer network; Theoretical computer science; Distributed computing; Topology (electrical circuits); Algorithm; Mathematics; Combinatorics","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.002493105,0.002642946,0.0034333,0.002166436,0.001832462,0.003423015,0.007645896,0.002746947,0.02202811],"category_scores_gemma":[0.01409319,0.001160717,0.002300333,0.005551417,0.002098386,0.008352772,0.004673996,0.005487606,0.004372716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007192671,"about_ca_system_score_gemma":0.004452227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01212955,"about_ca_topic_score_gemma":0.01837331,"domain_scores_codex":[0.9970181,0.0006870847,0.0001204542,0.0005325355,0.0009355676,0.0007063153],"domain_scores_gemma":[0.9890714,0.006530557,0.0003778016,0.002796361,0.0007084247,0.0005155216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002867564,0.001013073,0.001619085,0.001338665,0.000262378,0.0002840917,0.0007234947,0.4069905,0.0104455,0.1398989,0.07820868,0.3563481],"study_design_scores_gemma":[0.0002596449,0.0001585382,0.0004848674,0.00008279573,0.0001395354,0.0001871258,0.0001425249,0.8585339,0.002587979,0.1299291,0.007458903,0.00003509521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09821414,0.004148731,0.8296281,0.003747663,0.0009914244,0.0005034682,0.002128027,0.008519808,0.05211864],"genre_scores_gemma":[0.4133804,0.00247587,0.5395691,0.001052201,0.0008393859,0.0007607898,0.003696452,0.001947384,0.03627842],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02202811,"threshold_uncertainty_score":0.07369137,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02555346809668129,"score_gpt":0.2476210108354498,"score_spread":0.2220675427387685,"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."}}