{"id":"W4280652037","doi":"10.1016/j.comgeo.2022.101897","title":"An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Combinatorics; Euclidean shortest path; Mathematics; Convexity; Generalization; Upper and lower bounds; Euclidean geometry; Path (computing); K shortest path routing; Computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005910707,0.0001793221,0.0001894762,0.0003514198,0.0005838666,0.0001520528,0.0006817303,0.00004594186,0.0002534195],"category_scores_gemma":[0.00004556228,0.0001567724,0.0001100473,0.001328745,0.00008573195,0.0002947772,0.0002015713,0.0002306152,0.000008197076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009920327,"about_ca_system_score_gemma":0.0003074456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001568981,"about_ca_topic_score_gemma":0.000001838052,"domain_scores_codex":[0.9979013,0.000156758,0.0004190559,0.0004662909,0.0007959342,0.0002606454],"domain_scores_gemma":[0.9982045,0.0009945468,0.0001953916,0.000298239,0.0002334142,0.00007386631],"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.0001143635,0.0006310538,0.001993413,0.00001333279,0.00001981645,0.000008731045,0.0003770219,0.8094845,0.001578981,0.179845,0.001842073,0.004091674],"study_design_scores_gemma":[0.0008772597,0.0003568375,0.04816741,0.000007893116,0.000006523467,0.00002780492,0.0000576801,0.7494337,0.001303434,0.1985073,0.0009768446,0.0002773213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8659992,0.00005923269,0.1320724,0.0006025216,0.0006413738,0.0002923068,0.00008140582,0.00003749058,0.0002140628],"genre_scores_gemma":[0.960683,3.242851e-7,0.03738808,0.001402283,0.0001097145,0.0000604037,0.0002109489,0.00001372539,0.0001315281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0946843,"threshold_uncertainty_score":0.6392993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01410959408346892,"score_gpt":0.2739026528871327,"score_spread":0.2597930588036638,"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."}}