{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002724498,0.00008777815,0.00008459618,0.0001967804,0.0001275384,0.0001518923,0.0002626387,0.0000376467,0.0001410238],"category_scores_gemma":[0.00002356622,0.00007864895,0.00004979625,0.001100506,0.000008348258,0.0005069061,0.00002352331,0.00003684747,0.00008626746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002387156,"about_ca_system_score_gemma":0.00003921985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006400498,"about_ca_topic_score_gemma":0.000001448477,"domain_scores_codex":[0.9991198,0.00001633069,0.0001910743,0.0002876037,0.000210887,0.0001742808],"domain_scores_gemma":[0.9995098,0.00009030705,0.00003465462,0.0001949515,0.0001119021,0.00005836815],"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.000001964925,0.00008447304,0.00002919022,0.000008410138,0.000006775805,3.619635e-7,0.0000792401,0.03309431,0.0001432222,0.02402973,0.002246545,0.9402758],"study_design_scores_gemma":[0.000275484,0.0001157528,0.001029832,0.000004088181,0.000003221827,0.000009211375,0.00000293707,0.9601372,0.001057771,0.009803869,0.0274218,0.0001387829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004473089,0.00008435079,0.9893809,0.0004149503,0.0001496269,0.0004005902,0.000003086735,0.0001689694,0.004924449],"genre_scores_gemma":[0.4141366,0.00002650828,0.5784563,0.0004216773,0.0002243905,0.0001631436,0.00008454628,0.000008505633,0.006478346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.940137,"threshold_uncertainty_score":0.3207211,"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."}}