{"id":"W2025130628","doi":"10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Shortest path problem; Combinatorics; Dijkstra's algorithm; Mathematics; Regular polygon; Bounded function; Theory of computation; Context (archaeology); Domain (mathematical analysis); Euclidean shortest path; Computational geometry; Face (sociological concept); Discrete mathematics; K shortest path routing; Graph; Algorithm; Geometry","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.0002020088,0.0001285959,0.0001194218,0.0001190009,0.0001840768,0.0001471703,0.0003805835,0.00004686312,0.00003047524],"category_scores_gemma":[0.00003032604,0.0001187975,0.00004851003,0.0005901164,0.00001928392,0.0003272128,0.00008878561,0.0001094877,0.0001399937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003046344,"about_ca_system_score_gemma":0.00004486302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001375942,"about_ca_topic_score_gemma":0.000002177118,"domain_scores_codex":[0.9988396,0.00004978744,0.0002184217,0.0003431015,0.0003070074,0.0002421248],"domain_scores_gemma":[0.9993606,0.0001318134,0.00007051326,0.0002784132,0.00007424351,0.00008447018],"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.0000105021,0.0002448843,0.0005697681,0.000005673657,0.00003126905,0.00006696973,0.0004147253,0.004946692,0.002364915,0.06359894,0.001473904,0.9262717],"study_design_scores_gemma":[0.0002325364,0.0001289572,0.003095668,0.00001344324,0.00000371982,0.00005196036,0.00001468964,0.9795106,0.004414323,0.006335245,0.005985868,0.0002129916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2137263,0.00009866416,0.7788544,0.001411851,0.0005336082,0.0001459949,0.000003041048,0.0002581388,0.004967917],"genre_scores_gemma":[0.8422137,0.000009084931,0.1564809,0.0004811617,0.0002686781,0.00001109028,0.00002147794,0.000008156997,0.0005057123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9745639,"threshold_uncertainty_score":0.4844421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01470809025050108,"score_gpt":0.2418008765560288,"score_spread":0.2270927863055277,"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."}}