{"id":"W2995422874","doi":"10.1142/s0219265919500063","title":"Approximation Algorithm for the Broadcast Time in <i>k</i>-Path Graph","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Time complexity; Graph; Path (computing); Broadcasting (networking); Tree (set theory); Algorithm; Approximation algorithm; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; 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.001897217,0.0001637193,0.0003291722,0.0002771125,0.0001025139,0.0002421454,0.0006714594,0.0001327933,0.00004599656],"category_scores_gemma":[0.00004369659,0.0001109127,0.0003060821,0.0005375578,0.00002154617,0.0008490829,0.00006488163,0.0004261746,0.00002491724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001217719,"about_ca_system_score_gemma":0.00003770414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001580954,"about_ca_topic_score_gemma":0.00001335625,"domain_scores_codex":[0.9982607,0.0001631654,0.0008293206,0.0002227416,0.0002451356,0.0002789822],"domain_scores_gemma":[0.9980035,0.0005969144,0.0006374831,0.0003166828,0.0003847668,0.00006069644],"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.0001878043,0.0002430888,0.0006406716,0.00003836288,0.0002689412,0.00001536867,0.001483857,0.3005802,0.000564239,0.00914678,0.03340192,0.6534287],"study_design_scores_gemma":[0.0008586083,0.0004125092,0.0001848426,0.0001835025,0.00001025546,0.0003515487,0.0002120665,0.9876698,0.00007428192,0.0008431754,0.009066162,0.0001332568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005771052,0.0005533707,0.9859268,0.0005585531,0.006276036,0.0004376115,8.030205e-7,0.00003087658,0.0004448729],"genre_scores_gemma":[0.9821854,0.0001942472,0.01402797,0.0007011869,0.001822683,0.00003967721,0.000002011782,0.00002790642,0.0009989496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9764143,"threshold_uncertainty_score":0.4522889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007086389217122757,"score_gpt":0.2160067141272689,"score_spread":0.2089203249101462,"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."}}