{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006547771,0.0007098791,0.0008514528,0.001195752,0.001219167,0.001726586,0.001834212,0.0008222164,0.009267134],"category_scores_gemma":[0.002611604,0.0005207014,0.0006590334,0.001549417,0.0007565161,0.001819263,0.00179339,0.0009271923,0.002803116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001904575,"about_ca_system_score_gemma":0.002829047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008220494,"about_ca_topic_score_gemma":0.01029147,"domain_scores_codex":[0.9991655,0.0001595487,0.00006113556,0.0002187639,0.0001804327,0.0002146667],"domain_scores_gemma":[0.9979305,0.001071519,0.0002651056,0.0002547804,0.0003117998,0.0001663364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001454104,0.0006072899,0.003402255,0.0009172357,0.0001151193,0.0003042428,0.000938112,0.1750457,0.03362608,0.03792698,0.04445876,0.7012041],"study_design_scores_gemma":[0.0005923594,0.0003632732,0.001343365,0.00005528634,0.0001031424,0.0004621153,0.0003857104,0.9337329,0.01438648,0.03807407,0.01043448,0.00006670834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04550492,0.0004358743,0.9367889,0.0007147138,0.0000664848,0.0004424986,0.00061412,0.004736533,0.01069605],"genre_scores_gemma":[0.2176005,0.0001704151,0.7743922,0.0001453016,0.00005006808,0.0003989429,0.001506898,0.0003666954,0.005369009],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009267134,"threshold_uncertainty_score":0.03100163,"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."}}