{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002512883,0.001780949,0.001436747,0.001842606,0.0007325198,0.001838084,0.002329062,0.001426473,0.003255824],"category_scores_gemma":[0.02827656,0.0007197312,0.001097906,0.002256804,0.00145607,0.00347365,0.002701814,0.001713272,0.0005975506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002349649,"about_ca_system_score_gemma":0.0008820305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01082286,"about_ca_topic_score_gemma":0.008932639,"domain_scores_codex":[0.9980654,0.0006574722,0.0001226314,0.0003056422,0.0005745287,0.0002742457],"domain_scores_gemma":[0.9848348,0.01148106,0.0009412125,0.00133934,0.001012239,0.0003914279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002594271,0.00004109065,0.001748169,0.0001380195,0.00004530178,0.00007549709,0.0001429348,0.9492135,0.001781277,0.01906545,0.001065344,0.02642404],"study_design_scores_gemma":[0.000007529345,0.00003585865,0.0001404257,0.00001301197,0.000005608038,0.00003591505,0.00003004322,0.9855081,0.000618422,0.0131868,0.0004113464,0.000006904982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1165392,0.00119013,0.8774123,0.0002438783,0.00008807806,0.00007669941,0.00043507,0.0006902569,0.003324309],"genre_scores_gemma":[0.566375,0.000884191,0.4283414,0.0001740224,0.00005753181,0.0002111756,0.001271832,0.000410777,0.002274145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01082286,"threshold_uncertainty_score":0.02151972,"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."}}