{"id":"W4250203847","doi":"10.1002/dac.976","title":"An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; Graph; K shortest path routing; Theoretical computer science","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.001721626,0.0007771082,0.001429734,0.001258105,0.0005532222,0.001360384,0.001936733,0.001309361,0.001895422],"category_scores_gemma":[0.008936211,0.0006174036,0.0008902929,0.0009589284,0.001164135,0.00189206,0.002060262,0.001616,0.0003546294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073697,"about_ca_system_score_gemma":0.001477515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005692359,"about_ca_topic_score_gemma":0.003515754,"domain_scores_codex":[0.9991054,0.0002863788,0.00006484112,0.0002444919,0.0002108279,0.00008810936],"domain_scores_gemma":[0.9956142,0.003096272,0.0002622073,0.0002774206,0.0005961829,0.0001537599],"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.00006204416,0.00003230042,0.0008445581,0.00004561844,0.00003731754,0.00003235224,0.00005872503,0.9407874,0.000880152,0.01261318,0.0003930104,0.04421343],"study_design_scores_gemma":[0.000001929857,0.00000754855,0.00002243085,0.000001652349,0.000001309669,0.000002975034,0.000003290614,0.9972907,0.0001132175,0.002491931,0.00006124676,0.000001789277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01246742,0.00007815519,0.9865621,0.0001022938,0.00001836085,0.00002647613,0.00003112035,0.0001894684,0.0005246273],"genre_scores_gemma":[0.6420262,0.000213672,0.3543856,0.0001596674,0.0000639331,0.0003030058,0.0002653921,0.0001042545,0.002478335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005692359,"threshold_uncertainty_score":0.01131845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04909891223916364,"score_gpt":0.3075747939105659,"score_spread":0.2584758816714023,"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."}}