{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008879039,0.00132615,0.001695771,0.001889476,0.0007914501,0.001397268,0.002047748,0.001416314,0.0029248],"category_scores_gemma":[0.007690911,0.0008965697,0.001136578,0.00234902,0.001079305,0.003242007,0.002277142,0.001373355,0.0006858253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152454,"about_ca_system_score_gemma":0.001108099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003983574,"about_ca_topic_score_gemma":0.004513556,"domain_scores_codex":[0.9984885,0.0003195217,0.0000855071,0.0003454526,0.0006108222,0.0001501346],"domain_scores_gemma":[0.9974958,0.001453674,0.0002387144,0.00040894,0.0003016675,0.0001010566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001182682,0.00003780038,0.000968413,0.000133587,0.00004074737,0.0001105551,0.0001363805,0.9023156,0.002796281,0.01949274,0.001327511,0.07252219],"study_design_scores_gemma":[0.00001172843,0.00002039617,0.00008380786,0.000007438626,0.000004161147,0.00003045154,0.00005557055,0.9665436,0.0007984279,0.03168632,0.0007524465,0.000005628764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05695695,0.0002030683,0.9405017,0.0001115288,0.00002823324,0.00008649098,0.0002313712,0.0007257094,0.001155014],"genre_scores_gemma":[0.34829,0.0003131821,0.647987,0.00004522495,0.00003029266,0.0002778771,0.001308074,0.0002793608,0.001468925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003983574,"threshold_uncertainty_score":0.00978446,"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."}}