{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005540765,0.0005035731,0.0007454836,0.001134385,0.001100238,0.0008542181,0.001382486,0.0008606079,0.00869356],"category_scores_gemma":[0.002621511,0.0003460142,0.0004275275,0.001406638,0.0005566821,0.001310772,0.001045191,0.000804181,0.001948616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000955588,"about_ca_system_score_gemma":0.001406381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002523485,"about_ca_topic_score_gemma":0.002338118,"domain_scores_codex":[0.9992883,0.0002242529,0.0000334507,0.000118985,0.0002335629,0.0001015033],"domain_scores_gemma":[0.9991955,0.0003973054,0.0000549942,0.0001741254,0.0001262895,0.00005175088],"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.0003639811,0.000157186,0.000553978,0.0003871124,0.00009231768,0.0001557768,0.0004242185,0.2684971,0.01170002,0.1711369,0.0241205,0.5224109],"study_design_scores_gemma":[0.0002738758,0.0001538511,0.0002090689,0.00005902764,0.00005967596,0.0002494001,0.0001437626,0.8169085,0.008669265,0.1328278,0.04040462,0.00004126354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01339736,0.0003876073,0.973186,0.0003101018,0.000109018,0.0002117968,0.0002498651,0.001593833,0.01055445],"genre_scores_gemma":[0.1906005,0.0005681568,0.7999436,0.0001457151,0.00008738231,0.0003737525,0.0008534283,0.0002853898,0.00714218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00869356,"threshold_uncertainty_score":0.02908283,"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."}}