{"id":"W2592215285","doi":"10.1007/s00454-016-9842-y","title":"Upper and Lower Bounds for Online Routing on Delaunay Triangulations","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Computer science; Upper and lower bounds; Routing (electronic design automation); Constrained Delaunay triangulation; Combinatorics; Computer network; Algorithm; Mathematics","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.01053899,0.00551073,0.00600505,0.005901824,0.003834197,0.01288977,0.01386969,0.00563223,0.03339813],"category_scores_gemma":[0.07424908,0.003147895,0.003865728,0.007601162,0.005680273,0.0260702,0.01594843,0.01185228,0.006389698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006926754,"about_ca_system_score_gemma":0.004310646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003734514,"about_ca_topic_score_gemma":0.006373177,"domain_scores_codex":[0.9846644,0.003175644,0.0008322795,0.00236664,0.005725596,0.003235421],"domain_scores_gemma":[0.886251,0.08550882,0.004504246,0.01396492,0.005827661,0.003943324],"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.001699295,0.000828099,0.002265265,0.001825102,0.00024312,0.0002773667,0.0008823323,0.543972,0.006713554,0.2616578,0.03469778,0.1449383],"study_design_scores_gemma":[0.00008624223,0.0002067753,0.0004787091,0.0002391577,0.0001582434,0.0002032091,0.0002524381,0.80093,0.002816985,0.188609,0.005948776,0.00007039611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04291629,0.008789851,0.8716743,0.006295887,0.001172695,0.0005332432,0.002596197,0.003702317,0.06231913],"genre_scores_gemma":[0.5458148,0.009453584,0.3963644,0.002128331,0.002699937,0.001449883,0.004631262,0.004191641,0.03326622],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03339813,"threshold_uncertainty_score":0.1117278,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01888128039390763,"score_gpt":0.2841021751962053,"score_spread":0.2652208948022977,"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."}}