{"id":"W1798872925","doi":"10.1007/s00454-013-9486-0","title":"An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Los Alamos National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Combinatorics; Mathematics; Geodesic; Voronoi diagram; Vertex (graph theory); Domain (mathematical analysis); Tetrahedron; Algorithm; Geometry; Graph; Mathematical analysis","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.0006146899,0.0003014668,0.0003119324,0.0008315352,0.0003158932,0.0005237832,0.0006917448,0.0001245437,0.00004440171],"category_scores_gemma":[0.00005848412,0.0003132985,0.0001273634,0.001814506,0.00005452254,0.001783312,0.0001366802,0.0001921646,0.00006967409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001303364,"about_ca_system_score_gemma":0.0001525363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005020796,"about_ca_topic_score_gemma":0.000006095774,"domain_scores_codex":[0.9972407,0.000142727,0.0006956627,0.0007934581,0.0006297086,0.0004977216],"domain_scores_gemma":[0.9981681,0.000507926,0.0002280056,0.0003657134,0.0005227872,0.0002074962],"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.000007617781,0.0003754128,0.00162997,0.00003157491,0.00004074163,0.000006037712,0.0006402925,0.2959119,0.00042188,0.07107118,0.0005264877,0.6293368],"study_design_scores_gemma":[0.0008135097,0.0001555218,0.04973005,0.00002294187,0.000005866576,0.00001653653,0.00007785936,0.8911189,0.0001465214,0.05731703,0.0002384857,0.0003568199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320873,0.00007985506,0.8657147,0.0003837719,0.0004182763,0.0008671438,0.00003014288,0.0001988862,0.0002198738],"genre_scores_gemma":[0.5458012,0.000001627125,0.4528566,0.0003221339,0.0001799101,0.00008988349,0.0007014701,0.00001574157,0.00003141382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.62898,"threshold_uncertainty_score":0.9999319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01090492122145809,"score_gpt":0.266188493852599,"score_spread":0.2552835726311409,"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."}}