{"id":"W1590149829","doi":"","title":"Concurrent Parallel Shortest Path Computation.","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Shortest path problem; Parallel computing; Constrained Shortest Path First; Computation; K shortest path routing; Path (computing); Topology (electrical circuits); Theoretical computer science; Algorithm; Mathematics; Combinatorics; 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.0001016501,0.00007523564,0.00006778401,0.00004122571,0.00005636986,0.0002096377,0.0005328556,0.00001232489,0.00006442759],"category_scores_gemma":[0.000003743956,0.00006291093,0.00002658549,0.0001443892,0.00001553544,0.0007740973,0.000245151,0.00004162269,0.0006106963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001330115,"about_ca_system_score_gemma":0.0000109378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005842685,"about_ca_topic_score_gemma":0.00000503124,"domain_scores_codex":[0.9993038,0.00001226686,0.0001283475,0.0002241288,0.0001721781,0.0001593463],"domain_scores_gemma":[0.9996493,0.00002147836,0.00002812023,0.0002193399,0.00002534268,0.00005640664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[1.233049e-7,0.00006451172,0.0001747294,0.000001414955,0.000007059533,0.000004204202,0.00005411369,0.001163385,0.000002901295,0.1855342,0.06315478,0.7498385],"study_design_scores_gemma":[0.0002264576,0.00002341866,0.001783367,0.000003224498,0.00000228178,0.00000196363,0.000009457403,0.8355684,0.00001706929,0.000642932,0.161596,0.0001255254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002098338,0.00005819112,0.973288,0.002253109,0.0002317111,0.0000849359,0.000001705313,0.0002296509,0.02364285],"genre_scores_gemma":[0.6392718,0.00002527375,0.3556387,0.001513329,0.0001871712,0.00000998567,0.00003398308,0.000005148451,0.003314637],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8344049,"threshold_uncertainty_score":0.7849469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02065145057853855,"score_gpt":0.2618288140896078,"score_spread":0.2411773635110693,"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."}}