{"id":"W3041287753","doi":"10.1007/s10878-020-00604-1","title":"Shortest paths among transient obstacles","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Theory of computation; Transient (computer programming); Computer science; Mathematics; Combinatorics; Mathematical optimization; Algorithm","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.0003275716,0.0001275314,0.0002658548,0.00009302788,0.00007342733,0.0001631152,0.0006523412,0.00007947612,0.000008173063],"category_scores_gemma":[0.0002680179,0.0001161989,0.0001065189,0.0004623695,0.00002959247,0.0009171877,0.00005026023,0.000234991,0.000004060231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005096845,"about_ca_system_score_gemma":0.0001315619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001900652,"about_ca_topic_score_gemma":1.307269e-8,"domain_scores_codex":[0.9984598,0.000104532,0.0005442947,0.000163901,0.0005538852,0.0001735678],"domain_scores_gemma":[0.9986992,0.0000932668,0.0004431998,0.0001578524,0.0003681495,0.0002383581],"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.00002049929,0.00007999771,0.0007430182,0.000006360892,0.00002545004,0.00009527642,0.001367945,0.9923185,0.0001045254,0.002931031,0.0009773003,0.001330159],"study_design_scores_gemma":[0.001170247,0.0005363908,0.001401196,0.00004486316,0.00002406064,0.00003166693,0.00003611111,0.9951759,0.0003972658,0.0006308372,0.0003947211,0.0001567399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003151292,0.00009238443,0.991038,0.001467229,0.003809089,0.00009468326,8.708458e-7,0.00005915771,0.0002872996],"genre_scores_gemma":[0.4917181,0.00002836147,0.5074473,0.0001879012,0.0005967358,0.000001119051,0.000002032334,0.00001342425,0.000004950198],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4885668,"threshold_uncertainty_score":0.4738454,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01598105883444883,"score_gpt":0.2243725514582892,"score_spread":0.2083914926238403,"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."}}