{"id":"W3215715196","doi":"10.1007/978-3-030-96731-4_33","title":"On Approximating Shortest Paths in Weighted Triangular Tessellations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Universidad de Alcalá","keywords":"Combinatorics; Tessellation (computer graphics); Shortest path problem; Vertex (graph theory); Hexagonal tiling; Mathematics; Path (computing); Space (punctuation); Geometry; Grid; Computer science; Graph","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.001291372,0.0004142757,0.0004327786,0.001769114,0.0003960712,0.0003746159,0.001784598,0.0001775965,0.000121291],"category_scores_gemma":[0.0001818861,0.0004229012,0.0001106661,0.001804132,0.0001566566,0.0005318721,0.0007664241,0.0009010028,0.00002650645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004671667,"about_ca_system_score_gemma":0.0005815723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001481121,"about_ca_topic_score_gemma":0.00004432606,"domain_scores_codex":[0.9961702,0.00008002936,0.0006954653,0.001391574,0.001178338,0.0004843943],"domain_scores_gemma":[0.997578,0.0009747597,0.0002944748,0.0008915278,0.0001475781,0.0001136689],"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.000005167724,0.00006537255,0.00003110465,0.00001332162,0.00000550643,0.00007658592,0.0005361784,0.4597182,0.00007456185,0.1664217,0.00002154685,0.3730307],"study_design_scores_gemma":[0.0002729473,0.0001453131,0.0001165377,0.0001124976,0.000003222518,0.00002567026,1.858793e-7,0.7728683,0.0002204316,0.2242713,0.0015635,0.0004000758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004201524,0.0002488115,0.9906775,0.0006612256,0.001575244,0.000520819,0.000007939795,0.000122638,0.005765647],"genre_scores_gemma":[0.391875,0.00003716426,0.6045806,0.0020056,0.0006588238,0.00006795961,0.00009460493,0.00005631611,0.0006238995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3914548,"threshold_uncertainty_score":0.9998223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01708299613129252,"score_gpt":0.2438070071282417,"score_spread":0.2267240109969492,"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."}}