{"id":"W2510377198","doi":"","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"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; Path (computing); Mathematical optimization; Average path length; Routing (electronic design automation); Convergence (economics); 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":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147225,0.0001127569,0.0002740853,0.0003822544,0.0001137183,0.000197209,0.0009034882,0.00003659872,0.00001086977],"category_scores_gemma":[0.00005246068,0.0001082666,0.0001424126,0.0003228862,0.00005678761,0.000273994,0.0001530496,0.0004092461,0.00000201849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003174233,"about_ca_system_score_gemma":0.000199994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001353768,"about_ca_topic_score_gemma":0.0001279497,"domain_scores_codex":[0.9980688,0.0002602521,0.0008154018,0.000123931,0.0005080909,0.0002235437],"domain_scores_gemma":[0.9973025,0.0007389028,0.0005619205,0.0002755618,0.001038744,0.00008236809],"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.00004011886,0.0001092651,0.001820971,3.751162e-8,0.0001784542,0.00000224869,0.0006954986,0.925077,0.00003266699,0.04399058,0.000190023,0.02786316],"study_design_scores_gemma":[0.001230373,0.0001274744,0.001060333,0.0008218573,0.0000247354,0.00001375829,0.004791431,0.9614957,0.00004045196,0.02982779,0.0004336775,0.0001324336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01428948,0.0007108257,0.983879,0.0004377811,0.0001290672,0.0002558315,0.000006530987,0.00001426861,0.0002772004],"genre_scores_gemma":[0.9868474,0.00002441213,0.01219844,0.00001195812,0.0008121062,0.00003784666,0.00001845896,0.00001728933,0.00003211407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9725579,"threshold_uncertainty_score":0.4414984,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06935098984981178,"score_gpt":0.3724407295829069,"score_spread":0.3030897397330951,"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."}}