{"id":"W3106756511","doi":"10.1007/978-3-030-61792-9_19","title":"An $$\\varOmega (n^3)$$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Upper and lower bounds; Combinatorics; Generalization; Sharpening; Path (computing); Mathematics; Discrete mathematics; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"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.001851301,0.003996892,0.002457369,0.003181668,0.002581525,0.005169389,0.00667714,0.003075316,0.0534793],"category_scores_gemma":[0.01175011,0.001637901,0.003392712,0.003829414,0.002455365,0.008522593,0.007558764,0.01129622,0.01357381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003755512,"about_ca_system_score_gemma":0.002167849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004199615,"about_ca_topic_score_gemma":0.01077646,"domain_scores_codex":[0.9978861,0.0002817686,0.00009792123,0.000561713,0.0007364544,0.0004360578],"domain_scores_gemma":[0.9929235,0.004954294,0.0002382615,0.0009780725,0.0005023593,0.000403505],"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.001045834,0.0005650806,0.001631154,0.00159643,0.0002402396,0.0003105983,0.0004238658,0.07019852,0.02051646,0.4314192,0.1509696,0.3210832],"study_design_scores_gemma":[0.0001198578,0.0002088662,0.002548369,0.0005252578,0.0003208203,0.000708735,0.0002150051,0.3372946,0.01023168,0.5617448,0.08592801,0.0001539291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04405794,0.01005788,0.5843584,0.007678879,0.004265771,0.0003089515,0.004546282,0.003517377,0.3412085],"genre_scores_gemma":[0.292702,0.01041429,0.5189176,0.003145878,0.002637957,0.001810874,0.00611445,0.005286377,0.1589706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0534793,"threshold_uncertainty_score":0.1789061,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01556296695742086,"score_gpt":0.2614847325972661,"score_spread":0.2459217656398452,"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."}}