{"id":"W1714480694","doi":"10.3233/hsn-2006-282","title":"Destination-driven shortest path tree algorithms","year":2006,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Path (computing); Tree (set theory); Algorithm; Shortest path problem; Theoretical computer science; Computer network; Mathematics; Combinatorics; 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.001079224,0.0008839808,0.001141424,0.001127908,0.0009280532,0.001279191,0.00213229,0.001100036,0.003419716],"category_scores_gemma":[0.003723373,0.0004255579,0.0006529354,0.00182462,0.0003662352,0.002050831,0.001830168,0.001022624,0.00132709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008025167,"about_ca_system_score_gemma":0.001811824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008966509,"about_ca_topic_score_gemma":0.001500118,"domain_scores_codex":[0.9990053,0.0003102597,0.00007331048,0.0001627671,0.0003323111,0.0001160716],"domain_scores_gemma":[0.9986279,0.0006254007,0.0001241371,0.0002131574,0.0003388051,0.00007056374],"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.0002308985,0.0001543878,0.001029986,0.0003045621,0.0001155471,0.0001123029,0.0002152708,0.6111614,0.003932931,0.06668167,0.01038388,0.3056772],"study_design_scores_gemma":[0.00005971844,0.00006921715,0.0001124413,0.00002030007,0.00002728132,0.0001293311,0.00005195711,0.9386818,0.002231601,0.04961642,0.008982814,0.00001708576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006155931,0.0003354644,0.9894838,0.0001585497,0.00005623698,0.0001241199,0.0001552556,0.000541132,0.002989542],"genre_scores_gemma":[0.1716444,0.0007138588,0.8216901,0.0001535852,0.00007600114,0.0003829538,0.0009346549,0.0001627505,0.004241692],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003419716,"threshold_uncertainty_score":0.0114401,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00937035923181781,"score_gpt":0.2166548126016384,"score_spread":0.2072844533698206,"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."}}