{"id":"W4230024666","doi":"10.1002/net.20270","title":"A linear algorithm for finding the <i>k</i>‐broadcast center of a tree","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Vertex (graph theory); Computer science; Graph; Algorithm; Dissemination; Prim's algorithm; Unit disk graph; Tree (set theory); Combinatorics; Mathematics; Theoretical computer science; Shortest-path tree; Telecommunications","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.0003106373,0.0001080373,0.0001781633,0.00003836391,0.000233516,0.00003210573,0.0005428963,0.00007887377,0.000008159379],"category_scores_gemma":[0.000009646998,0.00007263462,0.0001573197,0.0002506865,0.00004909012,0.0001285078,0.0000955093,0.0001364632,0.000005195552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000178805,"about_ca_system_score_gemma":0.00002038651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001341116,"about_ca_topic_score_gemma":0.00001056807,"domain_scores_codex":[0.9990174,0.00005875928,0.0002841051,0.0002173483,0.0001454053,0.0002770057],"domain_scores_gemma":[0.9991488,0.0001938679,0.0001312212,0.0003808158,0.0001020991,0.00004319024],"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.00003688765,0.0002083761,0.001475931,0.0000247735,0.0001529578,0.00002614328,0.002998462,0.03631859,0.0000411344,0.01052514,0.1750467,0.773145],"study_design_scores_gemma":[0.0003721947,0.00008569351,0.0001294245,0.00003345447,0.000003065286,0.00008962665,0.00002004841,0.9460561,0.00004828408,0.00005582562,0.0530234,0.00008291999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009888901,0.0002638996,0.9948317,0.0001966205,0.001502841,0.0002577455,0.000002911788,0.00005295063,0.001902488],"genre_scores_gemma":[0.9591985,0.00008113328,0.03621729,0.0006551089,0.001886982,0.00007941379,0.000004967741,0.00001939944,0.001857163],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9586143,"threshold_uncertainty_score":0.2961954,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03035313355142223,"score_gpt":0.2480676424642185,"score_spread":0.2177145089127963,"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."}}