{"id":"W2218492333","doi":"10.1007/978-3-319-07956-1_18","title":"Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Digraph; Combinatorics; Shortest path problem; Undirected graph; Floyd–Warshall algorithm; Mathematics; Arc (geometry); Algorithm; Discrete mathematics; Computer science; K shortest path routing; 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.0004227244,0.001122578,0.001036366,0.001682523,0.001244488,0.00221227,0.001718591,0.001148708,0.00672794],"category_scores_gemma":[0.003951721,0.0008846885,0.0008242944,0.003408703,0.000891077,0.004435723,0.001737469,0.002009291,0.001143609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001551853,"about_ca_system_score_gemma":0.001077702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001582331,"about_ca_topic_score_gemma":0.003089811,"domain_scores_codex":[0.9993429,0.0001130856,0.00003903433,0.0002202437,0.0001829125,0.0001018256],"domain_scores_gemma":[0.9972146,0.001598972,0.0002780288,0.0003005092,0.0003697674,0.0002381231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003092013,0.0001506985,0.000887304,0.001238212,0.0001320134,0.0006772919,0.0005993953,0.1495935,0.01142904,0.6787944,0.01700149,0.1391875],"study_design_scores_gemma":[0.00005478868,0.00005809792,0.0003425289,0.0001039835,0.00005690269,0.0004345132,0.0002056474,0.1583453,0.003095221,0.8262053,0.01106263,0.00003511944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2150312,0.001333795,0.7189349,0.001597234,0.0002903151,0.000298595,0.003315212,0.001002889,0.05819586],"genre_scores_gemma":[0.7233083,0.002251251,0.2319912,0.0003131759,0.0002310903,0.0004048716,0.003117053,0.0004644313,0.03791871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00672794,"threshold_uncertainty_score":0.02250719,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01108422173354614,"score_gpt":0.2417086249128505,"score_spread":0.2306244031793044,"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."}}