{"id":"W1534329287","doi":"10.1007/978-3-540-77120-3_58","title":"An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Plane (geometry); Path (computing); Algorithm; Combinatorics; Computer science; Mathematics; Geometry; 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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.004629676,0.0008200171,0.000828091,0.001101324,0.0005370802,0.001010464,0.006982529,0.0004806986,0.000003964661],"category_scores_gemma":[0.0001300686,0.0006537791,0.0001731232,0.001050636,0.0006666634,0.00107126,0.0008694016,0.001402208,0.00003268562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004040398,"about_ca_system_score_gemma":0.0005056405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005248545,"about_ca_topic_score_gemma":0.00003457493,"domain_scores_codex":[0.9937704,0.0001132878,0.0009575381,0.002201333,0.001502684,0.001454796],"domain_scores_gemma":[0.9948153,0.002415134,0.0003963557,0.001931161,0.0002106614,0.0002313499],"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.000003167771,0.00006627664,0.0000734201,0.00001897572,0.00000908636,0.0004221238,0.002119542,0.09018083,0.00006143108,0.002670851,0.0000194687,0.9043548],"study_design_scores_gemma":[0.0003552345,0.0003795836,0.0004412289,0.0004604392,0.00001090184,0.000297407,0.000002051149,0.9800077,0.0001250235,0.0168252,0.0002707961,0.000824434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000803207,0.0002145282,0.9953705,0.0004841137,0.001736687,0.0009690491,0.00002504257,0.0002883578,0.0008313705],"genre_scores_gemma":[0.01126027,0.000006006191,0.984896,0.002449015,0.00118126,0.00001376538,0.00005902999,0.00006033481,0.00007430614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9035304,"threshold_uncertainty_score":0.9995914,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02434634861827658,"score_gpt":0.278317481065577,"score_spread":0.2539711324473005,"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."}}