{"id":"W2028769163","doi":"10.1145/1044731.1044733","title":"Determining approximate shortest paths on weighted polyhedral surfaces","year":2005,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Discretization; Combinatorics; Face (sociological concept); Mathematics; Shortest path problem; Surface (topology); Euclidean geometry; Polyhedron; Computational geometry; Discrete mathematics; Algorithm; Geometry; Graph; Mathematical analysis","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.0004439159,0.00009198208,0.0001270387,0.00007778984,0.0001047051,0.0002321623,0.004236207,0.00002063312,0.00001079294],"category_scores_gemma":[0.0001162318,0.00005285782,0.00009481102,0.0001844286,0.0000217672,0.0008828015,0.001047022,0.0001703974,0.00002409198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002704311,"about_ca_system_score_gemma":0.00002218592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001059641,"about_ca_topic_score_gemma":0.000001464663,"domain_scores_codex":[0.9990523,0.00004560131,0.0002573789,0.0001120772,0.0003534268,0.0001792294],"domain_scores_gemma":[0.9986002,0.00006623324,0.0002741267,0.0009678056,0.00003860577,0.00005306943],"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.00003468089,0.000399767,0.01094942,0.00001715825,0.0001671662,0.0001760756,0.001164781,0.001487994,0.002850664,0.006540814,0.04739069,0.9288208],"study_design_scores_gemma":[0.002884259,0.001106672,0.09487472,0.0005770454,0.0001377226,0.0006029592,0.0002157908,0.7346602,0.02731827,0.02594073,0.1106665,0.001015081],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9505292,0.000191753,0.01864709,0.02603155,0.001947276,0.0001368691,0.000004280348,0.00006228362,0.002449702],"genre_scores_gemma":[0.8871483,0.00002930897,0.1110038,0.0008633644,0.0004185106,5.500274e-7,3.295994e-7,0.000007507972,0.0005282615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9278057,"threshold_uncertainty_score":0.7871997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02130323145929961,"score_gpt":0.2520038338114481,"score_spread":0.2307006023521485,"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."}}