{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001751417,0.0003963621,0.0004941224,0.001138783,0.0002124775,0.0005537704,0.001818022,0.0003213288,0.000002574831],"category_scores_gemma":[0.0001449187,0.0003712969,0.000161756,0.0009219103,0.000167942,0.0005330291,0.0005540915,0.0005494302,0.0000129499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002535433,"about_ca_system_score_gemma":0.0002589329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005246553,"about_ca_topic_score_gemma":0.0002488528,"domain_scores_codex":[0.9967537,0.00003441817,0.0007051423,0.001353231,0.0004930762,0.0006604563],"domain_scores_gemma":[0.9978567,0.0006679019,0.0003413001,0.0008003432,0.0002424894,0.00009123631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001250527,0.00002710961,0.00005125366,0.0001751219,0.00001273236,0.00003308598,0.001743576,0.07286763,0.000313885,0.1338468,0.00006484861,0.7908514],"study_design_scores_gemma":[0.00026293,0.0001224133,0.00002732002,0.0004936004,0.000002069066,0.00002195491,4.075837e-7,0.8589591,0.0001497877,0.139322,0.0002787074,0.0003597603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007749048,0.00009130914,0.9930726,0.0002584925,0.004385639,0.0008480868,0.000004335545,0.0002228959,0.001039109],"genre_scores_gemma":[0.3834131,0.00004127856,0.6111177,0.001266117,0.00169185,0.0002250684,0.00002556563,0.0001349138,0.002084436],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7904916,"threshold_uncertainty_score":0.9998739,"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."}}