{"id":"W4226303121","doi":"10.1016/j.artint.2023.103898","title":"On approximating shortest paths in weighted triangular tessellations","year":2023,"lang":"en","type":"preprint","venue":"Artificial Intelligence","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Universidad de Alcalá; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; HORIZON EUROPE Framework Programme; Agencia Estatal de Investigación; Ministerio de Ciencia, Innovación y Universidades","keywords":"Combinatorics; Shortest path problem; Vertex (graph theory); Tessellation (computer graphics); Path (computing); Mathematics; Hexagonal tiling; Space (punctuation); Discrete mathematics; Computer science; Grid; Geometry","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.001590727,0.0003842384,0.0006249266,0.0008530894,0.0001404819,0.0001881095,0.0005203215,0.0003698845,0.0002159377],"category_scores_gemma":[0.006236289,0.0003735096,0.0001808285,0.001391416,0.00007665468,0.00008171125,0.0003755639,0.0008988788,0.0003861335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001255344,"about_ca_system_score_gemma":0.000158042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000302221,"about_ca_topic_score_gemma":0.000384678,"domain_scores_codex":[0.9966851,0.0001338362,0.001478303,0.0006837876,0.0005122157,0.0005067827],"domain_scores_gemma":[0.9956651,0.002904531,0.0004408519,0.0006955616,0.0002119853,0.00008193077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003607905,0.000393247,0.00008764864,0.0006130687,0.00005088789,0.0000578017,0.003482696,0.003438625,0.0000394437,0.9669865,0.000524196,0.02428979],"study_design_scores_gemma":[0.00002164614,0.00005214899,0.00001860014,0.0005914036,0.00002801051,0.000001261233,0.001403626,0.05965938,0.003672742,0.9341057,0.00006553404,0.0003799416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3588883,0.0004130744,0.6197436,0.001825846,0.003800102,0.002666238,0.000330016,0.001254699,0.01107811],"genre_scores_gemma":[0.9874159,0.00008456938,0.01065329,0.0000726225,0.0003894551,0.000225171,0.00009220099,0.00009059625,0.0009761704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6285276,"threshold_uncertainty_score":0.9998717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2805005081998962,"score_gpt":0.4009864052137628,"score_spread":0.1204858970138666,"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."}}