{"id":"W1947367101","doi":"10.1109/icc.2002.997248","title":"A destination-driven shortest path tree algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Shortest path problem; Yen's algorithm; K shortest path routing; Constrained Shortest Path First; Shortest Path Faster Algorithm; Multicast; Tree (set theory); Shortest-path tree; Node (physics); Algorithm; Path (computing); Dijkstra's algorithm; Mathematical optimization; Theoretical computer science; Distributed computing; Mathematics; Minimum spanning tree; Computer network; Graph; Combinatorics; Engineering","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.0001520022,0.00009833505,0.00009633262,0.0000433707,0.00009265632,0.0001033118,0.0003449728,0.0000375555,0.00007948647],"category_scores_gemma":[0.00003677073,0.00008490397,0.00004328058,0.0002777642,0.00002097971,0.0002345629,0.00002804302,0.0000731611,0.0001407654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001969429,"about_ca_system_score_gemma":0.00007611109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004049311,"about_ca_topic_score_gemma":0.00001313024,"domain_scores_codex":[0.9991441,0.00005856217,0.0001409914,0.0002624545,0.0001809913,0.0002129428],"domain_scores_gemma":[0.99938,0.0001045945,0.00003394386,0.0002975494,0.00008407902,0.00009985857],"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.322554e-7,0.00003403854,0.0003425811,2.970048e-7,0.000005378918,0.00001099622,0.00003742965,0.0002884695,0.000008905859,0.241675,0.001697072,0.7558996],"study_design_scores_gemma":[0.0004002933,0.00005730259,0.001158054,0.000005968507,0.000005284177,0.00003591666,0.00001574406,0.9759908,0.00005264861,0.002617937,0.01948686,0.0001731701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004615134,0.00006474555,0.9564803,0.0004799307,0.000250008,0.00009911138,4.101925e-7,0.0002895584,0.04187445],"genre_scores_gemma":[0.7102177,0.000006745726,0.287089,0.0005065466,0.00005345167,0.00002167064,0.000001083615,0.000005200508,0.002098679],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9757023,"threshold_uncertainty_score":0.3462284,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00873844565430657,"score_gpt":0.2067654483065396,"score_spread":0.198027002652233,"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."}}