{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006551562,0.0001391602,0.0002067118,0.0002791744,0.0001205264,0.0001547309,0.0004943006,0.00006652328,0.000001679587],"category_scores_gemma":[0.0002457438,0.0001339088,0.00004922988,0.001158405,0.00002183563,0.0001940013,0.0002503778,0.0001550652,0.00002250986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000763894,"about_ca_system_score_gemma":0.00009786371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007348769,"about_ca_topic_score_gemma":0.00001019881,"domain_scores_codex":[0.9985854,0.00003966392,0.0005629543,0.0003283644,0.0002541543,0.0002294663],"domain_scores_gemma":[0.9987714,0.0005366172,0.0001349981,0.0004238851,0.00009284402,0.00004029624],"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.00002574642,0.0009526826,0.0008716235,0.000438257,0.00008162022,0.00006693343,0.008398819,0.05292789,0.003270532,0.718454,0.004875489,0.2096364],"study_design_scores_gemma":[0.0004812698,0.00001830095,0.003059154,0.0002773358,0.000004519008,0.000003284986,0.00006802292,0.9402298,0.001114657,0.05413,0.0004710654,0.0001426227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0604591,0.00004959607,0.9215896,0.0005177614,0.0004104223,0.0002128032,0.000003421426,0.0001016782,0.01665559],"genre_scores_gemma":[0.7895977,0.00001173373,0.2095669,0.0001517766,0.00005870673,0.000005422318,0.00001444983,0.000005301718,0.0005879501],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8873019,"threshold_uncertainty_score":0.5460644,"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."}}