{"id":"W2074682596","doi":"10.1007/s00454-009-9204-0","title":"Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Shortest path problem; Combinatorics; Logarithm; Euclidean geometry; Data structure; Graph; Range (aeronautics); Discrete mathematics; Algorithm; Computer science","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004019848,0.0003493956,0.0003265725,0.0004939637,0.0004525904,0.0003998473,0.0006284631,0.0001070701,0.00002527254],"category_scores_gemma":[0.00008369046,0.0003305576,0.0001984583,0.001269368,0.0000623309,0.0007433921,0.00008655916,0.0001709735,0.0000401951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007741091,"about_ca_system_score_gemma":0.0001610949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005913173,"about_ca_topic_score_gemma":9.544748e-7,"domain_scores_codex":[0.9973982,0.00007610516,0.0005037196,0.0007699732,0.0007670038,0.0004850022],"domain_scores_gemma":[0.9984001,0.000499017,0.0001994461,0.0003481487,0.0003634287,0.0001898435],"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.0001059543,0.0003598758,0.0002662042,0.00002283031,0.00008021801,0.00001808674,0.0003256324,0.3887698,0.0003458557,0.4957277,0.002174592,0.1118033],"study_design_scores_gemma":[0.0007156544,0.0006349743,0.02450237,0.0000302404,0.00001291734,0.00002577763,0.00002964245,0.8675913,0.0006169261,0.1035094,0.00187261,0.0004582434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08329514,0.0002830932,0.9118181,0.002452515,0.0005783291,0.000476718,0.0001004438,0.0003094117,0.000686233],"genre_scores_gemma":[0.777102,0.000009116568,0.2204607,0.001266361,0.0002709958,0.00003528528,0.0006195717,0.00001544817,0.0002205458],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6938068,"threshold_uncertainty_score":0.9999146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01929003721726897,"score_gpt":0.2807975083370942,"score_spread":0.2615074711198252,"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."}}