{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004578307,0.0001658451,0.000261372,0.0002038358,0.0001111068,0.000356728,0.001183933,0.00006352156,0.0000221249],"category_scores_gemma":[0.00001782831,0.0001371494,0.000121433,0.000529727,0.00003874541,0.001231393,0.0002061555,0.0002776545,0.00001567306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005471817,"about_ca_system_score_gemma":0.00003583311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003931933,"about_ca_topic_score_gemma":0.00001335663,"domain_scores_codex":[0.9983692,0.00005125692,0.0005462908,0.0002128463,0.0005031255,0.0003173087],"domain_scores_gemma":[0.9987915,0.000100296,0.0004653186,0.0003363122,0.000205415,0.0001011611],"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.00002600422,0.0006285886,0.007978036,0.00001025459,0.0001570582,0.001565045,0.00007605519,0.2263972,0.0001376868,0.06318308,0.2127755,0.4870655],"study_design_scores_gemma":[0.0009704559,0.0002701163,0.0609565,0.00006997972,0.00004686082,0.0001776181,0.0000112584,0.9208708,0.00005793706,0.005588421,0.01068928,0.000290759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008269142,0.0002806115,0.9865341,0.0009401187,0.001461478,0.00009337396,0.000002435748,0.00006216498,0.002356568],"genre_scores_gemma":[0.8159804,0.00009303261,0.1801556,0.0002030673,0.002680249,9.518159e-7,0.00001874276,0.00001725834,0.0008506649],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8077112,"threshold_uncertainty_score":0.559279,"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."}}