{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003061162,0.003011855,0.002342079,0.002273876,0.002132572,0.005065535,0.006068841,0.002893574,0.02802819],"category_scores_gemma":[0.02470623,0.001644742,0.00241738,0.003441543,0.002693981,0.01044292,0.007256626,0.006890434,0.005365341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003030384,"about_ca_system_score_gemma":0.002394663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003165961,"about_ca_topic_score_gemma":0.00843248,"domain_scores_codex":[0.995698,0.0007772308,0.0002998426,0.0009829105,0.001522174,0.0007198812],"domain_scores_gemma":[0.979385,0.01499143,0.0007945981,0.0027709,0.0009826116,0.001075412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002790033,0.000987594,0.006414824,0.002781554,0.0004753616,0.0006311521,0.0007937641,0.3351586,0.03919242,0.2006972,0.06764786,0.3424297],"study_design_scores_gemma":[0.0002257265,0.0002587059,0.001928212,0.0002570112,0.000180642,0.0005502473,0.0002580429,0.6845272,0.008057836,0.2870601,0.01660433,0.0000920259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1237525,0.005344945,0.7764623,0.007247757,0.001329664,0.0005047797,0.004732813,0.003563596,0.0770615],"genre_scores_gemma":[0.4537177,0.004097271,0.4963503,0.001795376,0.0007644853,0.001139949,0.005856623,0.002481165,0.03379709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02802819,"threshold_uncertainty_score":0.09376365,"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."}}