{"id":"W4412967130","doi":"10.1007/s00025-025-02479-2","title":"Computing Shortest Paths Amid Non-overlapping Weighted Disks","year":2025,"lang":"en","type":"article","venue":"Results in Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; Carleton University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Universidad de Alcalá; Ministerio de Ciencia, Innovación y Universidades","keywords":"Algorithm; Dijkstra's algorithm; Shortest path problem; Computer science; Mathematics; Graph; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.0008963545,0.00129338,0.001441926,0.001999003,0.0008297386,0.001786405,0.002557158,0.001559351,0.005261601],"category_scores_gemma":[0.007184731,0.0008704968,0.0009342569,0.00251171,0.000718308,0.003956441,0.002244942,0.001123463,0.001171229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009892441,"about_ca_system_score_gemma":0.0009508705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00517731,"about_ca_topic_score_gemma":0.005046647,"domain_scores_codex":[0.9983895,0.0003813544,0.0001061671,0.0004792397,0.0004395258,0.0002042298],"domain_scores_gemma":[0.9974893,0.001416806,0.000305506,0.0003208675,0.0002900102,0.0001774422],"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.001034968,0.0001941453,0.002127603,0.0005353137,0.0001850415,0.0003968437,0.000376878,0.7724014,0.006213635,0.02819144,0.004988322,0.1833544],"study_design_scores_gemma":[0.0000505933,0.0001147292,0.0002812655,0.00002654569,0.0000200148,0.0001184601,0.0001497571,0.9669297,0.002457106,0.02715946,0.002677326,0.00001504619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1502391,0.001221338,0.8429856,0.0003628742,0.00007151528,0.0001877493,0.0007864153,0.001067834,0.00307758],"genre_scores_gemma":[0.3570411,0.0005519438,0.6357751,0.00006498552,0.00004686069,0.0002231211,0.001770113,0.0002239785,0.004302813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005261601,"threshold_uncertainty_score":0.01760179,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01500225864679229,"score_gpt":0.2788081659087391,"score_spread":0.2638059072619469,"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."}}