{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061548,0.0001206073,0.0002265802,0.0002352749,0.0001477981,0.0002692618,0.002805285,0.00005594085,0.000003357653],"category_scores_gemma":[0.0001115116,0.0001145992,0.00006759517,0.0002017868,0.00005472662,0.0006919833,0.0002247482,0.0002133012,0.00000368397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002273473,"about_ca_system_score_gemma":0.0001234335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002746748,"about_ca_topic_score_gemma":0.000001805833,"domain_scores_codex":[0.9975623,0.0003175209,0.0008500447,0.0001755585,0.0008730817,0.0002214191],"domain_scores_gemma":[0.9980364,0.0002765559,0.0006487228,0.0005878529,0.0003309982,0.0001194361],"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.00001608921,0.0003060974,0.0003792506,0.000002485179,0.00003952907,0.000003828539,0.0009630634,0.992853,0.00004355636,0.004088515,0.000277231,0.00102733],"study_design_scores_gemma":[0.0008033325,0.00009082265,0.0006649487,0.000104186,0.000003802478,0.0001324472,0.0001253526,0.9969619,0.000005198462,0.0001401595,0.0008618747,0.0001059946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003596929,0.0003978791,0.9944612,0.0003350502,0.0005065465,0.0003924796,0.000005457109,0.00003016118,0.0002743464],"genre_scores_gemma":[0.7209191,0.00005823055,0.2787496,0.00005929453,0.00009756746,0.00004007892,0.00003024493,0.00001016554,0.00003581284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7173221,"threshold_uncertainty_score":0.5212964,"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."}}