{"id":"W1978258815","doi":"10.1002/dac.684","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Mathematical optimization; Path (computing); Average path length; Convergence (economics); Routing (electronic design automation); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"}],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009556531,0.0006432373,0.0008700216,0.0007249892,0.0004789088,0.0009321443,0.001618644,0.001308733,0.001422742],"category_scores_gemma":[0.002895276,0.0003545124,0.0005115043,0.0009647309,0.000861414,0.001458515,0.001581233,0.001225615,0.0004832324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005803704,"about_ca_system_score_gemma":0.001197942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00315745,"about_ca_topic_score_gemma":0.002288473,"domain_scores_codex":[0.9994397,0.000158546,0.00002943931,0.0001140275,0.0002015795,0.00005668253],"domain_scores_gemma":[0.9993266,0.0003204353,0.00008598611,0.00007800253,0.0001407714,0.00004811888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000129649,0.00004318442,0.000454473,0.00007740388,0.00005603107,0.0000716058,0.00009612145,0.7551075,0.005662392,0.02380883,0.003448136,0.2110447],"study_design_scores_gemma":[0.0000147386,0.0000249355,0.00003581423,0.000002883329,0.000003582282,0.00001843646,0.000005211886,0.9938698,0.0004174968,0.004641321,0.0009619869,0.00000392887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006048582,0.0001176824,0.9928088,0.00009074608,0.00003502418,0.00002920614,0.00002175315,0.0003270785,0.0005210947],"genre_scores_gemma":[0.2304986,0.0003133701,0.7658866,0.00017884,0.00009290145,0.0002321742,0.0002199291,0.0001296439,0.002447947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00315745,"threshold_uncertainty_score":0.006278098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02630559418688871,"score_gpt":0.273776655301145,"score_spread":0.2474710611142563,"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."}}