{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000975639,0.001265893,0.001549828,0.001964136,0.0008656263,0.001567028,0.002618822,0.001580698,0.003744099],"category_scores_gemma":[0.005018668,0.0007827519,0.00115243,0.00284701,0.0007699464,0.002054369,0.002300514,0.001607546,0.0009768788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001341622,"about_ca_system_score_gemma":0.001767014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009710218,"about_ca_topic_score_gemma":0.01167964,"domain_scores_codex":[0.9993303,0.0001077175,0.0000468423,0.0001332533,0.000310933,0.00007101845],"domain_scores_gemma":[0.9986217,0.0007250445,0.00008938312,0.0001581481,0.0003213035,0.00008443928],"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.000236185,0.0001160329,0.0008134537,0.000209999,0.00007403483,0.00008329407,0.0001703803,0.6723537,0.004066165,0.02642983,0.003367392,0.2920795],"study_design_scores_gemma":[0.00001569069,0.00002211453,0.00006540032,0.000009390018,0.000008846092,0.00002427088,0.00002415526,0.9912964,0.0006890074,0.006816784,0.001021498,0.000006420448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006281542,0.0001112529,0.9923539,0.00004408064,0.00003415949,0.00004559568,0.00006613276,0.0003884684,0.0006748803],"genre_scores_gemma":[0.06505942,0.0001884657,0.9324412,0.000036587,0.00002110188,0.0001701821,0.0003207887,0.0001349619,0.001627187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009710218,"threshold_uncertainty_score":0.01930743,"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."}}