{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005638602,0.0007139416,0.001111781,0.0009466305,0.0009563951,0.0009612902,0.001828678,0.001162252,0.004023726],"category_scores_gemma":[0.00201856,0.0003917831,0.0006326176,0.00146088,0.0003044855,0.001546031,0.001494139,0.0009002516,0.001434283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000578493,"about_ca_system_score_gemma":0.002106961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001453834,"about_ca_topic_score_gemma":0.001797235,"domain_scores_codex":[0.9993399,0.0001460891,0.00004790917,0.0001346331,0.0002539042,0.00007757537],"domain_scores_gemma":[0.9993603,0.0002051179,0.0000453374,0.0001015891,0.0002389714,0.00004864197],"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.0002778,0.000198483,0.001064059,0.0002790517,0.0001279047,0.0002307263,0.0001541261,0.4063095,0.01085227,0.04672005,0.02306559,0.5107204],"study_design_scores_gemma":[0.00009459999,0.00008434369,0.0001590961,0.00001393164,0.00003107539,0.0002179038,0.00003622867,0.9592247,0.003028745,0.0227117,0.0143749,0.00002272445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007458496,0.0002628715,0.9874649,0.0002830951,0.0001199357,0.0001535428,0.0002525955,0.0009898554,0.003014734],"genre_scores_gemma":[0.1680385,0.0003869287,0.824343,0.0001522743,0.00009930433,0.0003264356,0.001127634,0.0001382126,0.005387708],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004023726,"threshold_uncertainty_score":0.0134607,"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."}}