{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001194827,0.0007618451,0.0009307572,0.0008387135,0.001538469,0.002122903,0.002475201,0.0007346366,0.00863736],"category_scores_gemma":[0.00884228,0.0005494341,0.000561744,0.001688651,0.0008858927,0.002932798,0.002379406,0.00135875,0.001880912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009876075,"about_ca_system_score_gemma":0.002520466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004461034,"about_ca_topic_score_gemma":0.007348953,"domain_scores_codex":[0.998774,0.0002236903,0.00008946498,0.0002855406,0.0004288552,0.0001984648],"domain_scores_gemma":[0.9967224,0.001085477,0.0001705911,0.001101885,0.0006726948,0.0002468384],"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":[0.002766306,0.0005616068,0.003547681,0.0008325764,0.0002771684,0.0005187875,0.000538205,0.1907803,0.01909341,0.2508721,0.05471927,0.4754925],"study_design_scores_gemma":[0.0003414545,0.0001295911,0.0003328611,0.0000443581,0.0001132047,0.0002443643,0.0001189371,0.6217467,0.01363822,0.3326241,0.03063543,0.00003080247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03304307,0.0012321,0.9386174,0.0008827593,0.0005383812,0.0003108628,0.0007925942,0.003302219,0.02128045],"genre_scores_gemma":[0.5196365,0.0007831402,0.4620096,0.000231071,0.0002170767,0.0004435676,0.00157988,0.0004746358,0.01462454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00863736,"threshold_uncertainty_score":0.0288949,"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."}}