{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003116659,0.000553901,0.0005727037,0.000816309,0.0008104163,0.001262106,0.001057031,0.0009118767,0.006840058],"category_scores_gemma":[0.00277958,0.0005581859,0.0005384553,0.001006786,0.0006318144,0.001427457,0.001513953,0.001042257,0.0007931635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009215319,"about_ca_system_score_gemma":0.001151796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002788146,"about_ca_topic_score_gemma":0.003446553,"domain_scores_codex":[0.9997858,0.00003756232,0.00001135598,0.0000588548,0.00005677028,0.00004974434],"domain_scores_gemma":[0.9991571,0.0004754564,0.0001041896,0.00007215308,0.0001076141,0.00008350641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003063444,0.000114823,0.000975563,0.0002062779,0.00005256608,0.0002142585,0.0001841693,0.8096686,0.00600676,0.08658054,0.006204762,0.08948533],"study_design_scores_gemma":[0.00002601395,0.00007982415,0.0003480482,0.00003102786,0.00001988009,0.00008350131,0.0001129765,0.9290467,0.002978039,0.06365539,0.003606914,0.00001170724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1361829,0.0003102952,0.839466,0.0004007632,0.00008718922,0.0001445934,0.0005479045,0.0006454039,0.02221496],"genre_scores_gemma":[0.7628152,0.0004304707,0.2175582,0.00007984275,0.00003157175,0.0002646565,0.001146099,0.0002580789,0.01741591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006840058,"threshold_uncertainty_score":0.02288222,"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."}}