{"id":"W1980197133","doi":"10.1145/335305.335339","title":"Approximation algorithms for geometric shortest path problems","year":2000,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Citation; Computer science; Bulgarian; Algorithm; Library science; Shortest path problem; Theoretical 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001789067,0.001879117,0.001470268,0.001528096,0.0008842756,0.001988422,0.003081209,0.002116163,0.00431677],"category_scores_gemma":[0.01139346,0.0006295218,0.001079456,0.003343411,0.001386692,0.004643106,0.0027662,0.002992711,0.00141578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001775402,"about_ca_system_score_gemma":0.00140037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002814928,"about_ca_topic_score_gemma":0.002571871,"domain_scores_codex":[0.9983652,0.000494059,0.00009784108,0.0003005904,0.0004892736,0.0002530774],"domain_scores_gemma":[0.9968645,0.002004119,0.0002235413,0.0004633704,0.000292132,0.0001523467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002399326,0.000154545,0.0006974224,0.0003121856,0.00009890256,0.00008560683,0.0001741985,0.7157968,0.001044653,0.1211673,0.007678828,0.1525497],"study_design_scores_gemma":[0.00005389559,0.00004701893,0.00007895966,0.00002723695,0.00001913581,0.00006195476,0.00005416151,0.8316089,0.0005592451,0.1636562,0.003823326,0.00000996686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007406607,0.0009519268,0.9879358,0.0003713515,0.00007909502,0.00005219542,0.0001161954,0.0004904681,0.002596388],"genre_scores_gemma":[0.2021255,0.00233021,0.7901056,0.000198261,0.0002389127,0.0002812506,0.001245677,0.0002545478,0.003220118],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00431677,"threshold_uncertainty_score":0.01444107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02778989724429457,"score_gpt":0.2526524067234931,"score_spread":0.2248625094791985,"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."}}