{"id":"W2169134333","doi":"10.1109/icpads.2010.110","title":"Broadcasting Algorithm Via Shortest Paths","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Heuristic; Broadcasting (networking); Null-move heuristic; Node (physics); Algorithm; Tree (set theory); Consistent heuristic; Shortest path problem; Time complexity; Path (computing); Theoretical computer science; Distributed computing; Computer network; Mathematics; Search algorithm; Incremental heuristic search; Artificial intelligence","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.0002701016,0.00007887035,0.00008738563,0.00004101359,0.0001106876,0.0001767729,0.0003984793,0.00005769965,0.0001278521],"category_scores_gemma":[0.00001441789,0.00006311676,0.00004622783,0.0001623562,0.00001357952,0.0002678195,0.0001046125,0.0001845599,0.0001805882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006739,"about_ca_system_score_gemma":0.00001430113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001057904,"about_ca_topic_score_gemma":0.00008274008,"domain_scores_codex":[0.9992526,0.00001905919,0.0001701905,0.0002297948,0.000130215,0.0001981448],"domain_scores_gemma":[0.9994136,0.00005482752,0.00003867311,0.0003443482,0.00007478812,0.00007377147],"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":[2.830601e-7,0.00002789018,0.0004877395,0.000001777137,0.000007151619,0.0000180436,0.0002188932,0.00004115477,0.004148565,0.03845664,0.003954964,0.9526369],"study_design_scores_gemma":[0.00006631507,0.00002860476,0.0003128908,0.000004729145,7.931331e-7,0.0001631368,0.00001486127,0.9739252,0.0007414218,0.0006846315,0.02394051,0.0001169106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003435129,0.000007786294,0.9618179,0.0001813039,0.003252844,0.00005785246,2.423597e-7,0.000233174,0.03101378],"genre_scores_gemma":[0.8927618,4.857199e-7,0.1043761,0.0002959851,0.0005598309,0.000006619041,5.393313e-7,0.000005575077,0.0019931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.973884,"threshold_uncertainty_score":0.2573827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008425689884388299,"score_gpt":0.2190567878399945,"score_spread":0.2106310979556062,"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."}}