{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884002,0.000111954,0.0002150153,0.0002086768,0.00003486062,0.00009134576,0.0005435509,0.00006453912,0.000001142775],"category_scores_gemma":[0.00004437732,0.0001121876,0.00008020408,0.0000967956,0.00001985113,0.0002121217,0.00004691577,0.0002537453,8.248309e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003018861,"about_ca_system_score_gemma":0.00006199635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001507026,"about_ca_topic_score_gemma":0.00004736938,"domain_scores_codex":[0.9989586,0.00004635833,0.0005685829,0.0000672104,0.0002292019,0.0001300116],"domain_scores_gemma":[0.998934,0.000217451,0.0002727023,0.0001835045,0.0003398921,0.000052402],"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.00001699266,0.00001821931,0.00004651256,3.296056e-8,0.00008411611,0.000007498493,0.0003639414,0.9885972,0.00009805059,0.002392777,0.0001419478,0.008232752],"study_design_scores_gemma":[0.0007728272,0.00006143178,0.0003113198,0.001033759,0.00001256898,0.0001106182,0.0006018739,0.9950489,0.0001020427,0.001512786,0.0003219334,0.0001099616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004859913,0.00197641,0.9920548,0.0001187249,0.0005320064,0.000162469,0.000003868583,0.00006713632,0.0002247311],"genre_scores_gemma":[0.983815,0.0001670589,0.01558596,0.00002429145,0.0003574638,0.00001094381,0.000008053281,0.00002314214,0.000008141637],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.978955,"threshold_uncertainty_score":0.4574876,"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."}}